Objectives
In this chapter you’ll:
• Program with many of the dozens of Standard Library algorithms.
• Use iterators with algorithms to access and manipulate the elements of Standard Library containers.
• Pass function pointers, function objects and lambda expressions into Standard Library algorithms.
16.2 Minimum Iterator Requirements
16.3.1 fill
, fill_n
, generate
and generate_n
16.3.2 equal
, mismatch
and lexicographical_compare
16.3.3 remove
, remove_if
, remove_copy
and remove_copy_if
16.3.4 replace
, replace_if
, replace_copy
and replace_copy_if
16.3.5 Mathematical Algorithms
16.3.6 Basic Searching and Sorting Algorithms
16.3.7 swap
, iter_swap
and swap_ranges
16.3.8 copy_backward
, merge
, unique
and reverse
16.3.9 inplace_merge
, unique_copy
and reverse_copy
16.3.11 lower_bound
, upper_bound
and equal_range
16.3.13 min
, max
, minmax
and minmax_element
16.6 Standard Library Algorithm Summary
3.144.91.24