SGI Logo

Index: The Standard Template Library

accumulate
Adaptable Binary Function
Adaptable Binary Predicate
Adaptable Generator
Adaptable Predicate
Adaptable Unary Function
adjacent_difference
adjacent_find
advance
Allocators
Assignable
Associative Container
Back Insertion Sequence
back_insert_iterator<BackInsertionSequence>
basic_string<charT, traits, Alloc>
Bidirectional Iterator
bidirectional_iterator<T, Distance>
bidirectional_iterator_tag
Binary Function
Binary Predicate
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
Character Traits
construct
Container
copy
copy_backward
copy_n
count
count_if
Default Constructible
deque<T, Alloc>
destroy
distance
distance_type
divides<T>
equal
equal_range
equal_to<T>
Equality Comparable
fill
fill_n
find
find_end
find_first_of
find_if
for_each
Forward Container
Forward Iterator
forward_iterator<T, Distance>
forward_iterator_tag
Front Insertion Sequence
front_insert_iterator<FrontInsertionSequence>
Function Objects
generate
generate_n
Generator
get_temporary_buffer
greater<T>
greater_equal<T>
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
identity<T>
includes
inner_product
inplace_merge
Input Iterator
input_iterator<T, Distance>
input_iterator_tag
insert_iterator<Container>
iota
is_heap
is_sorted
istream_iterator<T, Distance>
iter_swap
Iterator Tags
iterator_category
iterator_traits<Iterator>
Iterators
less<T>
less_equal<T>
LessThan Comparable
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>
MonoidOperation
multimap<Key, Data, Compare, Alloc>
Multiple Associative Container
Multiple Hashed Associative Container
Multiple Sorted Associative Container
multiplies<T>
multiset<Key, Compare, Alloc>
negate<T>
next_permutation
not_equal_to<T>
nth_element
ostream_iterator<T>
Output Iterator
output_iterator
output_iterator_tag
Pair Associative Container
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
Predicate
prev_permutation
priority_queue<T, Sequence, Compare>
project1st<Arg1, Arg2>
project2nd<Arg1, Arg2>
ptr_fun
push_heap
queue<T, Sequence>
Random Access Container
Random Access Iterator
Random Number Generator
random_access_iterator<T, Distance>
random_access_iterator_tag
random_sample
random_sample_n
random_shuffle
raw_storage_iterator<ForwardIterator, T>
Relational Operators
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>
Reversible Container
rope<T, Alloc>
rotate
rotate_copy
search
search_n
select1st<Pair>
select2nd<Pair>
Sequence
sequence_buffer<Container, buf_sz>
set<Key, Compare, Alloc>
set_difference
set_intersection
set_symmetric_difference
set_union
Simple Associative Container
slist<T, Alloc>
sort
sort_heap
Sorted Associative Container
stable_partition
stable_sort
stack<T, Sequence>
Strict Weak Ordering
subtractive_rng
swap
swap_ranges
temporary_buffer<ForwardIterator, T>
transform
Trivial Iterator
Unary Function
unary_compose<AdaptableUnaryFunction1,AdaptableUnaryFunction2>
unary_function<Arg, Result>
unary_negate<AdaptablePredicate>
uninitialized_copy
uninitialized_copy_n
uninitialized_fill
uninitialized_fill_n
unique
Unique Associative Container
Unique Hashed Associative Container
Unique Sorted Associative Container
unique_copy
upper_bound
value_type
vector<T, Alloc>


STL Main Page

Contact Us | Site Map | Trademarks | Privacy | Using this site means you accept its Terms of Use
Copyright © 2009 - 2016 Silicon Graphics International. All rights reserved.