Trait BidirectedQueue

pub trait BidirectedQueue<T>: Default {
    // 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;

    // Provided method
    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)

Insert an element at the front of the queue.

fn push_back(&mut self, t: T)

Insert an element at the back of the queue.

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

Remove and return an element from the front of the queue.

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

Remove and return an element from the back of the queue.

fn clear(&mut self)

Remove all elements from the queue without returning them.

fn len(&self) -> usize

Return the amount of elements currently in the queue.

Provided Methods

fn is_empty(&self) -> bool

Returns true if the queue contains no elements.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

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

Implementors