Struct crossbeam::queue::SegQueue

pub struct SegQueue<T> { /* 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>

pub fn new() -> SegQueue<T>

Create a new, empty queue.

pub fn push(&self, t: T)

Add t to the back of the queue.

pub fn is_empty(&self) -> bool

Judge if the queue is empty.

Returns true if the queue is empty.

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

Attempt to dequeue from the front.

Returns None if the queue is observed to be empty.

Trait Implementations

impl<T: Debug> Debug for SegQueue<T>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T> Drop for SegQueue<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T> Default for SegQueue<T>

fn default() -> Self

Returns the "default value" for a type.