Struct IndexBase 

pub struct IndexBase<Idx = Udx, K = VertexIndex> { /* private fields */ }

A generic IndexBase implementation used to represent various kinds of indices

Implementations

impl<T, K> IndexBase<T, K>

where T: RawIndex,

pub fn new(index: T) -> Self

returns a new instance of IndexBase with the given value.

pub fn new_with<F>(index: F) -> Self

where F: FnOnce() -> T,

creates a new instance of IndexBase using the given function to generate the value

pub fn one() -> Self

where T: One,

creates a new index with a value of one

pub fn zero() -> Self

where T: Zero,

creates a new index with a value of zero

pub const fn as_ptr(&self) -> *const T

returns a pointer to the inner value

pub fn as_mut_ptr(&mut self) -> *mut T

returns a mutable pointer to the inner value

pub fn as_raw_box(&self) -> Box<dyn RawIndex>

where T: Clone,

converts the a reference to a boxed raw index trait object

pub fn into_raw_box(self) -> Box<dyn RawIndex>

boxes up the raw index value for generic use

pub const fn get(&self) -> &T

returns an immutable reference to the inner value

pub const fn get_mut(&mut self) -> &mut T

returns a mutable reference to the inner value

pub fn value(self) -> T

consumes the current instance to return the inner value

pub fn map<U, F>(self, f: F) -> IndexBase<U, K>

where F: FnOnce(T) -> U, U: RawIndex,

apply a function to the inner value and returns a new Index wrapping the result

pub const fn replace(&mut self, index: T) -> T

replace and return the old value after replacing it with the given value

pub fn set(&mut self, value: T) -> &mut Self

set the index to the given value

pub const fn swap(&mut self, other: &mut Self)

swap the values of two indices

pub fn take(&mut self) -> T

where T: Default,

take the value and replace it with the default value

pub fn with<U: RawIndex>(self, value: U) -> IndexBase<U, K>

consumes the current index to create another with the given value

pub fn counter(self) -> Counter<Self>

returns a new counter iterator over the index

pub fn dec(self) -> IndexBase<<T as Sub>::Output, K>

where T: Sub + One, <T as Sub>::Output: RawIndex,

decrements the index value by one and returns a new instance

pub fn dec_inplace(&mut self)

where T: SubAssign + One,

mutably decrements the index value by one

pub fn inc(self) -> IndexBase<<T as Add>::Output, K>

where T: Add + One, <T as Add>::Output: RawIndex,

increments the index value by one and consumes the current instance to create another with the new value.

pub fn inc_inplace(&mut self)

where T: Copy + AddAssign + One,

mutably increments the index value by 1

pub fn step(&mut self) -> IndexResult<Self>

where T: AddStep<Output = T>,

increments the current index and returns the previous instance of the index.

    use rshyper_core::EdgeId;
    let mut edge_id = EdgeId::<usize>::zero();
    let e0 = edge_id.step()?;
    let e1 = edge_id.step()?;
    let e2 = edge_id.step()?;
    assert_eq!(e0.get(), &0);
    assert_eq!(e1.get(), &1);
    assert_eq!(e2.get(), &2);

pub fn step_with<F>(&mut self, f: F) -> IndexResult<Self>

where F: FnOnce(&T) -> T,

replaces the current value with the next one computed using the provided function and returns the previous instance of the index.

pub fn next_with<U, F>(self, f: F) -> IndexResult<IndexBase<U, K>>

where F: FnOnce(T) -> U, U: RawIndex,

similar to step_with, however, rather than replacing the current value with the computed value, it returns a new instance of the index containing the computed value.

pub fn into_inner(self) -> T

👎Deprecated since 0.0.10: use value instead

impl<K> IndexBase<usize, K>

generic implementations for the IndexBase<T, K> enabled by the rand feature

pub fn rand() -> Self

generate a random index from a value of type T

impl<T, K> IndexBase<T, K>

where T: RawIndex,

generic implementations for the IndexBase<T, K> enabled by the rand feature

pub fn rand_step(&mut self) -> Self

where StandardUniform: Distribution<T>,

replaces the current value with a randomly generated value and returns a new instance of IndexBase with the previous value.

pub fn random() -> Self

where StandardUniform: Distribution<T>,

generate a random index from a value of type T

pub fn random_between<R>(range: R) -> Self

where R: SampleRange<T>, T: SampleUniform,

returns a new index randomly generated within the provided range

