Struct BoundedRing 

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

A bounded first-in first-out queue that evicts its oldest entry on a push into a full queue and counts every eviction.

Implementations

impl<T> BoundedRing<T>

pub fn new(capacity: usize) -> Self

An empty ring holding at most capacity entries (at least one).

pub fn push(&mut self, entry: T) -> bool

Appends entry, evicting and counting the oldest entry when full. Answers whether an entry was evicted.

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

Removes every held entry, oldest first, with the evictions since the previous take; the next take counts from zero again.

pub fn len(&self) -> usize

Entries currently held.

pub fn is_empty(&self) -> bool

Whether the ring holds nothing.

pub const fn capacity(&self) -> usize

The bound.

pub const fn dropped(&self) -> u64

Entries evicted since the ring was made (monotonic).

pub const fn dropped_since_take(&self) -> u64

Entries evicted since the previous take.

Trait Implementations

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

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

Formats the value using the given formatter.