Trait rayon::par_iter::ParallelIterator [−] [src]

pub trait ParallelIterator: Sized {
    type Item: Send;
    fn weight(self, scale: f64) -> Weight<Self> { ... }
    fn weight_max(self) -> Weight<Self> { ... }
    fn for_each<OP>(self, op: OP) where OP: Fn(Self::Item) + Sync { ... }
    fn map<MAP_OP, R>(self, map_op: MAP_OP) -> Map<Self, MAP_OP> where MAP_OP: Fn(Self::Item) -> R { ... }
    fn filter<FILTER_OP>(self, filter_op: FILTER_OP) -> Filter<Self, FILTER_OP> where FILTER_OP: Fn(&Self::Item) -> bool { ... }
    fn filter_map<FILTER_OP, R>(self, filter_op: FILTER_OP) -> FilterMap<Self, FILTER_OP> where FILTER_OP: Fn(Self::Item) -> Option<R> { ... }
    fn flat_map<MAP_OP, PI>(self, map_op: MAP_OP) -> FlatMap<Self, MAP_OP> where MAP_OP: Fn(Self::Item) -> PI, PI: ParallelIterator { ... }
    fn reduce_with<OP>(self, op: OP) -> Option<Self::Item> where OP: Fn(Self::Item, Self::Item) -> Self::Item + Sync { ... }
    fn sum(self) -> Self::Item where SumOp: ReduceOp<Self::Item> { ... }
    fn mul(self) -> Self::Item where MulOp: ReduceOp<Self::Item> { ... }
    fn min(self) -> Self::Item where MinOp: ReduceOp<Self::Item> { ... }
    fn max(self) -> Self::Item where MaxOp: ReduceOp<Self::Item> { ... }
    fn reduce<REDUCE_OP>(self, reduce_op: &REDUCE_OP) -> Self::Item where REDUCE_OP: ReduceOp<Self::Item> { ... }
}

The ParallelIterator interface.

Associated Types

type Item: Send

Provided Methods

fn weight(self, scale: f64) -> Weight<Self>

Indicates the relative "weight" of producing each item in this parallel iterator. A higher weight will cause finer-grained parallel subtasks. 1.0 indicates something very cheap and uniform, like copying a value out of an array, or computing x + 1. If your tasks are either very expensive, or very unpredictable, you are better off with higher values. See also weight_max, which is a convenient shorthand to force the finest grained parallel execution posible. Tuning this value should not affect correctness but can improve (or hurt) performance.

fn weight_max(self) -> Weight<Self>

Shorthand for self.weight(f64::INFINITY). This forces the smallest granularity of parallel execution, which makes sense when your parallel tasks are (potentially) very expensive to execute.

fn for_each<OP>(self, op: OP) where OP: Fn(Self::Item) + Sync

Executes OP on each item produced by the iterator, in parallel.

fn map<MAP_OP, R>(self, map_op: MAP_OP) -> Map<Self, MAP_OP> where MAP_OP: Fn(Self::Item) -> R

Applies map_op to each item of his iterator, producing a new iterator with the results.

fn filter<FILTER_OP>(self, filter_op: FILTER_OP) -> Filter<Self, FILTER_OP> where FILTER_OP: Fn(&Self::Item) -> bool

Applies map_op to each item of his iterator, producing a new iterator with the results.

fn filter_map<FILTER_OP, R>(self, filter_op: FILTER_OP) -> FilterMap<Self, FILTER_OP> where FILTER_OP: Fn(Self::Item) -> Option<R>

Applies map_op to each item of his iterator, producing a new iterator with the results.

fn flat_map<MAP_OP, PI>(self, map_op: MAP_OP) -> FlatMap<Self, MAP_OP> where MAP_OP: Fn(Self::Item) -> PI, PI: ParallelIterator

Applies map_op to each item of his iterator, producing a new iterator with the results.

fn reduce_with<OP>(self, op: OP) -> Option<Self::Item> where OP: Fn(Self::Item, Self::Item) -> Self::Item + Sync

Reduces the items in the iterator into one item using op. See also sum, mul, min, etc, which are slightly more efficient. Returns None if the iterator is empty.

Note: unlike in a sequential iterator, the order in which op will be applied to reduce the result is not specified. So op should be commutative and associative or else the results will be non-deterministic.

fn sum(self) -> Self::Item where SumOp: ReduceOp<Self::Item>

Sums up the items in the iterator.

Note that the order in items will be reduced is not specified, so if the + operator is not truly commutative and associative (as is the case for floating point numbers), then the results are not fully deterministic.

fn mul(self) -> Self::Item where MulOp: ReduceOp<Self::Item>

Multiplies all the items in the iterator.

Note that the order in items will be reduced is not specified, so if the * operator is not truly commutative and associative (as is the case for floating point numbers), then the results are not fully deterministic.

fn min(self) -> Self::Item where MinOp: ReduceOp<Self::Item>

Computes the minimum of all the items in the iterator.

Note that the order in items will be reduced is not specified, so if the Ord impl is not truly commutative and associative (as is the case for floating point numbers), then the results are not deterministic.

fn max(self) -> Self::Item where MaxOp: ReduceOp<Self::Item>

Computes the maximum of all the items in the iterator.

Note that the order in items will be reduced is not specified, so if the Ord impl is not truly commutative and associative (as is the case for floating point numbers), then the results are not deterministic.

fn reduce<REDUCE_OP>(self, reduce_op: &REDUCE_OP) -> Self::Item where REDUCE_OP: ReduceOp<Self::Item>

Reduces the items using the given "reduce operator". You may prefer reduce_with for a simpler interface.

Note that the order in items will be reduced is not specified, so if the reduce_op impl is not truly commutative and associative, then the results are not deterministic.

Implementors