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.
Creates a new work queue that starts empty, where elements range from (0..len).
Attempt to enqueue
element in the work queue. Returns false if it was already present.
Auto Trait Implementations§
impl<T> RefUnwindSafe for WorkQueue<T>where
impl<T> UnwindSafe for WorkQueue<T>where
impl<'a, T> Captures<'a> for T
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