Struct rayon::iter::par_bridge::IterBridge
source ·
pub struct IterBridge<Iter> {
iter: Iter,
}
Expand description
IterBridge
is a parallel iterator that wraps a sequential iterator.
This type is created when using the par_bridge
method on ParallelBridge
. See the ParallelBridge
documentation for details.
Fields§
§iter: Iter
Trait Implementations§
source§
impl<Iter: Clone> Clone for IterBridge<Iter>
impl<Iter: Clone> Clone for IterBridge<Iter>
source§
fn clone(&self) -> IterBridge<Iter>
fn clone(&self) -> IterBridge<Iter>
Returns a copy of the value. Read more
1.0.0 · source§
fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read more
source§
impl<Iter: Debug> Debug for IterBridge<Iter>
impl<Iter: Debug> Debug for IterBridge<Iter>
source§
impl<Iter: Iterator + Send> ParallelIterator for IterBridge<Iter>where Iter::Item: Send,
impl<Iter: Iterator + Send> ParallelIterator for IterBridge<Iter>where Iter::Item: Send,
§
type Item = <Iter as Iterator>::Item
type Item = <Iter as Iterator>::Item
The type of item that this parallel iterator produces. For example, if you use the
for_each
method, this is the type of item that your closure will be invoked with.
source§
fn drive_unindexed<C>(self, consumer: C) -> C::Resultwhere C: UnindexedConsumer<Self::Item>,
fn drive_unindexed<C>(self, consumer: C) -> C::Resultwhere C: UnindexedConsumer<Self::Item>,
Internal method used to define the behavior of this parallel iterator. You should not need to call this directly. Read more
source§
fn for_each<OP>(self, op: OP)where OP: Fn(Self::Item) + Sync + Send,
fn for_each<OP>(self, op: OP)where OP: Fn(Self::Item) + Sync + Send,
Executes
OP
on each item produced by the iterator, in parallel. Read more
source§
fn for_each_with<OP, T>(self, init: T, op: OP)where OP: Fn(&mut T, Self::Item) + Sync + Send, T: Send + Clone,
fn for_each_with<OP, T>(self, init: T, op: OP)where OP: Fn(&mut T, Self::Item) + Sync + Send, T: Send + Clone,
source§
fn for_each_init<OP, INIT, T>(self, init: INIT, op: OP)where OP: Fn(&mut T, Self::Item) + Sync + Send, INIT: Fn() -> T + Sync + Send,
fn for_each_init<OP, INIT, T>(self, init: INIT, op: OP)where OP: Fn(&mut T, Self::Item) + Sync + Send, INIT: Fn() -> T + Sync + Send,
Executes
OP
on a value returned by init
with each item produced by the iterator, in parallel. Read more
source§
fn try_for_each<OP, R>(self, op: OP) -> Rwhere OP: Fn(Self::Item) -> R + Sync + Send, R: Try<Output = ()> + Send,
fn try_for_each<OP, R>(self, op: OP) -> Rwhere OP: Fn(Self::Item) -> R + Sync + Send, R: Try<Output = ()> + Send,
Executes a fallible
OP
on each item produced by the iterator, in parallel. Read more
source§
fn try_for_each_with<OP, T, R>(self, init: T, op: OP) -> Rwhere OP: Fn(&mut T, Self::Item) -> R + Sync + Send, T: Send + Clone, R: Try<Output = ()> + Send,
fn try_for_each_with<OP, T, R>(self, init: T, op: OP) -> Rwhere OP: Fn(&mut T, Self::Item) -> R + Sync + Send, T: Send + Clone, R: Try<Output = ()> + Send,
Executes a fallible
OP
on the given init
value with each item produced by the iterator, in parallel. Read more
source§
fn try_for_each_init<OP, INIT, T, R>(self, init: INIT, op: OP) -> Rwhere OP: Fn(&mut T, Self::Item) -> R + Sync + Send, INIT: Fn() -> T + Sync + Send, R: Try<Output = ()> + Send,
fn try_for_each_init<OP, INIT, T, R>(self, init: INIT, op: OP) -> Rwhere OP: Fn(&mut T, Self::Item) -> R + Sync + Send, INIT: Fn() -> T + Sync + Send, R: Try<Output = ()> + Send,
Executes a fallible
OP
on a value returned by init
with each item produced by the iterator, in parallel. Read more
source§
fn map<F, R>(self, map_op: F) -> Map<Self, F>where F: Fn(Self::Item) -> R + Sync + Send, R: Send,
fn map<F, R>(self, map_op: F) -> Map<Self, F>where F: Fn(Self::Item) -> R + Sync + Send, R: Send,
Applies
map_op
to each item of this iterator, producing a new iterator with the results. Read more
source§
fn map_with<F, T, R>(self, init: T, map_op: F) -> MapWith<Self, T, F>where F: Fn(&mut T, Self::Item) -> R + Sync + Send, T: Send + Clone, R: Send,
fn map_with<F, T, R>(self, init: T, map_op: F) -> MapWith<Self, T, F>where F: Fn(&mut T, Self::Item) -> R + Sync + Send, T: Send + Clone, R: Send,
Applies
map_op
to the given init
value with each item of this iterator, producing a new iterator with the results. Read more
source§
fn map_init<F, INIT, T, R>( self, init: INIT, map_op: F ) -> MapInit<Self, INIT, F>where F: Fn(&mut T, Self::Item) -> R + Sync + Send, INIT: Fn() -> T + Sync + Send, R: Send,
fn map_init<F, INIT, T, R>( self, init: INIT, map_op: F ) -> MapInit<Self, INIT, F>where F: Fn(&mut T, Self::Item) -> R + Sync + Send, INIT: Fn() -> T + Sync + Send, R: Send,
Applies
map_op
to a value returned by init
with each item of this iterator, producing a new iterator with the results. Read more
source§
fn cloned<'a, T>(self) -> Cloned<Self>where T: 'a + Clone + Send, Self: ParallelIterator<Item = &'a T>,
fn cloned<'a, T>(self) -> Cloned<Self>where T: 'a + Clone + Send, Self: ParallelIterator<Item = &'a T>,
source§
fn copied<'a, T>(self) -> Copied<Self>where T: 'a + Copy + Send, Self: ParallelIterator<Item = &'a T>,
fn copied<'a, T>(self) -> Copied<Self>where T: 'a + Copy + Send, Self: ParallelIterator<Item = &'a T>,
source§
fn inspect<OP>(self, inspect_op: OP) -> Inspect<Self, OP>where OP: Fn(&Self::Item) + Sync + Send,
fn inspect<OP>(self, inspect_op: OP) -> Inspect<Self, OP>where OP: Fn(&Self::Item) + Sync + Send,
Applies
inspect_op
to a reference to each item of this iterator, producing a new iterator passing through the original items. This is often useful for debugging to see what’s happening in iterator stages. Read more
source§
fn update<F>(self, update_op: F) -> Update<Self, F>where F: Fn(&mut Self::Item) + Sync + Send,
fn update<F>(self, update_op: F) -> Update<Self, F>where F: Fn(&mut Self::Item) + Sync + Send,
Mutates each item of this iterator before yielding it. Read more
source§
fn filter<P>(self, filter_op: P) -> Filter<Self, P>where P: Fn(&Self::Item) -> bool + Sync + Send,
fn filter<P>(self, filter_op: P) -> Filter<Self, P>where P: Fn(&Self::Item) -> bool + Sync + Send,
Applies
filter_op
to each item of this iterator, producing a new iterator with only the items that gave true
results. Read more
source§
fn filter_map<P, R>(self, filter_op: P) -> FilterMap<Self, P>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,
fn filter_map<P, R>(self, filter_op: P) -> FilterMap<Self, P>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,
Applies
filter_op
to each item of this iterator to get an Option
, producing a new iterator with only the items from Some
results. Read more
source§
fn flat_map<F, PI>(self, map_op: F) -> FlatMap<Self, F>where F: Fn(Self::Item) -> PI + Sync + Send, PI: IntoParallelIterator,
fn flat_map<F, PI>(self, map_op: F) -> FlatMap<Self, F>where F: Fn(Self::Item) -> PI + Sync + Send, PI: IntoParallelIterator,
Applies
map_op
to each item of this iterator to get nested parallel iterators, producing a new parallel iterator that flattens these back into one. Read more
source§
fn flat_map_iter<F, SI>(self, map_op: F) -> FlatMapIter<Self, F>where F: Fn(Self::Item) -> SI + Sync + Send, SI: IntoIterator, SI::Item: Send,
fn flat_map_iter<F, SI>(self, map_op: F) -> FlatMapIter<Self, F>where F: Fn(Self::Item) -> SI + Sync + Send, SI: IntoIterator, SI::Item: Send,
Applies
map_op
to each item of this iterator to get nested serial iterators, producing a new parallel iterator that flattens these back into one. Read more
source§
fn reduce<OP, ID>(self, identity: ID, op: OP) -> Self::Itemwhere OP: Fn(Self::Item, Self::Item) -> Self::Item + Sync + Send, ID: Fn() -> Self::Item + Sync + Send,
fn reduce<OP, ID>(self, identity: ID, op: OP) -> Self::Itemwhere OP: Fn(Self::Item, Self::Item) -> Self::Item + Sync + Send, ID: Fn() -> Self::Item + Sync + Send,
Reduces the items in the iterator into one item using
op
. The argument identity
should be a closure that can produce “identity” value which may be inserted into the sequence as needed to create opportunities for parallel execution. So, for example, if you are doing a summation, then identity()
ought to produce something that represents the zero for your type (but consider just calling sum()
in that case). Read more
source§
fn reduce_with<OP>(self, op: OP) -> Option<Self::Item>where OP: Fn(Self::Item, Self::Item) -> Self::Item + Sync + Send,
fn reduce_with<OP>(self, op: OP) -> Option<Self::Item>where OP: Fn(Self::Item, Self::Item) -> Self::Item + Sync + Send,
Reduces the items in the iterator into one item using
op
. If the iterator is empty, None
is returned; otherwise, Some
is returned. Read more
source§
fn fold<T, ID, F>(self, identity: ID, fold_op: F) -> Fold<Self, ID, F>where F: Fn(T, Self::Item) -> T + Sync + Send, ID: Fn() -> T + Sync + Send, T: Send,
fn fold<T, ID, F>(self, identity: ID, fold_op: F) -> Fold<Self, ID, F>where F: Fn(T, Self::Item) -> T + Sync + Send, ID: Fn() -> T + Sync + Send, T: Send,
Parallel fold is similar to sequential fold except that the sequence of items may be subdivided before it is folded. Consider a list of numbers like
22 3 77 89 46
. If you used sequential fold to add them (fold(0, |a,b| a+b)
, you would wind up first adding 0 + 22, then 22 + 3, then 25 + 77, and so forth. The parallel fold works similarly except that it first breaks up your list into sublists, and hence instead of yielding up a single sum at the end, it yields up multiple sums. The number of results is nondeterministic, as is the point where the breaks occur. Read more
source§
fn fold_with<F, T>(self, init: T, fold_op: F) -> FoldWith<Self, T, F>where F: Fn(T, Self::Item) -> T + Sync + Send, T: Send + Clone,
fn fold_with<F, T>(self, init: T, fold_op: F) -> FoldWith<Self, T, F>where F: Fn(T, Self::Item) -> T + Sync + Send, T: Send + Clone,
Applies
fold_op
to the given init
value with each item of this iterator, finally producing the value for further use. Read more
source§
fn try_fold<T, R, ID, F>( self, identity: ID, fold_op: F ) -> TryFold<Self, R, ID, F>where F: Fn(T, Self::Item) -> R + Sync + Send, ID: Fn() -> T + Sync + Send, R: Try<Output = T> + Send,
fn try_fold<T, R, ID, F>( self, identity: ID, fold_op: F ) -> TryFold<Self, R, ID, F>where F: Fn(T, Self::Item) -> R + Sync + Send, ID: Fn() -> T + Sync + Send, R: Try<Output = T> + Send,
Performs a fallible parallel fold. Read more
source§
fn try_fold_with<F, T, R>(self, init: T, fold_op: F) -> TryFoldWith<Self, R, F>where F: Fn(T, Self::Item) -> R + Sync + Send, R: Try<Output = T> + Send, T: Clone + Send,
fn try_fold_with<F, T, R>(self, init: T, fold_op: F) -> TryFoldWith<Self, R, F>where F: Fn(T, Self::Item) -> R + Sync + Send, R: Try<Output = T> + Send, T: Clone + Send,
Performs a fallible parallel fold with a cloneable
init
value. Read more
source§
fn sum<S>(self) -> Swhere S: Send + Sum<Self::Item> + Sum<S>,
fn sum<S>(self) -> Swhere S: Send + Sum<Self::Item> + Sum<S>,
Sums up the items in the iterator. Read more
source§
fn product<P>(self) -> Pwhere P: Send + Product<Self::Item> + Product<P>,
fn product<P>(self) -> Pwhere P: Send + Product<Self::Item> + Product<P>,
Multiplies all the items in the iterator. Read more
source§
fn min_by<F>(self, f: F) -> Option<Self::Item>where F: Sync + Send + Fn(&Self::Item, &Self::Item) -> Ordering,
fn min_by<F>(self, f: F) -> Option<Self::Item>where F: Sync + Send + Fn(&Self::Item, &Self::Item) -> Ordering,
Computes the minimum of all the items in the iterator with respect to the given comparison function. If the iterator is empty,
None
is returned; otherwise, Some(min)
is returned. Read more
source§
fn min_by_key<K, F>(self, f: F) -> Option<Self::Item>where K: Ord + Send, F: Sync + Send + Fn(&Self::Item) -> K,
fn min_by_key<K, F>(self, f: F) -> Option<Self::Item>where K: Ord + Send, F: Sync + Send + Fn(&Self::Item) -> K,
Computes the item that yields the minimum value for the given function. If the iterator is empty,
None
is returned; otherwise, Some(item)
is returned. Read more
source§
fn max_by<F>(self, f: F) -> Option<Self::Item>where F: Sync + Send + Fn(&Self::Item, &Self::Item) -> Ordering,
fn max_by<F>(self, f: F) -> Option<Self::Item>where F: Sync + Send + Fn(&Self::Item, &Self::Item) -> Ordering,
Computes the maximum of all the items in the iterator with respect to the given comparison function. If the iterator is empty,
None
is returned; otherwise, Some(max)
is returned. Read more
source§
fn max_by_key<K, F>(self, f: F) -> Option<Self::Item>where K: Ord + Send, F: Sync + Send + Fn(&Self::Item) -> K,
fn max_by_key<K, F>(self, f: F) -> Option<Self::Item>where K: Ord + Send, F: Sync + Send + Fn(&Self::Item) -> K,
Computes the item that yields the maximum value for the given function. If the iterator is empty,
None
is returned; otherwise, Some(item)
is returned. Read more
source§
fn chain<C>(self, chain: C) -> Chain<Self, C::Iter>where C: IntoParallelIterator<Item = Self::Item>,
fn chain<C>(self, chain: C) -> Chain<Self, C::Iter>where C: IntoParallelIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both. Read more
source§
fn find_any<P>(self, predicate: P) -> Option<Self::Item>where P: Fn(&Self::Item) -> bool + Sync + Send,
fn find_any<P>(self, predicate: P) -> Option<Self::Item>where P: Fn(&Self::Item) -> bool + Sync + Send,
Searches for some item in the parallel iterator that matches the given predicate and returns it. This operation is similar to
find
on sequential iterators but the item returned may not be the first one in the parallel sequence which matches, since we search the entire sequence in parallel. Read more
source§
fn find_first<P>(self, predicate: P) -> Option<Self::Item>where P: Fn(&Self::Item) -> bool + Sync + Send,
fn find_first<P>(self, predicate: P) -> Option<Self::Item>where P: Fn(&Self::Item) -> bool + Sync + Send,
Searches for the sequentially first item in the parallel iterator that matches the given predicate and returns it. Read more
source§
fn find_last<P>(self, predicate: P) -> Option<Self::Item>where P: Fn(&Self::Item) -> bool + Sync + Send,
fn find_last<P>(self, predicate: P) -> Option<Self::Item>where P: Fn(&Self::Item) -> bool + Sync + Send,
Searches for the sequentially last item in the parallel iterator that matches the given predicate and returns it. Read more
source§
fn find_map_any<P, R>(self, predicate: P) -> Option<R>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,
fn find_map_any<P, R>(self, predicate: P) -> Option<R>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,
Applies the given predicate to the items in the parallel iterator and returns any non-None result of the map operation. Read more
source§
fn find_map_first<P, R>(self, predicate: P) -> Option<R>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,
fn find_map_first<P, R>(self, predicate: P) -> Option<R>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,
Applies the given predicate to the items in the parallel iterator and returns the sequentially first non-None result of the map operation. Read more
source§
fn find_map_last<P, R>(self, predicate: P) -> Option<R>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,
fn find_map_last<P, R>(self, predicate: P) -> Option<R>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,
Applies the given predicate to the items in the parallel iterator and returns the sequentially last non-None result of the map operation. Read more
source§
fn any<P>(self, predicate: P) -> boolwhere P: Fn(Self::Item) -> bool + Sync + Send,
fn any<P>(self, predicate: P) -> boolwhere P: Fn(Self::Item) -> bool + Sync + Send,
Searches for some item in the parallel iterator that matches the given predicate, and if so returns true. Once a match is found, we’ll attempt to stop process the rest of the items. Proving that there’s no match, returning false, does require visiting every item. Read more
source§
fn all<P>(self, predicate: P) -> boolwhere P: Fn(Self::Item) -> bool + Sync + Send,
fn all<P>(self, predicate: P) -> boolwhere P: Fn(Self::Item) -> bool + Sync + Send,
Tests that every item in the parallel iterator matches the given predicate, and if so returns true. If a counter-example is found, we’ll attempt to stop processing more items, then return false. Read more
source§
fn while_some<T>(self) -> WhileSome<Self>where Self: ParallelIterator<Item = Option<T>>, T: Send,
fn while_some<T>(self) -> WhileSome<Self>where Self: ParallelIterator<Item = Option<T>>, T: Send,
Creates an iterator over the
Some
items of this iterator, halting as soon as any None
is found. Read more
source§
fn panic_fuse(self) -> PanicFuse<Self>
fn panic_fuse(self) -> PanicFuse<Self>
Wraps an iterator with a fuse in case of panics, to halt all threads as soon as possible. Read more
source§
fn collect<C>(self) -> Cwhere C: FromParallelIterator<Self::Item>,
fn collect<C>(self) -> Cwhere C: FromParallelIterator<Self::Item>,
Creates a fresh collection containing all the elements produced by this parallel iterator. Read more
source§
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where Self: ParallelIterator<Item = (A, B)>, FromA: Default + Send + ParallelExtend<A>, FromB: Default + Send + ParallelExtend<B>, A: Send, B: Send,
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where Self: ParallelIterator<Item = (A, B)>, FromA: Default + Send + ParallelExtend<A>, FromB: Default + Send + ParallelExtend<B>, A: Send, B: Send,
Unzips the items of a parallel iterator into a pair of arbitrary
ParallelExtend
containers. Read more
source§
fn partition<A, B, P>(self, predicate: P) -> (A, B)where A: Default + Send + ParallelExtend<Self::Item>, B: Default + Send + ParallelExtend<Self::Item>, P: Fn(&Self::Item) -> bool + Sync + Send,
fn partition<A, B, P>(self, predicate: P) -> (A, B)where A: Default + Send + ParallelExtend<Self::Item>, B: Default + Send + ParallelExtend<Self::Item>, P: Fn(&Self::Item) -> bool + Sync + Send,
Partitions the items of a parallel iterator into a pair of arbitrary
ParallelExtend
containers. Items for which the predicate
returns true go into the first container, and the rest go into the second. Read more
source§
fn partition_map<A, B, P, L, R>(self, predicate: P) -> (A, B)where A: Default + Send + ParallelExtend<L>, B: Default + Send + ParallelExtend<R>, P: Fn(Self::Item) -> Either<L, R> + Sync + Send, L: Send, R: Send,
fn partition_map<A, B, P, L, R>(self, predicate: P) -> (A, B)where A: Default + Send + ParallelExtend<L>, B: Default + Send + ParallelExtend<R>, P: Fn(Self::Item) -> Either<L, R> + Sync + Send, L: Send, R: Send,
Partitions and maps the items of a parallel iterator into a pair of arbitrary
ParallelExtend
containers. Either::Left
items go into the first container, and Either::Right
items go into the second. Read more
source§
fn take_any(self, n: usize) -> TakeAny<Self>
fn take_any(self, n: usize) -> TakeAny<Self>
Creates an iterator that yields
n
elements from anywhere in the original iterator. Read more
source§
fn skip_any(self, n: usize) -> SkipAny<Self>
fn skip_any(self, n: usize) -> SkipAny<Self>
Creates an iterator that skips
n
elements from anywhere in the original iterator. Read more
source§
fn take_any_while<P>(self, predicate: P) -> TakeAnyWhile<Self, P>where P: Fn(&Self::Item) -> bool + Sync + Send,
fn take_any_while<P>(self, predicate: P) -> TakeAnyWhile<Self, P>where P: Fn(&Self::Item) -> bool + Sync + Send,
Creates an iterator that takes elements from anywhere in the original iterator until the given
predicate
returns false
. Read more
source§
fn skip_any_while<P>(self, predicate: P) -> SkipAnyWhile<Self, P>where P: Fn(&Self::Item) -> bool + Sync + Send,
fn skip_any_while<P>(self, predicate: P) -> SkipAnyWhile<Self, P>where P: Fn(&Self::Item) -> bool + Sync + Send,
Creates an iterator that skips elements from anywhere in the original iterator until the given
predicate
returns false
. Read more
source§
fn collect_vec_list(self) -> LinkedList<Vec<Self::Item>>
fn collect_vec_list(self) -> LinkedList<Vec<Self::Item>>
Collects this iterator into a linked list of vectors. Read more
Auto Trait Implementations§
impl<Iter> RefUnwindSafe for IterBridge<Iter>where Iter: RefUnwindSafe,
impl<Iter> Send for IterBridge<Iter>where Iter: Send,
impl<Iter> Sync for IterBridge<Iter>where Iter: Sync,
impl<Iter> Unpin for IterBridge<Iter>where Iter: Unpin,
impl<Iter> UnwindSafe for IterBridge<Iter>where Iter: UnwindSafe,
Blanket Implementations§
source§
impl<T> BorrowMut<T> for Twhere T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§
fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§
impl<T> IntoEither for T
impl<T> IntoEither for T
source§
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
. Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more
source§
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘwhere F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘwhere F: FnOnce(&Self) -> bool,
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
. Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more
source§
impl<T> IntoParallelIterator for Twhere T: ParallelIterator,
impl<T> IntoParallelIterator for Twhere T: ParallelIterator,
§
type Item = <T as ParallelIterator>::Item
type Item = <T as ParallelIterator>::Item
The type of item that the parallel iterator will produce.
source§
fn into_par_iter(self) -> T
fn into_par_iter(self) -> T
Converts
self
into a parallel iterator. Read more