Topic Index
Click on one of the letters below to jump immediately to that section of the index. If you get no response, that letter has no entries.
A B C D E F G H I J K L M N O P
Q R S T U V W X Y Z
a
abs() [in 20.2 Creating and Using Complex Numbers]
accumulate() [in 13.6 Scalar-Producing Algorithms]
adaptor
adaptors [in 16.2 Building on the Standard Containers]
adjacent_difference() [in 13.7 Sequence-Generating Algorithms]
adjacent_find() [in 13.3 Searching Operations]
advance [in 16.4 Tips and Techniques for Building Algorithms]
advance() [in 2.5 Iterator Operations]
algorithm [in 1.4 Overview of This Manual]
algorithms
allocator interface
allocator
allocator_interface [in 15.3 Building Your Own Allocators]
any() [in 8.4 The bitset Abstraction]
append() [in 12.2 string Operations]
arg() [in 20.2 Creating and Using Complex Numbers]
assign()
at()
auto_ptr class [in 19.1 Overview]
b
back()
back_inserter [in 2.4 Insert Iterators]
basic_string [in 12.1 The string Abstraction]
begin()
bidirectional iterator [in 2.2 Varieties of Iterators]
binary search tree [in 4.4 Container Types Not Found in the Standard Library]
binary_function
binary_search() [in 14.5 Binary Search]
binder [in 3.5 Negators and Binders]
bit-wise [in 8.4 The bitset Abstraction]
bitset [in 8.4 The bitset Abstraction]
c
capacity()
catenation [in 13.2 Initialization Algorithms]
characteristics, of containers [in 4.1 Overview]
code re-use
compare() [in 12.2 string Operations]
complex numbers [in 20.1 Overview]
composition [in 16.2 Building on the Standard Containers]
conj() [in 20.2 Creating and Using Complex Numbers]
conjugate, complex [in 20.2 Creating and Using Complex Numbers]
constant iterator [in 2.2 Varieties of Iterators]
containers
conventions, presentation [in 1.4 Overview of This Manual]
copy()
copy_backward() [in 13.2 Initialization Algorithms]
count()
count_if() [in 13.6 Scalar-Producing Algorithms]
Curry, Haskell P. [in 3.5 Negators and Binders]
c_str() [in 12.2 string Operations]
d
data() [in 12.2 string Operations]
deep copy [in 4.3 Memory Management Issues]
default constructor [in 5.2 vector Operations]
design requirements
designing your own containers
distance [in 16.4 Tips and Techniques for Building Algorithms]
distance() [in 2.5 Iterator Operations]
e
empty()
end()
equal()
equal_range()
erase()
Eratosthenes [in 5.4 Example Program: The Sieve of Eratosthenes]
errors [in 18.1 Overview]
event driven simulation [in 11.3 Example Application: Event-Driven Simulation]
exception classes [in 18.2 The Standard Exception Hierarchy]
exceptions
exponential function [in 20.2 Creating and Using Complex Numbers]
f
fill() [in 13.2 Initialization Algorithms]
fill_n() [in 13.2 Initialization Algorithms]
find()
find_first_not_of() [in 12.2 string Operations]
find_first_of() [in 12.2 string Operations]
find_if()
find_last_not_of() [in 12.2 string Operations]
find_last_of() [in 12.2 string Operations]
flip()
forward iterator [in 2.2 Varieties of Iterators]
front()
front_inserter [in 2.4 Insert Iterators]
function object
functions as arguments [in 3.1 Functions]
g
generate() [in 13.2 Initialization Algorithms]
generate_n() [in 13.2 Initialization Algorithms]
generator
generic adaptor [in 16.2 Building on the Standard Containers]
generic algorithms [in 13.1 Overview]
generic composition [in 16.2 Building on the Standard Containers]
generic programming [in 16.1 Extending the Library]
graph [in 4.4 Container Types Not Found in the Standard Library]
h
hash table [in 4.4 Container Types Not Found in the Standard Library]
heap
heterogeneous collection [in 11.3 Example Application: Event-Driven Simulation]
i
imag() [in 20.2 Creating and Using Complex Numbers]
in place transformations [in 13.4 In-Place Transformations]
includes()
initialization algorithms [in 13.2 Initialization Algorithms]
inner_product() [in 13.6 Scalar-Producing Algorithms]
inplace_merge()
input iterator [in 2.2 Varieties of Iterators]
insert iterator
insert()
inserter [in 2.4 Insert Iterators]
intersection, [in 8.4 The bitset Abstraction]
iotaGen
istream_iterator [in 2.3 Stream Iterators]
iterator
iterators
iterator_category
iter_swap() [in 13.2 Initialization Algorithms]
k
key_comp() [in 9.2 map and multimap Operations]
l
length() [in 12.2 string Operations]
lexicographical_compare() [in 13.6 Scalar-Producing Algorithms]
list [in 6.1 The list Data Abstraction]
logical [in 8.4 The bitset Abstraction]
logic_error [in 18.2 The Standard Exception Hierarchy]
lower_bound()
m
make_heap() [in 14.8 heap Operations]
map [in 9.1 The map Data Abstraction]
max() [in 13.3 Searching Operations]
max_element() [in 13.3 Searching Operations]
max_size()
memory management [in 4.3 Memory Management Issues]
merge()
min() [in 13.3 Searching Operations]
min_element() [in 13.3 Searching Operations]
mismatch()
multidimensional array [in 4.4 Container Types Not Found in the Standard Library]
n
negation [in 8.4 The bitset Abstraction]
negator [in 3.5 Negators and Binders]
new operator [in 4.3 Memory Management Issues]
next_permutation() [in 13.4 In-Place Transformations]
none() [in 8.4 The bitset Abstraction]
norm() [in 20.2 Creating and Using Complex Numbers]
numeric_limits [in 21.1 Overview]
o
ordered collections [in 14.1 Overview]
ostream_iterator [in 2.3 Stream Iterators]
output iterator [in 2.2 Varieties of Iterators]
p
pairwise equality [in 13.6 Scalar-Producing Algorithms]
partial_sort() [in 14.3 Partial Sort]
partial_sum() [in 13.7 Sequence-Generating Algorithms]
partition() [in 13.4 In-Place Transformations]
phase angle, complex [in 20.2 Creating and Using Complex Numbers]
pointers, as container values
polar() [in 20.2 Creating and Using Complex Numbers]
pop_back() [in 5.2 vector Operations]
pop_heap() [in 14.8 heap Operations]
predicate [in 3.2 Predicates]
prev_permutation() [in 13.4 In-Place Transformations]
priority queue
push_back()
push_front() [in 6.2 list Operations]
push_heap() [in 14.8 heap Operations]
q
queue [in 10.1 Overview]
r
radix sort [in 7.3 Example Program: Radix Sort]
random access iterators [in 2.2 Varieties of Iterators]
randomInteger()
random_shuffle() [in 13.4 In-Place Transformations]
rbegin()
reachable iterator [in 2.1 Introduction to Iterators]
real() [in 20.2 Creating and Using Complex Numbers]
removal algorithms [in 13.5 Removal Algorithms]
remove()
remove_copy() [in 13.5 Removal Algorithms]
remove_copy_if() [in 13.5 Removal Algorithms]
remove_if()
rend()
replace() [in 13.4 In-Place Transformations]
replace_copy() [in 13.4 In-Place Transformations]
replace_copy_if() [in 13.4 In-Place Transformations]
replace_if() [in 13.4 In-Place Transformations]
reserve()
reset() [in 8.4 The bitset Abstraction]
resize()
reverse iterator [in 2.2 Varieties of Iterators]
reverse()
rfind() [in 12.2 string Operations]
rotate() [in 13.4 In-Place Transformations]
runtime_error [in 18.2 The Standard Exception Hierarchy]
s
scalar producing algorithms [in 13.6 Scalar-Producing Algorithms]
Schonfinkel, Moses [in 3.5 Negators and Binders]
search()
searching algorithms [in 13.3 Searching Operations]
sequence generating algorithms [in 13.7 Sequence-Generating Algorithms]
set operations [in 14.7 set Operations]
set [in 8.1 The set Data Abstraction]
set() [in 8.4 The bitset Abstraction]
set
set_difference()
set_intersection()
set_symmetric_difference()
set_union()
shallow copy [in 4.3 Memory Management Issues]
shift [in 8.4 The bitset Abstraction]
sieve of Eratosthenes [in 5.4 Example Program: The Sieve of Eratosthenes]
simulation programs [in 11.1 The priority queue Data Abstraction]
size()
sort() [in 14.2 Sorting Algorithms]
sort_heap() [in 14.8 heap Operations]
sparse array [in 4.4 Container Types Not Found in the Standard Library]
splice() [in 6.2 list Operations]
stable_sort() [in 14.2 Sorting Algorithms]
stack [in 10.1 Overview]
Standard Template Library [in 1.2 Product Overview]
stream iterator [in 2.3 Stream Iterators]
string traits class [in 17.2 Using the Traits Technique]
string [in 12.1 The string Abstraction]
string_char_trait [in 17.2 Using the Traits Technique]
subscript operator
substr() [in 12.2 string Operations]
swap()
swap_ranges() [in 13.2 Initialization Algorithms]
symbolic constants [in 21.1 Overview]
t
test() [in 8.4 The bitset Abstraction]
to_string() [in 8.4 The bitset Abstraction]
to_ulong() [in 8.4 The bitset Abstraction]
traits template [in 17.2 Using the Traits Technique]
traits [in 17.2 Using the Traits Technique]
transcendental functions [in 20.2 Creating and Using Complex Numbers]
transform() [in 13.7 Sequence-Generating Algorithms]
transformation algorithms [in 13.4 In-Place Transformations]
trigonometric functions [in 20.2 Creating and Using Complex Numbers]
two-category error model [in 18.2 The Standard Exception Hierarchy]
u
unary_function [in 3.3 Function Objects]
unique()
unique_copy() [in 13.5 Removal Algorithms]
upper_bound()
user-defined algorithms [in 16.1 Extending the Library]
user-defined containers [in 16.1 Extending the Library]
using exceptions [in 18.3 Using Exceptions]
v
value_comp() [in 9.2 map and multimap Operations]
value_type
vector [in 5.1 The vector Data Abstraction]
w
wstring [in 12.1 The string Abstraction]
©Copyright 1998, Rogue Wave Software, Inc.
Send mail to report errors or comment on the documentation.
OEM Release, June 1998