Struct lib_wc::data_structures::queues::BasicQueue

pub struct BasicQueue<T> { /* private fields */ }

It’s just a wrapper around std::collections::LinkedList which does all of the heavy lifting

Implementations

impl<T> BasicQueue<T>

pub fn new() -> BasicQueue<T>

pub fn enqueue(&mut self, value: T)

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

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<T: Debug> Debug for BasicQueue<T>

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

Formats the value using the given formatter.

impl<T> Default for BasicQueue<T>

fn default() -> BasicQueue<T>

Returns the “default value” for a type.