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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
use crate::{Array, ArrayBase, DataMut, Dimension, IntoNdProducer, NdProducer, Zip};
use crate::AssignElem;
use crate::parallel::prelude::*;
use crate::parallel::par::ParallelSplits;
use super::send_producer::SendProducer;
use crate::partial::Partial;
impl<A, S, D> ArrayBase<S, D>
where
S: DataMut<Elem = A>,
D: Dimension,
A: Send + Sync,
{
pub fn par_map_inplace<F>(&mut self, f: F)
where
F: Fn(&mut A) + Sync + Send,
{
self.view_mut().into_par_iter().for_each(f)
}
pub fn par_mapv_inplace<F>(&mut self, f: F)
where
F: Fn(A) -> A + Sync + Send,
A: Clone,
{
self.view_mut()
.into_par_iter()
.for_each(move |x| *x = f(x.clone()))
}
}
const COLLECT_MAX_SPLITS: usize = 10;
macro_rules! zip_impl {
($([$notlast:ident $($p:ident)*],)+) => {
$(
#[allow(non_snake_case)]
impl<D, $($p),*> Zip<($($p,)*), D>
where $($p::Item : Send , )*
$($p : Send , )*
D: Dimension,
$($p: NdProducer<Dim=D> ,)*
{
pub fn par_for_each<F>(self, function: F)
where F: Fn($($p::Item),*) + Sync + Send
{
self.into_par_iter().for_each(move |($($p,)*)| function($($p),*))
}
#[deprecated(note="Renamed to .par_for_each()", since="0.15.0")]
pub fn par_apply<F>(self, function: F)
where F: Fn($($p::Item),*) + Sync + Send
{
self.into_par_iter().for_each(move |($($p,)*)| function($($p),*))
}
expand_if!(@bool [$notlast]
pub fn par_map_collect<R>(self, f: impl Fn($($p::Item,)* ) -> R + Sync + Send)
-> Array<R, D>
where R: Send
{
let mut output = self.uninitalized_for_current_layout::<R>();
let total_len = output.len();
let splits = unsafe {
ParallelSplits {
iter: self.and(SendProducer::new(output.raw_view_mut().cast::<R>())),
max_splits: COLLECT_MAX_SPLITS,
}
};
let collect_result = splits.map(move |zip| {
unsafe {
zip.collect_with_partial(&f)
}
})
.reduce(Partial::stub, Partial::try_merge);
if std::mem::needs_drop::<R>() {
debug_assert_eq!(total_len, collect_result.len,
"collect len is not correct, expected {}", total_len);
assert!(collect_result.len == total_len,
"Collect: Expected number of writes not completed");
}
collect_result.release_ownership();
unsafe {
output.assume_init()
}
}
#[deprecated(note="Renamed to .par_map_collect()", since="0.15.0")]
pub fn par_apply_collect<R>(self, f: impl Fn($($p::Item,)* ) -> R + Sync + Send)
-> Array<R, D>
where R: Send
{
self.par_map_collect(f)
}
pub fn par_map_assign_into<R, Q>(self, into: Q, f: impl Fn($($p::Item,)* ) -> R + Sync + Send)
where Q: IntoNdProducer<Dim=D>,
Q::Item: AssignElem<R> + Send,
Q::Output: Send,
{
self.and(into)
.par_for_each(move |$($p, )* output_| {
output_.assign_elem(f($($p ),*));
});
}
#[deprecated(note="Renamed to .par_map_assign_into()", since="0.15.0")]
pub fn par_apply_assign_into<R, Q>(self, into: Q, f: impl Fn($($p::Item,)* ) -> R + Sync + Send)
where Q: IntoNdProducer<Dim=D>,
Q::Item: AssignElem<R> + Send,
Q::Output: Send,
{
self.par_map_assign_into(into, f)
}
);
}
)+
}
}
zip_impl! {
[true P1],
[true P1 P2],
[true P1 P2 P3],
[true P1 P2 P3 P4],
[true P1 P2 P3 P4 P5],
[false P1 P2 P3 P4 P5 P6],
}