Struct heapless::HistoryBuffer [−][src]
pub struct HistoryBuffer<T, N> where
N: ArrayLength<T>, { /* fields omitted */ }
Expand description
A “history buffer”, similar to a write-only ring buffer of fixed length.
This buffer keeps a fixed number of elements. On write, the oldest element is overwritten. Thus, the buffer is useful to keep a history of values with some desired depth, and for example calculate a rolling average.
The buffer is always fully initialized; depending on the constructor, the initial value is either the default value for the element type or a supplied initial value. This simplifies the API and is mostly irrelevant for the intended use case.
Examples
use heapless::HistoryBuffer; use heapless::consts::*; // Initialize a new buffer with 8 elements, all initially zero. let mut buf = HistoryBuffer::<_, U8>::new(); buf.write(3); buf.write(5); buf.extend(&[4, 4]); // The most recent written element is a four. assert_eq!(buf.recent(), &4); // To access all elements in an unspecified order, use `as_slice()`. for el in buf.as_slice() { println!("{:?}", el); } // Now we can prepare an average of all values, which comes out to 2. let avg = buf.as_slice().iter().sum::<usize>() / buf.len(); assert_eq!(avg, 2);
Implementations
Constructs a new history buffer, where every element is filled with the
default value of the type T
.
HistoryBuffer
currently cannot be constructed in const
context.
Examples
use heapless::HistoryBuffer; use heapless::consts::*; // Allocate a 16-element buffer on the stack let mut x: HistoryBuffer<u8, U16> = HistoryBuffer::new(); // All elements are zero assert_eq!(x.as_slice(), [0; 16]);
Constructs a new history buffer, where every element is the given value.
Examples
use heapless::HistoryBuffer; use heapless::consts::*; // Allocate a 16-element buffer on the stack let mut x: HistoryBuffer<u8, U16> = HistoryBuffer::new_with(4); // All elements are four assert_eq!(x.as_slice(), [4; 16]);
Clears the buffer, replacing every element with the given value.
Returns the capacity of the buffer, which is the length of the underlying backing array.
Clones and writes all elements in a slice to the buffer.
If the slice is longer than the buffer, only the last self.len()
elements will actually be stored.
Returns a reference to the most recently written value.
Examples
use heapless::HistoryBuffer; use heapless::consts::*; let mut x: HistoryBuffer<u8, U16> = HistoryBuffer::new(); x.write(4); x.write(10); assert_eq!(x.recent(), &10);
Trait Implementations
Extends a collection with the contents of an iterator. Read more
fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)Extends a collection with exactly one element.
fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
Extends a collection with the contents of an iterator. Read more
fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)Extends a collection with exactly one element.
fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
Auto Trait Implementations
impl<T, N> Send for HistoryBuffer<T, N> where
T: Send,
impl<T, N> Sync for HistoryBuffer<T, N> where
T: Sync,
impl<T, N> Unpin for HistoryBuffer<T, N> where
<N as ArrayLength<T>>::ArrayType: Unpin,
Blanket Implementations
pub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
pub fn from(t: T) -> T
pub fn from(t: T) -> T
Performs the conversion.
pub fn into(self) -> U
pub fn into(self) -> U
Performs the conversion.