parallel_task 0.6.0

A fast data parallelism library for Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

//! TaskQueue stores the AtomicIterator that allows a unique value to be popped up for each
//! thread that enquires the same. 
//! 
use crate::prelude::AtomicIterator;

pub struct TaskQueue<I,V> 
where I:AtomicIterator<AtomicItem = V> + Send + Sized,
V: Send
{
    pub iter: I
}

impl<I,V> TaskQueue<I,V> 
where I:AtomicIterator<AtomicItem = V> + Send + Sized,
V:Send
{
    /// Pops a unique value from the TaskQueue. It returns None when all values are done, which is the 
    /// signal for the threads to (return and) exit.
    pub fn pop(&mut self) -> Option<V> {
        // let tm = std::time::Instant::now();
        // let x = self.iter.atomic_next();
        // println!("Pop time = {}",tm.elapsed().as_nanos());
        // x
        self.iter.atomic_next()
    }

    pub fn pull(&mut self) -> Option<Vec<V>> {
        self.iter.atomic_pull()
    }
}