search for books and compare prices
Tables of Contents for Accelerated C++
Chapter/Section Title
Page #
Page Count
Preface
xi
Getting started
1
8
Comments
1
1
#include
2
1
The main function
2
1
Curly braces
2
1
Using the standard library for output
3
1
The return statement
3
1
A slightly deeper look
4
1
Details
5
4
Working with strings
9
8
Input
9
2
Framing a name
11
3
Details
14
3
Looping and counting
17
18
The problem
17
1
Overall structure
18
1
Writing an unknown number of rows
18
4
Writing a row
22
5
The complete framing program
27
3
Counting
30
1
Details
31
4
Working with batches of data
35
16
Computing student grades
35
6
Using medians instead of averages
41
7
Details
48
3
Organizing programs and data
51
24
Organizing computations
51
10
Organizing data
61
5
Putting it all together
66
2
Partitioning the grading program
68
2
The revised grading program
70
1
Details
71
4
Using sequential containers and analyzing strings
75
26
Separating students into categories
75
4
Iterators
79
3
Using iterators instead of indices
82
2
Rethinking our data structure for better performance
84
1
The list type
85
2
Taking strings apart
87
3
Testing our split function
90
1
Putting strings together
91
5
Details
96
5
Using library algorithms
101
22
Analyzing strings
101
9
Comparing grading schemes
110
6
Classifying students, revisited
116
4
Algorithms, containers, and iterators
120
1
Details
121
2
Using associative containers
123
16
Containers that support efficient look-up
123
1
Counting words
124
2
Generating a cross-reference table
126
3
Generating sentences
129
7
A note on performance
136
1
Details
137
2
Writing generic functions
139
16
What is a generic function?
139
4
Data-structure independence
143
7
Input and output iterators
150
2
Using iterators for flexibility
152
1
Details
153
2
Defining new types
155
14
Student__info revisited
155
1
Class types
156
4
Protection
160
3
The Student__info class
163
1
Constructors
164
2
Using the Student__info class
166
1
Details
167
2
Managing memory and low-level data structures
169
18
Pointers and arrays
169
7
String literals revisited
176
1
Initializing arrays of character pointers
177
2
Arguments to main
179
1
Reading and writing files
180
2
Three kinds of memory management
182
3
Details
185
2
Defining abstract data types
187
24
The Vec class
187
1
Implementing the Vec class
188
7
Copy control
195
7
Dynamic Vecs
202
1
Flexible memory management
203
6
Details
209
2
Making class objects act like values
211
16
A simple string class
212
1
Automatic conversions
213
1
Str operations
214
7
Some conversions are hazardous
221
1
Conversion operators
222
1
Conversions and memory management
223
2
Details
225
2
Using inheritance and dynamic binding
227
26
Inheritance
227
5
Polymorphism and virtual functions
232
5
Using inheritance to solve our problem
237
6
A simple handle class
243
4
Using the handle class
247
1
Subtleties
248
2
Details
250
3
Managing memory (almost) automatically
253
16
Handles that copy their objects
254
5
Reference-counted handles
259
4
Handles that let you decide when to share data
263
1
An improvement on controllable handles
264
4
Details
268
1
Revisiting character pictures
269
22
Design
269
9
Implementation
278
10
Details
288
3
Where do we go from here?
291
4
Use the abstractions you have
291
2
Learn more
293
2
Appendix A Language details
295
16
A.1 Declarations
295
4
A.2 Types
299
6
A.3 Expressions
305
3
A.4 Statements
308
3
Appendix B Library summary
311
14
B.1 Input--output
311
3
B.2 Containers and iterators
314
7
B.3 Algorithms
321
4
Index
325