Struct ds_ext::list::List

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

A linked list with cardinal indexing and O(log n) get/insert/remove by index

Implementations

impl<T> List<T>

pub fn new() -> Self

Create a new empty List.

pub fn with_capacity(capacity: usize) -> Self

Create a new empty List with the given capacity.

impl<T> List<T>

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

Borrow the last element in this List, if any.

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

Borrow the last element in this List, if any.

pub fn clear(&mut self)

Remove all elements from this List.

pub fn drain(&mut self) -> Drain<'_, T>

Drain all elements from this List.

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

Borrow the first element in this List, if any.

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

Borrow the last element in this List, if any.

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

Borrow the element at the given index, if any.

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

Borrow the element at the given index mutably, if any.

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

Insert a new value at the given index.

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

Iterate over all elements in this List.

pub fn is_empty(&self) -> bool

Return true if this List is empty.

pub fn len(&self) -> usize

Return the length of this List.

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

Remove and return the last value in this List.

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

Remove and return the first value in this List.

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

Append the given value to the back of this List.

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

Append the given value to the front of this List.

pub fn range<R: RangeBounds<usize>>(&self, range: R) -> Iter<'_, T>

Iterate over the given range of elements in this List.

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

Remove and return the value at the given index, if any.

pub fn starts_with<'a, I: IntoIterator<Item = &'a T>>( &'a self, other: I ) -> boolwhere T: PartialEq,

Return true if the first elements in this List are equal to those in the given iter.

pub fn swap(&mut self, from: usize, to: usize)

Swap the value at from with the value at to.

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<T> Extend<T> for List<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 List<T>

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

Creates a value from an iterator.

impl<T: GetSize> GetSize for List<T>

fn get_heap_size(&self) -> usize

Determines how many bytes this object occupies inside the heap.

fn get_stack_size() -> usize

Determines how may bytes this object occupies inside the stack.

fn get_size(&self) -> usize

Determines the total size of the object.

impl<'a, T> IntoIterator for &'a List<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) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for List<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) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq<List<T>> for List<T>

fn eq(&self, other: &Self) -> 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 !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialEq> PartialEq<Vec<T, Global>> for List<T>

fn eq(&self, other: &Vec<T>) -> 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 !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq> Eq for List<T>