Struct LockFreeQueue 

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

Lock-free SPSC (Single Producer Single Consumer) queue

Optimized for low-latency real-time streaming with wait-free operations.

Implementations

impl<T> LockFreeQueue<T>

pub fn new(capacity: usize) -> Self

Create a new lock-free queue with given capacity

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

Push an item to the queue (non-blocking)

Returns Err if the queue is full

pub fn try_push(&self, item: T) -> bool

Try to push an item, dropping it if queue is full

Returns true if the item was pushed, false if dropped

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

Pop an item from the queue (non-blocking)

Returns None if the queue is empty

pub fn is_empty(&self) -> bool

Check if queue is empty

pub fn is_full(&self) -> bool

Check if queue is full

pub fn len(&self) -> usize

Get current queue length

pub fn capacity(&self) -> usize

Get queue capacity

pub fn dropped_count(&self) -> usize

Get number of dropped items (when queue was full)

pub fn reset_dropped_count(&self)

Reset dropped count

pub fn clone_handle(&self) -> Self

Clone the queue handle (shares the same underlying queue)

impl<T: Clone> LockFreeQueue<T>

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

Pop all available items as a vector