orx-parallel 3.4.0

High performance, configurable and expressive parallel computation library.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

use super::iter::GenericIterator;
use crate::{IterationOrder, ParIter};

impl<T, S, R, O> GenericIterator<T, S, R, O>
where
    T: Send + Sync,
    S: Iterator<Item = T>,
    R: rayon::iter::ParallelIterator<Item = T>,
    O: ParIter<Item = T>,
{
    /// Find computation for the generic iterator.
    ///
    /// See [`find`] for details.
    ///
    /// [`find`]: crate::ParIter::find
    pub fn find<Predicate>(self, predicate: Predicate) -> Option<T>
    where
        Predicate: Fn(&T) -> bool + Send + Sync + Clone,
    {
        match self {
            GenericIterator::Sequential(mut x) => x.find(predicate),
            GenericIterator::Rayon(x) => x.find_first(predicate),
            GenericIterator::Orx(x) => x.find(predicate),
        }
    }

    /// Find-any computation for the generic iterator.
    ///
    /// See [`first`] for details.
    ///
    /// [`first`]: crate::ParIter::first
    pub fn find_any<Predicate>(self, predicate: Predicate) -> Option<T>
    where
        Predicate: Fn(&T) -> bool + Send + Sync + Clone,
    {
        match self {
            GenericIterator::Sequential(mut x) => x.find(predicate),
            GenericIterator::Rayon(x) => x.find_any(predicate),
            GenericIterator::Orx(x) => x.iteration_order(IterationOrder::Arbitrary).find(predicate),
        }
    }
}