Struct EventRingBuffer 

pub struct EventRingBuffer<E: Event + Copy> { /* private fields */ }

Lock-free ring buffer for event storage

Optimized for Single-Producer-Single-Consumer (SPSC) pattern with atomic head/tail pointers for wait-free operations.

Thread Safety

This buffer is designed for SPSC (Single-Producer-Single-Consumer) use. While it is Send + Sync, concurrent multi-producer or multi-consumer access may lead to data races or lost events. For MPSC patterns, use external synchronization or the ShardedEventBus which provides isolation through sharding.

Memory Ordering

• Producer writes data before publishing tail (Release)
• Consumer reads head with Acquire before accessing data
• This ensures data visibility across threads in SPSC mode

Implementations

impl<E: Event + Copy> EventRingBuffer<E>

pub fn new(capacity: usize) -> Self

Create new ring buffer with specified capacity

Capacity must be power of 2 for efficient modulo operations.

pub fn push(&self, event: E) -> Result<(), E>

Push event to buffer

Returns Err(event) if buffer is full. Time complexity: O(1), typically <100ns

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

Pop event from buffer

Returns None if buffer is empty. Time complexity: O(1), typically <100ns

pub fn len(&self) -> usize

Get current number of events in buffer

pub fn is_empty(&self) -> bool

Check if buffer is empty

pub fn is_full(&self) -> bool

Check if buffer is full

pub fn capacity(&self) -> usize

Get buffer capacity

pub fn fill_ratio(&self) -> f32

Get fill percentage (0.0 to 1.0)

Trait Implementations

impl<E: Event + Copy> Send for EventRingBuffer<E>

impl<E: Event + Copy> Sync for EventRingBuffer<E>