Struct Rev 

pub struct Rev<I>
where
    I: DoubleEndedBulk,
{ /* private fields */ }

A double-ended bulk with the direction inverted.

This struct is created by the rev method on Bulk. See its documentation for more.

Implementations

impl<I, const N: usize> Rev<ArrayChunks<I, N>>

where I: DoubleEndedBulk,

pub const fn for_each_with_remainder<F>( self, f: F, ) -> <ArrayBuffer<I::Item, N, true> as IntoBulk>::IntoBulk

where ArrayChunks<I, N>: Sized, I: DoubleEndedBulk<Item> + Bulk, F: FnMut(<Self as IntoIterator>::Item), ArrayBuffer<I::Item, N, true>: IntoBulk,

pub const fn try_for_each_with_remainder<F, R>( self, f: F, ) -> <<R as Try>::Residual as Residual<<ArrayBuffer<I::Item, N, true> as IntoBulk>::IntoBulk>>::TryType

where ArrayChunks<I, N>: Sized, I: DoubleEndedBulk<Item> + Bulk, F: FnMut(<ArrayChunks<I, N> as IntoIterator>::Item) -> R, ArrayBuffer<I::Item, N, true>: IntoBulk, R: Try<Output = (), Residual: Residual<<ArrayBuffer<I::Item, N, true> as IntoBulk>::IntoBulk, TryType: Try>>,

pub const fn collect_with_remainder<C, A>( self, ) -> (C, <ArrayBuffer<I::Item, N, true> as IntoBulk>::IntoBulk)

where Self: Sized, I: Bulk<Item> + DoubleEndedBulk, C: FromBulk<A>, A: CollectionAdapter<Elem = [I::Item; N]> + for<'a> CollectionStrategy<ArrayChunksWithRemainder<'a, Rev<I>, N, true>, C> + ?Sized, ArrayBuffer<I::Item, N, true>: IntoBulk,

impl<I> Rev<I>

where I: DoubleEndedBulk,

pub const fn into_inner(self) -> I

Consumes the Rev, returning the inner bulk.

Examples

use bulks::*;

let s = b"foobar";
let mut s2: [_; _] = s.bulk()
    .copied()
    .rev()
    .into_inner()
    .collect();
assert_eq!(&s2, b"foobar");

Trait Implementations

impl<I> Bulk for Rev<I>

where I: Bulk + DoubleEndedBulk,

type MinLength = <I as Bulk>::MinLength

type MaxLength = <I as Bulk>::MaxLength

fn len(&self) -> usize

Returns the exact length of the bulk.

fn is_empty(&self) -> bool

Returns true if the iterator is empty.

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

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

Calls a closure on each element of a bulk.

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

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

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

type Nearest = Self::Nearest

type TryNearest = Self::TryNearest where Self::Item: Try

type Length = Self::Length

type Strategy<U, C> = Self::Strategy<U, C>

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

where Self::Item:, Self: Sized,

Returns the first value, and discards the rest of the bulk.

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

where Self::Item:, Self: Sized,

Returns the last value, and discards the rest of the bulk.

fn nth<L>(self, n: L) -> Option<Self::Item>

where Self: Sized, Self::Item:, L: LengthValue,

Returns the n-th value, and discards the rest of the bulk.

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

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

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

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

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

TODO

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

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

TODO

fn try_reduce<F, R>( self, f: F, ) -> <R::Residual as Residual<Option<R::Output>>>::TryType

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

TODO

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

where Self: Sized, L: LengthValue,

Creates a bulk starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, U::IntoBulk>

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

Takes two bulks and creates a new bulk over both in sequence.

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.

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

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

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

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

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

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

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

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

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

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates a bulk which gives the current index together with its values.

fn enumerate_from<U>(self, initial_count: U) -> EnumerateFrom<Self, U>

where Self: Sized, U: Step + Copy,

Creates a bulk which gives the current index counting from a given initial index together with its values.

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

where Self: Sized, L: LengthValue,

Creates a bulk that skips the first n elements.

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

where Self: Sized, L: LengthValue,

Creates a bulk for the first n elements, or fewer if the underlying bulk/iterator is shorter.

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

where Self: Sized, U: IntoBulk<IntoBulk: StaticBulk>, F: FnMut(Self::Item) -> U,

Creates a bulk that works like map, but flattens nested structure.

fn flatten(self) -> Flatten<Self>

