Struct ra_ap_rustc_data_structures::work_queue::WorkQueue

pub struct WorkQueue<T: Idx> { /* private fields */ }

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.

Implementations

impl<T: Idx> WorkQueue<T>

pub fn with_none(len: usize) -> Self

Creates a new work queue that starts empty, where elements range from (0..len).

pub fn insert(&mut self, element: T) -> bool

Attempt to enqueue element in the work queue. Returns false if it was already present.

pub fn pop(&mut self) -> Option<T>

Attempt to pop an element from the work queue.