Struct RingBuffer 

pub struct RingBuffer<T, const SIZE: usize> { /* private fields */ }

A RingBuffer holds SIZE elements of type T.

Implementations

impl<T: Default + Copy, const SIZE: usize> RingBuffer<T, SIZE>

pub fn new() -> Self

Make a new RingBuffer!

pub fn push_overwrite(&mut self, elem: T) -> Option<T>

Push something onto the buffer. If the buffer is full, the oldest element is returned.

pub fn push_unless_full(&mut self, elem: T) -> Result<(), Error>

Push something onto the buffer, unless the buffer is full.

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

Pop the buffer. If it is empty, then None is returned.

pub fn len(&self) -> usize

How many elements are in the buffer?

pub fn is_empty(&self) -> bool

Is the buffer empty?

pub fn is_full(&self) -> bool

Is the buffer full?

impl<T: Default + Copy, const SIZE: usize> RingBuffer<T, SIZE>

pub fn iter(&self) -> IntoIteratorRingbuffer<'_, T, SIZE>

Make an immutable non-consuming iterator

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.

impl<'a, T: Default + Copy, const SIZE: usize> IntoIterator for &'a RingBuffer<T, SIZE>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = IntoIteratorRingbuffer<'a, T, SIZE>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Default + Copy, const SIZE: usize> IntoIterator for RingBuffer<T, SIZE>

type Item = T

The type of the elements being iterated over.

type IntoIter = ConsumingIntoIteratorRingbuffer<T, SIZE>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.