fn for_each_init<O, S, T>(self, init: S, operation: O) -> Collect<MapInit<Self, S, O>, ()>
    where
        O: Fn(&mut T, Self::Item) + Clone + Send + 'a,
        S: Fn() -> T + Clone + Send + 'a,
    {
        self.map_init(init, operation).collect()
    }
/// Executes `operation` on a value returned by `init` with each item produced by
/// the iterator, in parallel.
///
/// The `init` function will be called only as needed for a value to be
/// paired with the group of items in each rayon job.  There is no
/// constraint on that returned type at all!
Executes `operation` on a value returned by `init` with each item produced by
the iterator, in parallel.

The `init` function will be called only as needed for a value to be
paired with the group of items in each rayon job.  There is no
constraint on that returned type at all!
Executes ` operation ` on a value returned by ` init ` with each item produced by the iterator in parallel . The ` init ` function will be called only as needed for a value to be paired with the group of items in each rayon job . There is no constraint on that returned type at all!
fn for_each_init<O, S, T>(self, init: S, operation: O) -> Collect<MapInit<Self, S, O>, ()>
    where
        O: Fn(&mut T, Self::Item) + Clone + Send + 'a,
        S: Fn() -> T + Clone + Send + 'a,
    {
        self.map_init(init, operation).collect()
    }
fn for_each_init < O , S , T > ( self , init : S , operation : O ) -> Collect < MapInit < Self , S , O > , ( ) > where O : Fn ( & mut T , Self :: Item ) + Clone + Send + ' a , S : Fn ( ) -> T + Clone + Send + ' a , { self . map_init ( init , operation ) . collect ( ) }
Executes `operation` on a value returned by `init` with each item produced by
the iterator, in parallel.
Executes ` operation ` on a value returned by ` init ` with each item produced by the iterator in parallel .
self
init
S
operation
O
self
init
S
operation
O