Struct Reverse

pub struct Reverse<I>(pub I)
where
    I: Iterable,
    I::Iter: DoubleEndedIterator;

Stream that goes over an [ExactSizeIterator] in reverse order.

This stream allows to switch fast from little endian ordering used in time-efficient algorithms, e.g. in slices &[T] into big endia ordering (used in space-efficient algorithms.

Examples

use ark_std::iterable::{Iterable, Reverse};

let le_v = &[1, 2, 3];
let be_v = Reverse(le_v);
let mut be_v_iter = be_v.iter();
assert_eq!(be_v_iter.next(), Some(&3));
assert_eq!(be_v_iter.next(), Some(&2));
assert_eq!(be_v_iter.next(), Some(&1));

Tuple Fields

0: I

Trait Implementations

impl<I> Clone for Reverse<I>

where I: Iterable + Clone, I::Iter: DoubleEndedIterator,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I> Iterable for Reverse<I>

where I: Iterable, I::Iter: DoubleEndedIterator,

type Item = <I as Iterable>::Item

The type of the element being streamed.

type Iter = Rev<<I as Iterable>::Iter>

The type of the iterator being generated.

fn iter(&self) -> Self::Iter

Return the iterator associated to the current instance.

fn len(&self) -> usize

Return a hint on the length of the stream.

fn is_empty(&self) -> bool

Return true if the stream is empty, else false.

impl<I> Copy for Reverse<I>

where I: Iterable + Copy, I::Iter: DoubleEndedIterator,