Standard C++ Library Class Reference

Algorithms
#include <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
Complex Number
Library
#include <complex>
complex
Containers
#include <bitset>
#include <deque>
#include <list>
#include <map> for map
and multimap
#include <queue> for
queue and priority_queue
#include <set> for set and
multiset
#include <stack>
#include <vector>
bitset deque list map multimap multiset priority_queue queue
set stack vector
Function Adaptors
#include <functional>
bind1st bind2nd not1 not2 ptr_fun
Function Objects
#include <functional>
binary_function binary_negate binder1st binder2nd divides
equal_to greater greater_equal less less_equal logical_and
logical_not logical_or minus modulus negate not_equal_to plus
pointer_to_binary-function pointer_to_unary_function times
unary_function unary_negate
Generalized Numeric
Operations
#include <numeric>
accumulate adjacent_difference accumulate inner_product
partial_sum