| accumulate |
| 可适配二元函数 |
| 可适配二元谓词 |
| 可适配生成器 |
| 可适配谓词 |
| 可适配一元函数 |
| adjacent_difference |
| adjacent_find |
| advance |
| 分配器 |
| 可赋值 |
| 关联容器 |
| 尾部插入序列 |
| back_insert_iterator<BackInsertionSequence> |
| basic_string<charT, traits, Alloc> |
| 双向迭代器 |
| bidirectional_iterator<T, Distance> |
| bidirectional_iterator_tag |
| 二元函数 |
| 二元谓词 |
| binary_compose<AdaptableBinaryFunction,AdaptableUnaryFunction1,AdaptableUnaryFunction2> |
| binary_function<Arg1, Arg2, Result> |
| binary_negate<AdaptableBinaryPredicate> |
| binary_search |
| binder1st<AdaptableBinaryFunction> |
| binder2nd<AdaptableBinaryFunction> |
| bit_vector |
| bitset<N> |
| char_producer |
| char_traits |
| 字符特征 |
| construct |
| 容器 |
| copy |
| copy_backward |
| copy_n |
| count |
| count_if |
| 默认可构造 |
| deque<T, Alloc> |
| destroy |
| distance |
| distance_type |
| divides<T> |
| equal |
| equal_range |
| equal_to<T> |
| 相等可比较 |
| fill |
| fill_n |
| find |
| find_end |
| find_first_of |
| find_if |
| for_each |
| 前向容器 |
| 前向迭代器 |
| forward_iterator<T, Distance> |
| forward_iterator_tag |
| 头部插入序列 |
| front_insert_iterator<FrontInsertionSequence> |
| 函数对象 |
| generate |
| generate_n |
| 生成器 |
| get_temporary_buffer |
| greater<T> |
| greater_equal<T> |
| 哈希函数 |
| hash<T> |
| hash_map<Key, Data, HashFcn, EqualKey, Alloc> |
| hash_multimap<Key, Data, HashFcn, EqualKey, Alloc> |
| hash_multiset<Key, HashFcn, EqualKey, Alloc> |
| hash_set<Key, HashFcn, EqualKey, Alloc> |
| 哈希关联容器 |
| identity<T> |
| includes |
| inner_product |
| inplace_merge |
| 输入迭代器 |
| input_iterator<T, Distance> |
| input_iterator_tag |
| insert_iterator<Container> |
| iota |
| is_heap |
| is_sorted |
| istream_iterator<T, Distance> |
| iter_swap |
| 迭代器标签 |
| iterator_category |
| iterator_traits<Iterator> |
| 迭代器 |
| less<T> |
| less_equal<T> |
| 小于可比较 |
| lexicographical_compare |
| lexicographical_compare_3way |
| list<T, Alloc> |
| logical_and<T> |
| logical_not<T> |
| logical_or<T> |
| lower_bound |
| make_heap |
| map<Key, Data, Compare, Alloc> |
| max |
| max_element |
| mem_fun1_ref_t<Result, X, Arg> |
| mem_fun1_t<Result, X, Arg> |
| mem_fun_ref_t<Result, X> |
| mem_fun_t<Result, X> |
| merge |
| min |
| min_element |
| minus<T> |
| mismatch |
| modulus<T> |
| 幺半群运算 |
| multimap<Key, Data, Compare, Alloc> |
| 多关联容器 |
| 多哈希关联容器 |
| 多排序关联容器 |
| multiplies<T> |
| multiset<Key, Compare, Alloc> |
| negate<T> |
| next_permutation |
| not_equal_to<T> |
| nth_element |
| ostream_iterator<T> |
| 输出迭代器 |
| output_iterator |
| output_iterator_tag |
| 对关联容器 |
| pair<T1, T2> |
| partial_sort |
| partial_sort_copy |
| partial_sum |
| partition |
| plus<T> |
| pointer_to_binary_function<Arg1, Arg2, Result> |
| pointer_to_unary_function<Arg, Result> |
| pop_heap |
| power |
| 谓词 |
| prev_permutation |
| priority_queue<T, Sequence, Compare> |
| project1st<Arg1, Arg2> |
| project2nd<Arg1, Arg2> |
| ptr_fun |
| push_heap |
| queue<T, Sequence> |
| 随机访问容器 |
| 随机访问迭代器 |
| 随机数生成器 |
| random_access_iterator<T, Distance> |
| random_access_iterator_tag |
| random_sample |
| random_sample_n |
| random_shuffle |
| raw_storage_iterator<ForwardIterator, T> |
| 关系运算符 |
| remove |
| remove_copy |
| remove_copy_if |
| remove_if |
| replace |
| replace_copy |
| replace_copy_if |
| replace_if |
| return_temporary_buffer |
| reverse |
| reverse_bidirectional_iterator<BidirectionalIterator, T, Reference, Distance> |
| reverse_copy |
| reverse_iterator<RandomAccessIterator, T, Reference, Distance> |
| 可逆容器 |
| rope<T, Alloc> |
| rotate |
| rotate_copy |
| search |
| search_n |
| select1st<Pair> |
| select2nd<Pair> |
| 序列 |
| sequence_buffer<Container, buf_sz> |
| set<Key, Compare, Alloc> |
| set_difference |
| set_intersection |
| set_symmetric_difference |
| set_union |
| 简单关联容器 |
| slist<T, Alloc> |
| sort |
| sort_heap |
| 排序关联容器 |
| stable_partition |
| stable_sort |
| stack<T, Sequence> |
| 严格弱排序 |
| subtractive_rng |
| swap |
| swap_ranges |
| temporary_buffer<ForwardIterator, T> |
| transform |
| 平凡迭代器 |
| 一元函数 |
| unary_compose<AdaptableUnaryFunction1,AdaptableUnaryFunction2> |
| unary_function<Arg, Result> |
| unary_negate<AdaptablePredicate> |
| uninitialized_copy |
| uninitialized_copy_n |
| uninitialized_fill |
| uninitialized_fill_n |
| unique |
| 唯一关联容器 |
| 唯一哈希关联容器 |
| 唯一排序关联容器 |
| unique_copy |
| upper_bound |
| value_type |
| vector<T, Alloc> |