-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathmaybe_parallel.hpp
More file actions
239 lines (214 loc) · 8.05 KB
/
maybe_parallel.hpp
File metadata and controls
239 lines (214 loc) · 8.05 KB
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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
//=======================================================================
// Copyright (c) 2013-2020 Baptiste Wicht
// Distributed under the terms of the MIT License.
// (See accompanying file LICENSE or copy at
// http://opensource.org/licenses/MIT)
//=======================================================================
/*!
* \file maybe_parallel.hpp
* \brief Contains algorithms that can either be executed
* concurrently or linearly based on a compile-time switch.
*/
#ifndef CPP_UTILS_MAYBE_PARALLEL_HPP
#define CPP_UTILS_MAYBE_PARALLEL_HPP
#include "algorithm.hpp"
#include "parallel.hpp"
namespace cpp {
/*!
* \brief A conditional thread pool
* \tparam Parallel Defines if the thread pool is parallel or not
*/
template <bool Parallel>
struct thread_pool {
/*!
* \brief Construct the thread pool and forward the args to the
* real implementation (if any)
*/
template<typename... Args>
explicit thread_pool(Args... /*args*/){
//Does not do anything by default
}
};
/*!
* \copydoc thread_pool
*/
template <>
struct thread_pool<true> : default_thread_pool<> {
/*!
* \brief Construct the thread pool and forward the args to the
* real implementation (if any)
*/
template<typename... Args>
explicit thread_pool(Args... args) : default_thread_pool<>(std::forward<Args>(args)...){
//Simply inherits from default thread pool
}
};
//parallel versions
/*!
* \brief Apply the given function to each element of the given
* container, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param container The container to iterate
* \param fun The functor to apply
*/
template <typename Container, typename Functor>
void maybe_parallel_foreach(thread_pool<true>& thread_pool, const Container& container, Functor&& fun) {
parallel_foreach(thread_pool, container, std::forward<Functor>(fun));
}
/*!
* \brief Apply the given function to each element of the given
* range, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param first The beginning of the range
* \param last The end of the range
* \param fun The functor to apply
*/
template <typename Iterator, typename Functor>
void maybe_parallel_foreach(thread_pool<true>& thread_pool, Iterator first, Iterator last, Functor&& fun) {
parallel_foreach(thread_pool, first, last, std::forward<Functor>(fun));
}
/*!
* \brief Apply the given function to each element of the given
* container and its position, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param container The container to iterate
* \param fun The functor to apply
*/
template <typename Container, typename Functor>
void maybe_parallel_foreach_i(thread_pool<true>& thread_pool, const Container& container, Functor&& fun) {
parallel_foreach_i(thread_pool, container, std::forward<Functor>(fun));
}
/*!
* \brief Apply the given function to each element of the given
* range and its position, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param it The beginning of the range
* \param end The end of the range
* \param fun The functor to apply
*/
template <typename Iterator, typename Functor>
void maybe_parallel_foreach_i(thread_pool<true>& thread_pool, Iterator it, Iterator end, Functor&& fun) {
parallel_foreach_i(thread_pool, it, end, std::forward<Functor>(fun));
}
/*!
* \brief Apply the given function to each pair of element of the given
* ranges and its position, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param it The beginning of the first range
* \param end The end of the first range
* \param iit The beginning of the second range
* \param ilast The end of the second range
* \param fun The functor to apply
*/
template <typename Iterator, typename Iterator2, typename Functor>
void maybe_parallel_foreach_pair_i(thread_pool<true>& thread_pool, Iterator it, Iterator end, Iterator2 iit, Iterator2 ilast, Functor&& fun) {
parallel_foreach_pair_i(thread_pool, it, end, iit, ilast, std::forward<Functor>(fun));
}
/*!
* \brief Apply the given function to each position in the given
* range, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param first The beginning of the range
* \param last The end of the range
* \param fun The functor to apply
*/
template <typename Functor>
void maybe_parallel_foreach_n(thread_pool<true>& thread_pool, std::size_t first, std::size_t last, Functor&& fun) {
parallel_foreach_n(thread_pool, first, last, std::forward<Functor>(fun));
}
//non-parallel versions
/*!
* \brief Apply the given function to each element of the given
* container, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param container The container to iterate
* \param fun The functor to apply
*/
template <typename Container, typename Functor>
void maybe_parallel_foreach(thread_pool<false>& thread_pool, const Container& container, Functor&& fun) {
cpp_unused(thread_pool);
foreach (container, fun);
}
/*!
* \brief Apply the given function to each element of the given
* range, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param first The beginning of the range
* \param last The end of the range
* \param fun The functor to apply
*/
template <typename Iterator, typename Functor>
void maybe_parallel_foreach(thread_pool<false>& thread_pool, Iterator first, Iterator last, Functor&& fun) {
cpp_unused(thread_pool);
foreach (first, last, fun);
}
/*!
* \brief Apply the given function to each element of the given
* container and its position, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param container The container to iterate
* \param fun The functor to apply
*/
template <typename Container, typename Functor>
void maybe_parallel_foreach_i(thread_pool<false>& thread_pool, const Container& container, Functor&& fun) {
cpp_unused(thread_pool);
foreach_i(container, fun);
}
/*!
* \brief Apply the given function to each element of the given
* range and its position, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param it The beginning of the range
* \param end The end of the range
* \param fun The functor to apply
*/
template <typename Iterator, typename Functor>
void maybe_parallel_foreach_i(thread_pool<false>& thread_pool, Iterator it, Iterator end, Functor&& fun) {
cpp_unused(thread_pool);
foreach_i(it, end, fun);
}
/*!
* \brief Apply the given function to each pair of element of the given
* ranges and its position, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param it The beginning of the first range
* \param end The end of the first range
* \param iit The beginning of the second range
* \param ilast The end of the second range
* \param fun The functor to apply
*/
template <typename Iterator, typename Iterator2, typename Functor>
void maybe_parallel_foreach_pair_i(thread_pool<false>& thread_pool, Iterator it, Iterator end, Iterator2 iit, Iterator2 ilast, Functor&& fun) {
cpp_unused(thread_pool);
cpp_unused(ilast);
for (std::size_t i = 0; it != end; ++it, ++iit, ++i) {
fun(*it, *iit, i);
}
}
/*!
* \brief Apply the given function to each position in the given
* range, in parallel if the thread pool is paralle,
* sequentially otherwise.
* \param thread_pool The thread pool
* \param first The beginning of the range
* \param last The end of the range
* \param fun The functor to apply
*/
template <typename functor>
void maybe_parallel_foreach_n(thread_pool<false>& thread_pool, std::size_t first, std::size_t last, functor&& fun) {
cpp_unused(thread_pool);
foreach_n(first, last, fun);
}
} //end of dll namespace
#endif