Struct Queue 

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

A queue holding N-1 elements.

Why N-1? Because [T; N+1] isn’t supported, and ringbuffers/circular buffers generally waste 1 element in an optimal implementation. https://github.com/rust-lang/rust/issues/76560

Implementations

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

where T: Default + Copy,

pub fn new() -> Self

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

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

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

pub fn pop_into(&mut self, out_val: &mut T) -> bool

Trait Implementations

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T, const N: usize> Default for Queue<T, N>

where T: Default + Copy,

fn default() -> Self

Returns the “default value” for a type.