Standard C++ Library Reference ISO/IEC (VERSION3)

Next
<algorithm>
adjacent_find · binary_search · copy · copy_backward · count ·
count_if · equal · equal_range · fill · fill_n · find · find_end
· find_first_of · find_if · for_each · generate · generate_n ·
includes · inplace_merge · iter_swap · lexicographical_compare ·
lower_bound · make_heap · max · max_element · merge · min ·
min_element · mismatch · next_permutation · nth_element ·
partial_sort · partial_sort_copy · partition · pop_heap ·
prev_permutation · push_heap · random_shuffle · remove ·
remove_copy · remove_copy_if · remove_if · replace · replace_copy
· replace_copy_if · replace_if · reverse · reverse_copy · rotate
· rotate_copy · search · search_n · set_difference ·
set_intersection · set_symmetric_difference · set_union · sort ·
sort_heap · stable_partition · stable_sort · swap · swap_ranges ·
transform · unique · unique_copy · upper_bound
Include the STL standard header <algorithm> to define numerous template functions that
perform useful algorithms. The descriptions that follow make extensive use of common template
parameter names (or prefixes) to indicate the least powerful category of iterator permitted as an
actual argument type:
OutIt -- to indicate an output iterator●
InIt -- to indicate an input iterator●
FwdIt -- to indicate a forward iterator●
BidIt -- to indicate a bidirectional iterator●
RanIt -- to indicate a random-access iterator●
The descriptions of these templates employ a number of conventions common to all algorithms.
namespace std {
template<class InIt, class Fn1>
Fun for_each(InIt first, InIt last, Fn1 func);
template<class InIt, class Ty>
InIt find(InIt first, InIt last, const Ty& val);
template<class InIt, class Pr>
InIt find_if(InIt first, InIt last, Pr pred);
template<class FwdIt1, class FwdIt2>