Trait competitive_hpp::prelude::__std_iter::DoubleEndedIterator

pub trait DoubleEndedIterator: Iterator {
    fn next_back(&mut self) -> Option<Self::Item>;

    fn nth_back(&mut self, n: usize) -> Option<Self::Item> { ... }
    fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
    where
        F: FnMut(B, Self::Item) -> R,
        R: Try<Ok = B>,
    { ... }
    fn rfold<B, F>(self, accum: B, f: F) -> B
    where
        F: FnMut(B, Self::Item) -> B,
    { ... }
    fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item>
    where
        P: FnMut(&Self::Item) -> bool,
    { ... }
}

An iterator able to yield elements from both ends.

Something that implements DoubleEndedIterator has one extra capability over something that implements Iterator: the ability to also take Items from the back, as well as the front.

It is important to note that both back and forth work on the same range, and do not cross: iteration is over when they meet in the middle.

In a similar fashion to the Iterator protocol, once a DoubleEndedIterator returns None from a next_back(), calling it again may or may not ever return Some again. next() and next_back() are interchangeable for this purpose.

Examples

Basic usage:

let numbers = vec![1, 2, 3, 4, 5, 6];

let mut iter = numbers.iter();

assert_eq!(Some(&1), iter.next());
assert_eq!(Some(&6), iter.next_back());
assert_eq!(Some(&5), iter.next_back());
assert_eq!(Some(&2), iter.next());
assert_eq!(Some(&3), iter.next());
assert_eq!(Some(&4), iter.next());
assert_eq!(None, iter.next());
assert_eq!(None, iter.next_back());

Required methods

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

Removes and returns an element from the end of the iterator.

Returns None when there are no more elements.

The trait-level docs contain more details.

Examples

Basic usage:

let numbers = vec![1, 2, 3, 4, 5, 6];

let mut iter = numbers.iter();

assert_eq!(Some(&1), iter.next());
assert_eq!(Some(&6), iter.next_back());
assert_eq!(Some(&5), iter.next_back());
assert_eq!(Some(&2), iter.next());
assert_eq!(Some(&3), iter.next());
assert_eq!(Some(&4), iter.next());
assert_eq!(None, iter.next());
assert_eq!(None, iter.next_back());

Loading content...

Provided methods

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

Returns the nth element from the end of the iterator.

This is essentially the reversed version of nth. Although like most indexing operations, the count starts from zero, so nth_back(0) returns the first value from the end, nth_back(1) the second, and so on.

Note that all elements between the end and the returned element will be consumed, including the returned element. This also means that calling nth_back(0) multiple times on the same iterator will return different elements.

nth_back() will return None if n is greater than or equal to the length of the iterator.

Examples

Basic usage:

let a = [1, 2, 3];
assert_eq!(a.iter().nth_back(2), Some(&1));

Calling nth_back() multiple times doesn't rewind the iterator:

let a = [1, 2, 3];

let mut iter = a.iter();

assert_eq!(iter.nth_back(1), Some(&2));
assert_eq!(iter.nth_back(1), None);

Returning None if there are less than n + 1 elements:

let a = [1, 2, 3];
assert_eq!(a.iter().nth_back(10), None);

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, Self::Item) -> R,
    R: Try<Ok = B>, 

This is the reverse version of try_fold(): it takes elements starting from the back of the iterator.

Examples

Basic usage:

let a = ["1", "2", "3"];
let sum = a.iter()
    .map(|&s| s.parse::<i32>())
    .try_rfold(0, |acc, x| x.and_then(|y| Ok(acc + y)));
assert_eq!(sum, Ok(6));

Short-circuiting:

let a = ["1", "rust", "3"];
let mut it = a.iter();
let sum = it
    .by_ref()
    .map(|&s| s.parse::<i32>())
    .try_rfold(0, |acc, x| x.and_then(|y| Ok(acc + y)));
assert!(sum.is_err());

// Because it short-circuited, the remaining elements are still
// available through the iterator.
assert_eq!(it.next_back(), Some(&"1"));

