Struct List 

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

An immutable singly-linked list.

Implementations

impl<T> List<T>

pub fn is_empty(&self) -> bool

Returns true if the list contains no elements.

pub fn push_front(&self, value: Arc<T>) -> Self

Creates a new list with the given value at the front, sharing the rest of the nodes.

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

Returns an iterator over references to the list elements.

Trait Implementations

impl<T: Clone> Clone for List<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for List<T>

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

Formats the value using the given formatter.

impl<T> Drop for List<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Hash> Hash for List<T>

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 List<T>

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

type Item = &'a T

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for List<T>

fn eq(&self, other: &Self) -> 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<T: Eq> Eq for List<T>