Struct Buffer 

pub struct Buffer<T, const N: usize> { /* private fields */ }

A buffer than can contain any type and at a specific length

Implementations

impl<T, const N: usize> Buffer<T, N>

pub fn new(inital_data: [T; N]) -> Self

Creates a buffer with the starting data provided

pub fn insert_data(&mut self, data: T)

This adds a new entry into the buffer and deletes the oldest entry in the buffer this operation in O(n),

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

Gives an iterator with the contents of the buffer for functional operations

pub fn len(&self) -> usize

Returns the length of the buffer

pub fn is_empty(&self) -> bool

Buffers can never be empty this always be false

Trait Implementations

impl<T: Clone, const N: usize> Clone for Buffer<T, N>

fn clone(&self) -> Buffer<T, N>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug, const N: usize> Debug for Buffer<T, N>

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

Formats the value using the given formatter.

impl<T: Hash, const N: usize> Hash for Buffer<T, N>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T, const N: usize> Index<usize> for Buffer<T, N>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T, const N: usize> IndexMut<usize> for Buffer<T, N>

fn index_mut(&mut self, index: usize) -> &mut T

Performs the mutable indexing (container[index]) operation.

impl<'a, T, const N: usize> IntoIterator for &'a Buffer<T, N>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, const N: usize> IntoIterator for Buffer<T, N>

type Item = T

The type of the elements being iterated over.

type IntoIter = <[T; N] as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord, const N: usize> Ord for Buffer<T, N>

fn cmp(&self, other: &Buffer<T, N>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq, const N: usize> PartialEq for Buffer<T, N>

fn eq(&self, other: &Buffer<T, N>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialOrd, const N: usize> PartialOrd for Buffer<T, N>

fn partial_cmp(&self, other: &Buffer<T, N>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Copy, const N: usize> Copy for Buffer<T, N>

impl<T: Eq, const N: usize> Eq for Buffer<T, N>

impl<T, const N: usize> StructuralPartialEq for Buffer<T, N>