Struct List 

pub struct List<T, P = RcK>
where
    P: SharedPointerKind,
{ /* private fields */ }

A persistent list with structural sharing.

Complexity

Let n be the number of elements in the list.

Temporal complexity

Operation	Average	Worst case
new()	Θ(1)	Θ(1)
push_front()	Θ(1)	Θ(1)
drop_first()	Θ(1)	Θ(1)
reverse()	Θ(n)	Θ(n)
first()	Θ(1)	Θ(1)
last()	Θ(1)	Θ(1)
len()	Θ(1)	Θ(1)
clone()	Θ(1)	Θ(1)
iterator creation	Θ(1)	Θ(1)
iterator step	Θ(1)	Θ(1)
iterator full	Θ(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.

Implementations

impl<T> List<T, ArcTK>

pub fn new_sync() -> List<T, ArcTK>

impl<T> List<T>

pub fn new() -> List<T>

impl<T, P> List<T, P>

where P: SharedPointerKind,

pub fn new_with_ptr_kind() -> List<T, P>

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

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

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

pub fn drop_first_mut(&mut self) -> bool

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

pub fn push_front_mut(&mut self, v: T)

pub fn reverse(&self) -> List<T, P>

pub fn reverse_mut(&mut self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> Map<IterPtr<'_, T, P>, fn(&SharedPointer<T, P>) -> &T>

Trait Implementations

impl<T, P> Clone for List<T, P>

where P: SharedPointerKind,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T, P> Debug for List<T, P>

where T: Debug, P: Debug + SharedPointerKind,

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

Formats the value using the given formatter.

impl<T, P> Default for List<T, P>

where P: SharedPointerKind,

fn default() -> List<T, P>

Returns the “default value” for a type.

impl<'de, T, P> Deserialize<'de> for List<T, P>

where T: Deserialize<'de>, P: SharedPointerKind,

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T, P> Display for List<T, P>

where T: Display, P: SharedPointerKind,

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

Formats the value using the given formatter.

impl<T, P> Drop for List<T, P>

where P: SharedPointerKind,

fn drop(&mut self)

Executes the destructor for this type.

impl<T, P> FromIterator<T> for List<T, P>

where P: SharedPointerKind,

fn from_iter<I>(into_iter: I) -> List<T, P>

where I: IntoIterator<Item = T>,

Creates a value from an iterator.

impl<T, P> Hash for List<T, P>

where T: Hash, P: SharedPointerKind,

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

where H: Hasher,

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

where P: SharedPointerKind,

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Map<IterPtr<'a, T, P>, fn(&SharedPointer<T, P>) -> &T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Map<IterPtr<'a, T, P>, fn(&SharedPointer<T, P>) -> &T>

Creates an iterator from a value.

impl<T, P> Ord for List<T, P>

where T: Ord, P: SharedPointerKind,

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

where T: PartialEq, P: SharedPointerKind, PO: SharedPointerKind,

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

where T: PartialOrd, P: SharedPointerKind, PO: SharedPointerKind,

fn partial_cmp(&self, other: &List<T, PO>) -> 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<T, P> Serialize for List<T, P>

where T: Serialize, P: SharedPointerKind,

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

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, P> Eq for List<T, P>

where T: Eq, P: SharedPointerKind,