Struct FixedQueue 

pub struct FixedQueue<T, const N: usize> {
    entries: [MaybeUninit<T>; N],
    head: usize,
    len: usize,
}

Fixed-capacity FIFO queue with no heap allocation.

Fields

entries: [MaybeUninit<T>; N]

head: usize

len: usize

Implementations

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

pub const fn new() -> Self

Creates a new empty queue.

pub fn len(&self) -> usize

Returns the number of elements currently stored.

pub fn is_empty(&self) -> bool

Returns whether the queue is empty.

pub fn is_full(&self) -> bool

Returns whether the queue is full.

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

Returns a shared reference to the element at index from the front.

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

Returns a shared reference to the last element.

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

Returns an iterator from front to back.

pub fn push_back(&mut self, value: T) -> Result<(), T>

Appends an element to the tail of the queue.

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

Removes and returns the element at the head of the queue.

pub fn remove_first_where<F>(&mut self, predicate: F) -> Option<T>

where F: FnMut(&T) -> bool,

Removes the first element matching predicate.

fn remove_at(&mut self, offset: usize) -> T

Trait Implementations

impl<T, const N: usize> Drop for FixedQueue<T, N>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.