Struct BoundedQueue 

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

Bounded message queue for a peer

Provides a FIFO queue with configurable maximum size. When full, oldest messages are dropped (or operations fail).

Implementations

impl<T> BoundedQueue<T>

pub fn new(max_size: usize) -> BoundedQueue<T>

Create a new bounded queue

pub fn enqueue(&mut self, item: T) -> Option<T>

Enqueue a message, dropping oldest if full

Returns the dropped message if one was evicted, None otherwise.

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

Try to enqueue a message, failing if full

Returns Ok(()) if enqueued, Err if queue is full.

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

Dequeue the next message

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

Peek at the next message without removing

pub fn len(&self) -> usize

Get current queue length

pub fn is_empty(&self) -> bool

Check if queue is empty

pub fn total_enqueued(&self) -> u64

Get total messages enqueued (all time)

pub fn total_dropped(&self) -> u64

Get total messages dropped due to overflow

pub fn clear(&mut self)

Clear the queue

Trait Implementations

impl<T> Debug for BoundedQueue<T>

where T: Debug,

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

Formats the value using the given formatter.