Struct MaybeParallelIterator

pub struct MaybeParallelIterator<IT: Iterator>(/* private fields */);

An iterator that may be sequential or parallel depending on feature flags.

Implementations

impl<IT: Iterator> MaybeParallelIterator<IT>

pub fn collect<B: FromIterator<IT::Item>>(self) -> B

where Self: Sized,

pub fn for_each<O: Fn(IT::Item)>(self, op: O)

Do a computation on all items.

pub fn with_min_sequential(self, _: usize) -> Self

Process at least this many items sequentially (no-op unless rayon feature enabled).

Foot-gun

Without rayon feature, this can be called in places IndexedParallelIterator would not apply. These uses won’t compile under rayon.

pub fn enumerate(self) -> MaybeParallelIterator<Enumerate<IT>>

Map to a tuple containing the index of each item along with that item.

Foot-gun

Without rayon feature, this can be called in places IndexedParallelIterator would not apply. These uses won’t compile under rayon.

pub fn map<O, M: Fn(IT::Item) -> O>( self, map: M, ) -> MaybeParallelIterator<Map<IT, M>>

Like iterator mapping.

pub fn filter_map<O, M: Fn(IT::Item) -> Option<O>>( self, map: M, ) -> MaybeParallelIterator<FilterMap<IT, M>>

Like iterator filter mapping.

pub fn flat_map<O: IntoIterator, M: Fn(IT::Item) -> O>( self, map: M, ) -> MaybeParallelIterator<FlatMap<IT, O, M>>

Like iterator flat-mapping.

pub fn find_any<F: Fn(&IT::Item) -> bool>(self, f: F) -> Option<IT::Item>

Like iterator find (but won’t necessarily return the first match).

pub fn into_inner(self) -> IT

Get the inner iterator.

Trait Implementations

impl<IT: Iterator> IntoIterator for MaybeParallelIterator<IT>

type Item = <IT as Iterator>::Item

The type of the elements being iterated over.

type IntoIter = IT

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.