Struct ParallelMap 

pub struct ParallelMap<V, F, T, I>
where
    I: AtomicIterator<AtomicItem = V> + Send + Sized,
    F: Fn(V) -> T + Send,
    V: Send,
    T: Send,
{
    pub iter: TaskQueue<I, V>,
    pub f: Pin<Box<F>>,
    pub num_threads: usize,
    pub v: PhantomData<V>,
    pub t: PhantomData<T>,
}

Fields

iter: TaskQueue<I, V>

f: Pin<Box<F>>

num_threads: usize

v: PhantomData<V>

t: PhantomData<T>

Implementations

impl<I, V, F, T> ParallelMap<V, F, T, I>

where I: AtomicIterator<AtomicItem = V> + Send + Sized, F: Fn(V) -> T + Send, V: Send, T: Send,

ParallelMap is a object that allows map function to be run on AtomicIterators. The results may be then collected in types implementing Collector trait.

use parallel_task::prelude::*;
 
let res = (0..100_000).collect::<Vec<i32>>().parallel_iter().map(|val|*val).collect::<Vec<i32>>();
assert_eq!(res.len(),100_000)

pub fn new(iter: I, f: F) -> Self

pub fn threads(self, nthreads: usize) -> Self

Set the thread pool size for running the parallel tasker.

pub fn collect<C>(self) -> C

where C: Collector<T>,

Collect the results of the Map in a type implementing Collector trait