pub struct Repeat<I> { /* private fields */ }Expand description
An index list consisting of an index repeated a finite number of times.
Implementations§
Trait Implementations§
Source§impl<I: RecordIndex> IndexList for Repeat<I>
impl<I: RecordIndex> IndexList for Repeat<I>
Source§const ALWAYS_BOUNDED: bool = true
const ALWAYS_BOUNDED: bool = true
Signals whether this index list is always bounded. Read more
Source§unsafe fn get_index_unchecked(&self, _: usize) -> Self::Index
unsafe fn get_index_unchecked(&self, _: usize) -> Self::Index
Obtain the index at the given location. Read more
Source§fn num_indices(&self) -> usize
fn num_indices(&self) -> usize
The number of indices in this index list.
Source§fn bounds(&self) -> Option<Bounds<Self::Index>>
fn bounds(&self) -> Option<Bounds<Self::Index>>
Return the tightest bounds that contain all indices in this index list, if possible.
Source§fn get_index(&self, loc: usize) -> Self::Index
fn get_index(&self, loc: usize) -> Self::Index
Returns the index at the given location. Read more
Source§fn index_cast<TargetIndex>(self) -> IndexCast<Self, TargetIndex>
fn index_cast<TargetIndex>(self) -> IndexCast<Self, TargetIndex>
Casts indices in this collection to the desired type. Read more
Source§fn index_product<I: IndexList>(self, other: I) -> IndexProduct<Self, I>where
Self: Sized,
fn index_product<I: IndexList>(self, other: I) -> IndexProduct<Self, I>where
Self: Sized,
Returns the Cartesian product of this index set with another set of (unique) indices.
Source§fn index_zip<I: IndexList>(self, other: I) -> IndexZip<Self, I>where
Self: Sized,
fn index_zip<I: IndexList>(self, other: I) -> IndexZip<Self, I>where
Self: Sized,
Zips this index list with another. Read more
Source§fn index_azip<I: IndexList>(self, other: I) -> IndexAZip<Self, I>where
Self: Sized,
fn index_azip<I: IndexList>(self, other: I) -> IndexAZip<Self, I>where
Self: Sized,
Zips this index list with another, but uniqueness is determined by the second list. Read more
Source§fn index_flatten(self) -> IndexFlatten<Self>where
Self: Sized,
fn index_flatten(self) -> IndexFlatten<Self>where
Self: Sized,
Flattens nested tuple indices. Read more
Source§fn index_transpose(self) -> IndexTranspose<Self>where
Self: Sized,
fn index_transpose(self) -> IndexTranspose<Self>where
Self: Sized,
Transposes the indices in this index list. Read more
Source§fn check_unique(self) -> Result<CheckedUnique<Self>, NonUniqueIndex>
fn check_unique(self) -> Result<CheckedUnique<Self>, NonUniqueIndex>
Turns an index list into a list of unique indices, if possible. Read more
Source§unsafe fn assume_unique(self) -> AssumedUnique<Self>where
Self: Sized,
unsafe fn assume_unique(self) -> AssumedUnique<Self>where
Self: Sized,
Turns an index list into a list of unique indices, without checking. Read more
Auto Trait Implementations§
impl<I> Freeze for Repeat<I>where
I: Freeze,
impl<I> RefUnwindSafe for Repeat<I>where
I: RefUnwindSafe,
impl<I> Send for Repeat<I>where
I: Send,
impl<I> Sync for Repeat<I>where
I: Sync,
impl<I> Unpin for Repeat<I>where
I: Unpin,
impl<I> UnwindSafe for Repeat<I>where
I: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more