pub fn random_with<R, Dist>(rng: &mut R, distr: Dist) -> Self

where R: ?Sized + RngCore, Dist: Distribution<T>,

generate a random index from a value of type T using the provided Rng

impl<K> IndexBase<usize, K>

pub fn atomic() -> Self

returns a new index generated using an AtomicUsize This method is useful in that it is no_std compatible, thread-safe, and capable of generating unique indices in a concurrent environment.

pub fn create() -> Self

a helper method that dynamically initializes the index based on the enabled features:

• rand: if enabled, use random number generation to generate the index.
• fallback: otherwise, use an atomic counter to generate the index.

pub fn atomic_next(&mut self) -> Self

atomically generates a the next index, replacing the current value with the generated one and returning the previous value.

pub fn generate(&mut self) -> Self

the generate is useful for instances where the type Idx of the IndexBase is not generalized, automatically using random number generation if the rand feature is enabled, or an atomic counter otherwise. The method is also useful in that it generates usize indices, whcih are the most common instances, yet aren’t direct implementors of StandardUniform.

impl<T> IndexBase<T, EdgeIndex>

where T: RawIndex,

pub fn vertex(value: T) -> Self

impl<T> IndexBase<T, VertexIndex>

where T: RawIndex,

pub fn vertex(value: T) -> Self

Trait Implementations

impl<'a, K, A, B, C> Add<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Add<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the + operator.

