Struct adivon::deque::Deque

pub struct Deque<T> {
    // some fields omitted
}

linked double queue

Methods

impl<T> Deque<T>

fn new() -> Deque<T>

fn is_empty(&self) -> bool

fn len(&self) -> usize

fn add_first(&mut self, item: T)

fn add_last(&mut self, item: T)

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

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

fn peek_first(&self) -> Option<&T>

fn peek_last(&self) -> Option<&T>

impl<T> Deque<T>

fn iter<'a>(&'a self) -> Iter<'a, T>

Trait Implementations

impl<T: Display> Display for Deque<T>

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

Formats the value using the given formatter.

impl<T> IntoIterator for Deque<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.