Skip to content

Commit 1783cf9

Browse files
jaredhoberockjaredhoberock
committed
Transpose Table 1 to make it easier to maintain
Add replace_if & is_heap_until to Table 1 Fixes n3554/n3554#53 Fixes n3554/n3554#56 Fixes n3554/n3554#59
1 parent 0bc6255 commit 1783cf9

File tree

2 files changed

+188
-108
lines changed

2 files changed

+188
-108
lines changed

‎algorithms.html

Lines changed: 114 additions & 108 deletions
Original file line numberDiff line numberDiff line change
@@ -166,114 +166,120 @@ <h1><code>ExecutionPolicy</code> algorithm overloads</h1>
166166

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

‎algorithms_list.txt

Lines changed: 74 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,74 @@
1+
adjacent_difference
2+
adjacent_find
3+
all_of
4+
any_of
5+
copy
6+
copy_if
7+
copy_n
8+
count
9+
count_if
10+
equal
11+
exclusive_scan
12+
fill
13+
fill_n
14+
find
15+
find_end
16+
find_first_of
17+
find_if
18+
find_if_not
19+
for_each
20+
for_each_n
21+
generate
22+
generate_n
23+
includes
24+
inclusive_scan
25+
inner_product
26+
inplace_merge
27+
is_heap
28+
is_heap_until
29+
is_partitioned
30+
is_sorted
31+
is_sorted_until
32+
lexicographical_compare
33+
max_element
34+
merge
35+
min_element
36+
minmax_element
37+
mismatch
38+
move
39+
none_of
40+
nth_element
41+
partial_sort
42+
partial_sort_copy
43+
partition
44+
partition_copy
45+
reduce
46+
remove
47+
remove_copy
48+
remove_copy_if
49+
remove_if
50+
replace
51+
replace_copy
52+
replace_copy_if
53+
replace_if
54+
reverse
55+
reverse_copy
56+
rotate
57+
rotate_copy
58+
search
59+
search_n
60+
set_difference
61+
set_intersection
62+
set_symmetric_difference
63+
set_union
64+
sort
65+
stable_partition
66+
stable_sort
67+
swap_ranges
68+
transform
69+
uninitialized_copy
70+
uninitialized_copy_n
71+
uninitialized_fill
72+
uninitialized_fill_n
73+
unique
74+
unique_copy

0 commit comments

Comments
 (0)