Struct TimestampedRingBuffer 

pub struct TimestampedRingBuffer<T: Copy> { /* private fields */ }

An SPSC ring buffer that stores TimestampedValue entries and exposes time-range queries and throughput estimation.

Internally backed by a StatisticsWindow<f64> for the values and a separate Vec-based circular buffer for the full TimestampedValue records.

Implementations

impl<T: Copy> TimestampedRingBuffer<T>

pub fn new(capacity: usize) -> Self

Create a new buffer with the given capacity.

Panics if capacity == 0.

pub fn push_now(&mut self, value: T, time_ns: u64)

Push a new (value, timestamp_ns) pair.

If the buffer is full the oldest entry is evicted.

pub fn len(&self) -> usize

Number of entries currently stored.

pub fn is_empty(&self) -> bool

Returns true when empty.

pub fn iter_ordered(&self) -> impl Iterator<Item = TimestampedValue<T>> + '_

Iterate over all stored entries in insertion order (oldest first).

pub fn rate_per_sec(&self) -> f64

Estimate throughput as events per second over the entire stored window.

Returns 0.0 when fewer than 2 entries are stored or the time span is zero.

pub fn values_in_range(&self, start_ns: u64, end_ns: u64) -> Vec<T>

Return all values whose timestamps fall in [start_ns, end_ns] (inclusive on both ends).

pub fn oldest_timestamp(&self) -> Option<u64>

The timestamp of the oldest retained entry.

pub fn newest_timestamp(&self) -> Option<u64>

The timestamp of the most-recently added entry.

Trait Implementations

impl<T: Debug + Copy> Debug for TimestampedRingBuffer<T>

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

Formats the value using the given formatter.