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

abs() in 20.2 Creating and Using Complex Numbers
accumulate() in 13.6 Scalar-Producing Algorithms
adaptor

function in 3.5 Negators and Binders

priority queue in 11.2 The Priority Queue Operations

queue in 10.3 The queue Data Abstraction

stack in 10.1 Overview

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.6 Conventions
algorithms

building in 16.4 Tips and Techniques for Building Algorithms

categories in 16.1 Extending the Library

tips and techniques in 16.4 Tips and Techniques for Building Algorithms

user-defined in 16.1 Extending the Library

allocator in 15.1 An Overview of the Standard Library Allocators
allocator interface

in 15.1 An Overview of the Standard Library Allocators

basic interface in 16.3 Creating Your Own Containers

requirements in 16.3 Creating Your Own Containers

allocator

alternate interface in 15.3 Building Your Own Allocators

alternative interface in 15.3 Building Your Own Allocators

conforming in 15.3 Building Your Own Allocators

defining in 15.3 Building Your Own Allocators

required member functions in 15.3 Building Your Own Allocators

in 15.3 Building Your Own Allocators

standard interface in 15.3 Building Your Own Allocators

supporting both interfaces in 15.3 Building Your Own Allocators

allocator_interface in 15.3 Building Your Own Allocators
American National Standards Institute in 1.1 What is the Standard C++ Library?
append() in 12.2 String Operations
arg() in 20.2 Creating and Using Complex Numbers
assign()

in 6.2 List Operations

in 12.2 String Operations

in 5.2 Vector Operations

at()

in 12.2 String Operations

in 5.2 Vector Operations

auto_ptr class in 19.1 Overview

back()

in 6.2 List Operations

in 5.2 Vector Operations

back_inserter in 2.4 Insert Iterators
basic_string in 12.1 The string Abstraction
begin()

in 9.2 Map and Multimap Operations

in 2.2 Varieties of Iterators

in 5.2 Vector Operations

bidirectional iterator in 2.2 Varieties of Iterators
binary search tree in 4.4 Container Types Not Found in the Standard Library
binary_function

in 6.3 Example Program - An Inventory System

in 3.3 Function Objects

binary_search() in 14.5 Binary Search
binder in 3.5 Negators and Binders

capacity()

in 12.2 String Operations

in 5.2 Vector Operations

catenation in 13.2 Initialization Algorithms
characteristics, of containers in 4.1 Overview
code re-use

composition in 16.2 Building on the Standard Containers

generic inheritance in 16.2 Building on the Standard Containers

inheritance in 16.2 Building on the Standard Containers

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 not in standard library in 4.4 Container Types Not Found in the Standard Library
containers

creating your own in 16.3 Creating Your Own Containers

design requirements in 16.3 Creating Your Own Containers

designing in 15.1 An Overview of the Standard Library Allocators

designing your own in 16.3 Creating Your Own Containers

iterator requirements in 16.3 Creating Your Own Containers

user-defined in 16.3 Creating Your Own Containers

in 16.1 Extending the Library

conventions, presentation in 1.6 Conventions
copy()

in 13.2 Initialization Algorithms

in 6.2 List Operations

in 12.2 String Operations

copy_backward() in 13.2 Initialization Algorithms
count()

in 9.2 Map and Multimap Operations

in 13.6 Scalar-Producing Algorithms

count_if() in 13.6 Scalar-Producing Algorithms
Curry, Haskell P. in 3.5 Negators and Binders
c_str() in 12.2 String Operations

data() in 12.2 String Operations
deep copy in 4.3 Memory Management Issues
default constructor in 5.2 Vector Operations
design requirements

containers in 16.3 Creating Your Own Containers

designing your own containers

iterators in 16.3 Creating Your Own Containers

distance in 16.4 Tips and Techniques for Building Algorithms
distance() in 2.5 Iterator Operations

empty()

in 6.2 List Operations

in 9.2 Map and Multimap Operations

in 12.2 String Operations

in 5.2 Vector Operations

end()

in 9.2 Map and Multimap Operations

in 2.2 Varieties of Iterators

in 5.2 Vector Operations

equal()

in 13.6 Scalar-Producing Algorithms

in 13.3 Searching Operations

equal_range()

in 14.5 Binary Search

in 9.2 Map and Multimap Operations

erase()

in 6.2 List Operations

in 9.2 Map and Multimap Operations

in 12.2 String Operations

in 5.2 Vector Operations

Eratosthenes in 5.4 Example Program - Sieve of Eratosthenes
errors in 18.1 Overview
event driven simulation in 11.3 Application - Event-Driven Simulation
exception classes in 18.2 The Standard Exception Hierarchy
exceptions