fn add(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the + operation.

impl<'a, K, A, B, C> Add<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: Add<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the + operator.

fn add(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the + operation.

impl<'a, K, A, B, C> Add<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Add<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the + operator.

fn add(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the + operation.

impl<'a, K, A, B, C> Add<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: Add<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the + operator.

fn add(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the + operation.

impl<'a, K, A, B, C> Add<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Add<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the + operator.

fn add(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the + operation.

impl<'a, K, A, B, C> Add<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Add<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the + operator.

fn add(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the + operation.

impl<K, A, B, C> Add<IndexBase<B, K>> for IndexBase<A, K>

where A: Add<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the + operator.

fn add(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the + operation.

impl<K, A, B> AddAssign<B> for IndexBase<A, K>

where A: AddAssign<B>,

fn add_assign(&mut self, rhs: B)

Performs the += operation.

impl<T, K> AsMut<T> for IndexBase<T, K>

where T: RawIndex,

fn as_mut(&mut self) -> &mut T

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T, K> AsRef<T> for IndexBase<T, K>

where T: RawIndex,

fn as_ref(&self) -> &T

Converts this type into a shared reference of the (usually inferred) input type.

impl<T, K> Binary for IndexBase<T, K>

where T: Binary,

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

Formats the value using the given formatter.

impl<'a, K, A, B, C> BitAnd<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: BitAnd<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the & operator.

fn bitand(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the & operation.

impl<'a, K, A, B, C> BitAnd<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: BitAnd<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the & operator.

fn bitand(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the & operation.

impl<'a, K, A, B, C> BitAnd<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: BitAnd<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the & operator.

fn bitand(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the & operation.

impl<'a, K, A, B, C> BitAnd<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: BitAnd<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the & operator.

fn bitand(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the & operation.

impl<'a, K, A, B, C> BitAnd<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: BitAnd<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the & operator.

fn bitand(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the & operation.

impl<'a, K, A, B, C> BitAnd<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: BitAnd<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the & operator.

fn bitand(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the & operation.

impl<K, A, B, C> BitAnd<IndexBase<B, K>> for IndexBase<A, K>

where A: BitAnd<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the & operator.

fn bitand(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the & operation.

impl<K, A, B> BitAndAssign<B> for IndexBase<A, K>

where A: BitAndAssign<B>,

fn bitand_assign(&mut self, rhs: B)

Performs the &= operation.

impl<'a, K, A, B, C> BitOr<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: BitOr<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the | operator.

fn bitor(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the | operation.

impl<'a, K, A, B, C> BitOr<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: BitOr<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the | operator.

fn bitor(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the | operation.

impl<'a, K, A, B, C> BitOr<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: BitOr<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the | operator.

fn bitor(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the | operation.

impl<'a, K, A, B, C> BitOr<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: BitOr<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the | operator.

fn bitor(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the | operation.

impl<'a, K, A, B, C> BitOr<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: BitOr<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the | operator.

fn bitor(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the | operation.

impl<'a, K, A, B, C> BitOr<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: BitOr<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the | operator.

fn bitor(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the | operation.

impl<K, A, B, C> BitOr<IndexBase<B, K>> for IndexBase<A, K>

where A: BitOr<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the | operator.

fn bitor(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the | operation.

impl<K, A, B> BitOrAssign<B> for IndexBase<A, K>

where A: BitOrAssign<B>,

fn bitor_assign(&mut self, rhs: B)

Performs the |= operation.

impl<'a, K, A, B, C> BitXor<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: BitXor<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the ^ operation.

impl<'a, K, A, B, C> BitXor<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: BitXor<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the ^ operation.

impl<'a, K, A, B, C> BitXor<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: BitXor<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the ^ operation.

impl<'a, K, A, B, C> BitXor<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: BitXor<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the ^ operation.

impl<'a, K, A, B, C> BitXor<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: BitXor<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the ^ operation.

impl<'a, K, A, B, C> BitXor<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: BitXor<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the ^ operation.

impl<K, A, B, C> BitXor<IndexBase<B, K>> for IndexBase<A, K>

where A: BitXor<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the ^ operation.

impl<K, A, B> BitXorAssign<B> for IndexBase<A, K>

where A: BitXorAssign<B>,

fn bitxor_assign(&mut self, rhs: B)

Performs the ^= operation.

impl<T, Idx> Borrow<IndexBase<Idx>> for Node<T, Idx>

where Idx: RawIndex,

fn borrow(&self) -> &VertexId<Idx>

Immutably borrows from an owned value.

impl<T, S, K, Idx> Borrow<IndexBase<Idx, EdgeIndex>> for Edge<T, S, K, Idx>

where Idx: RawIndex, K: GraphType, S: Domain<Idx>,

fn borrow(&self) -> &EdgeId<Idx>

Immutably borrows from an owned value.

impl<S, K, Idx> Borrow<IndexBase<Idx, EdgeIndex>> for Link<S, K, Idx>

where Idx: RawIndex, K: GraphType, S: Domain<Idx>,

fn borrow(&self) -> &EdgeId<Idx>

Immutably borrows from an owned value.

impl<T, K> Borrow<T> for IndexBase<T, K>

where T: RawIndex,

fn borrow(&self) -> &T

Immutably borrows from an owned value.

impl<T, S, K, Idx> BorrowMut<IndexBase<Idx, EdgeIndex>> for Edge<T, S, K, Idx>

where Idx: RawIndex, K: GraphType, S: Domain<Idx>,

fn borrow_mut(&mut self) -> &mut EdgeId<Idx>

Mutably borrows from an owned value.

impl<S, K, Idx> BorrowMut<IndexBase<Idx, EdgeIndex>> for Link<S, K, Idx>

where Idx: RawIndex, K: GraphType, S: Domain<Idx>,

fn borrow_mut(&mut self) -> &mut EdgeId<Idx>

Mutably borrows from an owned value.

impl<T, K> BorrowMut<T> for IndexBase<T, K>

where T: RawIndex,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value.

impl<Idx: Clone, K: Clone> Clone for IndexBase<Idx, K>

fn clone(&self) -> IndexBase<Idx, K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T, K> Debug for IndexBase<T, K>

where T: Debug,

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

Formats the value using the given formatter.

impl<T, K> Default for IndexBase<T, K>

where T: Default,

fn default() -> Self

Returns the “default value” for a type.

impl<T, K> Deref for IndexBase<T, K>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T, K> DerefMut for IndexBase<T, K>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'de, Idx, K> Deserialize<'de> for IndexBase<Idx, K>

where Idx: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T, K> Display for IndexBase<T, K>

where T: Display,

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

Formats the value using the given formatter.

impl<T, K> Distribution<IndexBase<T, K>> for StandardNormal

where T: RawIndex, StandardNormal: Distribution<T>,

fn sample<R>(&self, rng: &mut R) -> IndexBase<T, K>

where R: ?Sized + RngCore,

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> Iter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> Map<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Map sampled values to type S

impl<T, K> Distribution<IndexBase<T, K>> for StandardUniform

where T: RawIndex, StandardUniform: Distribution<T>,

fn sample<R>(&self, rng: &mut R) -> IndexBase<T, K>

where R: ?Sized + Rng,

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> Iter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> Map<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Map sampled values to type S

impl<'a, K, A, B, C> Div<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Div<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the / operator.

fn div(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the / operation.

impl<'a, K, A, B, C> Div<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: Div<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the / operator.

fn div(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the / operation.

impl<'a, K, A, B, C> Div<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Div<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the / operator.

fn div(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the / operation.

impl<'a, K, A, B, C> Div<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: Div<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the / operator.

fn div(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the / operation.

impl<'a, K, A, B, C> Div<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Div<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the / operator.

fn div(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the / operation.

impl<'a, K, A, B, C> Div<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Div<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the / operator.

fn div(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the / operation.

impl<K, A, B, C> Div<IndexBase<B, K>> for IndexBase<A, K>

where A: Div<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the / operator.

fn div(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the / operation.

impl<K, A, B> DivAssign<B> for IndexBase<A, K>

where A: DivAssign<B>,

fn div_assign(&mut self, rhs: B)

Performs the /= operation.

impl<T, Idx> From<IndexBase<Idx>> for Node<T, Idx>

where Idx: RawIndex, T: Default,

fn from(index: VertexId<Idx>) -> Self

Converts to this type from the input type.

impl<T, S, K, Idx> From<IndexBase<Idx, EdgeIndex>> for Edge<T, S, K, Idx>

where Idx: RawIndex, K: GraphType, S: Default + Domain<Idx>, T: Default,

fn from(id: EdgeId<Idx>) -> Self

Converts to this type from the input type.

impl<S, K, Idx> From<IndexBase<Idx, EdgeIndex>> for Link<S, K, Idx>

where Idx: RawIndex, K: GraphType, S: Default + Domain<Idx>,

fn from(from: EdgeId<Idx>) -> Self

Converts to this type from the input type.

impl<T, K> From<T> for IndexBase<T, K>

where T: RawIndex,

fn from(index: T) -> Self

Converts to this type from the input type.

impl<S, K, Idx> FromIterator<IndexBase<Idx>> for Link<S, K, Idx>

where Idx: Default + RawIndex, K: GraphType, S: Domain<Idx> + FromIterator<VertexId<Idx>>,

fn from_iter<I>(iter: I) -> Self

where I: IntoIterator<Item = VertexId<Idx>>,

Creates a value from an iterator.

impl<Idx: Hash, K: Hash> Hash for IndexBase<Idx, K>

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, K> Iterator for IndexBase<T, K>

where T: RawIndex + AddStep<Output = T>,

type Item = IndexBase<T, K>

The type of the elements being iterated over.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

fn next_chunk<const N: usize>( &mut self, ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

where Self: Sized,

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

where Self: Sized,

Consumes the iterator, returning the last element.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse(self, separator: Self::Item) -> Intersperse<Self>

where Self: Sized, Self::Item: Clone,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places a copy of separator between adjacent items of the original iterator.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator.

fn map<B, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F)

where Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

fn skip(self, n: usize) -> Skip<Self>

where Self: Sized,

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure.

fn flatten(self) -> Flatten<Self>

where Self: Sized, Self::Item: IntoIterator,

Creates an iterator that flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Creates a “by reference” adapter for this instance of Iterator.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R

where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn fold<B, F>(self, init: B, f: F) -> B

where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index.

fn max(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: Copy + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: Clone + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn cycle(self) -> Cycle<Self>

where Self: Sized + Clone,

Repeats an iterator endlessly.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements

fn cmp<I>(self, other: I) -> Ordering

where I: IntoIterator<Item = Self::Item>, Self::Item: Ord, Self: Sized,

Lexicographically compares the elements of this Iterator with those of another.

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering>

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another.

fn eq_by<I, F>(self, other: I, eq: F) -> bool

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another.

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted(self) -> bool

where Self: Sized, Self::Item: PartialOrd,

Checks if the elements of this iterator are sorted.

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

Checks if the elements of this iterator are sorted using the given key extraction function.

impl<T, K> LowerExp for IndexBase<T, K>

where T: LowerExp,

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

Formats the value using the given formatter.

impl<T, K> LowerHex for IndexBase<T, K>

where T: LowerHex,

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

Formats the value using the given formatter.

impl<'a, K, A, B, C> Mul<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Mul<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the * operator.

fn mul(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the * operation.

impl<'a, K, A, B, C> Mul<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: Mul<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the * operator.

fn mul(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the * operation.

impl<'a, K, A, B, C> Mul<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Mul<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the * operator.

fn mul(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the * operation.

impl<'a, K, A, B, C> Mul<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: Mul<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the * operator.

fn mul(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the * operation.

impl<'a, K, A, B, C> Mul<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Mul<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the * operator.

fn mul(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the * operation.

impl<'a, K, A, B, C> Mul<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Mul<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the * operator.

fn mul(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the * operation.

impl<K, A, B, C> Mul<IndexBase<B, K>> for IndexBase<A, K>

where A: Mul<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the * operator.

fn mul(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the * operation.

impl<K, A, B> MulAssign<B> for IndexBase<A, K>

where A: MulAssign<B>,

fn mul_assign(&mut self, rhs: B)

Performs the *= operation.

impl<T, K> Neg for IndexBase<T, K>

where T: Neg,

type Output = IndexBase<<T as Neg>::Output, K>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<T, K> Not for IndexBase<T, K>

where T: Not,

type Output = IndexBase<<T as Not>::Output, K>

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.

impl<T, K> Num for IndexBase<T, K>

where T: Num,

type FromStrRadixErr = <T as Num>::FromStrRadixErr

fn from_str_radix(str: &str, radix: u32) -> Result<Self, Self::FromStrRadixErr>

Convert from a string and radix (typically 2..=36).

impl<T, K> Octal for IndexBase<T, K>

where T: Octal,

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

Formats the value using the given formatter.

impl<T, K> One for IndexBase<T, K>

where T: One,

fn one() -> Self

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl<Idx: Ord, K: Ord> Ord for IndexBase<Idx, K>

fn cmp(&self, other: &IndexBase<Idx, K>) -> 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<'a, T, K> PartialEq<&'a IndexBase<T, K>> for IndexBase<T, K>

where T: PartialEq,

fn eq(&self, other: &&'a IndexBase<T, K>) -> 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<'a, T, K> PartialEq<&'a T> for IndexBase<T, K>

where T: PartialEq,

fn eq(&self, other: &&'a 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<'a, T, K> PartialEq<&'a mut IndexBase<T, K>> for IndexBase<T, K>

where T: PartialEq,

fn eq(&self, other: &&'a mut IndexBase<T, K>) -> 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<'a, T, K> PartialEq<&'a mut T> for IndexBase<T, K>

where T: PartialEq,

fn eq(&self, other: &&'a mut 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, K> PartialEq<IndexBase<T, K>> for &IndexBase<T, K>

where T: PartialEq,

fn eq(&self, other: &IndexBase<T, K>) -> 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, K> PartialEq<IndexBase<T, K>> for &mut IndexBase<T, K>

where T: PartialEq,

fn eq(&self, other: &IndexBase<T, K>) -> 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, K> PartialEq<T> for IndexBase<T, K>

where T: PartialEq,

fn eq(&self, other: &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, K> PartialEq for IndexBase<T, K>

where T: PartialEq,

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

where T: PartialOrd,

fn partial_cmp(&self, other: &&'a 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<'a, T, K> PartialOrd<&'a mut T> for IndexBase<T, K>

where T: PartialOrd,

fn partial_cmp(&self, other: &&'a mut 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, K> PartialOrd<T> for IndexBase<T, K>

where T: PartialOrd,

fn partial_cmp(&self, other: &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<Idx: PartialOrd, K: PartialOrd> PartialOrd for IndexBase<Idx, K>

fn partial_cmp(&self, other: &IndexBase<Idx, K>) -> 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, K> Pointer for IndexBase<T, K>

where T: Pointer,

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

Formats the value using the given formatter.

impl<K, Id> RawPoint for IndexBase<Id, K>

where Id: RawIndex,

type Key = Id

impl<'a, K, A, B, C> Rem<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Rem<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the % operator.

fn rem(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the % operation.

impl<'a, K, A, B, C> Rem<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: Rem<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the % operator.

fn rem(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the % operation.

impl<'a, K, A, B, C> Rem<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Rem<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the % operator.

fn rem(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the % operation.

impl<'a, K, A, B, C> Rem<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: Rem<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the % operator.

fn rem(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the % operation.

impl<'a, K, A, B, C> Rem<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Rem<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the % operator.

fn rem(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the % operation.

impl<'a, K, A, B, C> Rem<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Rem<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the % operator.

fn rem(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the % operation.

impl<K, A, B, C> Rem<IndexBase<B, K>> for IndexBase<A, K>

where A: Rem<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the % operator.

fn rem(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the % operation.

impl<K, A, B> RemAssign<B> for IndexBase<A, K>

where A: RemAssign<B>,

fn rem_assign(&mut self, rhs: B)

Performs the %= operation.

impl<Idx, K> Serialize for IndexBase<Idx, K>

where Idx: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<'a, K, A, B, C> Shl<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Shl<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the << operator.

fn shl(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the << operation.

impl<'a, K, A, B, C> Shl<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: Shl<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the << operator.

fn shl(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the << operation.

impl<'a, K, A, B, C> Shl<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Shl<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the << operator.

fn shl(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the << operation.

impl<'a, K, A, B, C> Shl<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: Shl<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the << operator.

fn shl(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the << operation.

impl<'a, K, A, B, C> Shl<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Shl<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the << operator.

fn shl(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the << operation.

impl<'a, K, A, B, C> Shl<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Shl<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the << operator.

fn shl(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the << operation.

impl<K, A, B, C> Shl<IndexBase<B, K>> for IndexBase<A, K>

where A: Shl<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the << operator.

fn shl(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the << operation.

impl<K, A, B> ShlAssign<B> for IndexBase<A, K>

where A: ShlAssign<B>,

fn shl_assign(&mut self, rhs: B)

Performs the <<= operation.

impl<'a, K, A, B, C> Shr<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Shr<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the >> operator.

fn shr(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the >> operation.

impl<'a, K, A, B, C> Shr<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: Shr<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the >> operator.

fn shr(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the >> operation.

impl<'a, K, A, B, C> Shr<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Shr<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the >> operator.

fn shr(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the >> operation.

impl<'a, K, A, B, C> Shr<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: Shr<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the >> operator.

fn shr(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the >> operation.

impl<'a, K, A, B, C> Shr<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Shr<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the >> operator.

fn shr(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the >> operation.

impl<'a, K, A, B, C> Shr<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Shr<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the >> operator.

fn shr(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the >> operation.

impl<K, A, B, C> Shr<IndexBase<B, K>> for IndexBase<A, K>

where A: Shr<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the >> operator.

fn shr(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the >> operation.

impl<K, A, B> ShrAssign<B> for IndexBase<A, K>

where A: ShrAssign<B>,

fn shr_assign(&mut self, rhs: B)

Performs the >>= operation.

impl<T, K> StepWith<T> for IndexBase<T, K>

where T: RawIndex,

type Output = IndexBase<T, K>

fn step_with<F>(&mut self, f: F) -> Self::Output

where F: FnOnce(&T) -> T,

impl<'a, K, A, B, C> Sub<&'a IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Sub<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the - operation.

impl<'a, K, A, B, C> Sub<&'a IndexBase<B, K>> for IndexBase<A, K>

where A: Sub<&'a B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a IndexBase<B, K>) -> Self::Output

Performs the - operation.

impl<'a, K, A, B, C> Sub<&'a mut IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Sub<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the - operation.

impl<'a, K, A, B, C> Sub<&'a mut IndexBase<B, K>> for IndexBase<A, K>

where A: Sub<&'a mut B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a mut IndexBase<B, K>) -> Self::Output

Performs the - operation.

impl<'a, K, A, B, C> Sub<IndexBase<B, K>> for &'a IndexBase<A, K>

where &'a A: Sub<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the - operator.

fn sub(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the - operation.

impl<'a, K, A, B, C> Sub<IndexBase<B, K>> for &'a mut IndexBase<A, K>

where &'a mut A: Sub<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the - operator.

fn sub(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the - operation.

impl<K, A, B, C> Sub<IndexBase<B, K>> for IndexBase<A, K>

where A: Sub<B, Output = C>,

type Output = IndexBase<C, K>

The resulting type after applying the - operator.

fn sub(self, rhs: IndexBase<B, K>) -> Self::Output

Performs the - operation.

impl<K, A, B> SubAssign<B> for IndexBase<A, K>

where A: SubAssign<B>,

fn sub_assign(&mut self, rhs: B)

Performs the -= operation.

impl<T, K> UpperExp for IndexBase<T, K>

where T: UpperExp,

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

Formats the value using the given formatter.

impl<T, K> UpperHex for IndexBase<T, K>

where T: UpperHex,

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

Formats the value using the given formatter.

impl<T, K> Zero for IndexBase<T, K>

where T: Zero,

fn zero() -> Self

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.

impl<Idx: Copy, K: Copy> Copy for IndexBase<Idx, K>

impl<T, K> Eq for IndexBase<T, K>

where T: Eq,