pub struct RepeatN<A, N = [A]>{ /* private fields */ }Expand description
A bulk that repeats an element an exact number of times.
This struct is created by the repeat_n() function.
See its documentation for more.
Trait Implementations§
Source§impl<A, N> Bulk for RepeatN<A, N>
impl<A, N> Bulk for RepeatN<A, N>
type MinLength<U> = <N as Length>::Mapped<U>
type MaxLength<U> = <N as Length>::Mapped<U>
Source§fn try_for_each<F, R>(self, f: F) -> R
fn try_for_each<F, R>(self, f: F) -> R
A bulk method that applies a fallible function to each item in the
bulk, stopping at the first error and returning that error. Read more
type CollectNearest = Self::Nearest where Self: Nearest
Source§fn first(self) -> Option<Self::Item>
fn first(self) -> Option<Self::Item>
Returns the first value, and discards the rest of the bulk. Read more
Source§fn last(self) -> Option<Self::Item>
fn last(self) -> Option<Self::Item>
Returns the last value, and discards the rest of the bulk. Read more
Source§fn nth<L>(self, n: L) -> Option<Self::Item>
fn nth<L>(self, n: L) -> Option<Self::Item>
Returns the
n-th value, and discards the rest of the bulk. Read moreSource§fn fold<B, F>(self, init: B, f: F) -> B
fn fold<B, F>(self, init: B, f: F) -> B
Folds every element into an accumulator by applying an operation,
returning the final result. Read more
Source§fn try_reduce<F, R>(
self,
f: F,
) -> <R::Residual as Residual<Option<R::Output>>>::TryType
fn try_reduce<F, R>( self, f: F, ) -> <R::Residual as Residual<Option<R::Output>>>::TryType
TODO
Source§fn step_by<L>(self, step: L) -> StepBy<Self, L::Length<Self::Item>> ⓘwhere
Self: Sized,
L: LengthValue,
fn step_by<L>(self, step: L) -> StepBy<Self, L::Length<Self::Item>> ⓘwhere
Self: Sized,
L: LengthValue,
Creates a bulk starting at the same point, but stepping by
the given amount at each iteration. Read more
Source§fn chain<U>(self, other: U) -> Chain<Self, U::IntoBulk> ⓘ
fn chain<U>(self, other: U) -> Chain<Self, U::IntoBulk> ⓘ
Takes two bulks and creates a new bulk over both in sequence. Read more
Source§fn zip<U>(
self,
other: U,
) -> Zip<Self, <<U as IntoContained>::IntoContained as IntoBulk>::IntoBulk> ⓘwhere
Self: Sized,
U: IntoContainedBy<Self>,
fn zip<U>(
self,
other: U,
) -> Zip<Self, <<U as IntoContained>::IntoContained as IntoBulk>::IntoBulk> ⓘwhere
Self: Sized,
U: IntoContainedBy<Self>,
‘Zips up’ two bulks or iterators into a single bulk of pairs. One of them must be a bulk. Read more
Source§fn intersperse(self, separator: Self::Item) -> Intersperse<Self> ⓘ
fn intersperse(self, separator: Self::Item) -> Intersperse<Self> ⓘ
Creates a new bulk which places a copy of
separator between adjacent
items of the original bulk. Read moreSource§fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> ⓘ
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> ⓘ
Creates a new bulk which places an item generated by
separator
between adjacent items of the original bulk. Read moreSource§fn map<B, F>(self, f: F) -> Map<Self, F> ⓘ
fn map<B, F>(self, f: F) -> Map<Self, F> ⓘ
Takes a closure and creates a bulk which calls that closure on each
element. Read more
Source§fn enumerate(self) -> Enumerate<Self> ⓘwhere
Self: Sized,
fn enumerate(self) -> Enumerate<Self> ⓘwhere
Self: Sized,
Creates a bulk which gives the current index together with its values. Read more
Source§fn enumerate_from<U>(self, initial_count: U) -> EnumerateFrom<Self, U> ⓘ
fn enumerate_from<U>(self, initial_count: U) -> EnumerateFrom<Self, U> ⓘ
Creates a bulk which gives the current index counting from a given initial index together with its values. Read more
Source§fn skip<L>(self, n: L) -> Skip<Self, L::Length<Self::Item>> ⓘwhere
Self: Sized,
L: LengthValue,
fn skip<L>(self, n: L) -> Skip<Self, L::Length<Self::Item>> ⓘwhere
Self: Sized,
L: LengthValue,
Creates a bulk that skips the first
n elements. Read moreSource§fn take<L>(self, n: L) -> Take<Self, L::Length<Self::Item>> ⓘwhere
Self: Sized,
L: LengthValue,
fn take<L>(self, n: L) -> Take<Self, L::Length<Self::Item>> ⓘwhere
Self: Sized,
L: LengthValue,
Creates a bulk for the first
n elements, or fewer
if the underlying bulk/iterator is shorter. Read moreSource§fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> ⓘ
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> ⓘ
Creates a bulk that works like map, but flattens nested structure. Read more
Source§fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N> ⓘ
fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N> ⓘ
Calls the given function
f for each contiguous window of size N over
self and returns a bulk of the outputs of f. The windows during mapping will overlap. Read moreSource§fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
Does something with each element of a bulk, passing the value on. Read more
Source§fn mutate<F>(self, f: F) -> Mutate<Self, F> ⓘ
fn mutate<F>(self, f: F) -> Mutate<Self, F> ⓘ
Mutates with each element of a bulk, passing the value on. Read more
Source§fn collect<B = <Self as Nearest>::Nearest, L = CollectLength<B, <Self as IntoIterator>::Item>>(
self,
) -> B
fn collect<B = <Self as Nearest>::Nearest, L = CollectLength<B, <Self as IntoIterator>::Item>>( self, ) -> B
Transforms a bulk into a collection. Read more
Source§fn try_collect<B, L = CollectLength<B, <<Self as IntoIterator>::Item as Try>::Output>>(
self,
) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType
fn try_collect<B, L = CollectLength<B, <<Self as IntoIterator>::Item as Try>::Output>>( self, ) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType
Fallibly transforms a bulk into a collection, short circuiting if
a failure is encountered. Read more
Source§fn collect_array(
self,
) -> <Self as StaticBulk>::Array<<Self as IntoIterator>::Item>where
Self: StaticBulk,
fn collect_array(
self,
) -> <Self as StaticBulk>::Array<<Self as IntoIterator>::Item>where
Self: StaticBulk,
Transforms a statically sized bulk into an array.
The bulk must implement
StaticBulk. Read moreSource§fn try_collect_array(
self,
) -> <<Self::Item as Try>::Residual as Residual<Self::Array<<Self::Item as Try>::Output>>>::TryType
fn try_collect_array( self, ) -> <<Self::Item as Try>::Residual as Residual<Self::Array<<Self::Item as Try>::Output>>>::TryType
Fallibly transforms a statically sized bulk into an array, short circuiting if
a failure is encountered.
The bulk must implement
StaticBulk. Read moreSource§fn collect_option(self) -> Option<Self::Item>
fn collect_option(self) -> Option<Self::Item>
Collects into an option if possible, otherwise a vector (if feature “alloc” is enabled)
Source§fn collect_nearest(self) -> Self::CollectNearestwhere
Self: Nearest + Sized,
Self::CollectNearest: FromBulk<Self::Item, Self, <Self as BulkLength>::Length>,
fn collect_nearest(self) -> Self::CollectNearestwhere
Self: Nearest + Sized,
Self::CollectNearest: FromBulk<Self::Item, Self, <Self as BulkLength>::Length>,
Collects into an array if possible, otherwise a vector (if feature “alloc” is enabled)
Source§fn try_collect_nearest(
self,
) -> <<Self::Item as Try>::Residual as Residual<<Self as TryNearest>::TryNearest>>::TryType
fn try_collect_nearest( self, ) -> <<Self::Item as Try>::Residual as Residual<<Self as TryNearest>::TryNearest>>::TryType
Fallibly collects into an array if possible, otherwise a vector (if feature “alloc” is enabled)
Source§fn rev(self) -> Rev<Self> ⓘwhere
Self: Sized + DoubleEndedBulk,
fn rev(self) -> Rev<Self> ⓘwhere
Self: Sized + DoubleEndedBulk,
Reverses a bulks’s direction. Read more
Source§fn copied<'a, T>(self) -> Copied<Self> ⓘ
fn copied<'a, T>(self) -> Copied<Self> ⓘ
Creates a bulk which copies all of its elements. Read more
Source§fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N> ⓘwhere
Self: Sized,
fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N> ⓘwhere
Self: Sized,
Returns a bulk of
N elements of the bulk at a time. Read moreSource§impl<A, N> DoubleEndedBulk for RepeatN<A, N>
impl<A, N> DoubleEndedBulk for RepeatN<A, N>
Source§fn rev_for_each<F>(self, f: F)
fn rev_for_each<F>(self, f: F)
Calls a closure on each element of a bulk in reverse.
Source§impl<A, N> From<RepeatN<A, N>> for RepeatNWith<YieldOnce<A>, N>
impl<A, N> From<RepeatN<A, N>> for RepeatNWith<YieldOnce<A>, N>
Source§impl<A, N> IntoIterator for RepeatN<A, N>
impl<A, N> IntoIterator for RepeatN<A, N>
Source§impl<A, N, M, L, R> SplitBulk<M> for RepeatN<A, N>where
N: Length<Elem = A, Value: LengthValue<Min<M> = L, SaturatingSub<M> = R>>,
A: Clone,
M: LengthValue,
L: LengthValue,
R: LengthValue,
impl<A, N, M, L, R> SplitBulk<M> for RepeatN<A, N>where
N: Length<Elem = A, Value: LengthValue<Min<M> = L, SaturatingSub<M> = R>>,
A: Clone,
M: LengthValue,
L: LengthValue,
R: LengthValue,
Auto Trait Implementations§
impl<A, N> Freeze for RepeatN<A, N>
impl<A, N> RefUnwindSafe for RepeatN<A, N>
impl<A, N> Send for RepeatN<A, N>
impl<A, N> Sync for RepeatN<A, N>
impl<A, N> Unpin for RepeatN<A, N>
impl<A, N> UnwindSafe for RepeatN<A, N>
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