Struct RingBuffer 

pub struct RingBuffer<T: DataPoint + Copy, const N: usize> { /* private fields */ }

High-performance ring buffer optimized for real-time data

Implementations

impl<T: DataPoint + Copy, const N: usize> RingBuffer<T, N>

pub fn new() -> Self

Create a new ring buffer with default configuration

pub fn with_config(config: RingBufferConfig) -> Self

Create a new ring buffer with custom configuration

pub fn set_event_handler(&mut self, handler: fn(RingBufferEvent))

Set event handler for notifications

pub fn push(&mut self, value: T) -> ChartResult<()>

Push a new value into the ring buffer

pub fn extend<I>(&mut self, iter: I) -> ChartResult<usize>

where I: IntoIterator<Item = T>,

Push multiple values efficiently

pub fn pop(&mut self) -> Option<T>

Pop the oldest value from the ring buffer

pub fn peek(&self) -> Option<&T>

Peek at the oldest value without removing it

pub fn peek_newest(&self) -> Option<&T>

Peek at the newest value without removing it

pub fn iter(&self) -> impl Iterator<Item = &T>

Get an iterator over all values in the buffer

pub fn iter_chronological(&self) -> ChronologicalIter<'_, T, N>

Get an iterator over all values in chronological order (oldest to newest) This properly handles the wrap-around case when the buffer is full

pub fn recent(&self, n: usize) -> impl Iterator<Item = &T>

Get a slice of the most recent n values

pub fn clear(&mut self)

Clear all data from the buffer

pub fn len(&self) -> usize

Get the number of elements in the buffer

pub fn is_empty(&self) -> bool

Check if the buffer is empty

pub fn is_full(&self) -> bool

Check if the buffer is full

pub fn capacity(&self) -> usize

Get the capacity of the buffer

pub fn remaining_capacity(&self) -> usize

Get remaining capacity

pub fn bounds(&self) -> Option<DataBounds<f32, f32>>

Get current bounds (if tracking is enabled and T is Point2D)

pub fn stats(&self) -> &RingBufferStats

Get performance statistics

pub fn reset_stats(&mut self)

Reset performance statistics

pub fn for_each<F>(&self, f: F)

where F: FnMut(&T),

Apply a function to all elements in the buffer

pub fn find<F>(&self, predicate: F) -> Option<&T>

where F: FnMut(&T) -> bool,

Find the first element matching a predicate

impl<const N: usize> RingBuffer<Point2D, N>

pub fn push_point(&mut self, point: Point2D) -> ChartResult<()>

Push a Point2D with bounds tracking

pub fn moving_average(&self, window_size: usize) -> Option<Point2D>

Calculate moving average over the last n points

pub fn downsample(&self, factor: usize) -> Vec<Point2D, N>

Downsample data by taking every nth point

pub fn rate_of_change(&self) -> Option<f32>

Get the rate of change between the newest and oldest points

Trait Implementations

impl<T: DataPoint + Copy, const N: usize> Default for RingBuffer<T, N>

fn default() -> Self

Returns the “default value” for a type.