Enum rand::seq::index::IndexVec

pub enum IndexVec {
    // some variants omitted
}

A vector of indices.

Multiple internal representations are possible.

Implementations

impl IndexVec

pub fn len(&self) -> usize

Returns the number of indices

pub fn is_empty(&self) -> bool

Returns true if the length is 0.

pub fn index(&self, index: usize) -> usize

Return the value at the given index.

(Note: we cannot implement std::ops::Index because of lifetime restrictions.)

pub fn into_vec(self) -> Vec<usize>

Return result as a Vec<usize>. Conversion may or may not be trivial.

pub fn iter(&self) -> IndexVecIter<'_>

Iterate over the indices as a sequence of usize values

Trait Implementations

impl Clone for IndexVec

fn clone(&self) -> IndexVec

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for IndexVec

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

Formats the value using the given formatter.

impl From<Vec<u32>> for IndexVec

fn from(v: Vec<u32>) -> Self

Converts to this type from the input type.

impl From<Vec<usize>> for IndexVec

fn from(v: Vec<usize>) -> Self

Converts to this type from the input type.

impl IntoIterator for IndexVec

fn into_iter(self) -> IndexVecIntoIter

Convert into an iterator over the indices as a sequence of usize values

type Item = usize

The type of the elements being iterated over.

type IntoIter = IndexVecIntoIter

Which kind of iterator are we turning this into?

impl PartialEq for IndexVec

fn eq(&self, other: &IndexVec) -> 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.