Struct gcollections::queue::Queue

pub struct Queue<S, OrdPush, OrdPop> { /* fields omitted */ }

Methods

impl<S, OrdPush, OrdPop> Queue<S, OrdPush, OrdPop>

pub fn wrap(seq: S) -> Self

Trait Implementations

impl<S, OrdPush, OrdPop> Collection for Queue<S, OrdPush, OrdPop> where     S: Collection,

type Item = <S as Collection>::Item

impl<S, OrdPush, OrdPop> Deref for Queue<S, OrdPush, OrdPop>

type Target = S

The resulting type after dereferencing.

Important traits for &'a mut R

impl<'a, R> Read for &'a mut R where
    R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
    W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

fn deref<'a>(&'a self) -> &'a S

Dereferences the value.

impl<S, OrdPush, OrdPop> DerefMut for Queue<S, OrdPush, OrdPop>

Important traits for &'a mut R

impl<'a, R> Read for &'a mut R where
    R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
    W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

fn deref_mut<'a>(&'a mut self) -> &'a mut S

Mutably dereferences the value.

impl<S, OrdPush, OrdPop> Empty for Queue<S, OrdPush, OrdPop> where     S: Empty,

fn empty() -> Self

impl<S, OrdPush, OrdPop> Cardinality for Queue<S, OrdPush, OrdPop> where     S: Cardinality,

type Size = <S as Cardinality>::Size

fn size(&self) -> Self::Size

impl<S, OrdPush, OrdPop> Insert for Queue<S, OrdPush, OrdPop> where     S: Push<OrdPush>,

fn insert(&mut self, value: Self::Item)

impl<S, OrdPush, OrdPop> Extract for Queue<S, OrdPush, OrdPop> where     S: Pop<OrdPop>,

fn extract(&mut self) -> Option<Self::Item>