fn rfold<B, F>(self, accum: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

An iterator method that reduces the iterator's elements to a single, final value, starting from the back.

This is the reverse version of fold(): it takes elements starting from the back of the iterator.

rfold() takes two arguments: an initial value, and a closure with two arguments: an 'accumulator', and an element. The closure returns the value that the accumulator should have for the next iteration.

The initial value is the value the accumulator will have on the first call.

After applying this closure to every element of the iterator, rfold() returns the accumulator.

This operation is sometimes called 'reduce' or 'inject'.

Folding is useful whenever you have a collection of something, and want to produce a single value from it.

Examples

Basic usage:

let a = [1, 2, 3];

// the sum of all of the elements of a
let sum = a.iter()
           .rfold(0, |acc, &x| acc + x);

assert_eq!(sum, 6);

This example builds a string, starting with an initial value and continuing with each element from the back until the front:

let numbers = [1, 2, 3, 4, 5];

let zero = "0".to_string();

let result = numbers.iter().rfold(zero, |acc, &x| {
    format!("({} + {})", x, acc)
});

assert_eq!(result, "(1 + (2 + (3 + (4 + (5 + 0)))))");

fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

Searches for an element of an iterator from the back that satisfies a predicate.

rfind() takes a closure that returns true or false. It applies this closure to each element of the iterator, starting at the end, and if any of them return true, then rfind() returns Some(element). If they all return false, it returns None.

rfind() is short-circuiting; in other words, it will stop processing as soon as the closure returns true.

Because rfind() takes a reference, and many iterators iterate over references, this leads to a possibly confusing situation where the argument is a double reference. You can see this effect in the examples below, with &&x.

Examples

Basic usage:

let a = [1, 2, 3];

assert_eq!(a.iter().rfind(|&&x| x == 2), Some(&2));

assert_eq!(a.iter().rfind(|&&x| x == 5), None);

Stopping at the first true:

let a = [1, 2, 3];

let mut iter = a.iter();

assert_eq!(iter.rfind(|&&x| x == 2), Some(&2));

// we can still use `iter`, as there are more elements.
assert_eq!(iter.next_back(), Some(&1));

Loading content...

Implementations on Foreign Types

impl DoubleEndedIterator for Args

fn next_back(&mut self) -> Option<String>

impl<'a> DoubleEndedIterator for Components<'a>

fn next_back(&mut self) -> Option<Component<'a>>

impl DoubleEndedIterator for ArgsOs

fn next_back(&mut self) -> Option<OsString>

impl<'a> DoubleEndedIterator for Iter<'a>

fn next_back(&mut self) -> Option<&'a OsStr>

impl<'a, T> DoubleEndedIterator for IterMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut T>

impl<'a, T> DoubleEndedIterator for ChunksExactMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut [T]>

fn nth_back(
    &mut self,
    n: usize
) -> Option<<ChunksExactMut<'a, T> as Iterator>::Item>

impl<A> DoubleEndedIterator for RangeInclusive<A> where
    A: Step, 

fn next_back(&mut self) -> Option<A>

fn nth_back(&mut self, n: usize) -> Option<A>

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> R,
    R: Try<Ok = B>,
    RangeInclusive<A>: Sized, 

impl<const N: usize, T> DoubleEndedIterator for IntoIter<T, N> where
    [T; N]: LengthAtMost32, 

fn next_back(&mut self) -> Option<<IntoIter<T, N> as Iterator>::Item>

impl<T> DoubleEndedIterator for IntoIter<T>

fn next_back(&mut self) -> Option<T>

impl<'a, T> DoubleEndedIterator for RChunksExact<'a, T>

fn next_back(&mut self) -> Option<&'a [T]>

fn nth_back(
    &mut self,
    n: usize
) -> Option<<RChunksExact<'a, T> as Iterator>::Item>

impl<'a, T> DoubleEndedIterator for IterMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut T>

fn nth_back(&mut self, n: usize) -> Option<&'a mut T>

impl<'a, T, P> DoubleEndedIterator for RSplit<'a, T, P> where
    P: FnMut(&T) -> bool, 

fn next_back(&mut self) -> Option<&'a [T]>

impl<'a> DoubleEndedIterator for SplitAsciiWhitespace<'a>

fn next_back(&mut self) -> Option<&'a str>

impl<'a, T, P> DoubleEndedIterator for SplitInclusiveMut<'a, T, P> where
    P: FnMut(&T) -> bool, 

fn next_back(&mut self) -> Option<&'a mut [T]>

impl<'a> DoubleEndedIterator for LinesAny<'a>

fn next_back(&mut self) -> Option<&'a str>

impl<'_> DoubleEndedIterator for Bytes<'_>

fn next_back(&mut self) -> Option<u8>

fn nth_back(&mut self, n: usize) -> Option<<Bytes<'_> as Iterator>::Item>

fn rfind<P>(&mut self, predicate: P) -> Option<<Bytes<'_> as Iterator>::Item> where
    P: FnMut(&<Bytes<'_> as Iterator>::Item) -> bool, 

impl DoubleEndedIterator for EscapeDefault

fn next_back(&mut self) -> Option<u8>

impl<'a, T, P> DoubleEndedIterator for SplitInclusive<'a, T, P> where
    P: FnMut(&T) -> bool, 

fn next_back(&mut self) -> Option<&'a [T]>

impl<'a, T> DoubleEndedIterator for ChunksExact<'a, T>

fn next_back(&mut self) -> Option<&'a [T]>

fn nth_back(
    &mut self,
    n: usize
) -> Option<<ChunksExact<'a, T> as Iterator>::Item>

impl<'a, T> DoubleEndedIterator for RChunks<'a, T>

fn next_back(&mut self) -> Option<&'a [T]>

fn nth_back(&mut self, n: usize) -> Option<<RChunks<'a, T> as Iterator>::Item>

impl<'a, A> DoubleEndedIterator for IterMut<'a, A>

fn next_back(&mut self) -> Option<&'a mut A>

impl<'a> DoubleEndedIterator for Chars<'a>

fn next_back(&mut self) -> Option<char>

impl<'a, I> DoubleEndedIterator for &'a mut I where
    I: DoubleEndedIterator + ?Sized, 

fn next_back(&mut self) -> Option<<I as Iterator>::Item>

fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>

impl<'a> DoubleEndedIterator for CharIndices<'a>

fn next_back(&mut self) -> Option<(usize, char)>

impl<'a, T, P> DoubleEndedIterator for RSplitMut<'a, T, P> where
    P: FnMut(&T) -> bool, 

fn next_back(&mut self) -> Option<&'a mut [T]>

impl<'a, P> DoubleEndedIterator for Split<'a, P> where
    P: Pattern<'a>,
    <P as Pattern<'a>>::Searcher: DoubleEndedSearcher<'a>, 

fn next_back(&mut self) -> Option<&'a str>

impl<'a, P> DoubleEndedIterator for SplitTerminator<'a, P> where
    P: Pattern<'a>,
    <P as Pattern<'a>>::Searcher: DoubleEndedSearcher<'a>, 

fn next_back(&mut self) -> Option<&'a str>

impl<'a, P> DoubleEndedIterator for RSplitTerminator<'a, P> where
    P: Pattern<'a>,
    <P as Pattern<'a>>::Searcher: DoubleEndedSearcher<'a>, 

fn next_back(&mut self) -> Option<&'a str>

impl<'a, T> DoubleEndedIterator for RChunksMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut [T]>

fn nth_back(
    &mut self,
    n: usize
) -> Option<<RChunksMut<'a, T> as Iterator>::Item>

impl<'a> DoubleEndedIterator for Lines<'a>

fn next_back(&mut self) -> Option<&'a str>

impl<'a, T> DoubleEndedIterator for Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

impl<'a, P> DoubleEndedIterator for MatchIndices<'a, P> where
    P: Pattern<'a>,
    <P as Pattern<'a>>::Searcher: DoubleEndedSearcher<'a>, 

fn next_back(&mut self) -> Option<(usize, &'a str)>

impl<A> DoubleEndedIterator for Range<A> where
    A: Step, 

fn next_back(&mut self) -> Option<A>

fn nth_back(&mut self, n: usize) -> Option<A>

impl<'a, P> DoubleEndedIterator for RMatches<'a, P> where
    P: Pattern<'a>,
    <P as Pattern<'a>>::Searcher: DoubleEndedSearcher<'a>, 

fn next_back(&mut self) -> Option<&'a str>

impl<'a, T, P> DoubleEndedIterator for SplitMut<'a, T, P> where
    P: FnMut(&T) -> bool, 

fn next_back(&mut self) -> Option<&'a mut [T]>

impl<'a> DoubleEndedIterator for SplitWhitespace<'a>

fn next_back(&mut self) -> Option<&'a str>

impl<'a, T> DoubleEndedIterator for ChunksMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut [T]>

fn nth_back(&mut self, n: usize) -> Option<<ChunksMut<'a, T> as Iterator>::Item>

impl<A> DoubleEndedIterator for IntoIter<A>

fn next_back(&mut self) -> Option<A>

impl<'a, T> DoubleEndedIterator for Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

fn nth_back(&mut self, n: usize) -> Option<&'a T>

impl<'a, A> DoubleEndedIterator for Iter<'a, A>

fn next_back(&mut self) -> Option<&'a A>

impl<'a, T> DoubleEndedIterator for RChunksExactMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut [T]>

fn nth_back(
    &mut self,
    n: usize
) -> Option<<RChunksExactMut<'a, T> as Iterator>::Item>

impl<'a, P> DoubleEndedIterator for RSplit<'a, P> where
    P: Pattern<'a>,
    <P as Pattern<'a>>::Searcher: DoubleEndedSearcher<'a>, 

fn next_back(&mut self) -> Option<&'a str>

impl<'a, T, P> DoubleEndedIterator for Split<'a, T, P> where
    P: FnMut(&T) -> bool, 

fn next_back(&mut self) -> Option<&'a [T]>

impl<'a, T> DoubleEndedIterator for Chunks<'a, T>

fn next_back(&mut self) -> Option<&'a [T]>

fn nth_back(&mut self, n: usize) -> Option<<Chunks<'a, T> as Iterator>::Item>

impl<'a, T> DoubleEndedIterator for Windows<'a, T>

fn next_back(&mut self) -> Option<&'a [T]>

fn nth_back(&mut self, n: usize) -> Option<<Windows<'a, T> as Iterator>::Item>

impl<'a, P> DoubleEndedIterator for Matches<'a, P> where
    P: Pattern<'a>,
    <P as Pattern<'a>>::Searcher: DoubleEndedSearcher<'a>, 

fn next_back(&mut self) -> Option<&'a str>

impl<'a, P> DoubleEndedIterator for RMatchIndices<'a, P> where
    P: Pattern<'a>,
    <P as Pattern<'a>>::Searcher: DoubleEndedSearcher<'a>, 

fn next_back(&mut self) -> Option<(usize, &'a str)>

impl<'a, P> DoubleEndedIterator for SplitInclusive<'a, P> where
    P: Pattern<'a>,
    <P as Pattern<'a>>::Searcher: ReverseSearcher<'a>, 

fn next_back(&mut self) -> Option<&'a str>

impl<T> DoubleEndedIterator for IntoIter<T>

fn next_back(&mut self) -> Option<T>

impl<I> DoubleEndedIterator for Box<I> where
    I: DoubleEndedIterator + ?Sized, 

fn next_back(&mut self) -> Option<<I as Iterator>::Item>

fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>

impl<'_, I> DoubleEndedIterator for Splice<'_, I> where
    I: Iterator, 

fn next_back(&mut self) -> Option<<Splice<'_, I> as Iterator>::Item>

impl<'_> DoubleEndedIterator for Drain<'_>

fn next_back(&mut self) -> Option<char>

impl<'_, T> DoubleEndedIterator for Drain<'_, T>

fn next_back(&mut self) -> Option<T>

impl<'a, K, V> DoubleEndedIterator for IterMut<'a, K, V>

fn next_back(&mut self) -> Option<<IterMut<'a, K, V> as Iterator>::Item>

impl<'a, K, V> DoubleEndedIterator for Drain<'a, K, V>

fn next_back(&mut self) -> Option<<Drain<'a, K, V> as Iterator>::Item>

impl<'a, T, S> DoubleEndedIterator for Difference<'a, T, S> where
    S: BuildHasher,
    T: Eq + Hash, 

fn next_back(&mut self) -> Option<<Difference<'a, T, S> as Iterator>::Item>

impl<T> DoubleEndedIterator for IntoIter<T>

fn next_back(&mut self) -> Option<<IntoIter<T> as Iterator>::Item>

impl<'a, K, V> DoubleEndedIterator for ValuesMut<'a, K, V>

fn next_back(&mut self) -> Option<<ValuesMut<'a, K, V> as Iterator>::Item>

impl<'a, T> DoubleEndedIterator for Drain<'a, T>

fn next_back(&mut self) -> Option<<Drain<'a, T> as Iterator>::Item>

impl<'a, K, V> DoubleEndedIterator for Iter<'a, K, V>

fn next_back(&mut self) -> Option<<Iter<'a, K, V> as Iterator>::Item>

impl<'a, T, S1, S2> DoubleEndedIterator for SymmetricDifference<'a, T, S1, S2> where
    S1: BuildHasher,
    S2: BuildHasher,
    T: Eq + Hash, 

fn next_back(
    &mut self
) -> Option<<SymmetricDifference<'a, T, S1, S2> as Iterator>::Item>

impl<'a, K, V> DoubleEndedIterator for IntoIter<K, V>

fn next_back(&mut self) -> Option<<IntoIter<K, V> as Iterator>::Item>

impl<'a, T> DoubleEndedIterator for Iter<'a, T>

fn next_back(&mut self) -> Option<<Iter<'a, T> as Iterator>::Item>

impl<'a, T, S> DoubleEndedIterator for Union<'a, T, S> where
    S: BuildHasher,
    T: Eq + Hash, 

fn next_back(&mut self) -> Option<<Union<'a, T, S> as Iterator>::Item>

impl<'a, K, V> DoubleEndedIterator for Values<'a, K, V>

fn next_back(&mut self) -> Option<<Values<'a, K, V> as Iterator>::Item>

impl<'a, K, V> DoubleEndedIterator for Keys<'a, K, V>

fn next_back(&mut self) -> Option<&'a K>

impl<'a, T, S> DoubleEndedIterator for Intersection<'a, T, S> where
    S: BuildHasher,
    T: Eq + Hash, 

fn next_back(&mut self) -> Option<<Intersection<'a, T, S> as Iterator>::Item>

Loading content...

Implementors

impl<'_, T> DoubleEndedIterator for competitive_hpp::prelude::binary_heap::Drain<'_, T>

fn next_back(&mut self) -> Option<T>

impl<'_, T> DoubleEndedIterator for competitive_hpp::prelude::vec_deque::Drain<'_, T>

fn next_back(&mut self) -> Option<T>

impl<'a, I, T> DoubleEndedIterator for Cloned<I> where
    I: DoubleEndedIterator<Item = &'a T>,
    T: 'a + Clone, 

fn next_back(&mut self) -> Option<T>

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, <Cloned<I> as Iterator>::Item) -> R,
    R: Try<Ok = B>,
    Cloned<I>: Sized, 

fn rfold<Acc, F>(self, init: Acc, f: F) -> Acc where
    F: FnMut(Acc, <Cloned<I> as Iterator>::Item) -> Acc, 

impl<'a, I, T> DoubleEndedIterator for Copied<I> where
    I: DoubleEndedIterator<Item = &'a T>,
    T: 'a + Copy, 

fn next_back(&mut self) -> Option<T>

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, <Copied<I> as Iterator>::Item) -> R,
    R: Try<Ok = B>,
    Copied<I>: Sized, 

fn rfold<Acc, F>(self, init: Acc, f: F) -> Acc where
    F: FnMut(Acc, <Copied<I> as Iterator>::Item) -> Acc, 

impl<'a, K, V> DoubleEndedIterator for competitive_hpp::prelude::btree_map::Iter<'a, K, V> where
    K: 'a,
    V: 'a, 

fn next_back(&mut self) -> Option<(&'a K, &'a V)>

impl<'a, K, V> DoubleEndedIterator for competitive_hpp::prelude::btree_map::IterMut<'a, K, V> where
    K: 'a,
    V: 'a, 

fn next_back(&mut self) -> Option<(&'a K, &'a mut V)>

impl<'a, K, V> DoubleEndedIterator for competitive_hpp::prelude::btree_map::Keys<'a, K, V>

fn next_back(&mut self) -> Option<&'a K>

impl<'a, K, V> DoubleEndedIterator for competitive_hpp::prelude::btree_map::Range<'a, K, V>

fn next_back(&mut self) -> Option<(&'a K, &'a V)>

impl<'a, K, V> DoubleEndedIterator for RangeMut<'a, K, V>

fn next_back(&mut self) -> Option<(&'a K, &'a mut V)>

impl<'a, K, V> DoubleEndedIterator for competitive_hpp::prelude::btree_map::Values<'a, K, V>

fn next_back(&mut self) -> Option<&'a V>

impl<'a, K, V> DoubleEndedIterator for competitive_hpp::prelude::btree_map::ValuesMut<'a, K, V>

fn next_back(&mut self) -> Option<&'a mut V>

impl<'a, T> DoubleEndedIterator for competitive_hpp::prelude::binary_heap::Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

impl<'a, T> DoubleEndedIterator for competitive_hpp::prelude::btree_set::Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

impl<'a, T> DoubleEndedIterator for competitive_hpp::prelude::btree_set::Range<'a, T>

fn next_back(&mut self) -> Option<&'a T>

impl<'a, T> DoubleEndedIterator for competitive_hpp::prelude::linked_list::Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

impl<'a, T> DoubleEndedIterator for competitive_hpp::prelude::linked_list::IterMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut T>

impl<'a, T> DoubleEndedIterator for competitive_hpp::prelude::vec_deque::Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

fn rfold<Acc, F>(self, accum: Acc, f: F) -> Acc where
    F: FnMut(Acc, <Iter<'a, T> as Iterator>::Item) -> Acc, 

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, <Iter<'a, T> as Iterator>::Item) -> R,
    R: Try<Ok = B>,
    Iter<'a, T>: Sized, 

impl<'a, T> DoubleEndedIterator for competitive_hpp::prelude::vec_deque::IterMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut T>

fn rfold<Acc, F>(self, accum: Acc, f: F) -> Acc where
    F: FnMut(Acc, <IterMut<'a, T> as Iterator>::Item) -> Acc, 

impl<A> DoubleEndedIterator for Repeat<A> where
    A: Clone, 

fn next_back(&mut self) -> Option<A>

impl<A> DoubleEndedIterator for competitive_hpp::prelude::iter::Range<A> where
    A: Integer + Clone + ToPrimitive, 

Integer is required to ensure the range will be the same regardless of the direction it is consumed.

fn next_back(&mut self) -> Option<A>

impl<A> DoubleEndedIterator for competitive_hpp::prelude::iter::RangeInclusive<A> where
    A: Sub<A, Output = A> + Integer + Clone + ToPrimitive, 

fn next_back(&mut self) -> Option<A>

impl<A> DoubleEndedIterator for RepeatN<A> where
    A: Clone, 

fn next_back(&mut self) -> Option<<RepeatN<A> as Iterator>::Item>

impl<A, B> DoubleEndedIterator for Chain<A, B> where
    A: DoubleEndedIterator,
    B: DoubleEndedIterator<Item = <A as Iterator>::Item>, 

fn next_back(&mut self) -> Option<<A as Iterator>::Item>

fn nth_back(&mut self, n: usize) -> Option<<A as Iterator>::Item>

fn rfind<P>(&mut self, predicate: P) -> Option<<Chain<A, B> as Iterator>::Item> where
    P: FnMut(&<Chain<A, B> as Iterator>::Item) -> bool, 

fn try_rfold<Acc, F, R>(&mut self, acc: Acc, f: F) -> R where
    F: FnMut(Acc, <Chain<A, B> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    Chain<A, B>: Sized, 

fn rfold<Acc, F>(self, acc: Acc, f: F) -> Acc where
    F: FnMut(Acc, <Chain<A, B> as Iterator>::Item) -> Acc, 

impl<A, B> DoubleEndedIterator for Zip<A, B> where
    A: DoubleEndedIterator + ExactSizeIterator,
    B: DoubleEndedIterator + ExactSizeIterator, 

fn next_back(
    &mut self
) -> Option<(<A as Iterator>::Item, <B as Iterator>::Item)>

impl<A, F> DoubleEndedIterator for OnceWith<F> where
    F: FnOnce() -> A, 

fn next_back(&mut self) -> Option<A>

impl<B, I, F> DoubleEndedIterator for FilterMap<I, F> where
    F: FnMut(<I as Iterator>::Item) -> Option<B>,
    I: DoubleEndedIterator, 

fn next_back(&mut self) -> Option<B>

fn try_rfold<Acc, Fold, R>(&mut self, init: Acc, fold: Fold) -> R where
    Fold: FnMut(Acc, <FilterMap<I, F> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    FilterMap<I, F>: Sized, 

fn rfold<Acc, Fold>(self, init: Acc, fold: Fold) -> Acc where
    Fold: FnMut(Acc, <FilterMap<I, F> as Iterator>::Item) -> Acc, 

impl<B, I, F> DoubleEndedIterator for Map<I, F> where
    F: FnMut(<I as Iterator>::Item) -> B,
    I: DoubleEndedIterator, 

fn next_back(&mut self) -> Option<B>

fn try_rfold<Acc, G, R>(&mut self, init: Acc, g: G) -> R where
    G: FnMut(Acc, <Map<I, F> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    Map<I, F>: Sized, 

fn rfold<Acc, G>(self, init: Acc, g: G) -> Acc where
    G: FnMut(Acc, <Map<I, F> as Iterator>::Item) -> Acc, 

impl<F> DoubleEndedIterator for Linspace<F> where
    F: Float, 

fn next_back(&mut self) -> Option<F>

impl<I> DoubleEndedIterator for Enumerate<I> where
    I: ExactSizeIterator + DoubleEndedIterator, 

fn next_back(&mut self) -> Option<(usize, <I as Iterator>::Item)>

fn nth_back(&mut self, n: usize) -> Option<(usize, <I as Iterator>::Item)>

fn try_rfold<Acc, Fold, R>(&mut self, init: Acc, fold: Fold) -> R where
    Fold: FnMut(Acc, <Enumerate<I> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    Enumerate<I>: Sized, 

fn rfold<Acc, Fold>(self, init: Acc, fold: Fold) -> Acc where
    Fold: FnMut(Acc, <Enumerate<I> as Iterator>::Item) -> Acc, 

impl<I> DoubleEndedIterator for Fuse<I> where
    I: DoubleEndedIterator, 

fn next_back(&mut self) -> Option<<I as Iterator>::Item>

fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>

fn try_rfold<Acc, Fold, R>(&mut self, acc: Acc, fold: Fold) -> R where
    Fold: FnMut(Acc, <Fuse<I> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    Fuse<I>: Sized, 

fn rfold<Acc, Fold>(self, acc: Acc, fold: Fold) -> Acc where
    Fold: FnMut(Acc, <Fuse<I> as Iterator>::Item) -> Acc, 

fn rfind<P>(&mut self, predicate: P) -> Option<<Fuse<I> as Iterator>::Item> where
    P: FnMut(&<Fuse<I> as Iterator>::Item) -> bool, 

impl<I> DoubleEndedIterator for Peekable<I> where
    I: DoubleEndedIterator, 

fn next_back(&mut self) -> Option<<Peekable<I> as Iterator>::Item>

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, <Peekable<I> as Iterator>::Item) -> R,
    R: Try<Ok = B>,
    Peekable<I>: Sized, 

fn rfold<Acc, Fold>(self, init: Acc, fold: Fold) -> Acc where
    Fold: FnMut(Acc, <Peekable<I> as Iterator>::Item) -> Acc, 

impl<I> DoubleEndedIterator for Rev<I> where
    I: DoubleEndedIterator, 

fn next_back(&mut self) -> Option<<I as Iterator>::Item>

fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, <Rev<I> as Iterator>::Item) -> R,
    R: Try<Ok = B>,
    Rev<I>: Sized, 

fn rfold<Acc, F>(self, init: Acc, f: F) -> Acc where
    F: FnMut(Acc, <Rev<I> as Iterator>::Item) -> Acc, 

fn rfind<P>(&mut self, predicate: P) -> Option<<Rev<I> as Iterator>::Item> where
    P: FnMut(&<Rev<I> as Iterator>::Item) -> bool, 

impl<I> DoubleEndedIterator for Skip<I> where
    I: DoubleEndedIterator + ExactSizeIterator, 

fn next_back(&mut self) -> Option<<Skip<I> as Iterator>::Item>

fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>

fn try_rfold<Acc, Fold, R>(&mut self, init: Acc, fold: Fold) -> R where
    Fold: FnMut(Acc, <Skip<I> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    Skip<I>: Sized, 

impl<I> DoubleEndedIterator for StepBy<I> where
    I: DoubleEndedIterator + ExactSizeIterator, 

fn next_back(&mut self) -> Option<<StepBy<I> as Iterator>::Item>

fn nth_back(&mut self, n: usize) -> Option<<StepBy<I> as Iterator>::Item>

fn try_rfold<Acc, F, R>(&mut self, init: Acc, f: F) -> R where
    F: FnMut(Acc, <StepBy<I> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>, 

impl<I> DoubleEndedIterator for Take<I> where
    I: DoubleEndedIterator + ExactSizeIterator, 

fn next_back(&mut self) -> Option<<Take<I> as Iterator>::Item>

fn nth_back(&mut self, n: usize) -> Option<<Take<I> as Iterator>::Item>

fn try_rfold<Acc, Fold, R>(&mut self, init: Acc, fold: Fold) -> R where
    Fold: FnMut(Acc, <Take<I> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    Take<I>: Sized, 

impl<I> DoubleEndedIterator for RcIter<I> where
    I: DoubleEndedIterator, 

fn next_back(&mut self) -> Option<<I as Iterator>::Item>

impl<I, F> DoubleEndedIterator for Inspect<I, F> where
    F: FnMut(&<I as Iterator>::Item),
    I: DoubleEndedIterator, 

fn next_back(&mut self) -> Option<<I as Iterator>::Item>

fn try_rfold<Acc, Fold, R>(&mut self, init: Acc, fold: Fold) -> R where
    Fold: FnMut(Acc, <Inspect<I, F> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    Inspect<I, F>: Sized, 

fn rfold<Acc, Fold>(self, init: Acc, fold: Fold) -> Acc where
    Fold: FnMut(Acc, <Inspect<I, F> as Iterator>::Item) -> Acc, 

impl<I, F> DoubleEndedIterator for PadUsing<I, F> where
    F: FnMut(usize) -> <I as Iterator>::Item,
    I: DoubleEndedIterator + ExactSizeIterator, 

fn next_back(&mut self) -> Option<<I as Iterator>::Item>

impl<I, F> DoubleEndedIterator for Positions<I, F> where
    F: FnMut(<I as Iterator>::Item) -> bool,
    I: DoubleEndedIterator + ExactSizeIterator, 

fn next_back(&mut self) -> Option<<Positions<I, F> as Iterator>::Item>

impl<I, F> DoubleEndedIterator for Update<I, F> where
    F: FnMut(&mut <I as Iterator>::Item),
    I: DoubleEndedIterator, 

fn next_back(&mut self) -> Option<<Update<I, F> as Iterator>::Item>

impl<I, P> DoubleEndedIterator for Filter<I, P> where
    I: DoubleEndedIterator,
    P: FnMut(&<I as Iterator>::Item) -> bool, 

fn next_back(&mut self) -> Option<<I as Iterator>::Item>

fn try_rfold<Acc, Fold, R>(&mut self, init: Acc, fold: Fold) -> R where
    Fold: FnMut(Acc, <Filter<I, P> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    Filter<I, P>: Sized, 

fn rfold<Acc, Fold>(self, init: Acc, fold: Fold) -> Acc where
    Fold: FnMut(Acc, <Filter<I, P> as Iterator>::Item) -> Acc, 

impl<I, R> DoubleEndedIterator for MapInto<I, R> where
    I: DoubleEndedIterator,
    <I as Iterator>::Item: Into<R>, 

fn next_back(&mut self) -> Option<<MapInto<I, R> as Iterator>::Item>

impl<I, U> DoubleEndedIterator for Flatten<I> where
    I: DoubleEndedIterator,
    U: DoubleEndedIterator,
    <I as Iterator>::Item: IntoIterator,
    <<I as Iterator>::Item as IntoIterator>::IntoIter == U,
    <<I as Iterator>::Item as IntoIterator>::Item == <U as Iterator>::Item, 

fn next_back(&mut self) -> Option<<U as Iterator>::Item>

fn try_rfold<Acc, Fold, R>(&mut self, init: Acc, fold: Fold) -> R where
    Fold: FnMut(Acc, <Flatten<I> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    Flatten<I>: Sized, 

fn rfold<Acc, Fold>(self, init: Acc, fold: Fold) -> Acc where
    Fold: FnMut(Acc, <Flatten<I> as Iterator>::Item) -> Acc, 

impl<I, U, F> DoubleEndedIterator for FlatMap<I, U, F> where
    F: FnMut(<I as Iterator>::Item) -> U,
    I: DoubleEndedIterator,
    U: IntoIterator,
    <U as IntoIterator>::IntoIter: DoubleEndedIterator, 

fn next_back(&mut self) -> Option<<U as IntoIterator>::Item>

fn try_rfold<Acc, Fold, R>(&mut self, init: Acc, fold: Fold) -> R where
    Fold: FnMut(Acc, <FlatMap<I, U, F> as Iterator>::Item) -> R,
    R: Try<Ok = Acc>,
    FlatMap<I, U, F>: Sized, 

fn rfold<Acc, Fold>(self, init: Acc, fold: Fold) -> Acc where
    Fold: FnMut(Acc, <FlatMap<I, U, F> as Iterator>::Item) -> Acc, 

impl<K, V> DoubleEndedIterator for competitive_hpp::prelude::btree_map::IntoIter<K, V>

fn next_back(&mut self) -> Option<(K, V)>

impl<L, R> DoubleEndedIterator for Either<L, R> where
    L: DoubleEndedIterator,
    R: DoubleEndedIterator<Item = <L as Iterator>::Item>, 

fn next_back(&mut self) -> Option<<Either<L, R> as Iterator>::Item>

impl<T> DoubleEndedIterator for Empty<T>

fn next_back(&mut self) -> Option<T>

impl<T> DoubleEndedIterator for Once<T>

fn next_back(&mut self) -> Option<T>

impl<T> DoubleEndedIterator for competitive_hpp::prelude::binary_heap::IntoIter<T>

fn next_back(&mut self) -> Option<T>

impl<T> DoubleEndedIterator for competitive_hpp::prelude::btree_set::IntoIter<T>

fn next_back(&mut self) -> Option<T>

impl<T> DoubleEndedIterator for competitive_hpp::prelude::linked_list::IntoIter<T>

fn next_back(&mut self) -> Option<T>

impl<T> DoubleEndedIterator for competitive_hpp::prelude::vec_deque::IntoIter<T>

fn next_back(&mut self) -> Option<T>

impl<T, U> DoubleEndedIterator for ZipLongest<T, U> where
    T: DoubleEndedIterator + ExactSizeIterator,
    U: DoubleEndedIterator + ExactSizeIterator, 

fn next_back(&mut self) -> Option<<ZipLongest<T, U> as Iterator>::Item>

impl<X, Iter, B, C, D, E, F, G, H> DoubleEndedIterator for ConsTuples<Iter, ((B, C, D, E, F, G, H), X)> where
    Iter: DoubleEndedIterator<Item = ((B, C, D, E, F, G, H), X)>, 

fn next_back(
    &mut self
) -> Option<<ConsTuples<Iter, ((B, C, D, E, F, G, H), X)> as Iterator>::Item>

impl<X, Iter, C, D, E, F, G, H> DoubleEndedIterator for ConsTuples<Iter, ((C, D, E, F, G, H), X)> where
    Iter: DoubleEndedIterator<Item = ((C, D, E, F, G, H), X)>, 

fn next_back(
    &mut self
) -> Option<<ConsTuples<Iter, ((C, D, E, F, G, H), X)> as Iterator>::Item>

impl<X, Iter, D, E, F, G, H> DoubleEndedIterator for ConsTuples<Iter, ((D, E, F, G, H), X)> where
    Iter: DoubleEndedIterator<Item = ((D, E, F, G, H), X)>, 

fn next_back(
    &mut self
) -> Option<<ConsTuples<Iter, ((D, E, F, G, H), X)> as Iterator>::Item>

impl<X, Iter, E, F, G, H> DoubleEndedIterator for ConsTuples<Iter, ((E, F, G, H), X)> where
    Iter: DoubleEndedIterator<Item = ((E, F, G, H), X)>, 

fn next_back(
    &mut self
) -> Option<<ConsTuples<Iter, ((E, F, G, H), X)> as Iterator>::Item>

impl<X, Iter, F, G, H> DoubleEndedIterator for ConsTuples<Iter, ((F, G, H), X)> where
    Iter: DoubleEndedIterator<Item = ((F, G, H), X)>, 

fn next_back(
    &mut self
) -> Option<<ConsTuples<Iter, ((F, G, H), X)> as Iterator>::Item>

impl<X, Iter, G, H> DoubleEndedIterator for ConsTuples<Iter, ((G, H), X)> where
    Iter: DoubleEndedIterator<Item = ((G, H), X)>, 

fn next_back(
    &mut self
) -> Option<<ConsTuples<Iter, ((G, H), X)> as Iterator>::Item>

Loading content...