Struct smooth_buffer::SmoothBuffer

pub struct SmoothBuffer<const CAP: usize> { /* private fields */ }

Simple fixed size ringbuffer with fast averaging and smoothing. Do not use if the order of retrieval of each element matters.

Implementations

impl<const CAP: usize> SmoothBuffer<CAP>

pub fn new() -> Self

pub fn average(&self) -> f32

Fast! Sum is always kept up to date on push. No need to iterate.

pub fn clear(&mut self)

pub fn is_empty(&self) -> bool

pub fn max(&self) -> f32

pub fn min(&self) -> f32

pub fn capacity(&self) -> usize

pub fn len(&self) -> usize

pub fn push(&mut self, value: f32)

pub fn iter(&self) -> Iter<'_, f32>

pub fn iter_mut(&mut self) -> IterMut<'_, f32>

pub fn smooth(&self) -> f32

Will perform super fast hard-coded weighted average with up to 5 elements. Above that will use a sine-based formula, which is slower. TODO: Expand number of hard coded weights.

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.