Enum List

pub enum List<A> {
    Nil,
    Cons {
        head: A,
        tail: Rc<List<A>>,
    },
}

Variants

Nil

Cons

Fields

head: A

tail: Rc<List<A>>

Implementations

impl<A: Clone> List<A>

pub fn drop(self, n: u32) -> Self

pub fn reverse(&self) -> Self

Trait Implementations

impl<A> Apply for List<A>

type Elm = A

type M<U> = List<U>

fn ap<B, F>(self, fs: Self::M<F>) -> Self::M<B>

where F: Fn(&A) -> B, List<B>: Stack<B>,

impl<A: Clone> Bind for List<A>

type Elm = A

type M<U> = List<U>

fn bind<B, F>(self, f: F) -> List<B>

where F: Fn(&A) -> List<B>,

impl<A: Clone> Clone for List<A>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug> Debug for List<A>

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

Formats the value using the given formatter.

impl<A> Empty for List<A>

fn empty() -> List<A>

fn is_empty(&self) -> bool

impl<A: Clone> Foldable for List<A>

type Elm = A

fn fold_left<B, F>(&self, b: B, f: F) -> B

where F: Fn(B, &Self::Elm) -> B,

fn fold_right<B, F>(&self, b: B, f: F) -> B

where F: Fn(&Self::Elm, B) -> B,

impl<A: Clone> From<Vec<A>> for List<A>

fn from(vec: Vec<A>) -> Self

Converts to this type from the input type.

impl<A: Clone> Functor for List<A>

type Elm = A

type M<U> = List<U>

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

where F: Fn(&A) -> B, List<B>: Stack<B>,

impl<A: Clone> Into<Vec<A>> for List<A>

fn into(self) -> Vec<A>

Converts this type into the (usually inferred) input type.

impl<A: PartialEq> PartialEq for List<A>

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

type Elm = A

type M<U> = List<U>

fn pure(value: A) -> List<A>

fn unit() -> Self::M<()>

impl<A> Semigroup for List<A>

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

impl<A> Stack<A> for List<A>

fn cons(self, value: A) -> Self

fn head(&self) -> Result<&A, StackError>

fn tail(&self) -> Rc<Self>

fn size(&self) -> usize

fn update(self, index: u32, new_value: A) -> Result<Self, StackError>

where Self: Sized,

fn get(&self, index: u32) -> Result<&A, StackError>

impl<A> Applicative for List<A>

impl<A: Eq> Eq for List<A>

impl<A: Clone> Monad for List<A>

impl<A> Monoid for List<A>

impl<A> StructuralPartialEq for List<A>