Struct EventQueue 

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

FIFO queue with an explicit capacity limit and no silent event loss.

Implementations

impl<T> EventQueue<T>

pub fn new(capacity: usize) -> Self

Creates an empty bounded queue. A zero limit rejects every event. Memory is allocated on demand, not up front for the full limit.

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

Pushes to the back or returns the original event if the queue is full.

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

Pops the oldest pending event, if any.

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

Borrows the oldest pending event without consuming it.

pub fn iter(&self) -> impl DoubleEndedIterator<Item = &T> + ExactSizeIterator

Borrows all pending events in insertion order.

pub fn drain(&mut self) -> Drain<'_, T>

Consumes all queued events in insertion order. Dropping the drain early also removes the remaining events.

pub fn clear(&mut self)

Discards every event, retaining allocated memory.

pub fn len(&self) -> usize

Current pending count.

pub fn is_empty(&self) -> bool

Whether the queue contains no pending events.

pub fn is_full(&self) -> bool

Whether another push would fail.

pub fn capacity(&self) -> usize

Maximum pending count, independent of allocated storage size.

pub fn remaining_capacity(&self) -> usize

Free logical slots before reaching the limit.

Trait Implementations

impl<T: Clone> Clone for EventQueue<T>

fn clone(&self) -> EventQueue<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for EventQueue<T>

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

Formats the value using the given formatter.

impl<T> Default for EventQueue<T>

fn default() -> Self

Creates a queue allowing up to 256 events.