|
#
|
Chapter
|
|
|
|
1
|
Introduction to the STL
|
|
|
2
|
Associative Container |
|
3
|
Back Insertion Sequence |
|
4
|
basic_string<charT, traits, Alloc> |
|
5
|
bit_vector |
|
6
|
bitset<N> |
|
7
|
char_producer |
|
8
|
Container |
|
9
|
deque<T, Alloc> |
|
10
|
Forward Container |
|
11
|
Front Insertion Sequence |
|
12
|
Hash Function |
|
13
|
hash<T> |
|
14
|
hash_map<Key, Data, HashFcn, EqualKey, Alloc> |
|
15
|
hash_multimap<Key, Data, HashFcn, EqualKey, Alloc> |
|
16
|
hash_multiset<Key, HashFcn, EqualKey, Alloc> |
|
17
|
hash_set<Key, HashFcn, EqualKey, Alloc> |
|
18
|
Hashed Associative Container |
|
19
|
list<T, Alloc> |
|
20
|
map<Key, Data, Compare, Alloc> |
|
21
|
multimap<Key, Data, Compare, Alloc> |
|
22
|
Multiple Associative Container |
|
23
|
Multiple Hashed Associative Container |
|
24
|
Multiple Sorted Associative Container |
|
25
|
multiset<Key, Compare, Alloc> |
|
26
|
Pair Associative Container |
|
27
|
priority_queue<T, Sequence, Compare> |
|
28
|
queue<T, Sequence> |
|
29
|
Random Access Container |
|
30
|
Reversible Container |
|
31
|
rope<T, Alloc> |
|
32
|
Sequence |
|
33
|
set<Key, Compare, Alloc> |
|
34
|
Simple Associative Container |
|
35
|
slist<T, Alloc> |
|
36
|
Sorted Associative Container |
|
37
|
stack<T, Sequence> |
|
38
|
Unique Associative Container |
|
39
|
Unique Hashed Associative Container |
|
40
|
Unique Sorted Associative Container |
|
41
|
vector<T, Alloc> |
|
42
|
Iterators |
|
43
|
advance |
|
44
|
back_insert_iterator<BackInsertionSequence> |
|
45
|
Bidirectional Iterator |
|
46
|
bidirectional_iterator<T, Distance> |
|
47
|
bidirectional_iterator_tag |
|
48
|
distance |
|
49
|
distance_type |
|
50
|
Forward Iterator |
|
51
|
forward_iterator<T, Distance> |
|
52
|
forward_iterator_tag |
|
53
|
front_insert_iterator<FrontInsertionSequence> |
|
54
|
Input Iterator |
|
55
|
input_iterator<T, Distance> |
|
56
|
input_iterator_tag |
|
57
|
insert_iterator<Container> |
|
58
|
istream_iterator<T, Distance> |
|
59
|
Iterator Tags |
|
60
|
iterator_category |
|
61
|
iterator_traits<Iterator> |
|
62
|
Iterators |
|
63
|
ostream_iterator<T> |
|
64
|
Output Iterator |
|
65
|
output_iterator |
|
66
|
output_iterator_tag |
|
67
|
Random Access Iterator |
|
68
|
random_access_iterator<T, Distance> |
|
69
|
random_access_iterator_tag |
|
70
|
raw_storage_iterator<ForwardIterator, T> |
|
71
|
reverse_bidirectional_iterator<BidirectionalIterator,
T, Reference, Distance> |
|
72
|
reverse_iterator<RandomAccessIterator, T, Reference,
Distance> |
|
73
|
sequence_buffer<Container, buf_sz> |
|
74
|
Trivial Iterator |
|
75
|
value_type |
|
76
|
Algorithms |
|
77
|
accumulate |
|
78
|
adjacent_difference |
|
79
|
adjacent_find |
|
80
|
advance |
|
81
|
binary_search |
|
82
|
copy |
|
83
|
copy_backward |
|
84
|
copy_n |
|
85
|
count |
|
86
|
count_if |
|
87
|
distance |
|
88
|
equal |
|
89
|
equal_range |
|
90
|
fill |
|
91
|
fill_n |
|
92
|
find |
|
93
|
find_end |
|
94
|
find_first_of |
|
95
|
find_if |
|
96
|
for_each |
|
97
|
generate |
|
98
|
generate_n |
|
99
|
includes |
|
100
|
inner_product |
|
101
|
inplace_merge |
|
102
|
iota |
|
103
|
is_heap |
|
104
|
is_sorted |
|
105
|
iter_swap |
|
106
|
lexicographical_compare |
|
107
|
lexicographical_compare_3way |
|
108
|
lower_bound |
|
109
|
make_heap |
|
110
|
max |
|
111
|
max_element |
|
112
|
merge |
|
113
|
min |
|
114
|
min_element |
|
115
|
mismatch |
|
116
|
next_permutation |
|
117
|
nth_element |
|
118
|
partial_sort |
|
119
|
partial_sort_copy |
|
120
|
partial_sum |
|
121
|
partition |
|
122
|
pop_heap |
|
123
|
power |
|
124
|
prev_permutation |
|
125
|
push_heap |
|
126
|
random_sample |
|
127
|
random_sample_n |
|
128
|
random_shuffle |
|
129
|
remove |
|
130
|
remove_copy |
|
131
|
remove_copy_if |
|
132
|
remove_if |
|
133
|
replace |
|
134
|
replace_copy |
|
135
|
replace_copy_if |
|
136
|
replace_if |
|
137
|
reverse |
|
138
|
reverse_copy |
|
139
|
rotate |
|
140
|
rotate_copy |
|
141
|
search |
|
142
|
search_n |
|
143
|
set_difference |
|
144
|
set_intersection |
|
145
|
set_symmetric_difference |
|
146
|
set_union |
|
147
|
sort |
|
148
|
sort_heap |
|
149
|
stable_partition |
|
150
|
stable_sort |
|
151
|
swap |
|
152
|
swap_ranges |
|
153
|
transform |
|
154
|
uninitialized_copy |
|
155
|
uninitialized_copy_n |
|
156
|
uninitialized_fill |
|
157
|
uninitialized_fill_n |
|
158
|
unique |
|
159
|
unique_copy |
|
160
|
upper_bound |
|
161
|
Functors |
|
162
|
Adaptable Binary Function |
|
163
|
Adaptable Binary Predicate |
|
164
|
Adaptable Generator |
|
165
|
Adaptable Predicate |
|
166
|
Adaptable Unary Function |
|
167
|
Binary Function |
|
168
|
Binary Predicate |
|
169
|
binary_compose<AdaptableBinaryFunction,AdaptableUnaryFunction1,AdaptableUnaryFunction2> |
|
170
|
binary_function<Arg1, Arg2, Result> |
|
171
|
binary_negate<AdaptableBinaryPredicate> |
|
172
|
binder1st<AdaptableBinaryFunction> |
|
173
|
binder2nd<AdaptableBinaryFunction> |
|
174
|
divides<T> |
|
175
|
equal_to<T> |
|
176
|
Function Objects |
|
177
|
Generator |
|
178
|
greater<T> |
|
179
|
greater_equal<T> |
|
180
|
Hash Function |
|
181
|
hash<T> |
|
182
|
identity<T> |
|
183
|
less<T> |
|
184
|
less_equal<T> |
|
185
|
logical_and<T> |
|
186
|
logical_not<T> |
|
187
|
logical_or<T> |
|
188
|
mem_fun1_ref_t<Result, X, Arg> |
|
189
|
mem_fun1_t<Result, X, Arg> |
|
190
|
mem_fun_ref_t<Result, X> |
|
191
|
mem_fun_t<Result, X> |
|
192
|
minus<T> |
|
193
|
modulus<T> |
|
194
|
MonoidOperation |
|
195
|
multiplies<T> |
|
196
|
negate<T> |
|
197
|
not_equal_to<T> |
|
198
|
plus<T> |
|
199
|
pointer_to_binary_function<Arg1, Arg2,
Result> |
|
200
|
pointer_to_unary_function<Arg, Result> |
|
201
|
Predicate |
|
202
|
project1st<Arg1, Arg2> |
|
203
|
project2nd<Arg1, Arg2> |
|
204
|
ptr_fun |
|
205
|
Random Number Generator |
|
206
|
select1st<Pair> |
|
207
|
select2nd<Pair> |
|
208
|
Strict Weak Ordering |
|
209
|
subtractive_rng |
|
210
|
Unary Function |
|
211
|
unary_compose<AdaptableUnaryFunction1,AdaptableUnaryFunction2> |
|
212
|
unary_function<Arg, Result> |
|
213
|
unary_negate<AdaptablePredicate> |
|
214
|
Utilities |
|
215
|
Assignable |
|
216
|
char_traits |
|
217
|
Character Traits |
|
218
|
Default Constructible |
|
219
|
Equality Comparable |
|
220
|
LessThan Comparable |
|
221
|
max |
|
222
|
min |
|
223
|
pair<T1, T2> |
|
224
|
Relational Operators |
|
225
|
Adaptors |
|
226
|
back_insert_iterator<BackInsertionSequence> |
|
227
|
binary_compose<AdaptableBinaryFunction,AdaptableUnaryFunction1,AdaptableUnaryFunction2> |
|
228
|
binary_negate<AdaptableBinaryPredicate> |
|
229
|
binder1st<AdaptableBinaryFunction> |
|
230
|
binder2nd<AdaptableBinaryFunction> |
|
231
|
front_insert_iterator<FrontInsertionSequence> |
|
232
|
insert_iterator<Container> |
|
233
|
mem_fun1_ref_t<Result, X, Arg> |
|
234
|
mem_fun1_t<Result, X, Arg> |
|
235
|
mem_fun_ref_t<Result, X> |
|
236
|
mem_fun_t<Result, X> |
|
237
|
pointer_to_binary_function<Arg1, Arg2,
Result> |
|
238
|
pointer_to_unary_function<Arg, Result> |
|
239
|
priority_queue<T, Sequence, Compare> |
|
240
|
ptr_fun |
|
241
|
queue<T, Sequence> |
|
242
|
raw_storage_iterator<ForwardIterator, T> |
|
243
|
reverse_bidirectional_iterator<BidirectionalIterator,
T, Reference, Distance> |
|
244
|
reverse_iterator<RandomAccessIterator, T, Reference,
Distance> |
|
245
|
sequence_buffer<Container, buf_sz> |
|
246
|
stack<T, Sequence> |
|
247
|
unary_compose<AdaptableUnaryFunction1,AdaptableUnaryFunction2> |
|
248
|
unary_negate<AdaptablePredicate> |
|
249
|
Allocators |
|
250
|
Allocators |
|
251
|
construct |
|
252
|
destroy |
|
253
|
get_temporary_buffer |
|
254
|
raw_storage_iterator<ForwardIterator, T> |
|
255
|
return_temporary_buffer |
|
256
|
temporary_buffer<ForwardIterator, T> |
|
257
|
uninitialized_copy |
|
258
|
uninitialized_copy_n |
|
259
|
uninitialized_fill |
|
260
|
uninitialized_fill_n |