pub trait ParIterExt: Iterator {
// Required methods
fn find_any<P>(self, predicate: P) -> Option<Self::Item>
where P: Fn(&Self::Item) -> bool + Sync + Send;
fn find_map_any<P, R>(self, predicate: P) -> Option<R>
where P: Fn(Self::Item) -> Option<R> + Sync + Send;
fn flat_map_iter<U, F>(self, map_op: F) -> FlatMap<Self, U, F> ⓘ
where Self: Sized,
U: IntoIterator,
F: Fn(Self::Item) -> U;
fn for_each_init<OP, INIT, T>(self, init: INIT, op: OP)
where Self: Sized,
OP: Fn(&mut T, Self::Item) + Sync + Send,
INIT: Fn() -> T + Sync + Send;
// Provided methods
fn with_min_len(self, min_len: usize) -> Self
where Self: Sized { ... }
fn with_max_len(self, max_len: usize) -> Self
where Self: Sized { ... }
}Required Methods§
Sourcefn find_any<P>(self, predicate: P) -> Option<Self::Item>
fn find_any<P>(self, predicate: P) -> Option<Self::Item>
Serially, this returns the first matching item, unlike rayon’s find_any, which may
return any matching item found by any thread.
fn find_map_any<P, R>(self, predicate: P) -> Option<R>
fn flat_map_iter<U, F>(self, map_op: F) -> FlatMap<Self, U, F> ⓘ
Provided Methods§
Sourcefn with_min_len(self, min_len: usize) -> Selfwhere
Self: Sized,
fn with_min_len(self, min_len: usize) -> Selfwhere
Self: Sized,
No-op: there is only one split in a serial build, so a minimum split length has nothing to constrain.
Sourcefn with_max_len(self, max_len: usize) -> Selfwhere
Self: Sized,
fn with_max_len(self, max_len: usize) -> Selfwhere
Self: Sized,
No-op: there is only one split in a serial build, so a maximum split length has nothing to constrain.
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety".