Struct Queue 

pub struct Queue<Q>(pub Q);

Heterogenous queue Supports pushing, splitting to init and last Mapping and folding

Tuple Fields

0: Q

Implementations

impl Queue<()>

pub fn new() -> Queue<()>

impl<Q> Queue<Q>

pub fn push<V>(self, value: V) -> Queue<(Queue<Q>, V)>

impl<H, T> Queue<(Queue<H>, T)>

pub fn init(&self) -> &Queue<H>

pub fn last(&self) -> &T

Trait Implementations

impl<'a> ByRef<'a> for Queue<()>

type Refs = Queue<()>

fn by_ref(&'a self) -> Self::Refs

impl<'a, H, T: 'a, R: 'a> ByRef<'a> for Queue<(H, T)>

where H: ByRef<'a, Refs = R> + 'a,

type Refs = Queue<(R, &'a T)>

fn by_ref(&'a self) -> Self::Refs

impl<Q: Clone> Clone for Queue<Q>

fn clone(&self) -> Queue<Q>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Q: Debug> Debug for Queue<Q>

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

Formats the value using the given formatter.

impl<I, F> Foldable<I, F> for Queue<()>

fn fold(self, init: I, _: F) -> I

fold sequence using Function starting with Init value

impl<I, F, H, T> Foldable<I, F> for Queue<(H, T)>

where H: for<'a> Foldable<I, &'a mut F>, F: FnMut<(T, I), Output = I>,

fn fold(self, init: I, f: F) -> I

fold sequence using Function starting with Init value

impl<'a, F> Functor<F> for &'a Queue<()>

type Output = Queue<()>

Result of mapping

fn fmap(self, _: F) -> Queue<()>

Map sequence using Function

impl<'a, F, H, T, O, U> Functor<F> for &'a Queue<(H, T)>

where &'a H: for<'b> Functor<&'b mut F, Output = U>, F: FnMut<(&'a T,), Output = O>,

type Output = Queue<(U, O)>

Result of mapping

fn fmap(self, f: F) -> Self::Output

Map sequence using Function

impl<'a, F, H, T, O, U> Functor<F> for &'a mut Queue<(H, T)>

where &'a mut H: for<'b> Functor<&'b mut F, Output = U>, F: FnMut<(&'a mut T,), Output = O>,

type Output = Queue<(U, O)>

Result of mapping

fn fmap(self, f: F) -> Self::Output

Map sequence using Function

impl<F> Functor<F> for Queue<()>

type Output = Queue<()>

Result of mapping

fn fmap(self, _: F) -> Queue<()>

Map sequence using Function

impl<F, H, T, O, U> Functor<F> for Queue<(H, T)>

where H: for<'a> Functor<&'a mut F, Output = U>, F: FnMut<(T,), Output = O>,

type Output = Queue<(U, O)>

Result of mapping

fn fmap(self, f: F) -> Self::Output

Map sequence using Function

impl Length for Queue<()>

type Length = Z

fn len() -> usize

impl<H, T> Length for Queue<(H, T)>

where H: Length,

type Length = S<<H as Length>::Length>

fn len() -> usize

impl<Q: Ord> Ord for Queue<Q>

fn cmp(&self, other: &Queue<Q>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<Q: PartialEq> PartialEq for Queue<Q>

fn eq(&self, other: &Queue<Q>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Q: PartialOrd> PartialOrd for Queue<Q>

fn partial_cmp(&self, other: &Queue<Q>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<E> Try<E> for Queue<()>

type Ok = Queue<()>

Sequence of Ok Results

fn try(self) -> Result<Queue<()>, E>

impl<E, H, T, Z> Try<E> for Queue<(H, Result<T, E>)>

where H: Try<E, Ok = Z>,

type Ok = Queue<(Z, T)>

Sequence of Ok Results

fn try(self) -> Result<Queue<(Z, T)>, E>

impl Zip<Queue<()>> for Queue<()>

type Zipped = Queue<()>

fn zip(self, _: Queue<()>) -> Queue<()>

impl<LH, LT, RH, RT, ZH> Zip<Queue<(RH, RT)>> for Queue<(LH, LT)>

where LH: Zip<RH, Zipped = ZH>,

type Zipped = Queue<(ZH, (LT, RT))>

fn zip(self, right: Queue<(RH, RT)>) -> Self::Zipped

impl<Q: Copy> Copy for Queue<Q>

impl<Q: Eq> Eq for Queue<Q>

impl<Q> StructuralPartialEq for Queue<Q>