@@ -107,25 +107,10 @@ <h1>Non-Numeric Parallel Algorithms</h1>
107
107
< h1 > Header < code > <experimental/algorithm></ code > synopsis</ h1 >
108
108
109
109
< pre >
110
- < ins > #include <algorithm>
111
- </ ins >
112
- < del > namespace std {</ del >
113
- namespace < ins > std::</ ins > experimental {
114
- < ins > inline </ ins > namespace parallel< ins > ism_v2</ ins > {
115
- < del > inline namespace v2 {
116
- template<class ExecutionPolicy,
117
- class InputIterator, class Function>
118
- void for_each(ExecutionPolicy&& exec,
119
- InputIterator first, InputIterator last,
120
- Function f);
121
- template<class InputIterator, class Size, class Function>
122
- InputIterator for_each_n(InputIterator first, Size n,
123
- Function f);
124
- template<class ExecutionPolicy,
125
- class InputIterator, class Size, class Function>
126
- InputIterator for_each_n(ExecutionPolicy&& exec,
127
- InputIterator first, Size n,
128
- Function f);</ del >
110
+ #include <algorithm>
111
+
112
+ namespace std::experimental {
113
+ inline namespace parallelism_v2 {
129
114
130
115
namespace execution {
131
116
< cxx-ref insynopsis ="" to ="parallel.alg.novec "> </ cxx-ref >
@@ -140,7 +125,6 @@ <h1>Header <code><experimental/algorithm></code> synopsis</h1>
140
125
template<class T>
141
126
ordered_update_t<T> ordered_update(T& ref) noexcept;
142
127
}
143
- < ins >
144
128
145
129
// Exposition only: Suppress template argument deduction.
146
130
template<class T> struct no_deduce { using type = T; };
@@ -197,11 +181,8 @@ <h1>Header <code><experimental/algorithm></code> synopsis</h1>
197
181
class I, class Size, class S, class... Rest>
198
182
void for_loop_n_strided(ExecutionPolicy&& exec,
199
183
I start, Size n, S stride, Rest&&... rest);
200
- </ ins >
201
- < del > }</ del >
202
184
}
203
185
}
204
- < del > }</ del >
205
186
</ pre >
206
187
</ cxx-section >
207
188
0 commit comments