Struct LockFreeStack 

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

Lock-free stack using Treiber’s algorithm Provides LIFO semantics with concurrent access

Implementations

impl<T> LockFreeStack<T>

pub fn new() -> Self

Create a new lock-free stack

pub fn push(&self, data: T)

Push an item onto the stack

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

Pop an item from the stack

pub fn is_empty(&self) -> bool

Check if the stack is empty

Trait Implementations

impl<T: Debug> Debug for LockFreeStack<T>

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

Formats the value using the given formatter.

impl<T> Default for LockFreeStack<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for LockFreeStack<T>

fn drop(&mut self)

Executes the destructor for this type.