Struct rpds::sequence::list::List

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

A persistent list with structural sharing. This data structure supports fast push_front(), drop_first(), first(), and last().

Complexity

Let n be the number of elements in the list.

Temporal complexity

Operation	Best case	Average	Worst case
new()	Θ(1)	Θ(1)	Θ(1)
push_front()	Θ(1)	Θ(1)	Θ(1)
drop_first()	Θ(1)	Θ(1)	Θ(1)
reverse()	Θ(n)	Θ(n)	Θ(n)
first()	Θ(1)	Θ(1)	Θ(1)
last()	Θ(1)	Θ(1)	Θ(1)
len()	Θ(1)	Θ(1)	Θ(1)
clone()	Θ(1)	Θ(1)	Θ(1)
iterator creation	Θ(1)	Θ(1)	Θ(1)
iterator step	Θ(1)	Θ(1)	Θ(1)
iterator full	Θ(n)	Θ(n)	Θ(n)

Implementation details

This is your classic functional list with "cons" and "nil" nodes, with a little extra sauce to make some operations more efficient.

Methods

impl<T> List<T>

fn new() -> List<T>

fn first(&self) -> Option<&T>

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

fn drop_first(&self) -> Option<List<T>>

fn push_front(&self, v: T) -> List<T>

fn reverse(&self) -> List<T>

fn len(&self) -> usize

fn is_empty(&self) -> bool

fn iter(&self) -> Iter<T>

Trait Implementations

impl<T> Serialize for List<T> where
    T: Serialize, 

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl<'de, T> Deserialize<'de> for List<T> where
    T: Deserialize<'de>, 

fn deserialize<D: Deserializer<'de>>(
    deserializer: D
) -> Result<List<T>, D::Error>

Deserialize this value from the given Serde deserializer.

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

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T> Default for List<T>

fn default() -> List<T>

Returns the "default value" for a type.

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

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl<T: Eq> Eq for List<T>

impl<T: PartialOrd<T>> PartialOrd<List<T>> for List<T>

fn partial_cmp(&self, other: &List<T>) -> Option<Ordering>

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

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl<T: Ord> Ord for List<T>

fn cmp(&self, other: &List<T>) -> Ordering

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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, 

Feeds a slice of this type into the given [Hasher].

impl<T> Clone for List<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Display> Display for List<T>

fn fmt(&self, fmt: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<'a, T> IntoIterator for &'a List<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> FromIterator<T> for List<T>

fn from_iter<I: IntoIterator<Item = T>>(into_iter: I) -> List<T>

Creates a value from an iterator.