fn position_last<O>(self, operation: O) -> Position<Self, O>
    where
        O: Fn(Self::Item) -> bool + Clone + Send + 'a,
    {
        Position::new(self, operation, FindMatch::Last)
    }
/// Searches for the sequentially **last** item in the parallel iterator
/// that matches the given operation, and returns its index.
///
/// Like `ParallelIterator::find_last`, once a match is found,
/// all attempts to the left of the match will be stopped, while
/// attempts to the right must continue in case a later match
/// is found.
///
/// Note that not all parallel iterators have a useful order, much like
/// sequential `HashMap` iteration, so "last" may be nebulous.  When the
/// order doesn't actually matter to you, `position_any` is a better
/// choice.
///
/// # Examples
///
/// ```
/// use asparit::*;
///
/// let a = [1, 2, 3, 3];
///
/// assert_eq!(a.par_iter().position_last(|&x| x == 3).exec(), Some(3));
///
/// assert_eq!(a.par_iter().position_last(|&x| x == 100).exec(), None);
/// ```
Searches for the sequentially **last** item in the parallel iterator
that matches the given operation, and returns its index.

Like `ParallelIterator::find_last`, once a match is found,
all attempts to the left of the match will be stopped, while
attempts to the right must continue in case a later match
is found.

Note that not all parallel iterators have a useful order, much like
sequential `HashMap` iteration, so "last" may be nebulous.  When the
order doesn't actually matter to you, `position_any` is a better
choice.
Searches for the sequentially ** last ** item in the parallel iterator that matches the given operation and returns its index . Like ` ParallelIterator :: find_last ` once a match is found all attempts to the left of the match will be stopped while attempts to the right must continue in case a later match is found . Note that not all parallel iterators have a useful order much like sequential ` HashMap ` iteration so " last " may be nebulous . When the order doesn ' t actually matter to you ` position_any ` is a better choice .
fn position_last<O>(self, operation: O) -> Position<Self, O>
    where
        O: Fn(Self::Item) -> bool + Clone + Send + 'a,
    {
        Position::new(self, operation, FindMatch::Last)
    }
fn position_last < O > ( self , operation : O ) -> Position < Self , O > where O : Fn ( Self :: Item ) -> bool + Clone + Send + ' a , { Position :: new ( self , operation , FindMatch :: Last ) }
Searches for the sequentially **last** item in the parallel iterator
that matches the given operation, and returns its index.
Searches for the sequentially ** last ** item in the parallel iterator that matches the given operation and returns its index .
self
operation
O
self
operation
O
examples
None