C++ how to program / P.J. Deitel and H.M. Deitel.

H.M. Deitel's name appeared first on t.p. of earlier ed.

Includes index.

1 Introduction to Computers, the Internet and
the World Wide Web
1.1 introcluciion
1.2 Computers: Hardware and SoFt\vare
1.3 Computer Organization
1.4 Personal, Distributed and Client/Server Computing
1.5 The Internet and the World Wide Web
1.6 Web 2.0
1.7 Machine Languages. Assembly Languages
and High-Lcvcl Languages
1.8 Histor)' of C and C++
1.9 C++Standard Library
1.10 History of Java
1.11 Fortran, COBOL, Pascal and Ada
1.12 BASIC, Visual Basic, Visual C++, C# and .NET
1.13 Key Software Trend: Object Technology
1.14 Typical C++ Development Environment
1.15 Notes About C++ and C+ + How to Pro^am, 7le
1.16 Test-Driving a C++ Application
1.17 Software Technologies
1.18 Future of C++: Open Source Boost Libraries, TRl and C++Ox
1.19 Software Engineering Case Study: Introduction to Object Technology
and the UML
1.20 Wrap-Up
1.21 Web Resources
2 Introduction to C++ Programming
2.1 Introduction
2.2 First Program in C++: Printing a Line of Text
2.3 Modifying Our First C++ Program
2.4 Another C++ Program: Adding Integers
2.5 Memory Concepts
2.6 Arithmetic
2.7 Decision Making: Equality and Relational Operators
2.8 Wrap-Up
3 Introduction to Classes and Objects
3.1 Introduction
3.2 Classes, Objects, Member Functions and Data Members
3.3 Defining a Class with a Member Function
3.4 Defining a Member Function with a Parameter
3.5 Data Members, set Functions and get Functions
3.6 Initializing Objects with Constructors
3.7 Placing a Class in a Separate File for Reusability
3.8 Separating Interface from Implementation
3.9 Validating Data with set Functions
3.10 Wrap-Up
4 Control Statements: Part I
4.1 Introduction
4.2 Algorithms
4.3 Pseudocode
4.4 Control Structures
4.5 if Selection Statement
4.6 i f...el se Double-Selection Statement
4.7 while Repetition Statement
4.8 Formulating Algorithms: Counter-Controlled Repetition
4.9 Formulating Algorithms: Sentinel-Controlled Repetition
4.10 Formulating Algorithms: Nested Control Statements
4.11 Assignment Operators
4.12 Increment and Decrement Operators
4.13 Wrap-Up
5 Control Statements: Part 2
5.1 Introduction
5.2 Essentials of Counter-Controlled Repetition
5.3 for Repetition Statement
5.4 Examples Using the for Statement
5.5 do...while Repetition Statement
5.6 switch Multiple-Selection Statement
5.7 break and continue Statements
5.8 Logical Operators
5.9 Confusing the Equality (==) and Assignment (=) Operators
• structured Programming Summary
5.11 Wrap-Up
6 Functions and an Introduction to Recursion
6.1 Introduction
6.2 Program Components in C++
6.3 Math Librar)' Functions
6.4 Function Definitions with Multiple Parameters
6.5 Function Prototypes and Argument Coercion
6.6 C++ Standard Library Header Files
6.7 Case Study: Random Number Generation
6.8 Ca.se Study: Game of Chance; Introducing enum
6.9 Storage Classes
6.10 Scope Rules
6.11 Function Call Stack and Activation Records
6.12 Functions with Empty Parameter Lists
6.13 Inline Functions
6.14 References and Reference Parameters
6.15 Default Arguments
6.16 Unary Scope Resolution Operator
6.17 Function Overloading
6.18 Function Templates
6.19 Recursion
6.20 Example Using Recursion: Fibonacci Series
6.21 Recursion vs. Iteration
6.22 Wrap-Up
7 Arrays and Vectors
7.1 Introduction
7.2 Arrays
7.3 Declaring Arrays
7.4 Examples Using Arrays
7.4.1 Declaring an Array and Using a Loop to Initialize the
Array's Elements
7.4.2 Initializing an Array in a Declaration with an Initializer List
7.4.3 Specifying an Array's Size with a Constant Variable and
Setting Array Elements with Calculations
7.4.4 Summing the Elements of an Array
7.4.5 Using Bar Charts to Display Array Data Graphically
7.4.6 Using the Elements of an Array as Counters
7.4.7 Using Arrays to Summarize Survey Results
7.4.8 Static Local Arrays and Automatic Local Arrays
7.5 Passing Arrays to Functions
7.6 Case Study: Class GradeBook Using an Array to Store Grades
7.7 Searching Arrays with Linear Search
7.8 Sorting Arrays with Insertion Sort
7.9 Multidimensional Arrays
7.10 Case Study: Class GradeBook Using a Two-Dimensional Array
7.11 Introduction to C++ Standard Library Class Template vector
7.12 Wrap-Up
8 Pointers
8.1 Introduction
8.2 Pointer Variable Declarations and Initialization
8.3 Pointer Operators
8.4 Pass-by-Reference with Pointers
8.5 Using const with Pointers
8.6 Selection Sort Using Pass-by-Reference
8.7 sizeof Operator
8.8 Pointer Expressions and Pointer Arithmetic
8.9 Relationship Between Pointers and Arrays
8.10 Pointer-Based String Processing
8.11 Arrays of Pointers
8.12 Function Pointers
8.13 Wrap-Up
9 Classes: A Deeper Look, Fart I
9.1 Introduction
9.2 Ti me Class Case Study
9.3 Class Scope and Accessing Class Members
9.4 Separating Interface from Implementation
9.5 Access Functions and Utility Functions
9.6 Time Class Case Study: Constructors with Default Arguments
9.7 Destructors
9.8 When Constructors and Destructors Are Called
9.9 Time Class Case Study: A Subtle Trap—Returning a Reference to a
private Data Member
9.10 Default Memberwise Assignment
9.11 Wrap-Up
10 Classes: A Deeper Look, Part 2
10.1 Introduction
10.2 const (Constant) Objects and const Member Functions
10.3 Composition: Objects as Members of Classes
10.4 friend Functions and friend Classes
10.5 Using the thi s Pointer
10.6 static Class Members
10.7 Data Abstraction and Information Hiding
10.8 Wrap-Up
I I Operator Overloading
11.1 Introduction
11.2 Fundamentals of Operator Overloading
11.3 Restrictions on Operator Overloading
11.4 Operator Functions as Class Members vs. Global Functions
11.5 Overloading Stream Insertion and Stream Extraction Operators
11.6 Overloading Unary Operators
11.7 Overloading Binary Operators
11.8 Dynamic Memory Management
11.9 Case Study: Array Class
11.10 Converting between Types
11.11 Building a String Class
11.12 Overloading++and --
11.13 Case Study: A Date Class
11.14 Standard Library Class string
11.15 explicit Constructors
11.16 Proxy Classes
11.17 Wrap-Up
12 Object-Oriented Programming: Inheritance
12.1 Introduction
12.2 Base Classes and Derived Classes
12.3 protected Members
12.4 Relationship between Base Classes and Derived Classes
12.4.1 Creating and Using a CommissionEmployee Class
12.4.2 Creating a BasePl usCommi ssi onEmpl oyee Class Without
Using Inheritance
12.4.3 Creating a Commi ssi onEmployee—BasePlusCommi ssi onEmployee
Inheritance Hierarchy
12.4.4 Commi ssi onEmployee-BasePlusCommi ssionEmployee
Inheritance Hierarchy Using protected Data
12.4.5 Commi ssi onEmployee-BasePIusCommi ssi onEmployee
Inheritance Hierarchy Using private Data
12.5 Constructors and Destructors in Derived Classes
12.6 public, protected and private Inheritance
12.7 Software Engineering with Inheritance
12.8 Wrap-Up
I 3 Object-Oriented Programming: Polymorphism
13.1 Introduction
13.2 Polymorphism Examples
13.3 Relationships Among Objects in an Inheritance Hierarchy
13.3.1 Invoking Base-Class Functions from Derived-Class Objects
13.3.2 Aiming Derived-Class Pointers at Base-Class Objects
13.3.3 Derived-Class Member-Function Calls via Base-Class Pointers
13.3.4 Virtual Functions
13.3.5 Summary of the Allowed Assignments Between Base-Class
and Derived-Class Objects and Pointers
13.4 Type Fields and switch Statements
13.5 Abstract Classes and Pure VI rtual Functions
13.6 Case Study: Payroll System Using Polymorphism
13.6.1 Creating Abstract Base Class Empl oyee
13.6.2 Creating Concrete Derived Class SalariedEmployee
13.6.3 Creating Concrete Derived Class HourlyEmployee
13.6.4 Creating Concrete Derived Class CommissionEmployee
13.6.5 Creating Indirect Concrete Derived Class
BasePlusCommi ssi onEmployee
13.6.6 Demonstrating Polymorphic Processing
13.7 (Optional) Polymorphism, Virtual Functions and Dynamic Binding
"Under the Hood"
13.8 Case Study: Payroll System Using Polymorphism and Runtime Type
Information with Downcasting, dynamic_cast, typeid and type_info
13.9 Virtual Destructors
13.10 Wrap-Up
14 Templates
14.1 Introduction
14.2 Function Templates
14.3 Overloading Function Templates
14.4 Class Templates
14.5 Nontype Parameters and Default Types for Class Templates
14.6 Notes on Templates and Inheritance
14.7 Notes on Templates and Friends
14.8 Notes on Templates and stati c Members
14.9 Wrap-Up
15 Stream Input/Output
15.1 Introduction
15.2 Streams
15.2.1 Classic Streams vs. Standard Streams
15.2.2 iostream Library Header Files
15.2.3 Stream Input/Output Classes and Objects
15.3 Stream Output
15.3.1 Output of char * Variables
15.3.2 Character Output Using Member Function put
15.4 Stream Input
15.4.1 get and get! i ne Member Functions
15.4.2 1 stream Member Functions peek, putback and ignore
15.4.3 Type-Safe I/O >
15.5 Unformatted I/O Using read, wri te and gcount
15.6 Introduction to Stream Manipulators
15.6.1 Integral Scream Base: dec, oct, hex and setbase
15.6.2 Floating-Point Precision (precision, setprecision)
15.6.3 Field Width (width, setw)
15.6.4 User-Defined Output Stream Manipulators
15.7 Stream Format States and Stream Manipulators
15.7.1 Trailing Zeros and Decimal Points (showpoint)
15.7.2 Justification (left, right and internal)
15.7.3 Padding (fill, setfill)
15.7.4 Integral Stream Base (dec, oct, hex, showbase)
15.7.5 Floating-Point Numbers; Scientific and Fixed Notation
(scientific, fixed)
15.7.6 Uppercase/Lowercase Control (uppercase)
15.7.7 Specifying Boolean Format (bool al pha)
15.7.8 Setting and Resetting the Format State via Member
Function flags
15.8 Stream Error States
15.9 Tying an Output Stream to an Input Stream
15.10 Wrap-Up
I 6 Exception Handling
16.1 Introduction
16.2 Exception-Handling Overview
16.3 Example: Handling an Attempt to Divide by Zero
16.4 When to Use Exception Handling
16.5 Rethrowing an Exception
16.6 Exception Specifications
16.7 Processing Unexpected Exceptions
16.8 Stack Unwinding
16.9 Constructors, Destructors and Exception Handling
16.10 Exceptions and Inheritance
16.11 Processing new Failures
16.12 Class auto_ptr and Dynamic Memory Allocation
16.13 Standard Library Exception Hierarchy
16.14 Other Error-Handling Techniques
16.15 Wrap-Up
I 7 File Processing
17.1 Introduction
17.2 Data Hierarchy
17.3 Files and Streams
17.4 Creating a Sequential File
17.5 Reading Data from a Sequential File
17.6 Updating Sequential Files
17.7 Random-Access Files
17.8 Creating a Random-Access File
17.9 Writing Data Randomly to a Random-Access File
17.10 Reading from a Random-Access File Sequentially
17.11 Case Study: A Transaction-Processing Program
17.12 Overview of Object Serialization
17.13 Wrap-Up
I 8 Class string and String Stream Processing
18.1 Introduction
18.2 string Assignment and Concatenation
18.3 Comparing strings
18.4 Substrings
18.5 Swapping strings
18.6 string Characteristics
18.7 Finding Substrings and Characters in a string
18.8 Replacing Characters in a string
18.9 Inserting Characters into a string
18.10 Conversion to C-Style Pointer-Based char * Strings
18.11 Iterators
18.12 String Stream Processing
18.13 Wrap-Up
1 9 Searching and Sorting
19.1 Introduction
19.2 Searching Algorithms
19.2.1 Efficiency of Linear Search
19.2.2 Binary Search
19.3 Sorting Algorithms
19.3.1 Efficiency of Selection Sort
19.3.2 Efficiency of Insertion Sort
19.3.3 Merge Sort (A Recursive Implementation)
19.4 Wrap-Up
20 Data Structures
20.1 Introduction
20.2 Self-Referential Classes
20.3 Dynamic Memory Allocation and Data Structures
20.4 Linked Lists
20.5 Stacks
20.6 Queues
20.7 Trees
20.8 Wrap-Up
2 I Bits, Characters, C Strings and structs
21.1 Introduction
21.2 Structure Definitions
21.3 Initializing Structures
21.4 Using Structures with Functions
21.5 typedef
21.6 Example: Card Shuffling and Dealing Simulation
21.7 Bitwise Operators
21.8 Bit Fields
21.9 Character-Handling Library
21.10 Pointer-Based String Manipulation Functions
21.11 Pointer-Based String-Conversion Functions
21.12 Search Functions of the Pointer-Based String-Handling Library
21.13 Memory Functions of the Pointer-Based String-Handling Library
21.14 Wrap-Up
22 Standard Template Library (STL)
22.1 Introduction to the Standard Template Library (STL)
22.1.1 Introduction to Containers
22.1.2 Introduction to Iterators
22.1.3 Introduction to Algorithms
22.2 Sequence Containers
22.2.1 vector Sequence Container
22.2.2 1 i St Sequence Container
22.2.3 deque Sequence Container
22.3 Associative Containers
22.3.1 mul ti set Associative Container
22.3.2 set Associative Container
22.3.3 mul ti map Associative Container
22.3.4 map Associative Container
22.4 Container Adapters
22.4.1 stack Adapter
22.4.2 queue Adapter
22.4.3 priority_queue Adapter
22.5 Algorithms
22.5.1 fill, fill_n, generate and generate_n ,
22.5.2 equal, mismatch and lexicographical_compare
22.5.3 remove, remove_if, remove_copy and remove_copy_if
22.5.4 replace, replace_if, replace_copy and replace_copy_if
22.5.5 Mathematical Algorithms
22.5.6 Basic Searching and Sorting Algorithms
22.5.7 swap, iter_swap and swap_ranges
22.5.8 copy_backward, merge, unique and reverse
22.5.9 inplace_merge, unique_copy and reverse_copy
22.5.10 Set Operations
22.5.11 lower_bound, upper_bound and equal_range
22.5.12 Heapsort
22.3.13 minandmax
22.5.14 STL Algorithms Not Covered in This Chapter
22.6 Gassbltset
22.7 Function Objects
22.8 Wrap-Up
22.9 STTL Web Resources
Chapteis on the Web
Chapters 23-27 are PDF documents posted online at the book's Companion Website
(located at wmw . pearsonhighered. con/dei tel).
23 Boost Libraries, Technical Report i and C-hOx
23.1 Introduction
23.2 Deitel Online C-I-+ and Related Resource Centers
23.3 Boost Libraries
23.4 Boost Libraries Overview
23.5 Regular Expressions with the Boost. Regex Library
23.5.1 Rj^ular Expression Example
23.5.2 Validating User Input with R^lar Expressions
23.5.3 Replacing and Splitting Strings
23.6 Smart Pointers with Boost. Smart_ptr
23.6.1 Reference Counted shared^ptr
23.6.2 weakjF)tr: shared_ptr Observer
23.7 Technical Report 1
23.8 C-f+Ox
23.9 Core Language Changes
23.10 Wrap-Up
24 Odier Topics
24.1 Introduction
24.2 const^cast Operator ^
24.3 mutable Class Members
24.4 namespaces
24.5 Operator Keywords
24.6 Pointers to Class Members (.* and ->*)
24.7 Multiple Inheritance
24.8 Multiple Inheritance and vi rtual Base
24.9 Wrap-Up
25 ATM Case Study, Part i: Object-Oriented
Design with the UML
25.1 Introduaion
25.2 Examming the ATM Requirements Document
25.3 Identifying the Classes in the ATM Requirements Document
25.4 Identifying Class Attributes
25.5 Identifying Objects' States and Activities
25.6 Identifying Class Operations
25.7 Indicating Collaboration Among Objects
25.8 Wrap-Up
26 ATM Case Study, Part 2: Implementing
an Object-Oriented Design
26.1 Introduction
26.2 Starting to Program the Classes of the ATM System
26.3 Incorporating Inheritance into the ATM System
26.4 ATM Case Study Implementation
26.4.1 Class ATM
26.4.2 Class Screen
26.4.3 Class Keypad
26.4.4 Class CashDi Spenser
26.4.5 Class Deposits!ot
26.4.6 Class Account
26.4.7 Class BankOatabase
26.4.8 Class Transaction
26.4.9 Class Balancelnqui ry
26.4.10 Class Withdrawal
26.4.11 Class Deposi t
26.4.12 Test Program ATMCaseStudy. cpp
26.5 Wrap-Up
27 Game Programming with Ogre
27.1 Introduction
27.2 Installing Ogre, OgreAL and OpenAL
27.3 Basics of Game Programming
27.4 The Game of Pong: Code Walkthrough
27.4.1 Ogre Initialization ,
27.4.2 Creating a Scene
27.4.3 Adding to the Scene
27.4.4 Animation and Timers
27.4.5 User Input
27.4.6 Collision Detection
27.4.7 Sound
27.4.8 Resources
27.4.9 Pong Driver
27.5 Wrap-Up