Struct algorithms_edu::data_structures::queue::FixedCapacityQueue

pub struct FixedCapacityQueue<T: Clone> { /* fields omitted */ }

A custom implementation of a circular queue which is extremely quick and lightweight. However, the downside is you need to know an upper bound on the number of elements that will be inside the queue at any given time for this queue to work.

Implementations

impl<T: Clone> FixedCapacityQueue<T>

pub fn with_capacity(capacity: usize) -> Self

Initialize a queue where a maximum of max_sz elements can be in the queue at any given time

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

Trait Implementations

impl<T: Clone> Queue<T> for FixedCapacityQueue<T>

pub fn len(&self) -> usize

pub fn with_capacity(capacity: usize) -> Self

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

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

pub fn is_empty(&self) -> bool