@@ -174,116 +174,116 @@ <h1><code>ExecutionPolicy</code> algorithm overloads</h1>
174
174
< table is ="cxx-table " id ="tab.parallel.algorithms " class ="list ">
175
175
< caption > Table of parallel algorithms</ caption >
176
176
< tr >
177
- < td > < ins > adjacent_difference</ ins > </ td >
178
- < td > adjacent_find</ td >
179
- < td > all_of</ td >
180
- < td > any_of</ td >
177
+ < td > < ins > < code > adjacent_difference</ code > </ ins > </ td >
178
+ < td > < code > adjacent_find</ code > </ td >
179
+ < td > < code > all_of</ code > </ td >
180
+ < td > < code > any_of</ code > </ td >
181
181
</ tr >
182
182
< tr >
183
- < td > copy</ td >
184
- < td > copy_if</ td >
185
- < td > copy_n</ td >
186
- < td > count</ td >
183
+ < td > < code > copy</ code > </ td >
184
+ < td > < code > copy_if</ code > </ td >
185
+ < td > < code > copy_n</ code > </ td >
186
+ < td > < code > count</ code > </ td >
187
187
</ tr >
188
188
< tr >
189
- < td > count_if</ td >
190
- < td > equal</ td >
191
- < td > exclusive_scan</ td >
192
- < td > fill</ td >
189
+ < td > < code > count_if</ code > </ td >
190
+ < td > < code > equal</ code > </ td >
191
+ < td > < code > exclusive_scan</ code > </ td >
192
+ < td > < code > fill</ code > </ td >
193
193
</ tr >
194
194
< tr >
195
- < td > fill_n</ td >
196
- < td > find</ td >
197
- < td > find_end</ td >
198
- < td > find_first_of</ td >
195
+ < td > < code > fill_n</ code > </ td >
196
+ < td > < code > find</ code > </ td >
197
+ < td > < code > find_end</ code > </ td >
198
+ < td > < code > find_first_of</ code > </ td >
199
199
</ tr >
200
200
< tr >
201
- < td > find_if</ td >
202
- < td > find_if_not</ td >
203
- < td > for_each</ td >
204
- < td > for_each_n</ td >
201
+ < td > < code > find_if</ code > </ td >
202
+ < td > < code > find_if_not</ code > </ td >
203
+ < td > < code > for_each</ code > </ td >
204
+ < td > < code > for_each_n</ code > </ td >
205
205
</ tr >
206
206
< tr >
207
- < td > generate</ td >
208
- < td > generate_n</ td >
209
- < td > includes</ td >
210
- < td > inclusive_scan</ td >
207
+ < td > < code > generate</ code > </ td >
208
+ < td > < code > generate_n</ code > </ td >
209
+ < td > < code > includes</ code > </ td >
210
+ < td > < code > inclusive_scan</ code > </ td >
211
211
</ tr >
212
212
< tr >
213
- < td > < ins > inner_product</ ins > </ td >
214
- < td > inplace_merge</ td >
215
- < td > is_heap</ td >
216
- < td > is_heap_until</ td >
213
+ < td > < ins > < code > inner_product</ code > </ ins > </ td >
214
+ < td > < code > inplace_merge</ code > </ td >
215
+ < td > < code > is_heap</ code > </ td >
216
+ < td > < code > is_heap_until</ code > </ td >
217
217
</ tr >
218
218
< tr >
219
- < td > is_partitioned</ td >
220
- < td > is_sorted</ td >
221
- < td > is_sorted_until</ td >
222
- < td > lexicographical_compare</ td >
219
+ < td > < code > is_partitioned</ code > </ td >
220
+ < td > < code > is_sorted</ code > </ td >
221
+ < td > < code > is_sorted_until</ code > </ td >
222
+ < td > < code > lexicographical_compare</ code > </ td >
223
223
</ tr >
224
224
< tr >
225
- < td > max_element</ td >
226
- < td > merge</ td >
227
- < td > min_element</ td >
228
- < td > minmax_element</ td >
225
+ < td > < code > max_element</ code > </ td >
226
+ < td > < code > merge</ code > </ td >
227
+ < td > < code > min_element</ code > </ td >
228
+ < td > < code > minmax_element</ code > </ td >
229
229
</ tr >
230
230
< tr >
231
- < td > mismatch</ td >
232
- < td > move</ td >
233
- < td > none_of</ td >
234
- < td > nth_element</ td >
231
+ < td > < code > mismatch</ code > </ td >
232
+ < td > < code > move</ code > </ td >
233
+ < td > < code > none_of</ code > </ td >
234
+ < td > < code > nth_element</ code > </ td >
235
235
</ tr >
236
236
< tr >
237
- < td > partial_sort</ td >
238
- < td > partial_sort_copy</ td >
239
- < td > partition</ td >
240
- < td > partition_copy</ td >
237
+ < td > < code > partial_sort</ code > </ td >
238
+ < td > < code > partial_sort_copy</ code > </ td >
239
+ < td > < code > partition</ code > </ td >
240
+ < td > < code > partition_copy</ code > </ td >
241
241
</ tr >
242
242
< tr >
243
- < td > reduce</ td >
244
- < td > remove</ td >
245
- < td > remove_copy</ td >
246
- < td > remove_copy_if</ td >
243
+ < td > < code > reduce</ code > </ td >
244
+ < td > < code > remove</ code > </ td >
245
+ < td > < code > remove_copy</ code > </ td >
246
+ < td > < code > remove_copy_if</ code > </ td >
247
247
</ tr >
248
248
< tr >
249
- < td > remove_if</ td >
250
- < td > replace</ td >
251
- < td > replace_copy</ td >
252
- < td > replace_copy_if</ td >
249
+ < td > < code > remove_if</ code > </ td >
250
+ < td > < code > replace</ code > </ td >
251
+ < td > < code > replace_copy</ code > </ td >
252
+ < td > < code > replace_copy_if</ code > </ td >
253
253
</ tr >
254
254
< tr >
255
- < td > replace_if</ td >
256
- < td > reverse</ td >
257
- < td > reverse_copy</ td >
258
- < td > rotate</ td >
255
+ < td > < code > replace_if</ code > </ td >
256
+ < td > < code > reverse</ code > </ td >
257
+ < td > < code > reverse_copy</ code > </ td >
258
+ < td > < code > rotate</ code > </ td >
259
259
</ tr >
260
260
< tr >
261
- < td > rotate_copy</ td >
262
- < td > search</ td >
263
- < td > search_n</ td >
264
- < td > set_difference</ td >
261
+ < td > < code > rotate_copy</ code > </ td >
262
+ < td > < code > search</ code > </ td >
263
+ < td > < code > search_n</ code > </ td >
264
+ < td > < code > set_difference</ code > </ td >
265
265
</ tr >
266
266
< tr >
267
- < td > set_intersection</ td >
268
- < td > set_symmetric_difference</ td >
269
- < td > set_union</ td >
270
- < td > sort</ td >
267
+ < td > < code > set_intersection</ code > </ td >
268
+ < td > < code > set_symmetric_difference</ code > </ td >
269
+ < td > < code > set_union</ code > </ td >
270
+ < td > < code > sort</ code > </ td >
271
271
</ tr >
272
272
< tr >
273
- < td > stable_partition</ td >
274
- < td > stable_sort</ td >
275
- < td > swap_ranges</ td >
276
- < td > transform</ td >
273
+ < td > < code > stable_partition</ code > </ td >
274
+ < td > < code > stable_sort</ code > </ td >
275
+ < td > < code > swap_ranges</ code > </ td >
276
+ < td > < code > transform</ code > </ td >
277
277
</ tr >
278
278
< tr >
279
- < td > uninitialized_copy</ td >
280
- < td > uninitialized_copy_n</ td >
281
- < td > uninitialized_fill</ td >
282
- < td > uninitialized_fill_n</ td >
279
+ < td > < code > uninitialized_copy</ code > </ td >
280
+ < td > < code > uninitialized_copy_n</ code > </ td >
281
+ < td > < code > uninitialized_fill</ code > </ td >
282
+ < td > < code > uninitialized_fill_n</ code > </ td >
283
283
</ tr >
284
284
< tr >
285
- < td > unique</ td >
286
- < td > unique_copy</ td >
285
+ < td > < code > unique</ code > </ td >
286
+ < td > < code > unique_copy</ code > </ td >
287
287
< td > </ td >
288
288
< td > </ td >
289
289
</ tr >
0 commit comments