Struct fwdlist::List

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

A simply linked list.

Methods

impl<T> List<T>

pub fn cursor(&mut self) -> Cursor<T>

Return a cursor at the beginning of the list (before the first node).

impl<T> List<T>

Important traits for ListIter<'a, T>

impl<'a, T> Iterator for ListIter<'a, T> type Item = &'a T;

pub fn iter(&self) -> ListIter<T>

Returns an iterator over the list yielding read-only references.

impl<T> List<T>

Important traits for ListIterMut<'a, T>

impl<'a, T> Iterator for ListIterMut<'a, T> type Item = &'a mut T;

pub fn iter_mut(&mut self) -> ListIterMut<T>

Returns an iterator over the list yielding mutable references.

impl<T> List<T>

Some accessors to front/back elements.

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

Returns a reference to the first element in the list.

pub fn front_mut(&mut self) -> Option<&mut T>

Returns a mutable reference to the first element in the list.

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

Returns a reference to the last element in the list.

pub fn back_mut(&mut self) -> Option<&mut T>

Returns a mutable reference to the last element in the list.

impl<T> List<T>

pub fn new() -> List<T>

A new empty list.

pub fn len(&self) -> usize

The size of the list in O(1).

pub fn is_empty(&self) -> bool

Returns true if list is empty in O(1);

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

Push a new element at the front of the list in O(1). Cannot fails, only panic!/OOM on memory exhaustion.

pub fn pop_front(&mut self) -> Option<T>

Pop a element from the front of the list in O(1). Returns None if the list is empty.

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

Push an element at the end of the list in O(n). Cannot fails, only panic!/OOM on memory exhaustion.

pub fn pop_back(&mut self) -> Option<T>

Pop an element from the end of the list in O(n). Returns None if the list is empty.

pub fn clear(&mut self)

Clear the list in O(n).

impl<T> List<T>

Extra operations on the list - Unstable API.

pub fn append(&mut self, other: &mut List<T>)

Moves all elements from other to the end of the list in O(self.len());

pub fn split_off(&mut self, at: usize) -> List<T>

Splits the list into two at the given index in O(at).

• Returns everything after the given index, including the index.
• if at == self.len(), returns an empty list in O(1).
• Panics if at > self.len().

Trait Implementations

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

Clone a list in O(n).

clone_from() will reuse as many nodes from self as possible to avoid reallocation.

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

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

#[must_use]

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

This method tests for !=.

impl<A: PartialOrd> PartialOrd<List<A>> for List<A>

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

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

#[must_use]

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

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

#[must_use]

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

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

#[must_use]

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

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

#[must_use]

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<A: Ord> Ord for List<A>

fn cmp(&self, other: &List<A>) -> 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.

fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Returns max if self is greater than max, and min if self is less than min. Otherwise this will return self. Panics if min > max.

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

impl<T> IntoIterator for List<T>

for v in my_list { v ... }

type Item = T

The type of the elements being iterated over.

type IntoIter = ListIntoIter<Self::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

for v in &my_list { *v ... }

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = ListIter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut List<T>

for v in &mut my_list { *v = ... }

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = ListIterMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> Drop for List<T>

Drop the list in O(n).

fn drop(&mut self)

Executes the destructor for this type.

impl<T> Default for List<T>

A default empty list.

fn default() -> List<T>

Returns the "default value" for a type.

impl<T> Extend<T> for List<T>

Extend the list from the content of iter in O(n).

fn extend<I>(&mut self, iter: I) where
    I: IntoIterator<Item = T>, 

Extends a collection with the contents of an iterator.

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

Construct a list from the content of the iterator iter in O(n).

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

Creates a value from an iterator.

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

A debug formatter.

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

Formats the value using the given formatter.