


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.6 Norm and Absolute Value]
accumulate() [in 13.6.2 Reduce Sequence to a Single Value]
adaptors
adjacent difference
adjacent_difference() [in 13.7.3 Adjacent Differences]
adjacent_find() [in 13.3.2 Find Consecutive Duplicate Elements]
advance() [in 2.5 Iterator Operations]
advance
algorithms
allocator interface requirements [in 16.3.2 Meeting the Allocator Interface Requirements]
allocator interface
allocator<T> [in 15.2 Using Allocators with Existing Standard Library Containers]
Allocator() [in 15.2 Using Allocators with Existing Standard Library Containers]
allocators
allocator_interface [in 15.3.2 Using Rogue Wave's Alternative Interface]
any() [in 8.4.3 Accessing and Testing Elements]
append() [in 12.2.3 Assignment, Append, and Swap]
arg() [in 20.2.6 Norm and Absolute Value]
assign()
associative container [in 16.1 Extending the Library]
at()
auto_ptr class
b
back()
back_inserter() [in 2.4 Insert Iterators]
basic_string [in 12.1 The string Abstraction]
begin()
bidirectional iterators
binary search algorithms [in 14.4 Binary Search]
binary search tree [in 4.4 Container Types Not Found in the Standard Library]
binary_function
binary_search() [in 14.4 Binary Search]
binders
bit-wise operators [in 8.4 The bitset Abstraction]
bitset
bitsets
boolean vectors [in 5.3 Boolean Vectors]
c
capacity()
catenation [in 13.2.2 Copy One Sequence Into Another Sequence]
code reuse
compare() [in 12.2.8 string Comparisons]
complex class
complex conjugate [in 20.2.1 Declaring Complex Numbers]
complex numbers
concordance [in 9.3.3 Example - A Concordance]
conj() [in 20.2.1 Declaring Complex Numbers]
conjugate
constant iterators [in 2.2 Varieties of Iterators]
container adaptors [in 4.1 Overview]
container iterators [in 2.2.1.1 Kinds of Input Iterators]
containers
conventions [in 1.4.2 Conventions]
copy constructor [in 5.2.1 Declaration and Initialization of vectors]
copy()
copy_backward() [in 13.2.2 Copy One Sequence Into Another Sequence]
count()
count_if() [in 13.6.1 Count the Number of Elements That Satisfy a Condition]
Curry, Haskell P. [in 3.5 Negators and Binders]
c_str() [in 12.2.4 Character Access]
d
data() [in 12.2.4 Character Access]
datatypes
deep copy [in 4.3 Memory Management Issues]
deque
designing your own containers
distance() [in 2.5 Iterator Operations]
distance
distance_type [in 16.4.2 The distance and advance Primitives]
documentation [in 1.3 Documentation Overview]
e
empty()
end()
equal()
equal_range()
erase()
Eratosthenes [in 5.4 Example Program - The Sieve of Eratosthenes]
error model [in 18.2 The Standard Exception Hierarchy]
event-driven simulation [in 11.3 Example Program - Event-Driven Simulation]
example program
example programs
example
exception handling classes
exception handling [in 18.1 Overview]
exponential functions [in 20.2.8 Transcendental Functions]
extending the Standard C++ Library [in 16.1 Extending the Library]
f
fill() [in 13.2.1 Fill a Sequence with An Initial Value]
fill_n() [in 13.2.1 Fill a Sequence with An Initial Value]
find()
find_end() [in 13.3.5 Find the Last Occurrence of a Sub-Sequence ]
find_first_not_of() [in 12.2.9 Searching Operations]
find_first_of() [in 12.2.9 Searching Operations]
find_if()
find_last_not_of() [in 12.2.9 Searching Operations]
find_last_of() [in 12.2.9 Searching Operations]
flip()
forward iterators
for_each()
front()
front_inserter() [in 2.4 Insert Iterators]
function adaptors
function objects
functions as arguments [in 3.1 Functions]
fundamental datatypes [in 21.2 Fundamental Datatypes]
future events [in 11.1 The priority queue Data Abstraction]
g
generate() [in 13.2.3 Initialize a Sequence with Generated Values]
generate_n() [in 13.2.3 Initialize a Sequence with Generated Values]
generators
generic adaptor [in 16.2.2 Generic Inheritance]
generic algorithms
generic composition [in 16.2.3 Generic Composition]
generic inheritance [in 16.2.1 Inheritance ]
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 Program - Event-Driven Simulation]
i
imag() [in 20.2.2 Accessing Complex Number Values]
in-place transformations [in 13.4 In-Place Transformations]
includes()
inheritance [in 16.2.1 Inheritance ]
initialization algorithms
inner_product() [in 13.6.3 Generalized Inner Product]
inplace_merge()
input iterators
input streams iterators
insert iterators
insert()
inserter() [in 2.4 Insert Iterators]
iotaGen
istream_iterator [in 2.3.1 Input Stream Iterators]
iterators
iterator_category
iterator_traits template [in 16.4 Tips and Techniques for Building Algorithms]
iter_swap() [in 13.2.4 Swap Values from Two Parallel Ranges]
k
key_comp() [in 9.2.7 Element Comparisons]
l
length() [in 12.2.2 Resetting Size and Capacity]
lexical comparison
lexicographical_compare() [in 13.6.5 Lexical Comparison ]
list operations example [in 6.3 Example Program - An Inventory System]
list
logic errors [in 18.1 Overview]
logic_error [in 18.2 The Standard Exception Hierarchy]
lower_bound()
m
make_heap() [in 14.7 heap Operations]
managing data storage [in 15.1 An Overview]
map
max() [in 13.3.6 Locate Maximum or Minimum Element]
max_element() [in 13.3.6 Locate Maximum or Minimum Element]
max_size()
memory management [in 4.3 Memory Management Issues]
mem_fun [in 3.4.3 Adapting Member Functions]
merge ordered sequences algorithm [in 14.5 Merge Ordered Sequences]
merge()
merge
min() [in 13.3.6 Locate Maximum or Minimum Element]
min_element() [in 13.3.6 Locate Maximum or Minimum Element]
mismatch()
multidimensional array [in 4.4 Container Types Not Found in the Standard Library]
multimap
multiset
n
negators
new operator [in 4.3 Memory Management Issues]
next_permutation() [in 13.4.5 Generate Permutations in Sequence]
none() [in 8.4.3 Accessing and Testing Elements]
norm() [in 20.2.6 Norm and Absolute Value]
nth element algorithm [in 14.3 nth Element]
nth_element() [in 14.3 nth Element]
null pointers [in 2.1 Introduction to Iterators]
numeric_limits
o
operator new [in 4.3 Memory Management Issues]
ordered collection algorithms
ordered sequence
ordinary pointers [in 2.2.1.1 Kinds of Input Iterators]
ostream_iterator [in 2.3.2 Output Stream Iterators]
output iterators
output stream iterators [in 2.3.2 Output Stream Iterators]
p
pairwise equality [in 13.6.4 Test Two Sequences for Pairwise Equality]
partial sort algorithm [in 14.2.1 Partial Sort]
partial sum
partial_sort() [in 14.2.1 Partial Sort]
partial_sort_copy() [in 14.2.1 Partial Sort]
partial_sum() [in 13.7.2 Partial Sums]
partition() [in 13.4.4 Partition a Sequence into Two Groups]
permutation
phase angle
pointers
pointer_to_binary_function [in 3.4.2 Adapting Global Functions]
pointer_to_unary_function [in 3.4.2 Adapting Global Functions]
polar() [in 20.2.1 Declaring Complex Numbers]
pop()
pop_back() [in 5.2.5 Inserting and Removing Elements]
pop_heap() [in 14.7 heap Operations]
predicates
prev_permutation() [in 13.4.5 Generate Permutations in Sequence]
primitives [in 16.4.1 The iterator_traits Template]
priority queue
push(newElement) [in 10.2 The stack Data Abstraction]
push(T) [in 11.2 The priority queue Operations]
push_back()
push_front() [in 6.2.3 Placing Elements into a list]
push_heap() [in 14.7 heap Operations]
q
queue
r
radix sort [in 7.3 Example Program - Radix Sort]
random access iterators
random number generators [in 3.3.2.3 To Access or Set State Information]
randomInteger()
random_shuffle() [in 13.4.7 Randomly Rearrange Elements in a Sequence]
rbegin()
reachable iterators [in 2.1 Introduction to Iterators]
real() [in 20.2.2 Accessing Complex Number Values]
removal algorithms
remove()
remove_copy() [in 13.5.1 Remove Unwanted Elements]
remove_copy_if() [in 13.5.1 Remove Unwanted Elements]
remove_if()
rend()
replace() [in 13.4.2 Replace Certain Elements With Fixed Value]
replace_copy() [in 13.4.2 Replace Certain Elements With Fixed Value]
replace_copy_if() [in 13.4.2 Replace Certain Elements With Fixed Value]
replace_if() [in 13.4.2 Replace Certain Elements With Fixed Value]
reserve()
reset() [in 8.4.3 Accessing and Testing Elements]
resize()
reverse iterators [in 2.2.6 Reverse Iterators]
reverse()
reverse_copy() [in 2.2.4 Bidirectional Iterators]
rfind() [in 12.2.9 Searching Operations]
rotate() [in 13.4.3 Rotate Elements Around a Midpoint]
rotation
runtime errors [in 18.1 Overview]
runtime_error [in 18.2 The Standard Exception Hierarchy]
s
scalar-producing algorithms
Schonfinkel, Moses [in 3.5 Negators and Binders]
search() [in 13.3.4 Find a Sub-Sequence within a Sequence]
searching algorithms
sequence generators [in 3.3.2.3 To Access or Set State Information]
sequence [in 16.1 Extending the Library]
sequence-generating algorithms
set operations algorithms [in 14.6 set Operations]
set
set() [in 8.4.3 Accessing and Testing Elements]
set
set_difference()
set_intersection()
set_symmetric_difference()
set_union()
shallow copy [in 4.3 Memory Management Issues]
sieve of Eratosthenes [in 5.4 Example Program - The Sieve of Eratosthenes]
simulation framework example [in 11.3.1 Example Program - An Ice Cream Store Simulation]
simulation programs [in 11.1 The priority queue Data Abstraction]
size()
sort() [in 14.2 Sorting Algorithms]
sorting algorithms
sort_heap() [in 14.7 heap Operations]
sparse array [in 4.4 Container Types Not Found in the Standard Library]
splice() [in 6.2.3.1 Splicing]
stable_partition() [in 13.4.4 Partition a Sequence into Two Groups]
stable_sort() [in 14.2 Sorting Algorithms]
stack
Standard C++ Library
Standard Template Library [in 1.2.1 Components]
stream iterator [in 2.3 Stream Iterators]
string traits class [in 17.2 Using the Traits Technique]
string
string_char_trait [in 17.2 Using the Traits Technique]
Stroustrup, Bjarne [in 1.1 Welcome]
subscript operator
substr() [in 12.2.7 Copy and Substring]
swap()
swap_ranges() [in 13.2.4 Swap Values from Two Parallel Ranges]
symbolic constants [in 21.1 Overview]
t
test() [in 8.4.3 Accessing and Testing Elements]
Tools.h++ [in 1.2.3 Relationship to Tools.h++]
top()
to_string() [in 8.4.5 Conversions]
to_ulong() [in 8.4.5 Conversions]
traits parameter [in 17.1 Defining the Problem]
traits template example [in 17.2 Using the Traits Technique]
traits [in 17.2 Using the Traits Technique]
transcendental functions [in 20.2.8 Transcendental Functions]
transform() [in 13.7.1 Transform One or Two Sequences]
transformation algorithms
tree [in 4.4 Container Types Not Found in the Standard Library]
trigonometric functions [in 20.2.7 Trigonometric Functions]
u
unary_function [in 3.3.2.1 To Employ Existing Standard Library Function Objects]
unique()
unique_copy() [in 13.5.2 Remove Runs of Similar Values]
upper_bound()
user-defined algorithms [in 16.1 Extending the Library]
user-defined containers [in 16.1 Extending the Library]
v
valarray
value_comp() [in 9.2.7 Element Comparisons]
value_type [in 16.4.2 The distance and advance Primitives]
vector<bool>
vector
w
wstring [in 12.1 The string Abstraction]


OEM Edition, ©Copyright 1999, Rogue Wave Software, Inc.
Contact Rogue Wave about documentation or support issues.