Struct Unbounded

pub struct Unbounded<T> {
    head: CachePadded<Position<T>>,
    tail: CachePadded<Position<T>>,
}

An unbounded queue.

Fields

head: CachePadded<Position<T>>

The head of the queue.

tail: CachePadded<Position<T>>

The tail of the queue.

Implementations

impl<T> Unbounded<T>

pub const fn new() -> Unbounded<T>

Creates a new unbounded queue.

pub fn push(&self, value: T) -> Result<(), PushError<T>>

Pushes an item into the queue.

pub fn pop(&self) -> Result<T, PopError>

Pops an item from the queue.

pub fn len(&self) -> usize

Returns the number of items in the queue.

pub fn is_empty(&self) -> bool

Returns true if the queue is empty.

pub fn is_full(&self) -> bool

Returns true if the queue is full.

pub fn close(&self) -> bool

Closes the queue.

Returns true if this call closed the queue.

pub fn is_closed(&self) -> bool

Returns true if the queue is closed.

Trait Implementations

impl<T> Drop for Unbounded<T>

fn drop(&mut self)

Executes the destructor for this type.