Trait sp_std::iter::DoubleEndedIterator

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

    pub fn advance_back_by(&mut self, n: usize) -> Result<(), usize> { ... }
    pub fn nth_back(&mut self, n: usize) -> Option<Self::Item> { ... }
    pub fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
    where
        R: Try<Ok = B>,
        F: FnMut(B, Self::Item) -> R,
    { ... }
    pub fn rfold<B, F>(self, init: B, f: F) -> B
    where
        F: FnMut(B, Self::Item) -> B,
    { ... }
    pub 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

pub 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());

Remarks

The elements yielded by DoubleEndedIterator's methods may differ from the ones yielded by Iterator's methods:

let vec = vec![(1, 'a'), (1, 'b'), (1, 'c'), (2, 'a'), (2, 'b')];
let uniq_by_fst_comp = || {
    let mut seen = std::collections::HashSet::new();
    vec.iter().copied().filter(move |x| seen.insert(x.0))
};

assert_eq!(uniq_by_fst_comp().last(), Some((2, 'a')));
assert_eq!(uniq_by_fst_comp().next_back(), Some((2, 'b')));

assert_eq!(
    uniq_by_fst_comp().fold(vec![], |mut v, x| {v.push(x); v}),
    vec![(1, 'a'), (2, 'a')]
);
assert_eq!(
    uniq_by_fst_comp().rfold(vec![], |mut v, x| {v.push(x); v}),
    vec![(2, 'b'), (1, 'c')]
);

Loading content...

Provided methods

pub fn advance_back_by(&mut self, n: usize) -> Result<(), usize>

🔬 This is a nightly-only experimental API. (iter_advance_by)

recently added

Advances the iterator from the back by n elements.

advance_back_by is the reverse version of advance_by. This method will eagerly skip n elements starting from the back by calling next_back up to n times until None is encountered.

advance_back_by(n) will return Ok(()) if the iterator successfully advances by n elements, or Err(k) if None is encountered, where k is the number of elements the iterator is advanced by before running out of elements (i.e. the length of the iterator). Note that k is always less than n.

Calling advance_back_by(0) does not consume any elements and always returns Ok(()).

Examples

Basic usage:

#![feature(iter_advance_by)]

let a = [3, 4, 5, 6];
let mut iter = a.iter();

assert_eq!(iter.advance_back_by(2), Ok(()));
assert_eq!(iter.next_back(), Some(&4));
assert_eq!(iter.advance_back_by(0), Ok(()));
assert_eq!(iter.advance_back_by(100), Err(1)); // only `&3` was skipped

pub 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 Iterator::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);

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

This is the reverse version of Iterator::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"));

pub fn rfold<B, F>(self, init: 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 Iterator::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)))))");

pub 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 ArgsOs

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

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

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

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

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

impl DoubleEndedIterator for Args

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

impl DoubleEndedIterator for EscapeDefault

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

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

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

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

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

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

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

pub fn advance_back_by(&mut self, n: usize) -> Result<(), usize>

🔬 This is a nightly-only experimental API. (iter_advance_by)

recently added

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

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

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

impl<A> DoubleEndedIterator for IntoIter<A>

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

impl<T, const N: usize> DoubleEndedIterator for IntoIter<T, N>

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

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

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

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

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

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

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

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

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

impl<T> DoubleEndedIterator for IntoIter<T>

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

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

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

impl<T> DoubleEndedIterator for IntoIter<T>

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

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

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

Loading content...

Implementors

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

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

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

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

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

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

impl<'_, T> DoubleEndedIterator for sp_std::collections::vec_deque::Drain<'_, T>

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

impl<'_, T, A> DoubleEndedIterator for sp_std::vec::Drain<'_, T, A> where
    A: Allocator, 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pub 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
    T: 'a + Copy,
    I: DoubleEndedIterator<Item = &'a T>, 

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

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

pub 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 sp_std::collections::btree_map::Iter<'a, K, V> where
    K: 'a,
    V: 'a, 

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

impl<'a, K, V> DoubleEndedIterator for sp_std::collections::btree_map::IterMut<'a, K, V> where
    K: 'a,
    V: 'a, 

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

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

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

impl<'a, K, V> DoubleEndedIterator for sp_std::collections::btree_map::Range<'a, K, V>

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

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

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

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

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

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

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

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

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

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

pub 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>, 

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

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

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

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

pub 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>, 

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

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

pub 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>, 

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

impl<'a, T> DoubleEndedIterator for sp_std::collections::btree_set::Iter<'a, T>

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

impl<'a, T> DoubleEndedIterator for sp_std::collections::btree_set::Range<'a, T>

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

impl<'a, T> DoubleEndedIterator for sp_std::collections::vec_deque::Iter<'a, T>

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

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

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

impl<'a, T> DoubleEndedIterator for sp_std::collections::vec_deque::IterMut<'a, T>

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

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

impl<'a, T> DoubleEndedIterator for sp_std::result::Iter<'a, T>

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

impl<'a, T> DoubleEndedIterator for sp_std::result::IterMut<'a, T>

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<'a, T> DoubleEndedIterator for sp_std::slice::Iter<'a, T>

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

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

impl<'a, T> DoubleEndedIterator for sp_std::slice::IterMut<'a, T>

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<'a, T, const N: usize> DoubleEndedIterator for ArrayChunks<'a, T, N>

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

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

impl<'a, T, const N: usize> DoubleEndedIterator for ArrayChunksMut<'a, T, N>

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

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

impl<'a, T, const N: usize> DoubleEndedIterator for ArrayWindows<'a, T, N>

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

pub fn nth_back(&mut self, n: usize) -> Option<&'a [T; N]>

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

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

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

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

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

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

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

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

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

pub fn rfold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> B,
    RangeInclusive<A>: Sized, 

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

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

pub fn advance_back_by(&mut self, n: usize) -> Result<(), usize>

🔬 This is a nightly-only experimental API. (iter_advance_by)

recently added

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

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

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

pub 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, 

pub 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, 

pub 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, 

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

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

pub 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, 

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

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

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

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

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

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

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

pub 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, 

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

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

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

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

pub 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, 

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

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

pub 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, 

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

pub fn advance_back_by(&mut self, n: usize) -> Result<(), usize>

🔬 This is a nightly-only experimental API. (iter_advance_by)

recently added

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

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

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

pub 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, 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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, 

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

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

pub 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, 

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

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

pub 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 sp_std::collections::btree_map::IntoIter<K, V>

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

impl<K, V> DoubleEndedIterator for IntoKeys<K, V>

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

impl<K, V> DoubleEndedIterator for IntoValues<K, V>

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

impl<T> DoubleEndedIterator for sp_std::collections::btree_set::IntoIter<T>

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

impl<T> DoubleEndedIterator for sp_std::collections::vec_deque::IntoIter<T>

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

impl<T> DoubleEndedIterator for Empty<T>

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

impl<T> DoubleEndedIterator for Once<T>

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

impl<T> DoubleEndedIterator for sp_std::result::IntoIter<T>

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

impl<T, A> DoubleEndedIterator for sp_std::vec::IntoIter<T, A> where
    A: Allocator, 

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

Loading content...