using in 18.3 Using Exceptions

exponential function in 20.2 Creating and Using Complex Numbers

fill() in 13.2 Initialization Algorithms
fill_n() in 13.2 Initialization Algorithms
find()

in 9.2 Map and Multimap Operations

in 13.3 Searching Operations

in 13.3 Searching Operations

in 12.2 String Operations

find_first_not_of() in 12.2 String Operations
find_first_of() in 12.2 String Operations
find_if()

in 13.3 Searching Operations

in 13.3 Searching Operations

find_last_not_of() in 12.2 String Operations
find_last_of() in 12.2 String Operations
flip() in 5.3 Boolean Vectors
forward iterator in 2.2 Varieties of Iterators
for_each() in 13.8 Miscellaneous Algorithms
front()

in 6.2 List Operations

in 5.2 Vector Operations

front_inserter in 2.4 Insert Iterators
function object

in 3.3 Function Objects

in 3.4 Function Adaptors

functions as arguments in 3.1 Functions
future of OOP in 1.4 How Should I Use the Standard C++ Library?

generate() in 13.2 Initialization Algorithms
generate_n() in 13.2 Initialization Algorithms
generator

in 3.3 Function Objects

in 13.2 Initialization Algorithms

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

hash table in 4.4 Container Types Not Found in the Standard Library
heap

in 14.8 Heap Operations

in 11.2 The Priority Queue Operations

heterogeneous collection in 11.3 Application - Event-Driven Simulation

imag() in 20.2 Creating and Using Complex Numbers
in place transformations in 13.4 In-Place Transformations
includes() in 14.7 Set Operations
initialization algorithms in 13.2 Initialization Algorithms
inner_product() in 13.6 Scalar-Producing Algorithms
inplace_merge()

in 13.4 In-Place Transformations

in 14.6 Merge Ordered Sequences

input iterator in 2.2 Varieties of Iterators
insert iterator

in 13.2 Initialization Algorithms

in 13.2 Initialization Algorithms

in 2.4 Insert Iterators

in 6.2 List Operations

in 13.7 Sequence-Generating Algorithms

insert()

in 6.2 List Operations

in 9.2 Map and Multimap Operations

in 12.2 String Operations

in 5.2 Vector Operations

inserter in 2.4 Insert Iterators
International Standards Organization in 1.1 What is the Standard C++ Library?
iotaGen

in 3.3 Function Objects

in 13.2 Initialization Algorithms

istream_iterator in 2.3 Stream Iterators
iterator

in 2.1 Introduction to Iterators

bidirectional in 2.2 Varieties of Iterators

constant in 2.2 Varieties of Iterators

forward in 2.2 Varieties of Iterators

input in 2.2 Varieties of Iterators

insert in 2.4 Insert Iterators

output in 2.2 Varieties of Iterators

random access in 2.2 Varieties of Iterators

reverse in 2.2 Varieties of Iterators

stream in 2.3 Stream Iterators

iterators

in 16.3 Creating Your Own Containers

iterator requirements in 16.3 Creating Your Own Containers

iterator_category

primitive in 16.4 Tips and Techniques for Building Algorithms

iter_swap() in 13.2 Initialization Algorithms

key_comp() in 9.2 Map and Multimap Operations

length() in 12.2 String Operations
lexicographical_compare() in 13.6 Scalar-Producing Algorithms
list in 6.1 The list Data Abstraction
logic_error in 18.2 The Standard Exception Hierarchy
lower_bound()

in 14.5 Binary Search

in 9.2 Map and Multimap Operations

make_heap() in 14.8 Heap Operations
max() in 13.3 Searching Operations
max_element() in 13.3 Searching Operations
max_size()

in 12.2 String Operations

in 5.2 Vector Operations

memory management in 4.3 Memory Management Issues
merge()

in 13.4 In-Place Transformations

in 6.2 List Operations

in 14.6 Merge Ordered Sequences

min() in 13.3 Searching Operations
min_element() in 13.3 Searching Operations
mismatch()

in 13.6 Scalar-Producing Algorithms

in 13.3 Searching Operations

multidimensional array in 4.4 Container Types Not Found in the Standard Library

negator in 3.5 Negators and Binders
new operator in 4.3 Memory Management Issues
next_permutation() in 13.4 In-Place Transformations
norm() in 20.2 Creating and Using Complex Numbers
nth_element() in 14.4 nth Element
numeric_limits in 21.1 Overview

ordered collections in 14.1 Overview
ostream_iterator in 2.3 Stream Iterators
output iterator in 2.2 Varieties of Iterators

