.. |
adjacent_find.cpp
|
|
|
binary_search.cpp
|
|
|
copy_backward.cpp
|
|
|
copy_n.cpp
|
|
|
copy.cpp
|
|
|
count_if.cpp
|
|
|
count.cpp
|
|
|
equal_range.cpp
|
|
|
equal.cpp
|
|
|
fill.cpp
|
|
|
find_end.cpp
|
|
|
find_first_of.cpp
|
|
|
find_if.cpp
|
|
|
find.cpp
|
|
|
for_each.cpp
|
|
|
generate.cpp
|
|
|
heap.cpp
|
|
|
includes.cpp
|
|
|
inplace_merge.cpp
|
|
|
lexicographical_compare.cpp
|
|
|
lower_bound.cpp
|
|
|
max_element.cpp
|
|
|
merge.cpp
|
|
|
min_element.cpp
|
|
|
mismatch.cpp
|
|
|
next_permutation.cpp
|
|
|
nth_element.cpp
|
|
|
partial_sort.cpp
|
|
|
partition.cpp
|
|
|
prev_permutation.cpp
|
|
|
random_shuffle.cpp
|
|
|
remove_copy_if.cpp
|
|
|
remove_copy.cpp
|
|
|
remove_if.cpp
|
|
|
remove.cpp
|
|
|
replace_copy_if.cpp
|
|
|
replace_copy.cpp
|
|
|
replace_if.cpp
|
|
|
replace.cpp
|
|
|
reverse_copy.cpp
|
|
|
reverse.cpp
|
|
|
rotate_copy.cpp
|
|
|
rotate.cpp
|
|
|
search_n.cpp
|
|
|
search.cpp
|
|
|
set_difference.cpp
|
|
|
set_intersection.cpp
|
|
|
set_symmetric_difference.cpp
|
|
|
set_union.cpp
|
|
|
sort.cpp
|
|
|
stable_partition.cpp
|
|
|
stable_sort.cpp
|
|
|
swap_ranges.cpp
|
|
|
transform.cpp
|
|
|
unique_copy.cpp
|
|
|
unique.cpp
|
|
|
upper_bound.cpp
|
|
|