20 [lib.utilities] namespace rel_ops { operators !=, >, <=, >= } struct pair; pair binary operators { operators ==, <, !=, >, >=, <= } // function objects, or objects with operator() defined template class allocator; template<> class allocator; template class raw_storage_iterator; temporary buffers specialized algorithms for uninitialized_{copy, fill, fill_n} template class auto_ptr; 21 [lib.strings] template struct char_traits template<> struct char_traits template<> struct char_traits template, A=a > class basic_string; typedef basic_string string; typedef basic_string wstring; template void swap(string&, string&) template istream& operator>>(istream&, string&); template istream& getline(istream&, string&, C); template istream& getline(istream&, string&); template ostream& operator<<(ostream&, string&); 23 [lib.containers] 24 [lib.iterators] 25 [lib.algorithms] non-modifying sequence operations for_each, find, find_if, find_end, find_first_of, adjacent_find, count, count_if, mismatch, equal, search, search_n modifying sequence operations copy, copy_backward, swap, swap_ranges, iter_swap, transform, replace, replace_if, replace_copy, replace_copy_if, fill, fill_n, generate, generate_n, remove, remove_if, remove_copy, remove_copy_if, unique, unique_copy, reverse, reverse_copy, rotate, rotate_copy, random_shuffle sorting and related operations sort, stable_sort, partial_sort, partial_sort_copy, nth_element, lower_bound, upper_bound, equal_range, binary_search, merge, inplace_merge, includes, set_union, set_intersection, set_difference, set_symmetric_difference, push_heap, pop_heap, make_heap, sort_heap, min, max, min_element, max_element, lexicographical_compare, next_permutation, prev_permutation