Struct List

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

List is collection of homogeneous objects.

Implementations

impl<T> List<T>

pub fn new() -> Self

Construct an empty list.

pub fn len(&self) -> i32

Return the number of elements in the list.

pub fn is_empty(&self) -> bool

Return true if the list contains no elements.

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

Return an iterator over the list.

pub fn find(&self, element: &T) -> Option<&T>

where T: PartialEq,

Return the first occurrence of the specified element or None in the list.

pub fn contains(&self, element: &T) -> bool

where T: PartialEq,

Return true if the list contains element.

pub fn count(&self, element: &T) -> usize

where T: PartialEq,

Count the number of occurrence of the specified element.

pub fn uniquify(&self) -> Self

where T: PartialEq + Clone,

Return a list that eliminates duplicate elements and keep the original relative order of elements.

pub fn insert(&mut self, index: i32, element: T)

Insert the specified element at the specified index in the list. Index can be negative.

pub fn remove(&mut self, index: i32) -> T

Remove and return the element at the specified index in the list. Index can be negative.

pub fn push(&mut self, element: T)

Append an element to the back of the list.

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

Remove the last element from a list and return it, or None if it is empty.

pub fn clear(&mut self)

Clear the list.

pub fn reverse(&mut self)

Reverse the order of elements in the list, in place.

Trait Implementations

impl<T> Add<&List<T>> for &List<T>

where List<T>: Clone,

type Output = List<T>

The resulting type after applying the + operator.

fn add(self, rhs: &List<T>) -> Self::Output

Performs the + operation.

impl<T> Add<&List<T>> for List<T>

where List<T>: Clone,

type Output = List<T>

The resulting type after applying the + operator.

fn add(self, rhs: &List<T>) -> Self::Output

Performs the + operation.

impl<T> Add<List<T>> for &List<T>

where List<T>: Clone,

type Output = List<T>

The resulting type after applying the + operator.

fn add(self, rhs: List<T>) -> Self::Output

Performs the + operation.

impl<T> Add for List<T>

type Output = List<T>

The resulting type after applying the + operator.

fn add(self, rhs: List<T>) -> Self::Output

Performs the + operation.

impl<T> AddAssign<&List<T>> for List<T>

where List<T>: Clone,

fn add_assign(&mut self, rhs: &List<T>)

Performs the += operation.

impl<T> AddAssign for List<T>

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

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

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

Returns a duplicate 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: Default> Default for List<T>

fn default() -> List<T>

Returns the “default value” for a type.

impl<T: Display> Display 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, const N: usize> From<[T; N]> for List<T>

fn from(value: [T; N]) -> Self

Converts to this type from the input type.

impl<T> From<Vec<T>> for List<T>

fn from(value: Vec<T>) -> Self

Converts to this type from the input type.

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: 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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> Index<i32> for List<T>

type Output = T

The returned type after indexing.

fn index(&self, index: i32) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<i32> for List<T>

fn index_mut(&mut self, index: i32) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

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

fn cmp(&self, other: &List<T>) -> 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<T: PartialEq> PartialEq for List<T>

fn eq(&self, other: &List<T>) -> 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<T: PartialOrd> PartialOrd for List<T>

fn partial_cmp(&self, other: &List<T>) -> 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<T: Eq> Eq for List<T>

impl<T> StructuralPartialEq for List<T>