Struct LockFreeQueue 

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

A lock-free multi-producer, single-consumer queue.

Multiple threads can call push() concurrently. Only one thread should call pop() at a time (the owning CPU’s scheduler).

Implementations

impl<T> LockFreeQueue<T>

pub fn new() -> Self

Create a new empty lock-free queue.

Initializes with a sentinel (dummy) node so that head and tail always point to a valid node.

pub fn push(&self, value: T)

Push a value onto the tail of the queue (multi-producer safe).

This operation is lock-free: it uses a CAS loop on the tail pointer. Multiple CPUs can call push() concurrently.

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

Pop a value from the head of the queue (single-consumer only).

Returns None if the queue is empty.

pub fn is_empty(&self) -> bool

Check if the queue is empty (approximate).

pub fn len(&self) -> usize

Get the approximate number of elements in the queue.

Trait Implementations

impl<T> Default for LockFreeQueue<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for LockFreeQueue<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Send> Send for LockFreeQueue<T>

impl<T: Send> Sync for LockFreeQueue<T>