Struct LinkedList

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

Implementations

impl<T> LinkedList<T>

pub fn new() -> Self

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

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

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn clear(&mut self)

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

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

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

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

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

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

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

pub fn set_off(&mut self, at: usize, elt: T)

pub fn delete_first_n_filter<F>(&mut self, n: usize, f: F)

where F: Fn(&T) -> bool,

pub fn delete_last_n_filter<F>(&mut self, n: usize, f: F)

where F: Fn(&T) -> bool,

Trait Implementations

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

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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.