Struct RingBuf 

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

A ring buffer of N elements stored entirely on the stack.

Once full, new pushes overwrite the oldest entry. Iteration with iter() yields elements from oldest to newest.

Implementations

impl<T: Copy + Default, const N: usize> RingBuf<T, N>

pub fn new() -> Self

pub fn push(&mut self, val: T)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn is_full(&self) -> bool

pub const fn capacity(&self) -> usize

Number of elements the ring can hold.

pub fn clear(&mut self)

pub fn get(&self, i: usize) -> Option<T>

Read the i-th element (0 = oldest).

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

Most recently pushed element.

pub fn iter(&self) -> RingIter<'_, T, N>

Iterate over elements oldest→newest.

Trait Implementations

impl<T: Copy + Default, const N: usize> Debug for RingBuf<T, N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

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

type Item = T

The type of the elements being iterated over.

type IntoIter = RingIter<'a, T, N>

Which kind of iterator are we turning this into?

fn into_iter(self) -> RingIter<'a, T, N>

Creates an iterator from a value.

impl<T: Copy + Default, const N: usize> Sink<T> for RingBuf<T, N>

type Error = Infallible

The error returned when the sink cannot accept the value.

fn try_push(&mut self, val: T) -> Result<(), Infallible>

Push a value into the sink.