Crate ringbuffer_iteration

A ring buffer implementation where newer samples overwrite old samples. This implementation also enables the use of Rust iterators to iterate through the ring buffer in order from oldest to newest entries.

This library is implemented without the use of the standard library, and thus requires passing in a “backing store” of a statically allocated array.

Macros

• assert_almost_eq

Structs

• RingBuffer
  An implementation of a ring buffer data structure that creates a “lossy” queue. This is a simplified version of the generic heapless Queue with a few constraints relaxed:
• RingBufferIterator

Functions

• ac_rms
  Calculate the root-mean-square of buffer, passing in mean as the pre-calculated mean.
• mean
  Calculate the mean of the values inside buffer.
• windowed_ac_rms
  Calculate the AC RMS of the last window_len values inside buffer.
• windowed_mean
  Calculate the mean of the last window_len values inside buffer.