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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
use super::plumbing::*;
use super::*;
/// `Flatten` turns each element to a parallel iterator, then flattens these iterators
/// together. This struct is created by the [`flatten()`] method on [`ParallelIterator`].
///
/// [`flatten()`]: trait.ParallelIterator.html#method.flatten
/// [`ParallelIterator`]: trait.ParallelIterator.html
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
#[derive(Debug, Clone)]
pub struct Flatten<I: ParallelIterator> {
base: I,
}
impl<I> Flatten<I>
where
I: ParallelIterator,
I::Item: IntoParallelIterator,
{
/// Creates a new `Flatten` iterator.
pub(super) fn new(base: I) -> Self {
Flatten { base }
}
}
impl<I> ParallelIterator for Flatten<I>
where
I: ParallelIterator,
I::Item: IntoParallelIterator,
{
type Item = <I::Item as IntoParallelIterator>::Item;
fn drive_unindexed<C>(self, consumer: C) -> C::Result
where
C: UnindexedConsumer<Self::Item>,
{
let consumer = FlattenConsumer::new(consumer);
self.base.drive_unindexed(consumer)
}
}
/// ////////////////////////////////////////////////////////////////////////
/// Consumer implementation
struct FlattenConsumer<C> {
base: C,
}
impl<C> FlattenConsumer<C> {
fn new(base: C) -> Self {
FlattenConsumer { base }
}
}
impl<T, C> Consumer<T> for FlattenConsumer<C>
where
C: UnindexedConsumer<T::Item>,
T: IntoParallelIterator,
{
type Folder = FlattenFolder<C, C::Result>;
type Reducer = C::Reducer;
type Result = C::Result;
fn split_at(self, index: usize) -> (Self, Self, C::Reducer) {
let (left, right, reducer) = self.base.split_at(index);
(
FlattenConsumer::new(left),
FlattenConsumer::new(right),
reducer,
)
}
fn into_folder(self) -> Self::Folder {
FlattenFolder {
base: self.base,
previous: None,
}
}
fn full(&self) -> bool {
self.base.full()
}
}
impl<T, C> UnindexedConsumer<T> for FlattenConsumer<C>
where
C: UnindexedConsumer<T::Item>,
T: IntoParallelIterator,
{
fn split_off_left(&self) -> Self {
FlattenConsumer::new(self.base.split_off_left())
}
fn to_reducer(&self) -> Self::Reducer {
self.base.to_reducer()
}
}
struct FlattenFolder<C, R> {
base: C,
previous: Option<R>,
}
impl<T, C> Folder<T> for FlattenFolder<C, C::Result>
where
C: UnindexedConsumer<T::Item>,
T: IntoParallelIterator,
{
type Result = C::Result;
fn consume(self, item: T) -> Self {
let par_iter = item.into_par_iter();
let consumer = self.base.split_off_left();
let result = par_iter.drive_unindexed(consumer);
let previous = match self.previous {
None => Some(result),
Some(previous) => {
let reducer = self.base.to_reducer();
Some(reducer.reduce(previous, result))
}
};
FlattenFolder {
base: self.base,
previous,
}
}
fn complete(self) -> Self::Result {
match self.previous {
Some(previous) => previous,
None => self.base.into_folder().complete(),
}
}
fn full(&self) -> bool {
self.base.full()
}
}
|
