Struct RingBuffer 

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

Bounded FIFO ring buffer for inspector captures. Adding to a full buffer evicts the oldest entry. Reads return a snapshot in chronological order (oldest first).

Implementations

impl<T: Clone> RingBuffer<T>

pub fn new(capacity: usize) -> Self

Build a new buffer. Capacity must be > 0; capacity 0 is clamped to 1 to keep push infallible.

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

Push item; if the buffer was full, return the evicted oldest entry. Callers that maintain side-tables keyed off the entry (the inspector bridge’s details map keyed by seq) use the returned item to clean up in lockstep so the side-table never grows past the ring’s capacity.

pub fn snapshot(&self) -> Vec<T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

Trait Implementations

impl<T: Clone> Clone for RingBuffer<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for RingBuffer<T>

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

Formats the value using the given formatter.