pub struct SegQueue<T> { /* private fields */ }
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.
Judge if the queue is empty.
Returns true
if the queue is empty.
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
Returns the “default value” for a type.
Read more
Executes the destructor for this type.
Read more
Immutably borrows from an owned value.
Read more
Mutably borrows from an owned value.
Read more
Returns the argument unchanged.
Calls U::from(self)
.
That is, this conversion is whatever the implementation of
From<T> for U
chooses to do.
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.