where Self: Sized, Self::Item: IntoBulk<IntoBulk: StaticBulk>,

Creates a bulk 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,

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.

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

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

Does something with each element of a bulk, passing the value on.

fn mutate<F>(self, f: F) -> Mutate<Self, F>

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

Mutates with each element of a bulk, passing the value on.

fn collect<C, A>(self) -> C

where Self: Sized, C: FromBulk<A>, A: CollectionAdapter<Elem = Self::Item> + CollectionStrategy<Self, C> + ?Sized,

Transforms a bulk into a collection.

fn try_collect<C, A>( self, ) -> <<Self::Item as Try>::Residual as Residual<C>>::TryType

where Self: Sized, C: FromBulk<A>, A: CollectionAdapter<Elem = <Self::Item as Try>::Output> + TryCollectionAdapter<Self, C> + ?Sized, Self::Item: Try<Residual: Residual<C, TryType: Try>>,

Fallibly transforms a bulk into a collection, short circuiting if a failure is encountered.

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.

fn try_collect_array( self, ) -> <<Self::Item as Try>::Residual as Residual<Self::Array<<Self::Item as Try>::Output>>>::TryType

where Self: StaticBulk<Item: Try<Residual: Residual<(), TryType: Try> + Residual<Self::Array<<Self::Item as Try>::Output>, TryType: Try>, Output>> + Bulk,

Fallibly transforms a statically sized bulk into an array, short circuiting if a failure is encountered. The bulk must implement StaticBulk.

fn collect_nearest(self) -> Self::Nearest

where Self: Sized, Self::Nearest: FromBulk<Self::Strategy<Self::Item, Self::Nearest>>, Self::Strategy<Self::Item, Self::Nearest>: CollectionAdapter<Elem = Self::Item> + CollectionStrategy<Self, Self::Nearest>,

Collects into an array if possible, otherwise a vector (if feature “alloc” is enabled)

fn try_collect_nearest( self, ) -> <<Self::Item as Try>::Residual as Residual<Self::TryNearest>>::TryType

where Self: Sized, Self::TryNearest: FromBulk<Self::Strategy<<Self::Item as Try>::Output, Self::TryNearest>>, Self::Strategy<<Self::Item as Try>::Output, Self::TryNearest>: CollectionAdapter<Elem = <Self::Item as Try>::Output> + TryCollectionAdapter<Self, Self::TryNearest>, Self::Item: Try<Residual: Residual<Self::TryNearest, TryType: Try>>,

Fallibly collects into an array if possible, otherwise a vector (if feature “alloc” is enabled)

fn rev(self) -> Rev<Self>

where Self: Sized + DoubleEndedBulk,

Reverses a bulks’s direction.

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

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

Creates a bulk which copies all of its elements.

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

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

Creates a bulk which clones all of its elements.

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.

impl<I> Clone for Rev<I>

where I: DoubleEndedBulk + Clone,

fn clone(&self) -> Rev<I>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I> Debug for Rev<I>

where I: DoubleEndedBulk + Debug,

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

Formats the value using the given formatter.

impl<I> Default for Rev<I>

where I: Bulk + DoubleEndedBulk + Default,

fn default() -> Self

Returns the “default value” for a type.

impl<I> DoubleEndedBulk for Rev<I>

where I: Bulk + DoubleEndedBulk,

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

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

Calls a closure on each element of a bulk in reverse.

fn try_rev_for_each<F, R>(self, f: F) -> R

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

A bulk method that applies a fallible function to each item in the bulk in reverse, stopping at the first error and returning that error.

impl<I> IntoIterator for Rev<I>

where I: DoubleEndedBulk,

type IntoIter = Rev<<I as IntoIterator>::IntoIter>

Which kind of iterator are we turning this into?

type Item = <I as IntoIterator>::Item

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<I, N, L, R> SplitBulk<L> for Rev<I>

where I: SplitBulk<R, Left: Bulk + DoubleEndedBulk, Right: Bulk + DoubleEndedBulk> + Bulk<Length: Length<Value = N> + Pointee<Metadata = N::Metadata>> + DoubleEndedBulk, N: LengthValue<SaturatingSub<L> = R>, L: LengthValue, R: LengthValue,

type Left = Rev<<I as SplitBulk<R>>::Right>

type Right = Rev<<I as SplitBulk<R>>::Left>

fn split_at(self, m: L) -> (Self::Left, Self::Right)

where Self: Sized,

Splits a bulk in two at a specified index.