Struct ConsList 

pub struct ConsList<T> { /* private fields */ }

An immutable singly-linked list, as seen in basically every functional language

Implementations

impl<T> ConsList<T>

pub fn new() -> ConsList<T>

Constructs a new, empty ConsList

pub fn append(&self, elem: T) -> ConsList<T>

Returns a copy of the list, with elem appended to the front

pub fn head(&self) -> Option<&T>

Returns a reference to the first element in the list

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

Returns a copy of the list, with the first element removed

pub fn tailn(&self, n: usize) -> ConsList<T>

Returns a copy of the list, with the first n elements removed

pub fn last(&self) -> Option<&T>

Returns the last element in the list

pub fn lastn(&self, n: usize) -> ConsList<T>

Returns a copy of the list, with only the last n elements remaining

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

Returns an iterator over references to the elements of the list in order

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<T> Clone for ConsList<T>

fn clone(&self) -> ConsList<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for ConsList<T>

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

Formats the value using the given formatter.

impl<T> Drop for ConsList<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T> FromIterator<T> for ConsList<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> ConsList<T>

Creates a value from an iterator.

impl<A: Hash> Hash for ConsList<A>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, T> IntoIterator for &'a ConsList<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

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

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for ConsList<T>

fn eq(&self, other: &ConsList<T>) -> bool

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

fn ne(&self, other: &ConsList<T>) -> bool

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

impl<T: PartialOrd> PartialOrd for ConsList<T>

fn partial_cmp(&self, other: &ConsList<T>) -> 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.