pairwise equality in 13.6 Scalar-Producing Algorithms
parallel Sequences in 13.2 Initialization Algorithms
partial_sort() in 14.3 Partial Sort
partial_sum() in 13.7 Sequence-Generating Algorithms
partition() in 13.4 In-Place Transformations
permutations in 13.4 In-Place Transformations
phase angle, complex in 20.2 Creating and Using Complex Numbers
pointers, as container values

in 11.3 Application - Event-Driven Simulation

in 4.3 Memory Management Issues

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

in 9.3 Example Programs

in 11.1 The priority queue Data Abstraction

push_back()

in 6.2 List Operations

in 5.2 Vector Operations

push_front() in 6.2 List Operations
push_heap() in 14.8 Heap Operations

queue in 10.1 Overview

radix sort in 7.3 Example Program - Radix Sort
random access iterators in 2.2 Varieties of Iterators
randomInteger()

in 11.3 Application - Event-Driven Simulation

in 2.2 Varieties of Iterators

random_shuffle() in 13.4 In-Place Transformations
rbegin()

in 9.2 Map and Multimap Operations

in 5.2 Vector Operations

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()

in 6.2 List Operations

in 13.5 Removal Algorithms

in 12.2 String Operations

remove_copy() in 13.5 Removal Algorithms
remove_copy_if() in 13.5 Removal Algorithms
remove_if()

in 6.2 List Operations

in 13.5 Removal Algorithms

rend()

in 9.2 Map and Multimap Operations

in 5.2 Vector Operations

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()

in 12.2 String Operations

in 5.2 Vector Operations

resize()

in 6.2 List Operations

in 12.2 String Operations

in 5.2 Vector Operations

reverse iterator in 2.2 Varieties of Iterators
reverse()

in 13.4 In-Place Transformations

in 6.2 List Operations

rfind() in 12.2 String Operations
rotate() in 13.4 In-Place Transformations
running the tutorial programs in 1.8 Running the Tutorial Programs
runtime_error in 18.2 The Standard Exception Hierarchy

scalar producing algorithms in 13.6 Scalar-Producing Algorithms
Schonfinkel, Moses in 3.5 Negators and Binders
search()

in 13.3 Searching Operations

in 13.3 Searching Operations

searching algorithms in 13.3 Searching Operations
selecting a container in 4.2 Selecting a Container
sequence generating algorithms in 13.7 Sequence-Generating Algorithms
set in 8.1 The set Data Abstraction
set operations in 14.7 Set Operations
set

iterator category in 2.2 Varieties of Iterators

set_difference() in 14.7 Set Operations
set_intersection() in 14.7 Set Operations
set_symmetric_difference() in 14.7 Set Operations
set_union() in 14.6 Merge Ordered Sequences
shallow copy in 4.3 Memory Management Issues
sieve of Eratosthenes in 5.4 Example Program - Sieve of Eratosthenes
simulation programs in 11.1 The priority queue Data Abstraction
size()

in 6.2 List Operations

in 9.2 Map and Multimap Operations

in 12.2 String Operations

in 5.2 Vector Operations

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.1 What is the Standard C++ Library?
stream iterator in 2.3 Stream Iterators
string in 12.1 The string Abstraction
string traits class in 17.1 Using the Traits Technique
string_char_trait in 17.1 Using the Traits Technique
subscript operator

in 9.2 Map and Multimap Operations

in 12.2 String Operations

in 5.2 Vector Operations

substr() in 12.2 String Operations
swap()

in 13.2 Initialization Algorithms

in 6.2 List Operations

in 8.2 set and multiset Operations

in 12.2 String Operations

in 5.2 Vector Operations

swap_ranges() in 13.2 Initialization Algorithms
symbolic constants in 21.1 Overview

traits in 17.1 Using the Traits Technique
traits template in 17.1 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
tree in 4.4 Container Types Not Found in the Standard Library
trigonometric functions in 20.2 Creating and Using Complex Numbers
two-category error model in 18.2 The Standard Exception Hierarchy

unary_function in 3.3 Function Objects
unique()

in 6.2 List Operations

in 13.5 Removal Algorithms

unique_copy() in 13.5 Removal Algorithms
unordered sets in 4.4 Container Types Not Found in the Standard Library
upper_bound()

in 14.5 Binary Search

in 9.2 Map and Multimap Operations

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
using the standard library in 1.7 Using the Standard Library

value_comp() in 9.2 Map and Multimap Operations
value_type in 16.4 Tips and Techniques for Building Algorithms
vector in 5.1 The vector Data Abstraction

wstring in 12.1 The string Abstraction

Return to the User Guide home page

©Copyright 1996, Rogue Wave Software, Inc.