Struct crossbeam::sync::SegQueue

pub struct SegQueue<T> {
    // some fields omitted
}

A Michael-Scott queue that allocates "segments" (arrays of nodes) for efficiency.

Usable with any number of producers and consumers.

Methods

impl<T> SegQueue<T>

fn new() -> SegQueue<T>

Create a new, empty queue.

fn push(&self, t: T)

Add t to the back of the queue.

fn try_pop(&self) -> Option<T>

Attempt to dequeue from the front.

Returns None if the queue is observed to be empty.