Struct IndexList 

pub struct IndexList<E>
where
    E: Eq + Hash,
{ /* private fields */ }

Implementations

impl<E> IndexList<E>

where E: Eq + Hash,

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn contains(&self, x: &E) -> bool

pub fn index_of(&self, x: &E) -> Option<usize>

pub fn iter(&self) -> impl Iterator<Item = &E>

Trait Implementations

impl<E> Clone for IndexList<E>

where E: Eq + Hash + Clone,

fn clone(&self) -> IndexList<E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E> Debug for IndexList<E>

where E: Eq + Hash + Debug,

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

Formats the value using the given formatter.

impl<E> Default for IndexList<E>

where E: Eq + Hash + Default,

fn default() -> IndexList<E>

Returns the “default value” for a type.

impl<E> FromIterator<E> for IndexList<E>

where E: Eq + Hash,

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

Creates a value from an iterator.

impl<E> Index<usize> for IndexList<E>

where E: Eq + Hash,

type Output = E

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<E> IntoIterator for IndexList<E>

where E: Eq + Hash,

type Item = E

The type of the elements being iterated over.

type IntoIter = IntoIter<E>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<E> PartialEq for IndexList<E>

where E: Eq + Hash + PartialEq,

fn eq(&self, other: &IndexList<E>) -> 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<E> Eq for IndexList<E>

where E: Eq + Hash + Eq,

impl<E> StructuralPartialEq for IndexList<E>

where E: Eq + Hash,