pub struct SegQueue<T> { /* fields omitted */ }
Expand description
A Michael-Scott queue that allocates “segments” (arrays of nodes)
for efficiency.
Usable with any number of producers and consumers.
Create a new, empty queue.
Add t to the back of the queue.
Attempt to dequeue from the front.
Returns None if the queue is observed to be empty.
Formats the value using the given formatter. Read more
impl<T> Any for T where
T: 'static + ?Sized,
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
impl<T, U> Into<U> for T where
U: From<T>,
The type returned in the event of a conversion error.
The type returned in the event of a conversion error.