ajf adjacent_find
alo all_of
ano any_of
cni count_if
cnt count
eql equal
ffo find_first_of
fin find_if_not
fnd find
fne find_end
fni find_if
fre for_each
ihp is_heap
ihu is_heap_until
ipr is_permutation
ipt is_partitioned
iss is_sorted
isu is_sorted_until
lxc lexigraphical_compare
mme minmax_element
mne min_element
msm mismatch
mxe max_element
nno none_of
ppt partition_point
srh search
srn search_n
mkh make_heap
nth nth_element
phh push_heap
pph pop_heap
psc partial_sort_copy
pst partial_sort
ptc partition_copy
ptn partition
spt stable_partition
srt sort
sth sort_heap
sts stable_sort
bns binary_search
eqr equal_range
erl equal_range
inc includes
ipm inplace_merge
lwb lower_bound
mrg merge
ssd set_symmetric_difference
std set_difference
stn set_intersection
stu set_union
ucp unique_copy
upb upper_bound
cpb copy_backward
cpi copy_if
cpn copy_n
cpy copy
fil fill
fln fill_n
gnn generate_n
gnr generate
ita iota
mov move
mvb move_backward
rci replace_copy_if
rpc replace_copy
rpi replace_if
rpl replace
swp swap
swr swap_ranges
tfm transform
rmc remove_copy
rmf remove_copy_if
rmi remove_if
rmv remove
uqe unique
nxp next_permutation
prp prev_permutation
rtc rotate_copy
rte rotate
rvc reverse_copy
rvr reverse
shf random_shuffle
acl accumulate
acm accumulate
erm erase
ltr string_trim_left
lwr string_lower
trm string_trim_right
upr string_upper
oit copy
sti cin
sto cout
stv vector