Struct LatencyRing 

pub struct LatencyRing<const CAP: usize = 4096> { /* private fields */ }

Fixed-capacity (const-generic) ring of u64 nanos — a sliding window, not an accumulator. Allocation-free on every path: stats() works from a stack-resident scratch copy sized by CAP (default 4096 → 32 KiB — document your stack when embedding with larger capacities). REQ-CLK-006.

Implementations

impl<const CAP: usize> LatencyRing<CAP>

pub const fn new() -> Self

An empty ring.

pub fn record(&mut self, interval_ns: u64)

Record one interval. O(1); when the window is full the oldest sample is evicted. REQ-CLK-006.

pub fn stats(&self) -> IntervalStats

Exact statistics over the current window. Zero heap allocation; scratch is a stack-resident CAP-sized copy (heapsorted in place — iterative, no recursion). REQ-CLK-006.

pub const fn len(&self) -> usize

Live samples in the window (≤ CAP).

pub const fn is_empty(&self) -> bool

True when nothing has been recorded.

pub fn reset(&mut self)

Clear the window (reuses the allocation-free buffer).

Trait Implementations

impl<const CAP: usize> Debug for LatencyRing<CAP>

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

Formats the value using the given formatter.

impl<const CAP: usize> Default for LatencyRing<CAP>

fn default() -> Self

Returns the “default value” for a type.