Auto merge of #69227 - Marwes:buffer_stderr, r=varkor

[rust.git] / src / librustc_data_structures / work_queue.rs

diff --git a/src/librustc_data_structures/work_queue.rs b/src/librustc_data_structures/work_queue.rs
index 193025aafad20f9bf452b2fff07e67059f4ac3b8..0c848eb144d79bb8297838c7a9c7df7ad514925a 100644 (file)
--- a/src/librustc_data_structures/work_queue.rs
+++ b/src/librustc_data_structures/work_queue.rs
@@ -1,5 +1,5 @@
-use crate::bit_set::BitSet;
-use crate::indexed_vec::Idx;
+use rustc_index::bit_set::BitSet;
+use rustc_index::vec::Idx;
 use std::collections::VecDeque;
 
 /// A work queue is a handy data structure for tracking work left to
@@ -17,19 +17,13 @@ impl<T: Idx> WorkQueue<T> {
     /// Creates a new work queue with all the elements from (0..len).
     #[inline]
     pub fn with_all(len: usize) -> Self {
-        WorkQueue {
-            deque: (0..len).map(T::new).collect(),
-            set: BitSet::new_filled(len),
-        }
+        WorkQueue { deque: (0..len).map(T::new).collect(), set: BitSet::new_filled(len) }
     }
 
     /// Creates a new work queue that starts empty, where elements range from (0..len).
     #[inline]
     pub fn with_none(len: usize) -> Self {
-        WorkQueue {
-            deque: VecDeque::with_capacity(len),
-            set: BitSet::new_empty(len),
-        }
+        WorkQueue { deque: VecDeque::with_capacity(len), set: BitSet::new_empty(len) }
     }
 
     /// Attempt to enqueue `element` in the work queue. Returns false if it was already present.