transform_inclusive_scan |
1 |
First, Arg |
1 |
aR, uT |
|
O(N) |
∥ |
|
20 |
|---|
transform_exclusive_scan |
1 |
Arg |
1 |
aR, uT |
|
O(N) |
∥ |
|
20 |
|---|
partial_sum |
1 |
First |
1 |
A |
plus |
O(N), =(N - 1) |
Fwd. |
|
30 |
|---|
inclusive_scan |
1 |
First, Arg |
1 |
aR |
plus |
O(N) |
∥ |
|
30 |
|---|
exclusive_scan |
1 |
Arg |
1 |
aR |
plus |
O(N) |
∥ |
|
30 |
|---|
adjacent_difference |
1s |
Quasi |
1 |
fD |
minus |
O(N), =(N - 1) |
Fwd.∥ |
adjacent_transform |
40 |
|---|
adjacent_transform▸ |
1s |
Quasi |
1 |
D |
|
O(N), =(N - 1) |
Fwd.∥ |
adjacent_difference |
40 |
|---|
adjacent_inclusive_scan▸ |
1s |
First |
1 |
A, D |
|
O(N) |
Fwd. |
|
50 |
|---|
transform |
1 / 2 |
|
1 |
uT / bT |
|
=(N) |
∥ |
|
60 |
|---|
copy, copy_n |
1 |
|
1 |
|
|
=(N) |
Fwd.∥ |
transform |
60 |
|---|
copy_backward |
1 |
|
1 |
|
|
=(N) |
Rev. |
|
60 |
|---|
move |
1 |
|
1 |
|
|
=(N) |
Fwd.∥ |
shift_left |
60 |
|---|
move_backward |
1 |
|
1 |
|
|
=(N) |
Rev. |
shift_right |
60 |
|---|
replace_copy |
1+Value |
Arg |
1 |
|
equal_to |
=(N) |
Fwd.∥ |
transform |
60 |
|---|
replace_copy_if |
1 |
Arg |
1 |
uP |
|
=(N) |
Fwd.∥ |
transform |
60 |
|---|
reverse_copy |
1 |
|
1 |
|
|
=(N) |
∥ |
transform |
60 |
|---|
rotate_copy |
1d |
|
1 |
|
|
O(N) |
∥ |
|
60 |
|---|
sample |
1 |
Arg |
1 |
|
|
O(N) |
Fwd. |
|
60 |
|---|
partial_sort_copy |
1 |
|
1 |
bP |
less |
O(N log(min(D,N)) |
∥ |
|
60 |
|---|
partition_copy |
1 |
|
2 |
uP |
|
=(N) |
Fwd.∥ |
|
63 |
|---|
transform_if |
1 |
|
1 |
uP, uT |
|
O(N) |
Fwd. |
|
65 |
|---|
copy_if, remove_copy_if |
1 |
|
1 |
uP |
|
O(N) |
Fwd.∥ |
transform_if |
65 |
|---|
remove_copy |
1+Value |
|
1 |
|
equal_to |
=(N) |
Fwd.∥ |
transform_if |
65 |
|---|
unique_copy |
1 |
First |
1 |
bP |
equal_to |
O(N) |
Fwd.∥ |
|
65 |
|---|
set_difference, set_intersection, set_symmetric_difference, set_union |
2 |
|
1 |
bP |
less |
O(N+M), ≤(2â‹…(N+M)−1) |
Fwd.∥ |
|
67 |
|---|
merge |
2 |
|
1 |
bP |
less |
O(N+M) |
Fwd.∥ |
|
67 |
|---|
regex_replace⧫ |
2 |
|
1 |
Regex⧫ |
|
Unspc. |
|
See note⧫ |
68 |
|---|
search_replace_copy |
3 |
|
1 |
bP |
equal_to |
O(N×(S+R)) |
|
regex_replace⧫ |
68 |
|---|
generate, generate_n |
0 |
|
1 |
G |
|
=(N) |
Fwd.∥ |
|
100 |
|---|
iota |
0 |
Arg |
1 |
|
++ |
=(N) |
Fwd. |
generate |
100 |
|---|
iota |
0 |
Arg |
1 |
uT |
++ |
=(N) |
Fwd. |
generate |
100 |
|---|
fill, fill_n |
0 |
Arg |
1 |
|
|
=(N) |
Fwd.∥ |
generate, generate_n |
100 |
|---|
for_each, for_each_n |
1 |
|
0∅ |
muT |
|
=(N) |
Fwd.∥ |
|
140 |
|---|
for_each, for_each_n |
1 / 2 |
|
0∅ |
muT / mbT |
|
=(N) |
Fwd. |
|
140 |
|---|
swap_ranges |
2 |
|
Self |
|
swap |
O(N) |
Fwd.∥ |
for_each |
140 |
|---|
remove |
1+Value |
|
Self |
|
equal_to |
O(N) |
Fwd.∥ |
|
150 |
|---|
remove_if |
1 |
|
Self |
uP |
|
O(N) |
Fwd.∥ |
|
150 |
|---|
unique |
1 |
|
Self |
bP |
equal_to |
O(N) |
Fwd.∥ |
|
150 |
|---|
replace |
1+Value |
|
Self |
|
equal_to |
=(N) |
Fwd.∥ |
transform |
160 |
|---|
replace_if |
1 |
|
Self |
uP |
|
=(N) |
Fwd.∥ |
transform |
160 |
|---|
reverse |
1 |
|
Self |
|
|
O(N), =(N/2) |
Yes∥ |
swap_ranges |
170 |
|---|
rotate |
1d |
|
Self |
|
|
O(N) |
Yes∥ |
|
170 |
|---|
shift_left |
1d |
|
Self |
|
|
≤(N-n) |
Fwd.∥ |
move |
170 |
|---|
shift_right |
1d |
|
Self |
|
|
≤(N-n) |
Yes∥ |
move_backward |
170 |
|---|
shuffle |
1+URBG |
|
Self |
|
|
O(N) |
|
|
170 |
|---|
next_permutation, prev_permutation |
1 |
|
Self |
|
|
O(N), ≤(N/2) |
|
|
170 |
|---|
partition |
1 |
|
Self |
uP |
|
O(N); O(N log N)↓∥ |
∥ |
|
170 |
|---|
stable_partition |
1 |
|
Self |
uP |
|
O(N) w/ memory, else O(N log N); O(N log N)↓∥ |
∥ |
|
170 |
|---|
sort |
1 |
|
Self |
bP |
less |
O(N log N) |
∥ |
|
170 |
|---|
partial_sort |
1 |
|
Self |
bP |
less |
O(N log M) |
∥ |
|
170 |
|---|
stable_sort |
1 |
|
Self |
bP |
less |
O(N log N) w/ memory, else O(N log(N)2) |
∥ |
|
170 |
|---|
nth_element |
1 |
|
Self |
bP |
less |
O(N); O(N log N)↓∥ |
∥ |
|
170 |
|---|
make_heap |
1 |
|
Self |
bP |
less |
O(N), ≤(3N) |
|
|
170 |
|---|
push_heap, pop_heap |
1 |
|
Self |
bP |
less |
O(log N) |
|
|
170 |
|---|
sort_heap |
1 |
|
Self |
bP |
less |
O(N log N) |
|
|
170 |
|---|
inplace_merge |
1d |
|
Self |
bP |
less |
=(N-1) w/ memory, O(N log N); O(N log N)↓∥ |
∥ |
|
170 |
|---|