Struct Ring 

pub struct Ring<const N: usize> { /* private fields */ }

A ring buffer holding up to N f64 values.

Implementations

impl<const N: usize> Ring<N>

pub const fn new() -> Self

A new, empty ring.

pub const fn is_full(&self) -> bool

Whether the ring holds N values.

pub const fn len(&self) -> usize

Number of values currently held.

pub const fn is_empty(&self) -> bool

Whether the ring holds no values.

pub fn push(&mut self, x: f64) -> Option<f64>

Push x, overwriting the oldest slot once full.

Returns the evicted oldest value if the ring was already full, or None while still filling. The caller (SMA) subtracts the returned value from its rolling sum before adding x, matching the std subtract-then-add order.

pub fn chrono_sum(&self) -> f64

Sum the held values oldest-to-newest.

When full this walks buf[head..] then buf[..head] — the exact chronological order (and thus the exact fold, starting from 0.0) that wickra-core reseeds its rolling sum with, so the reseed is bit-for-bit identical.

Trait Implementations

impl<const N: usize> Clone for Ring<N>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const N: usize> Debug for Ring<N>

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

Formats the value using the given formatter.

impl<const N: usize> Default for Ring<N>

fn default() -> Self

Returns the “default value” for a type.