Struct linked::LinkedList

pub struct LinkedList<T>(_);

LinkedList is an implementation of a singly-linked-list.

Implementations

impl<T> LinkedList<T>

pub const fn new() -> Self

Create a new empty linked list

pub fn len(&self) -> usize

Get the length of the linked list. This is an O(n) computation

pub fn is_empty(&self) -> bool

Determine if this linked list is empty. This is an O(1) computation

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

Push to the front of the linked list. This is O(1)

let mut ll = LinkedList::new();
ll.push_front(1);
ll.push_front(2);
assert_eq!(ll, LinkedList::from_iter([2, 1]))

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

Pop from the front of the linked list. This is O(1)

let mut ll = LinkedList::from_iter([1, 2]);
assert_eq!(ll.pop_front(), Some(1));
assert_eq!(ll.pop_front(), Some(2));
assert_eq!(ll.pop_front(), None);

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

View the first value in the linked list. This is O(1)

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

Modify the first value in the linked list. This is O(1)

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

View the last value in the linked list. This is O(n)

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

Modify the last value in the linked list. This is O(n)

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

Push to the back of the linked list. This is O(n)

let mut ll = LinkedList::new();
ll.push_back(1);
ll.push_back(2);
assert_eq!(ll, LinkedList::from_iter([1, 2]))

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

Pop from the back of the linked list. This is O(n)

let mut ll = LinkedList::from_iter([1, 2]);
assert_eq!(ll.pop_back(), Some(2));
assert_eq!(ll.pop_back(), Some(1));
assert_eq!(ll.pop_back(), None);

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

Create an iter over this linked list

let mut ll = LinkedList::from_iter([1, 2, 3]);
assert_eq!(ll.iter().cloned().collect::<Vec<_>>(), vec![1, 2, 3]);

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

Create a mutable iter over this linked list

let mut ll = LinkedList::from_iter([1, 2, 3]);
ll.iter_mut().for_each(|i| *i *= 2);
assert_eq!(ll, LinkedList::from_iter([2, 4, 6]));

pub fn append(&mut self, other: Self)

Add one linked list to the end of this linked list

let mut ll = LinkedList::from_iter(0..3);
ll.append(LinkedList::from_iter(3..6));

assert_eq!(ll, LinkedList::from_iter(0..6));

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<T: Debug> Debug for LinkedList<T>

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

Formats the value using the given formatter.

impl<T> Default for LinkedList<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for LinkedList<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T> Extend<T> for LinkedList<T>

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

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

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

Creates a value from an iterator.

impl<T> IntoIterator for LinkedList<T>

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

type Item = T

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

type Item = &'a mut T

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, U> PartialEq<LinkedList<U>> for LinkedList<T> where
    T: PartialEq<U>, 

fn eq(&self, other: &LinkedList<U>) -> 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 !=.