moirai-iter 0.6.1

Parallel and async iterator combinators for Moirai concurrency library
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

use super::super::{Consumer, ParallelIterator, VecParIter};

#[repr(transparent)]
#[derive(Clone, Copy, Debug, Eq, PartialEq)]
struct StepSize(usize);

impl StepSize {
    fn new(value: usize) -> Self {
        assert!(value != 0, "step size must be non-zero");
        Self(value)
    }

    const fn get(self) -> usize {
        self.0
    }
}

/// Indexed step-by adapter with exact-size source semantics.
pub struct StepBy<I> {
    pub(in crate::parallel) base: I,
    step: StepSize,
}

impl<I> StepBy<I> {
    pub(in crate::parallel) fn new(base: I, step: usize) -> Self {
        Self {
            base,
            step: StepSize::new(step),
        }
    }

    pub(in crate::parallel) fn step(&self) -> usize {
        self.step.get()
    }
}

impl<I> ParallelIterator for StepBy<I>
where
    I: ParallelIterator,
    I::Item: Sync + 'static,
{
    type Item = I::Item;

    fn seq_items(self) -> Vec<Self::Item> {
        self.base
            .seq_items()
            .into_iter()
            .step_by(self.step.get())
            .collect()
    }

    /// # Why this stays sequential
    ///
    /// Which of a shard's items survive depends on the shard's logical start
    /// index modulo `step`, the same absent offset documented on
    /// [`Enumerate`](super::ref_ops::Enumerate).
    fn drive<C, R>(self, consumer: C) -> R
    where
        C: Consumer<Self::Item, Result = R> + Send + Sync,
        R: Send,
    {
        consumer.consume(VecParIter::new(self.seq_items()))
    }
}