Struct List 

pub struct List<L>(pub L);

Heterogenous list Supports pushing, splitting to head and tail Mapping and folding

Tuple Fields

0: L

Implementations

impl List<()>

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

impl<L> List<L>

pub fn push<V>(self, value: V) -> List<(V, List<L>)>

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

pub fn head(&self) -> &H

pub fn tail(&self) -> &List<T>

Trait Implementations

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

type Refs = List<()>

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

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

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

type Refs = List<(&'a H, R)>

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

impl<L: Clone> Clone for List<L>

fn clone(&self) -> List<L>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<L: Debug> Debug for List<L>

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

Formats the value using the given formatter.

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

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

fold sequence using Function starting with Init value

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

where T: Foldable<I, F>, F: FnMut<(H, 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 List<()>

type Output = List<()>

Result of mapping

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

Map sequence using Function

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

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

type Output = List<(O, U)>

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 List<(H, T)>

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

type Output = List<(O, U)>

Result of mapping

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

Map sequence using Function

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

type Output = List<()>

Result of mapping

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

Map sequence using Function

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

where T: Functor<F, Output = U>, F: FnMut<(H,), Output = O>,

type Output = List<(O, U)>

Result of mapping

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

Map sequence using Function

impl<L> IntoList for List<L>

type List = List<L>

fn into_list(self) -> Self

impl Length for List<()>

type Length = Z

fn len() -> usize

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

where T: Length,

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

fn len() -> usize

impl<L: Ord> Ord for List<L>

fn cmp(&self, other: &List<L>) -> 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<L: PartialEq> PartialEq for List<L>

fn eq(&self, other: &List<L>) -> 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<L: PartialOrd> PartialOrd for List<L>

fn partial_cmp(&self, other: &List<L>) -> 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 List<()>

type Ok = List<()>

Sequence of Ok Results

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

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

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

type Ok = List<(H, Z)>

Sequence of Ok Results

fn try(self) -> Result<List<(H, Z)>, E>

impl Zip<List<()>> for List<()>

type Zipped = List<()>

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

impl<LH, LT, RH, RT, ZT> Zip<List<(RH, RT)>> for List<(LH, LT)>

where LT: Zip<RT, Zipped = ZT>,

type Zipped = List<((LH, RH), ZT)>

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

impl<L: Copy> Copy for List<L>

impl<L: Eq> Eq for List<L>

impl<L> StructuralPartialEq for List<L>