Struct UnboundedQueue 

pub struct UnboundedQueue<T> { /* private fields */ }

Lock-free unbounded MPMC (Multi Producer Multi Consumer) queue

Uses a linked list for unbounded capacity. Slower than bounded queue but never blocks on push.

Implementations

impl<T> UnboundedQueue<T>

pub fn new() -> Self

Create a new unbounded queue

pub fn push(&self, item: T)

Push an item to the queue (never fails)

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

Pop an item from the queue

pub fn is_empty(&self) -> bool

Check if queue is empty

pub fn len(&self) -> usize

Get approximate queue length

pub fn clone_handle(&self) -> Self

Clone the queue handle

impl<T: Clone> UnboundedQueue<T>

pub fn pop_all(&self) -> Vec<T>

Pop all available items as a vector

Trait Implementations

impl<T> Default for UnboundedQueue<T>

fn default() -> Self

Returns the “default value” for a type.