fn partition<O>(self, operation: O) -> Partition<Self, O>
    where
        O: Fn(&Self::Item) -> bool + Sync + Send,
    {
        Partition::new(self, operation)
    }
/// Partitions the items of a parallel iterator into a pair of arbitrary
/// `ParallelExtend` containers.  Items for which the `operation` returns
/// true go into the first container, and the rest go into the second.
///
/// Note: unlike the standard `Iterator::partition`, this allows distinct
/// collection types for the left and right items.  This is more flexible,
/// but may require new type annotations when converting sequential code
/// that used type inferrence assuming the two were the same.
///
/// # Examples
///
/// ```
/// use asparit::*;
///
/// let (left, right): (Vec<_>, Vec<_>) = (0..8).into_par_iter().partition(|x| x % 2 == 0).exec();
///
/// assert_eq!(left, [0, 2, 4, 6]);
/// assert_eq!(right, [1, 3, 5, 7]);
/// ```
Partitions the items of a parallel iterator into a pair of arbitrary
`ParallelExtend` containers.  Items for which the `operation` returns
true go into the first container, and the rest go into the second.

unlike the standard `Iterator::partition`, this allows distinct
collection types for the left and right items.  This is more flexible,
but may require new type annotations when converting sequential code
that used type inferrence assuming the two were the same.
Partitions the items of a parallel iterator into a pair of arbitrary ` ParallelExtend ` containers . Items for which the ` operation ` returns true go into the first container and the rest go into the second . unlike the standard ` Iterator :: partition ` this allows distinct collection types for the left and right items . This is more flexible but may require new type annotations when converting sequential code that used type inferrence assuming the two were the same .
fn partition<O>(self, operation: O) -> Partition<Self, O>
    where
        O: Fn(&Self::Item) -> bool + Sync + Send,
    {
        Partition::new(self, operation)
    }
fn partition < O > ( self , operation : O ) -> Partition < Self , O > where O : Fn ( & Self :: Item ) -> bool + Sync + Send , { Partition :: new ( self , operation ) }
Partitions the items of a parallel iterator into a pair of arbitrary
`ParallelExtend` containers.
Partitions the items of a parallel iterator into a pair of arbitrary ` ParallelExtend ` containers .
self
operation
O
self
operation
O
examples
None