Struct LinkedList

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

An experimental rewrite of LinkedList to provide a more cursor-oriented API.

Implementations

impl<T> LinkedList<T>

pub fn new() -> LinkedList<T>

Makes a new LinkedList.

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

Appends an element to the back of the list.

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

Appends an element to the front of the list.

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

Removes the element at back of the list. Returns None if the list is empty.

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

Removes the element at front of the list. Returns None if the list is empty.

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

Gets the element at the front of the list, or None if empty.

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

Gets the element at the back of the list, or None if empty.

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

Gets the element at the front of the list mutably, or None if empty.

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

Gets the element at the back of the list mutably, or None if empty.

pub fn insert(&mut self, index: usize, elem: T)

Inserts an element at the given index.

Panics

Panics if the index is greater than the length of the list.

pub fn remove(&mut self, index: usize) -> Option<T>

Removes the element at the given index. Returns None if the index is out of bounds.

pub fn split_at(&mut self, index: usize) -> LinkedList<T>

Splits the list into two lists at the given index. Returns the right side of the split. Returns an empty list if index is out of bounds.

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

Appends the given list to the end of this one. The old list will be empty afterwards.

pub fn splice(&mut self, index: usize, other: &mut LinkedList<T>)

Inserts the given list at the given index. The old list will be empty afterwards.

pub fn len(&self) -> usize

Gets the number of elements in the list.

pub fn is_empty(&self) -> bool

Whether the list is empty.

pub fn clear(&mut self)

Removes all elements from the list.

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

Gets a cursor over the list.

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

Provides a forward iterator.

pub fn iter_mut<'a>(&'a mut self) -> IterMut<'a, T>

Provides a forward iterator with mutable references.

pub fn into_iter(self) -> IntoIter<T>

Consumes the list into an iterator yielding elements by value.

Trait Implementations

impl<T: Clone> Clone for LinkedList<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug> Debug for LinkedList<A>

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

Formats the value using the given formatter.

impl<T> Drop for LinkedList<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<A> Extend<A> for LinkedList<A>

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

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

Reserves capacity in a collection for the given number of additional elements.

impl<A> FromIterator<A> for LinkedList<A>

fn from_iter<T: IntoIterator<Item = A>>(iter: T) -> LinkedList<A>

Creates a value from an iterator.

impl<A: Hash> Hash for LinkedList<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 LinkedList<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<'a, T> IntoIterator for &'a mut LinkedList<T>

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

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

Creates an iterator from a value.

impl<T> IntoIterator for LinkedList<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IntoIter<T>

Creates an iterator from a value.

impl<A: Ord> Ord for LinkedList<A>

fn cmp(&self, other: &Self) -> 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<A: PartialEq> PartialEq for LinkedList<A>

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<A: PartialOrd> PartialOrd for LinkedList<A>

fn partial_cmp(&self, other: &Self) -> 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<A: Eq> Eq for LinkedList<A>