Struct NotificationRing 

pub struct NotificationRing { /* private fields */ }

Lock-free SPSC ring buffer carrying NotificationRef from Ring 0 to Ring 1.

Pre-allocates a power-of-2 sized buffer of NotificationRef slots so that the hot-path push never allocates. Uses UnsafeCell for interior mutability with the SPSC invariant: single writer (Ring 0), single reader (Ring 1).

Capacity

The capacity is always rounded up to the next power of two. This allows fast index computation via bitmask (pos & mask) instead of modulo.

Implementations

impl NotificationRing

pub fn new(capacity: usize) -> Self

Creates a new notification ring with the given capacity.

The capacity is rounded up to the next power of two. Minimum effective capacity is 2.

pub fn push(&self, notif: NotificationRef) -> bool

Pushes a notification into the ring (Ring 0 writer).

Returns true on success, false if the ring is full (backpressure). Zero allocations on the hot path.

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

Pops a notification from the ring (Ring 1 reader).

Returns None if the ring is empty.

pub fn drain_into<F: FnMut(NotificationRef)>(&self, f: F) -> usize

Drains all pending notifications, calling f for each one.

Returns the number of notifications drained.

pub fn len(&self) -> usize

Returns the number of pending (unread) notifications.

pub fn is_empty(&self) -> bool

Returns true if there are no pending notifications.

pub fn capacity(&self) -> usize

Returns the ring capacity.

Trait Implementations

impl Send for NotificationRing

impl Sync for NotificationRing