Struct rustc_data_structures::work_queue::WorkQueue
source · pub struct WorkQueue<T: Idx> {
deque: VecDeque<T>,
set: BitSet<T>,
}
Expand description
A work queue is a handy data structure for tracking work left to do. (For example, basic blocks left to process.) It is basically a de-duplicating queue; so attempting to insert X if X is already enqueued has no effect. This implementation assumes that the elements are dense indices, so it can allocate the queue to size and also use a bit set to track occupancy.
Fields§
§deque: VecDeque<T>
§set: BitSet<T>
Implementations§
Auto Trait Implementations§
impl<T> RefUnwindSafe for WorkQueue<T>where T: RefUnwindSafe,
impl<T> Send for WorkQueue<T>where T: Send,
impl<T> Sync for WorkQueue<T>where T: Sync,
impl<T> Unpin for WorkQueue<T>where T: Unpin,
impl<T> UnwindSafe for WorkQueue<T>where T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<'a, T> Captures<'a> for Twhere T: ?Sized,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 64 bytes