Trait traitgraph::queue::BidirectedQueue

pub trait BidirectedQueue<T>: Default {
    fn push_front(&mut self, t: T);
    fn push_back(&mut self, t: T);
    fn pop_front(&mut self) -> Option<T>;
    fn pop_back(&mut self) -> Option<T>;
    fn clear(&mut self);
    fn len(&self) -> usize;

    fn is_empty(&self) -> bool { ... }
}

A queue that supports both popping and pushing at front and back.

Required methods

fn push_front(&mut self, t: T)

fn push_back(&mut self, t: T)

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

fn pop_back(&mut self) -> Option<T>

fn clear(&mut self)

fn len(&self) -> usize

Loading content...

Provided methods

fn is_empty(&self) -> bool

Loading content...

Implementations on Foreign Types

impl<T> BidirectedQueue<T> for LinkedList<T>

fn push_front(&mut self, t: T)

fn push_back(&mut self, t: T)

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

fn pop_back(&mut self) -> Option<T>

fn clear(&mut self)

fn len(&self) -> usize

impl<T> BidirectedQueue<T> for VecDeque<T>

fn push_front(&mut self, t: T)

fn push_back(&mut self, t: T)

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

fn pop_back(&mut self) -> Option<T>

fn clear(&mut self)

fn len(&self) -> usize

Loading content...

Implementors

Loading content...