Struct BoundedRing 

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

A FIFO queue capped at cap items; a push into a full ring evicts the oldest.

Implementations

impl<T> BoundedRing<T>

pub fn new(cap: usize) -> Self

A ring holding at most cap items. cap must be positive.

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

Enqueue item. If the ring is already full, the OLDEST item is evicted first (and counted in dropped); the evicted item is returned so the caller can telemeter it.

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

Dequeue the oldest surviving item (FIFO).

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn is_full(&self) -> bool

pub fn capacity(&self) -> usize

pub fn dropped(&self) -> u64

The number of items shed to overflow since construction — the drop telemetry the congestion controller reads to lower the send rate.

Trait Implementations

impl<T: Clone> Clone for BoundedRing<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for BoundedRing<T>

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

Formats the value using the given formatter.