fn position_any<O>(self, operation: O) -> Position<Self, O>
    where
        O: Fn(Self::Item) -> bool + Clone + Send + 'a,
    {
        Position::new(self, operation, FindMatch::Any)
    }
/// Searches for **some** item in the parallel iterator that
/// matches the given operation, and returns its index.  Like
/// `ParallelIterator::find_any`, the parallel search will not
/// necessarily find the **first** match, and once a match is
/// found we'll attempt to stop processing any more.
///
/// # Examples
///
/// ```
/// use asparit::*;
///
/// let a = [1, 2, 3, 3];
///
/// let i = a
///     .par_iter()
///     .position_any(|&x| x == 3)
///     .exec()
///     .expect("found");
/// assert!(i == 2 || i == 3);
///
/// assert_eq!(a.par_iter().position_any(|&x| x == 100).exec(), None);
/// ```
Searches for **some** item in the parallel iterator that
matches the given operation, and returns its index.  Like
`ParallelIterator::find_any`, the parallel search will not
necessarily find the **first** match, and once a match is
found we'll attempt to stop processing any more.
Searches for ** some ** item in the parallel iterator that matches the given operation and returns its index . Like ` ParallelIterator :: find_any ` the parallel search will not necessarily find the ** first ** match and once a match is found we ' ll attempt to stop processing any more .
fn position_any<O>(self, operation: O) -> Position<Self, O>
    where
        O: Fn(Self::Item) -> bool + Clone + Send + 'a,
    {
        Position::new(self, operation, FindMatch::Any)
    }
fn position_any < O > ( self , operation : O ) -> Position < Self , O > where O : Fn ( Self :: Item ) -> bool + Clone + Send + ' a , { Position :: new ( self , operation , FindMatch :: Any ) }
Searches for **some** item in the parallel iterator that
matches the given operation, and returns its index.
Searches for ** some ** item in the parallel iterator that matches the given operation and returns its index .
self
operation
O
self
operation
O
examples
None