Struct MpmcStack 

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

Lock-free multi-producer multi-consumer stack (LIFO), used as a cross-thread handoff queue where ordering within a batch doesn’t matter. See the module-level comment above for the intended use sites.

Implementations

impl<T> MpmcStack<T>

pub const fn new() -> Self

An empty stack.

pub fn push(&self, value: T)

Push value onto the stack. Never blocks, never fails (heap allocation aside).

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

Pop the most-recently-pushed value, or None if empty.

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

Atomically take the entire stack’s contents as a Vec, leaving the stack empty. O(1) swap of the head pointer plus an O(n) linked-list walk to materialize the Vec — no CAS retries beyond the single head swap regardless of n.

pub fn is_empty(&self) -> bool

Whether the stack currently has no elements. Racy under concurrent push/pop from other threads — a true result can be stale by the time the caller acts on it, same as any lock-free length check.

pub fn len(&self) -> usize

Approximate current length. Racy under concurrent push/pop for the same reason as Self::is_empty.

pub fn drain_into_vec_deque(&self, target: &mut VecDeque<T>)

Zero-allocation drainage directly into the existing consumer buffer

Trait Implementations

impl<T> Default for MpmcStack<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for MpmcStack<T>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl<T: Send> Send for MpmcStack<T>

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