The Standard Template Library Index: The Standard Template Library Associative Container Back Insertion Sequence basic_string<charT, traits, Alloc> bit_vector bitset<N> char_producer Container deque<T, Alloc> Forward Container Front Insertion Sequence Hash Function 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> Hashed Associative Container list<T, Alloc> map<Key, Data, Compare, Alloc> multimap<Key, Data, Compare, Alloc> Multiple Associative Container Multiple Hashed Associative Container Multiple Sorted Associative Container multiset<Key, Compare, Alloc> Pair Associative Container priority_queue<T, Sequence, Compare> queue<T, Sequence> Random Access Container Reversible Container rope<T, Alloc> Sequence set<Key, Compare, Alloc> Simple Associative Container slist<T, Alloc> Sorted Associative Container stack<T, Sequence> Unique Associative Container Unique Hashed Associative Container Unique Sorted Associative Container vector<T, Alloc> advance back_insert_iterator<BackInsertionSequence> Bidirectional Iterator bidirectional_iterator<T, Distance> bidirectional_iterator_tag distance distance_type Forward Iterator forward_iterator<T, Distance> forward_iterator_tag front_insert_iterator<FrontInsertionSequence> Input Iterator input_iterator<T, Distance> input_iterator_tag insert_iterator<Container> istream_iterator<T, Distance> Iterator Tags iterator_category iterator_traits<Iterator> Iterators ostream_iterator<T> Output Iterator output_iterator output_iterator_tag Random Access Iterator random_access_iterator<T, Distance> random_access_iterator_tag raw_storage_iterator<ForwardIterator, T> reverse_bidirectional_iterator<BidirectionalIterator, T, Reference, Distance> reverse_iterator<RandomAccessIterator, T, Reference, Distance> sequence_buffer<Container, buf_sz> Trivial Iterator value_type accumulate adjacent_difference adjacent_find advance binary_search copy copy_backward copy_n count count_if distance equal equal_range fill fill_n find find_end find_first_of find_if for_each generate generate_n includes inner_product inplace_merge iota is_heap is_sorted iter_swap lexicographical_compare lexicographical_compare_3way lower_bound make_heap max max_element merge min min_element mismatch next_permutation nth_element partial_sort partial_sort_copy partial_sum partition pop_heap power prev_permutation push_heap random_sample random_sample_n 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 uninitialized_copy uninitialized_copy_n uninitialized_fill uninitialized_fill_n unique unique_copy upper_bound Adaptable Binary Function Adaptable Binary Predicate Adaptable Generator Adaptable Predicate Adaptable Unary Function Binary Function Binary Predicate binary_compose<AdaptableBinaryFunction,AdaptableUnaryFunction1,AdaptableUnaryFunction2> binary_function<Arg1, Arg2, Result> binary_negate<AdaptableBinaryPredicate> binder1st<AdaptableBinaryFunction> binder2nd<AdaptableBinaryFunction> divides<T> equal_to<T> Function Objects Generator greater<T> greater_equal<T> Hash Function hash<T> identity<T> less<T> less_equal<T> logical_and<T> logical_not<T> logical_or<T> mem_fun1_ref_t<Result, X, Arg> mem_fun1_t<Result, X, Arg> mem_fun_ref_t<Result, X> mem_fun_t<Result, X> minus<T> modulus<T> MonoidOperation multiplies<T> negate<T> not_equal_to<T> plus<T> pointer_to_binary_function<Arg1, Arg2, Result> pointer_to_unary_function<Arg, Result> Predicate project1st<Arg1, Arg2> project2nd<Arg1, Arg2> ptr_fun Random Number Generator select1st<Pair> select2nd<Pair> Strict Weak Ordering subtractive_rng Unary Function unary_compose<AdaptableUnaryFunction1,AdaptableUnaryFunction2> unary_function<Arg, Result> unary_negate<AdaptablePredicate> Assignable char_traits Character Traits Default Constructible Equality Comparable LessThan Comparable max min pair<T1, T2> Relational Operators back_insert_iterator<BackInsertionSequence> binary_compose<AdaptableBinaryFunction,AdaptableUnaryFunction1,AdaptableUnaryFunction2> binary_negate<AdaptableBinaryPredicate> binder1st<AdaptableBinaryFunction> binder2nd<AdaptableBinaryFunction> front_insert_iterator<FrontInsertionSequence> insert_iterator<Container> mem_fun1_ref_t<Result, X, Arg> mem_fun1_t<Result, X, Arg> mem_fun_ref_t<Result, X> mem_fun_t<Result, X> pointer_to_binary_function<Arg1, Arg2, Result> pointer_to_unary_function<Arg, Result> priority_queue<T, Sequence, Compare> ptr_fun queue<T, Sequence> raw_storage_iterator<ForwardIterator, T> reverse_bidirectional_iterator<BidirectionalIterator, T, Reference, Distance> reverse_iterator<RandomAccessIterator, T, Reference, Distance> sequence_buffer<Container, buf_sz> stack<T, Sequence> unary_compose<AdaptableUnaryFunction1,AdaptableUnaryFunction2> unary_negate<AdaptablePredicate> Allocators construct destroy get_temporary_buffer raw_storage_iterator<ForwardIterator, T> return_temporary_buffer temporary_buffer<ForwardIterator, T> uninitialized_copy uninitialized_copy_n uninitialized_fill uninitialized_fill_n Copyright © 1999 Silicon Graphics, Inc. All Rights Reserved. TrademarkInformation