book

C++ How to Program, Sixth Edition

Name: C++ How to Program, Sixth Edition
ISBN: 9780136085669

by P. J. Deitel - Deitel & Associates, Inc., H. M. Deitel - Deitel & Associates, Inc.

July 2007

Beginner to intermediate

1504 pages

44h 24m

English

Pearson

Read now

Unlock full access

Copyright
Dedication
Deitel® Series Page
How To Program SeriesSimply SeriesSafariX Web Books
Deitel Resource Centers
Preface
New and Updated FeaturesTeaching ApproachTour of the BookObject-Oriented Design of an ATM with the UML: A Tour of the Optional Software Engineering Case StudyStudent Resources Included with C++ How to Program, 6/eWarnings and Error Messages on Older C++ CompilersNotes Regarding using Declarations and C Standard Library FunctionsC++ Multimedia Cyber Classroom, 6/eInstructor Resources for C++ How to Program, 6/eDeitel® Buzz Online Free E-mail NewsletterThe Deitel Online Resource Centers
Acknowledgments
C++ How to Program 6/e ReviewersC++ How to Program 5/e Reviewers
About the Authors
About Deitel & Associates, Inc.
Before You Begin
Downloading the C++ How to Program, 6/e Example CodeInstalling/Choosing a Compiler
1. Introduction to Computers, the Internet and the World Wide Web
1.1. Introduction1.2. What Is a Computer?1.3. Computer Organization1.4. Early Operating Systems1.5. Personal, Distributed and Client/Server Computing1.6. The Internet and the World Wide Web1.7. Web 2.01.8. Machine Languages, Assembly Languages and High-Level Languages1.9. History of C and C++1.10. C++ Standard Library1.11. History of Java1.12. Fortran, COBOL, Pascal and Ada1.13. BASIC, Visual Basic, Visual C++, C# and .NET1.14. Key Software Trend: Object Technology1.15. Typical C++ Development EnvironmentPhase 1: Creating a ProgramPhases 2 and 3: Preprocessing and Compiling a C++ ProgramPhase 4: LinkingPhase 5: LoadingPhase 6: ExecutionProblems That May Occur at Execution Time1.16. Notes About C++ and C++ How to Program, 6/e1.17. Test-Driving a C++ ApplicationRunning a C++ Application from the Windows XP Command PromptRunning a C++ Application Using GNU C++ with Linux1.18. Software Technologies1.19. Game Programming with the Ogre Libraries1.20. Future of C++: Open Source Boost Libraries, TR1 and C++0x1.21. Software Engineering Case Study: Introduction to Object Technology and the UMLBasic Object Technology ConceptsClasses, Data Members and Member FunctionsIntroduction to Object-Oriented Analysis and Design (OOAD)History of the UMLWhat Is the UML?UML Web ResourcesRecommended ReadingsSection 1.21 Self-Review ExercisesAnswers to Section 1.21 Self-Review Exercises1.22. Wrap-Up1.23. Web ResourcesDeitel & Associates Web SitesCompilers and Development ToolsResourcesGames and Game ProgrammingSummarySection 1.1 IntroductionSection 1.2 What Is a Computer?Section 1.3 Computer OrganizationSection 1.4 Early Operating SystemsSection 1.5 Personal, Distributed and Client/Server ComputingSection 1.6 The Internet and the World Wide WebSection 1.7 Web 2.0Section 1.8 Machine Languages, Assembly Languages and High-Level LanguagesSection 1.9 History of C and C++Section 1.10 C++ Standard LibrarySection 1.11 History of JavaSection 1.12 Fortran, COBOL, Pascal and AdaSection 1.13 BASIC, Visual Basic, Visual C++, C# and .NETSection 1.14 Key Software Trend: Object TechnologySection 1.15 Typical C++ Development EnvironmentSection 1.18 Software TechnologiesSection 1.19 Game Programming with the Ogre LibrariesSection 1.20 Future of C++: Open Source Boost Libraries, TR1 and C++0xSection 1.21 Software Engineering Case Study: Introduction to Object Technology and the UMLTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
2. Introduction to C++ Programming
2.1. Introduction2.2. First Program in C++: Printing a Line of Text2.3. Modifying Our First C++ ProgramPrinting a Single Line of Text with Multiple StatementsPrinting Multiple Lines of Text with a Single Statement2.4. Another C++ Program: Adding Integers2.5. Memory Concepts2.6. ArithmeticArithmetic Expressions in Straight-Line FormParentheses for Grouping SubexpressionsRules of Operator PrecedenceSample Algebraic and C++ ExpressionsEvaluation of a Second-Degree Polynomial2.7. Decision Making: Equality and Relational Operators2.8. (Optional) Software Engineering Case Study: Examining the ATM Requirements SpecificationRequirements SpecificationAnalyzing the ATM SystemUse Case DiagramsDesigning the ATM SystemInternet and Web ResourcesRecommended ReadingsSoftware Engineering Case Study Self-Review ExercisesAnswers to Software Engineering Case Study Self-Review Exercises2.9. Wrap-UpSummarySection 2.2 First Program in C++: Printing a Line of TextSection 2.4 Another C++ Program: Adding IntegersSection 2.5 Memory ConceptsSection 2.6 ArithmeticSection 2.7 Decision Making: Equality and Relational OperatorsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
3. Introduction to Classes and Objects
3.1. Introduction3.2. Classes, Objects, Member Functions and Data Members3.3. Overview of the Chapter Examples3.4. Defining a Class with a Member FunctionClass GradeBookTesting Class GradeBookUML Class Diagram for Class GradeBook3.5. Defining a Member Function with a ParameterDefining and Testing Class GradeBookMore on Arguments and ParametersUpdated UML Class Diagram for Class GradeBook3.6. Data Members, set Functions and get FunctionsGradeBook Class with a Data Member, a set Function and a get FunctionAccess Specifiers public and privateMember Functions setCourseName and getCourseNameMember Function displayMessageTesting Class GradeBookSoftware Engineering with Set and Get FunctionsGradeBook’s UML Class Diagram with a Data Member and set and get Functions3.7. Initializing Objects with ConstructorsDefining a ConstructorTesting Class GradeBookTwo Ways to Provide a Default Constructor for a ClassAdding the Constructor to Class GradeBook’s UML Class Diagram3.8. Placing a Class in a Separate File for ReusabilityHeader FilesIncluding a Header File That Contains a User-Defined ClassHow Header Files Are LocatedAdditional Software Engineering Issues3.9. Separating Interface from ImplementationInterface of a ClassSeparating the Interface from the ImplementationGradeBook.h: Defining a Class’s Interface with Function PrototypesGradeBook.cpp: Defining Member Functions in a Separate Source-Code FileTesting Class GradeBookThe Compilation and Linking Process3.10. Validating Data with set FunctionsGradeBook Class DefinitionValidating the Course Name with GradeBook Member Function setCourseNameTesting Class GradeBookAdditional Notes on Set Functions3.11. (Optional) Software Engineering Case Study: Identifying the Classes in the ATM Requirements SpecificationIdentifying the Classes in a SystemModeling ClassesSoftware Engineering Case Study Self-Review ExercisesAnswers to Software Engineering Case Study Self-Review Exercises3.12. Wrap-UpSummarySection 3.2 Classes, Objects, Member Functions and Data MembersSection 3.4 Defining a Class with a Member FunctionSection 3.5 Defining a Member Function with a ParameterSection 3.6 Data Members, set Functions and get FunctionsSection 3.7 Initializing Objects with ConstructorsSection 3.8 Placing a Class in a Separate File for ReusabilitySection 3.9 Separating Interface from ImplementationSection 3.10 Validating Data with set FunctionsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises

4. Control Statements: Part 1
4.1. Introduction4.2. Algorithms4.3. Pseudocode4.4. Control StructuresSequence Structure in C++Selection Statements in C++Repetition Statements in C++Summary of Control Statements in C++4.5. if Selection Statement4.6. if...else Double-Selection StatementConditional Operator (?:)Nested if...else StatementsDangling-else ProblemBlocks4.7. while Repetition Statement4.8. Formulating Algorithms: Counter-Controlled RepetitionPseudocode Algorithm with Counter-Controlled RepetitionEnhancing GradeBook ValidationImplementing Counter-Controlled Repetition in Class GradeBookDemonstrating Class GradeBookNotes on Integer Division and Truncation4.9. Formulating Algorithms: Sentinel-Controlled RepetitionDeveloping the Pseudocode Algorithm with Top-Down, Stepwise Refinement: The Top and First RefinementProceeding to the Second RefinementImplementing Sentinel-Controlled Repetition in Class GradeBookProgram Logic for Sentinel-Controlled Repetition vs. Counter-Controlled RepetitionFloating-Point Number Precision and Memory RequirementsConverting Between Fundamental Types Explicitly and ImplicitlyFormatting for Floating-Point Numbers4.10. Formulating Algorithms: Nested Control StatementsConversion to Class AnalysisDemonstrating Class Analysis4.11. Assignment Operators4.12. Increment and Decrement Operators4.13. (Optional) Software Engineering Case Study: Identifying Class Attributes in the ATM SystemIdentifying AttributesModeling AttributesSoftware Engineering Case Study Self-Review ExercisesAnswers to Software Engineering Case Study Self-Review Exercises4.14. Wrap-UpSummarySection 4.2 AlgorithmsSection 4.3 PseudocodeSection 4.4 Control StructuresSection 4.5 if Selection StatementSection 4.6 if...else Double-Selection StatementSection 4.7 while Repetition StatementSection 4.8 Formulating Algorithms: Counter-Controlled RepetitionSection 4.9 Formulating Algorithms: Sentinel-Controlled RepetitionSection 4.10 Formulating Algorithms: Nested Control StatementsSection 4.11 Assignment OperatorsSection 4.12 Increment and Decrement OperatorsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
5. Control Statements: Part 2
5.1. Introduction5.2. Essentials of Counter-Controlled Repetition5.3. for Repetition Statementfor Statement Header Componentsfor Statement UML Activity Diagram5.4. Examples Using the for StatementApplication: Summing the Even Integers from 2 to 20Application: Compound Interest CalculationsA Caution about Using Type float or double for Monetary AmountsUsing Stream Manipulators to Format Numeric Output5.5. do...while Repetition Statementdo...while Statement UML Activity Diagram5.6. switch Multiple-Selection StatementGradeBook Class with switch Statement to Count A, B, C, D and F GradesReading Character Inputswitch Statement DetailsProviding a default CaseIgnoring Newline, Tab and Blank Characters in InputTesting Class GradeBookswitch Statement UML Activity DiagramNotes on Data Types5.7. break and continue Statementsbreak Statementcontinue Statement5.8. Logical OperatorsLogical AND (&&) OperatorLogical OR (||) OperatorLogical Negation (!) OperatorLogical Operators ExampleSummary of Operator Precedence and Associativity5.9. Confusing the Equality (==) and Assignment (=) Operators5.10. Structured Programming Summary5.11. (Optional) Software Engineering Case Study: Identifying Objects’ States and Activities in the ATM SystemState Machine DiagramsActivity DiagramsSoftware Engineering Case Study Self-Review ExercisesAnswers to Software Engineering Case Study Self-Review Exercises5.12. Wrap-UpSummarySection 5.2 Essentials of Counter-Controlled RepetitionSection 5.3 for Repetition StatementSection 5.4 Examples Using the for StatementSection 5.5 do...while Repetition StatementSection 5.6 switch Multiple-Selection StatementSection 5.7 break and continue StatementsSection 5.8 Logical OperatorsSection 5.9 Confusing the Equality (==) and Assignment (=) OperatorsSection 5.10 Structured Programming SummaryTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
6. Functions and an Introduction to Recursion
6.1. Introduction6.2. Program Components in C++6.3. Math Library Functions6.4. Function Definitions with Multiple Parameters6.5. Function Prototypes and Argument CoercionFunction SignaturesArgument CoercionArgument Promotion Rules6.6. C++ Standard Library Header Files6.7. Case Study: Random Number GenerationRolling a Six-Sided DieRolling a Six-Sided Die 6,000,000 TimesRandomizing the Random Number GeneratorGeneralized Scaling and Shifting of Random Numbers6.8. Case Study: Game of Chance; Introducing enum6.9. Storage ClassesStorage Class, Scope and LinkageStorage Class CategoriesLocal VariablesRegister VariablesStatic Storage ClassIdentifiers with Static Storage Class6.10. Scope Rules6.11. Function Call Stack and Activation RecordsFunction Call Stack in Action6.12. Functions with Empty Parameter Lists6.13. Inline Functions6.14. References and Reference ParametersReference ParametersPassing Arguments by Value and by ReferenceReferences as Aliases within a FunctionReturning a Reference from a FunctionError Messages for Uninitialized References6.15. Default Arguments6.16. Unary Scope Resolution Operator6.17. Function OverloadingOverloaded square FunctionsHow the Compiler Differentiates Overloaded FunctionsOverloaded Operators6.18. Function Templates6.19. Recursion6.20. Example Using Recursion: Fibonacci Series6.21. Recursion vs. Iteration6.22. (Optional) Software Engineering Case Study: Identifying Class Operations in the ATM SystemIdentifying OperationsModeling OperationsOperations of Class BankDatabase and Class AccountOperations of Class ScreenOperations of Class KeypadOperations of Class CashDispenser and Class DepositSlotOperations of Class ATMIdentifying and Modeling Operation ParametersSoftware Engineering Case Study Self-Review ExercisesAnswers to Software Engineering Case Study Self-Review Exercises6.23. Wrap-UpSummarySection 6.1 IntroductionSection 6.2 Program Components in C++Section 6.3 Math Library FunctionsSection 6.4 Function Definitions with Multiple ParametersSection 6.5 Function Prototypes and Argument CoercionSection 6.6 C++ Standard Library Header FilesSection 6.7 Case Study: Random Number GenerationSection 6.8 Case Study: Game of Chance; Introducing enumSection 6.9 Storage ClassesSection 6.10 Scope RulesSection 6.11 Function Call Stack and Activation RecordsSection 6.12 Functions with Empty Parameter ListsSection 6.13 Inline FunctionsSection 6.14 References and Reference ParametersSection 6.15 Default ArgumentsSection 6.16 Unary Scope Resolution OperatorSection 6.17 Function OverloadingSection 6.18 Function TemplatesSection 6.19 RecursionSection 6.20 Example Using Recursion: Fibonacci SeriesSection 6.21 Recursion vs. IterationTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
7. Arrays and Vectors
7.1. Introduction7.2. Arrays7.3. Declaring Arrays7.4. Examples Using Arrays7.4.1. Declaring an Array and Using a Loop to Initialize the Array’s Elements7.4.2. Initializing an Array in a Declaration with an Initializer List7.4.3. Specifying an Array’s Size with a Constant Variable and Setting Array Elements with Calculations7.4.4. Summing the Elements of an Array7.4.5. Using Bar Charts to Display Array Data Graphically7.4.6. Using the Elements of an Array as Counters7.4.7. Using Arrays to Summarize Survey Results7.4.8. Using Character Arrays to Store and Manipulate Strings7.4.9. Static Local Arrays and Automatic Local Arrays7.5. Passing Arrays to Functions7.6. Case Study: Class GradeBook Using an Array to Store GradesStoring Student Grades in an Array in Class GradeBookTesting Class GradeBook7.7. Searching Arrays with Linear SearchLinear Search7.8. Sorting Arrays with Insertion SortInsertion Sort7.9. Multidimensional Arrays7.10. Case Study: Class GradeBook Using a Two-Dimensional ArrayStoring Student Grades in a Two-Dimensional Array in Class GradeBookTesting Class GradeBook7.11. Introduction to C++ Standard Library Class Template vector7.12. (Optional) Software Engineering Case Study: Collaboration Among Objects in the ATM SystemIdentifying the Collaborations in a SystemInteraction DiagramsCommunication DiagramsSequence of Messages in a Communication DiagramSequence DiagramsSoftware Engineering Case Study Self-Review ExercisesAnswers to Software Engineering Case Study Self-Review Exercises7.13. Wrap-UpSummarySection 7.1 IntroductionSection 7.2 ArraysSection 7.3 Declaring ArraysSection 7.4 Examples Using ArraysSection 7.5 Passing Arrays to FunctionsSection 7.6 Case Study: Class GradeBook Using an Array to Store GradesSection 7.7 Searching Arrays with Linear SearchSection 7.8 Sorting Arrays with Insertion SortSection 7.9 Multidimensional ArraysSection 7.11 Introduction to C++ Standard Library Class Template vectorTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesRecursion Exercisesvector Exercises
8. Pointers and Pointer-Based Strings
8.1. Introduction8.2. Pointer Variable Declarations and Initialization8.3. Pointer Operators8.4. Passing Arguments to Functions by Reference with Pointers8.5. Using const with PointersNonconstant Pointer to Nonconstant DataNonconstant Pointer to Constant DataConstant Pointer to Nonconstant DataConstant Pointer to Constant Data8.6. Selection Sort Using Pass-by-Reference8.7. sizeof OperatorDetermining the Sizes of the Fundamental Types, an Array and a Pointer8.8. Pointer Expressions and Pointer Arithmetic8.9. Relationship Between Pointers and Arrays8.10. Arrays of Pointers8.11. Case Study: Card Shuffling and Dealing Simulation8.12. Function PointersMultipurpose Selection Sort Using Function PointersArrays of Pointers to Functions8.13. Introduction to Pointer-Based String Processing8.13.1. Fundamentals of Characters and Pointer-Based Strings8.13.2. String-Manipulation Functions of the String-Handling LibraryCopying Strings with strcpy and strncpyConcatenating Strings with strcat and strncatComparing Strings with strcmp and strncmpTokenizing a String with strtokDetermining String Lengths8.14. Wrap-UpSummarySection 8.2 Pointer Variable Declarations and InitializationSection 8.3 Pointer OperatorsSection 8.4 Passing Arguments to Functions by Reference with PointersSection 8.5 Using const with PointersSection 8.6 Selection Sort Using Pass-by-ReferenceSection 8.7 sizeof OperatorSection 8.8 Pointer Expressions and Pointer ArithmeticSection 8.9 Relationship Between Pointers and ArraysSection 8.10 Arrays of PointersSection 8.11 Case Study: Card Shuffling and Dealing SimulationSection 8.12 Function PointersSection 8.13 Introduction to Pointer-Based String ProcessingTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesSpecial Section: Building Your Own ComputerMore Pointer ExercisesString-Manipulation ExercisesSpecial Section: Advanced String-Manipulation ExercisesA Challenging String-Manipulation Project
9. Classes: A Deeper Look, Part 1
9.1. Introduction9.2. Time Class Case StudyTime Class DefinitionTime Class Member FunctionsDefining Member Functions Outside the Class Definition; Class ScopeMember Functions vs. Global FunctionsUsing Class TimeLooking Ahead to Composition and InheritanceObject Size9.3. Class Scope and Accessing Class Members9.4. Separating Interface from Implementation9.5. Access Functions and Utility Functions9.6. Time Class Case Study: Constructors with Default ArgumentsNotes Regarding Class Time’s Set and Get Functions and Constructor9.7. Destructors9.8. When Constructors and Destructors Are Called9.9. Time Class Case Study: A Subtle Trap—Returning a Reference to a private Data Member9.10. Default Memberwise Assignment9.11. (Optional) Software Engineering Case Study: Starting to Program the Classes of the ATM SystemVisibilityNavigabilityImplementing the ATM System from Its UML DesignSoftware Engineering Case Study Self-Review ExercisesAnswers to Software Engineering Case Study Self-Review Exercises9.12. Wrap-UpSummarySection 9.2 Time Class Case StudySection 9.3 Class Scope and Accessing Class MembersSection 9.4 Separating Interface from ImplementationSection 9.5 Access Functions and Utility FunctionsSection 9.6 Time Class Case Study: Constructors with Default ArgumentsSection 9.7 DestructorsSection 9.8 When Constructors and Destructors Are CalledSection 9.9 Time Class Case Study: A Subtle Trap—Returning a Reference to a private Data MemberSection 9.10 Default Memberwise AssignmentTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
10. Classes: A Deeper Look, Part 2
10.1. Introduction10.2. const (Constant) Objects and const Member FunctionsDefining and Using const Member FunctionsInitializing a const Data Member with a Member InitializerErroneously Attempting to Initialize a const Data Member with an Assignment10.3. Composition: Objects as Members of Classes10.4. friend Functions and friend ClassesModifying a Class’s private Data with a Friend FunctionErroneously Attempting to Modify a private Member with a Non-friend Function10.5. Using the this PointerImplicitly and Explicitly Using the this Pointer to Access an Object’s Data MembersUsing the this Pointer to Enable Cascaded Function Calls10.6. Dynamic Memory Management with Operators new and delete10.7. static Class Members10.8. Data Abstraction and Information Hiding10.8.1. Example: Array Abstract Data Type10.8.2. Example: String Abstract Data Type10.8.3. Example: Queue Abstract Data Type10.9. Container Classes and Iterators10.10. Proxy Classes10.11. Wrap-UpSummarySection 10.2 const (Constant) Objects and const Member FunctionsSection 10.3 Composition: Objects as Members of ClassesSection 10.4 friend Functions and friend ClassesSection 10.5 Using the this PointerSection 10.6 Dynamic Memory Management with Operators new and deleteSection 10.7 static Class MembersSection 10.8 Data Abstraction and Information HidingSection 10.9 Container Classes and IteratorsSection 10.10 Proxy ClassesTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
11. Operator Overloading; String and Array Objects
11.1. Introduction11.2. Fundamentals of Operator Overloading11.3. Restrictions on Operator OverloadingPrecedence, Associativity and Number of OperandsCreating New OperatorsOperators for Fundamental TypesRelated Operators11.4. Operator Functions as Class Members vs. Global FunctionsOperators That Must Be Overloaded as Member FunctionsOperators as Member Functions and Global FunctionsWhy Overloaded Stream Insertion and Stream Extraction Operators Are Overloaded as Global FunctionsCommutative Operators11.5. Overloading Stream Insertion and Stream Extraction Operators11.6. Overloading Unary Operators11.7. Overloading Binary Operators11.8. Case Study: Array ClassCreating Arrays, Outputting Their Size and Displaying Their ContentsUsing the Overloaded Stream Insertion Operator to Fill an ArrayUsing the Overloaded Inequality OperatorInitializing a New Array with a Copy of an Existing Array’s ContentsUsing the Overloaded Assignment OperatorUsing the Overloaded Equality OperatorUsing the Overloaded Subscript OperatorArray Class DefinitionOverloading the Stream Insertion and Stream Extraction Operators as friendsArray Default ConstructorArray Copy ConstructorArray DestructorgetSize Member FunctionOverloaded Assignment OperatorOverloaded Equality and Inequality OperatorsOverloaded Subscript Operators11.9. Converting between Types11.10. Case Study: String ClassString Class DefinitionOverloading the Stream Insertion and Stream Extraction Operators as friendsString Conversion ConstructorString Copy ConstructorString DestructorOverloaded Assignment OperatorOverloaded Addition Assignment OperatorOverloaded Negation OperatorOverloaded Equality and Relational OperatorsOverloaded Subscript OperatorsOverloaded Function Call OperatorString Member Function getLengthNotes on Our String Class11.11. Overloading ++ and --Overloading the Prefix Increment OperatorOverloading the Postfix Increment Operator11.12. Case Study: A Date Class11.13. Standard Library Class stringStandard Library Class string11.14. explicit ConstructorsAccidentally Using a Single-Argument Constructor as a Conversion ConstructorPreventing Accidental Use of a Single-Argument Constructor as a Conversion Constructor11.15. Wrap-UpSummarySection 11.1 IntroductionSection 11.2 Fundamentals of Operator OverloadingSection 11.3 Restrictions on Operator OverloadingSection 11.4 Operator Functions as Class Members vs. Global FunctionsSection 11.5 Overloading Stream Insertion and Stream Extraction OperatorsSection 11.6 Overloading Unary OperatorsSection 11.7 Overloading Binary OperatorsSection 11.8 Case Study: Array ClassSection 11.9 Converting between TypesSection 11.10 Case Study: String ClassSection 11.11 Overloading ++ and --Section 11.13 Standard Library Class stringSection 11.14 explicit ConstructorsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
12. Object-Oriented Programming: Inheritance
12.1. Introduction12.2. Base Classes and Derived Classes12.3. protected Members12.4. Relationship between Base Classes and Derived Classes12.4.1. Creating and Using a CommissionEmployee Class12.4.2. Creating a BasePlusCommissionEmployee Class Without Using InheritanceDefining Class BasePlusCommissionEmployeeTesting Class BasePlusCommissionEmployeeExploring the Similarities Between Class BasePlusCommissionEmployee and Class CommissionEmployee12.4.3. Creating a CommissionEmployee–BasePlusCommissionEmployee Inheritance HierarchyIncluding the Base-Class Header File in the Derived-Class Header File with #includeLinking Process in an Inheritance Hierarchy12.4.4. CommissionEmployee–BasePlusCommissionEmployee Inheritance Hierarchy Using protected DataDefining Base Class CommissionEmployee with protected DataModifying Derived Class BasePlusCommissionEmployeeTesting the Modified BasePlusCommissionEmployee ClassNotes on Using protected Data12.4.5. CommissionEmployee–BasePlusCommissionEmployee Inheritance Hierarchy Using private Data12.5. Constructors and Destructors in Derived Classes12.6. public, protected and private Inheritance12.7. Software Engineering with Inheritance12.8. Wrap-UpSummarySection 12.1 IntroductionSection 12.2 Base Classes and Derived ClassesSection 12.3 protected MembersSection 12.5 Constructors and Destructors in Derived ClassesSection 12.6 public, protected and private InheritanceTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
13. Object-Oriented Programming: Polymorphism
13.1. Introduction13.2. Polymorphism Examples13.3. Relationships Among Objects in an Inheritance Hierarchy13.3.1. Invoking Base-Class Functions from Derived-Class Objects13.3.2. Aiming Derived-Class Pointers at Base-Class Objects13.3.3. Derived-Class Member-Function Calls via Base-Class Pointers13.3.4. Virtual Functions13.3.5. Summary of the Allowed Assignments Between Base-Class and Derived-Class Objects and Pointers13.4. Type Fields and switch Statements13.5. Abstract Classes and Pure virtual Functions13.6. Case Study: Payroll System Using Polymorphism13.6.1. Creating Abstract Base Class Employee13.6.2. Creating Concrete Derived Class SalariedEmployee13.6.3. Creating Concrete Derived Class HourlyEmployee13.6.4. Creating Concrete Derived Class CommissionEmployee13.6.5. Creating Indirect Concrete Derived Class BasePlusCommissionEmployee13.6.6. Demonstrating Polymorphic Processing13.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_info13.9. Virtual Destructors13.10. (Optional) Software Engineering Case Study: Incorporating Inheritance into the ATM SystemImplementing the ATM System Design Incorporating InheritanceATM Case Study Wrap-UpSoftware Engineering Case Study Self-Review ExercisesAnswers to Software Engineering Case Study Self-Review Exercises13.11. Wrap-UpSummarySection 13.1 IntroductionSection 13.2 Polymorphism ExamplesSection 13.3 Relationships Among Objects in an Inheritance HierarchySection 13.4 Type Fields and switch StatementsSection 13.5 Abstract Classes and Pure virtual FunctionsSection 13.7 (Optional) Polymorphism, Virtual Functions and Dynamic Binding “Under the Hood”Section 13.8 Case Study: Payroll System Using Polymorphism and Runtime Type Information with Downcasting, dynamic_cast, typeid and type_infoSection 13.9 Virtual DestructorsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
14. Templates
14.1. Introduction14.2. Function TemplatesExample: Function Template printArray14.3. Overloading Function Templates14.4. Class TemplatesCreating Class Template Stack< T >Creating a Driver to Test Class Template Stack< T >Creating Function Templates to Test Class Template Stack< T >14.5. Nontype Parameters and Default Types for Class Templates14.6. Notes on Templates and Inheritance14.7. Notes on Templates and Friends14.8. Notes on Templates and static Members14.9. Wrap-UpSummarySection 14.1 IntroductionSection 14.2 Function TemplatesSection 14.3 Overloading Function TemplatesSection 14.4 Class TemplatesSection 14.5 Nontype Parameters and Default Types for Class TemplatesSection 14.6 Notes on Templates and InheritanceSection 14.7 Notes on Templates and FriendsSection 14.8 Notes on Templates and static MembersTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
15. Stream Input/Output
15.1. Introduction15.2. Streams15.2.1. Classic Streams vs. Standard Streams15.2.2. iostream Library Header Files15.2.3. Stream Input/Output Classes and ObjectsStream-I/O Template Hierarchy and Operator OverloadingStandard Stream Objects cin, cout, cerr and clogFile-Processing Templates15.3. Stream Output15.3.1. Output of char * Variables15.3.2. Character Output Using Member Function put15.4. Stream Input15.4.1. get and getline Member FunctionsUsing Member Functions eof, get and putComparing cin and cin.getUsing Member Function getline15.4.2. istream Member Functions peek, putback and ignore15.4.3. Type-Safe I/O15.5. Unformatted I/O Using read, write and gcount15.6. Introduction to Stream Manipulators15.6.1. Integral Stream Base: dec, oct, hex and setbase15.6.2. Floating-Point Precision (precision, setprecision)15.6.3. Field Width (width, setw)15.6.4. User-Defined Output Stream Manipulators15.7. Stream Format States and Stream Manipulators15.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 (boolalpha)15.7.8. Setting and Resetting the Format State via Member Function flags15.8. Stream Error States15.9. Tying an Output Stream to an Input Stream15.10. Wrap-UpSummarySection 15.1 IntroductionSection 15.2 StreamsSection 15.3 Stream OutputSection 15.4 Stream InputSection 15.5 Unformatted I/O Using read, write and gcountSection 15.6 Introduction to Stream ManipulatorsSection 15.7 Stream Format States and Stream ManipulatorsSection 15.8 Stream Error StatesSection 15.9 Tying an Output Stream to an Input StreamTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
16. Exception Handling
16.1. Introduction16.2. Exception-Handling Overview16.3. Example: Handling an Attempt to Divide by ZeroDefining an Exception Class to Represent the Type of Problem That Might OccurDemonstrating Exception HandlingEnclosing Code in a try BlockDefining a catch Handler to Process a DivideByZeroExceptionTermination Model of Exception HandlingFlow of Program Control When the User Enters a Nonzero DenominatorFlow of Program Control When the User Enters a Denominator of Zero16.4. When to Use Exception Handling16.5. Rethrowing an Exception16.6. Exception Specifications16.7. Processing Unexpected Exceptions16.8. Stack Unwinding16.9. Constructors, Destructors and Exception Handling16.10. Exceptions and Inheritance16.11. Processing new Failuresnew Returning 0 on Failurenew Throwing bad_alloc on FailureHandling new Failures Using Function set_new_handler16.12. Class auto_ptr and Dynamic Memory Allocation16.13. Standard Library Exception Hierarchy16.14. Other Error-Handling Techniques16.15. Wrap-UpSummarySection 16.1 IntroductionSection 16.2 Exception-Handling OverviewSection 16.3 Example: Handling an Attempt to Divide by ZeroSection 16.4 When to Use Exception HandlingSection 16.5 Rethrowing an ExceptionSection 16.6 Exception SpecificationsSection 16.7 Processing Unexpected ExceptionsSection 16.8 Stack UnwindingSection 16.9 Constructors, Destructors and Exception HandlingSection 16.10 Exceptions and InheritanceSection 16.11 Processing new FailuresSection 16.12 Class auto_ptr and Dynamic Memory AllocationSection 16.13 Standard Library Exception HierarchyTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
17. File Processing
17.1. Introduction17.2. Data Hierarchy17.3. Files and Streams17.4. Creating a Sequential File17.5. Reading Data from a Sequential File17.6. Updating Sequential Files17.7. Random-Access Files17.8. Creating a Random-Access FileWriting Bytes with ostream Member Function writeConverting Between Pointer Types with the reinterpret_cast OperatorCredit Processing Program17.9. Writing Data Randomly to a Random-Access File17.10. Reading from a Random-Access File Sequentially17.11. Case Study: A Transaction-Processing Program17.12. Overview of Object Serialization17.13. Wrap-UpSummarySection 17.1 IntroductionSection 17.2 Data HierarchySection 17.3 Files and StreamsSection 17.4 Creating a Sequential FileSection 17.5 Reading Data from a Sequential FileSection 17.6 Updating Sequential FilesSection 17.7 Random-Access FilesSection 17.8 Creating a Random-Access FileSection 17.9 Writing Data Randomly to a Random-Access FileSection 17.10 Reading from a Random-Access File SequentiallySection 17.12 Overview of Object SerializationTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
18. Class string and String Stream Processing
18.1. Introduction18.2. string Assignment and Concatenation18.3. Comparing strings18.4. Substrings18.5. Swapping strings18.6. string Characteristics18.7. Finding Substrings and Characters in a string18.8. Replacing Characters in a string18.9. Inserting Characters into a string18.10. Conversion to C-Style Pointer-Based char * Strings18.11. Iterators18.12. String Stream Processing18.13. Wrap-UpSummarySection 18.1 IntroductionSection 18.2 string Assignment and ConcatenationSection 18.3 Comparing stringsSection 18.4 SubstringsSection 18.5 Swapping stringsSection 18.6 string CharacteristicsSection 18.7 Finding Substrings and Characters in a stringSection 18.8 Replacing Characters in a stringSection 18.9 Inserting Characters into a stringSection 18.10 Conversion to C-Style Pointer-Based char * StringsSection 18.11 IteratorsSection 18.12 String Stream ProcessingTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
19. Searching and Sorting
19.1. Introduction19.2. Searching Algorithms19.2.1. Efficiency of Linear Search19.2.2. Binary SearchEfficiency of Binary Search19.3. Sorting Algorithms19.3.1. Efficiency of Selection Sort19.3.2. Efficiency of Insertion Sort19.3.3. Merge Sort (A Recursive Implementation)Efficiency of Merge Sort19.4. Wrap-UpSummarySection 19.1 IntroductionSection 19.2 Searching AlgorithmsSection 19.2.1 Efficiency of Linear SearchSection 19.2.2 Binary SearchSection 19.3.1 Efficiency of Selection SortSection 19.3.2 Efficiency of Insertion SortSection 19.3.3 Merge Sort (A Recursive Implementation)TerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
20. Data Structures
20.1. Introduction20.2. Self-Referential Classes20.3. Dynamic Memory Allocation and Data Structures20.4. Linked ListsLinked List ImplementationMember Function insertAtFrontMember Function insertAtBackMember Function removeFromFrontMember Function removeFromBackMember Function printLinear and Circular Singly Linked and Doubly Linked Lists20.5. Stacks20.6. Queues20.7. TreesBasic TerminologyBinary Search TreesImplementing the Binary Search Tree ProgramInorder Traversal AlgorithmPreorder Traversal AlgorithmPostorder Traversal AlgorithmDuplicate EliminationOverview of the Binary Tree Exercises20.8. Wrap-UpSummarySection 20.1 IntroductionSection 20.2 Self-Referential ClassesSection 20.3 Dynamic Memory Allocation and Data StructuresSection 20.4 Linked ListsSection 20.5 StacksSection 20.6 QueuesSection 20.7 TreesTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesSpecial Section: Building Your Own Compiler
21. Bits, Characters, C Strings and structs
21.1. Introduction21.2. Structure Definitions21.3. Initializing Structures21.4. Using Structures with Functions21.5. typedef21.6. Example: High-Performance Card Shuffling and Dealing Simulation21.7. Bitwise OperatorsPrinting a Binary Representation of an Integral ValueBitwise AND Operator (&)Bitwise Inclusive OR Operator (|)Bitwise Exclusive OR (^)Bitwise Complement (~)Left-Shift OperatorRight-Shift OperatorBitwise Assignment Operators21.8. Bit Fields21.9. Character-Handling Library21.10. Pointer-Based String-Conversion Functions21.11. Search Functions of the Pointer-Based String-Handling Library21.12. Memory Functions of the Pointer-Based String-Handling Library21.13. Wrap-UpSummarySection 21.2 Structure DefinitionsSection 21.3 Initializing StructuresSection 21.4 Using Structures with FunctionsSection 21.5 typedefSection 21.7 Bitwise OperatorsSection 21.8 Bit FieldsSection 21.9 Character-Handling LibrarySection 21.10 Pointer-Based String-Conversion FunctionsSection 21.11 Search Functions of the Pointer-Based String-Handling LibrarySection 21.12 Memory Functions of the Pointer-Based String-Handling LibraryTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
22. Standard Template Library (STL)
22.1. Introduction to the Standard Template Library (STL)22.1.1. Introduction to ContainersSTL Containers OverviewSTL Container Common FunctionsSTL Container Header FilesFirst-Class Container Common typedefs22.1.2. Introduction to IteratorsUsing istream_iterator for Input and Using ostream_iterator for OutputIterator Categories and Iterator Category HierarchyPredefined Iterator typedefsIterator Operations22.1.3. Introduction to Algorithms22.2. Sequence Containers22.2.1. vector Sequence ContainerUsing Vector and IteratorsVector Element-Manipulation Functions22.2.2. list Sequence Container22.2.3. deque Sequence Container22.3. Associative Containers22.3.1. multiset Associative Container22.3.2. set Associative Container22.3.3. multimap Associative Container22.3.4. map Associative Container22.4. Container Adapters22.4.1. stack Adapter22.4.2. queue Adapter22.4.3. priority_queue Adapter22.5. Algorithms22.5.1. fill, fill_n, generate and generate_n22.5.2. equal, mismatch and lexicographical_compare22.5.3. remove, remove_if, remove_copy and remove_copy_if22.5.4. replace, replace_if, replace_copy and replace_copy_if22.5.5. Mathematical Algorithms22.5.6. Basic Searching and Sorting Algorithms22.5.7. swap, iter_swap and swap_ranges22.5.8. copy_backward, merge, unique and reverse22.5.9. inplace_merge, unique_copy and reverse_copy22.5.10. Set Operations22.5.11. lower_bound, upper_bound and equal_range22.5.12. Heapsort22.5.13. min and max22.5.14. STL Algorithms Not Covered in This Chapter22.6. Class bitsetSieve of Eratosthenes with bitset22.7. Function ObjectsPredefined Function Objects of the Standard Template LibraryUsing the STL Accumulate Algorithm22.8. Wrap-Up22.9. STL Web ResourcesSummarySection 22.1 Introduction to the Standard Template Library (STL)Section 22.1.1 Introduction to ContainersSection 22.1.2 Introduction to IteratorsSection 22.1.3 Introduction to AlgorithmsSection 22.2 Sequence ContainersSection 22.2.1 vector Sequence ContainerSection 22.2.2 list Sequence ContainerSection 22.2.3 deque Sequence ContainerSection 22.3 Associative ContainersSection 22.3.1 multiset Associative ContainerSection 22.3.2 set Associative ContainerSection 22.3.3 multimap Associative ContainerSection 22.3.4 map Associative ContainerSection 22.4 Container AdaptersSection 22.4.1 stack AdapterSection 22.4.2 queue AdapterSection 22.4.3 priority_queue AdapterSection 22.5.1 fill, fill_n, generate and generate_nSection 22.5.2 equal, mismatch and lexicographical_compareSection 22.5.3 remove, remove_if, remove_copy and remove_copy_ifSection 22.5.4 replace, replace_if, replace_copy and replace_copy_ifSection 22.5.5 Mathematical AlgorithmsSection 22.5.6 Basic Searching and Sorting AlgorithmsSection 22.5.7 swap, iter_swap and swap_rangesSection 22.5.8 copy_backward, merge, unique and reverseSection 22.5.9 inplace_merge, unique_copy and reverse_copySection 22.5.10 Set OperationsSection 22.5.11 lower_bound, upper_bound and equal_rangeSection 22.5.12 HeapsortSection 22.5.13 min and maxSection 22.6 Class bitsetSection 22.7 Function ObjectsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesRecommended Reading
23. Game Programming with Ogre
23.1. Introduction23.2. Installing Ogre, OgreAL and OpenAL23.3. Basics of Game ProgrammingGraphics3D ModelsMaterials, Textures and ColorsLightingCollision Detection and ResponseSoundTextTimersUser Experience23.4. The Game of Pong: Code Walkthrough23.4.1. Ogre Initialization23.4.2. Creating a SceneSceneManagerCameraLight23.4.3. Adding to the SceneAdd the BallAdd the PaddlesAdd the WallsAdd the Text23.4.4. Animation and Timers23.4.5. User Input23.4.6. Collision Detection23.4.7. Sound23.4.8. Resources23.4.9. Pong Driver23.5. Wrap-Up23.6. Ogre Web ResourcesTutorialsToolsCode ExamplesBooksForumsSummarySection 23.3 Basics of Game ProgrammingSection 23.4.1 Ogre InitializationSection 23.4.2 Creating a SceneSection 23.4.3 Adding to the SceneSection 23.4.4 Animation and TimersSection 23.4.5 User InputSection 23.4.6 Collision DetectionSection 23.4.7 SoundSection 23.4.8 ResourcesSection 23.4.9 Pong DriverTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
24. Boost Libraries, Technical Report 1 and C++0x
24.1. Introduction24.2. Deitel Online C++ and Related Resource Centers24.3. Boost Libraries24.4. Adding a New Library to BoostThe Boost Software License24.5. Installing the Boost Libraries24.6. Boost Libraries in Technical Report 1 (TR1)ArrayBindFunctionMem_fnRandomRefRegexResult_ofSmart_ptrTupleType_traits24.7. Regular Expressions with the Boost.Regex LibraryRegular Expression Character Classes24.7.1. Regular Expression ExampleQuantifiers24.7.2. Validating User Input with Regular Expressions24.7.3. Replacing and Splitting Strings24.8. Smart Pointers with Boost.Smart_ptr24.8.1. Reference Counted shared_ptrExample Using shared_ptr24.8.2. weak_ptr: shared_ptr ObserverExample Using weak_ptr24.9. Technical Report 1Unordered Associative ContainersMathematical Special FunctionsIncreased Compatibility with C9924.10. C++0xStandardization ProcessGoals for C++0x24.11. Core Language ChangesRvalue ReferenceClarification of Initialization of Class Objects by rvaluesstatic_assertextern templateExtended friend DeclarationsSynchronizing the C++ Preprocessor with C99Conditionally Supported BehaviorChanging Undefined Behavior into Diagnosable ErrorsAdding the long long Type to C++Adding Extended Integer Types to C++Delegating ConstructorsRight Angle BracketsDeducing the Type of Variable from Its InitializerVariadic TemplatesTemplate AliasesNew Character TypesExtending sizeofAlternative to Sequence Points24.12. Wrap-UpSummarySection 24.2 Deitel Online C++ and Related Resource CentersSection 24.3 Boost LibrariesSection 24.4 Adding a New Library to BoostSection 24.5 Installing the Boost LibrariesSection 24.6 Boost Libraries in Technical Report 1 (TR1)Section 24.7 Regular Expressions with the Boost.Regex LibrarySection 24.7.1 Regular Expression ExampleSection 24.7.2 Validating User Input with Regular ExpressionsSection 24.7.3 Replacing and Splitting StringsSection 24.8 Smart Pointers with Boost.Smart_ptrSection 24.8.1 Reference Counted shared_ptrSection 24.8.2 weak_ptr:shared_ptr ObserverSection 24.9 Technical Report 1Section 24.10 C++0xSection 24.11 Core Language ChangesTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
25. Other Topics
25.1. Introduction25.2. const_cast Operator25.3. namespacesUsing the std NamespaceDefining NamespacesAccessing Namespace Members with Qualified NamesAliases for Namespace Names25.4. Operator Keywords25.5. mutable Class MembersMechanical Demonstration of a mutable Data Member25.6. Pointers to Class Members (.* and ->*)25.7. Multiple InheritanceResolving Ambiguity Issues That Arise When a Derived Class Inherits Member Functions of the Same Name from Multiple Base ClassesDemonstrating the Is-A Relationships in Multiple Inheritance25.8. Multiple Inheritance and virtual Base ClassesCompilation Errors Produced When Ambiguity Arises in Diamond InheritanceEliminating Duplicate Subobjects with virtual Base-Class InheritanceConstructors in Multiple-Inheritance Hierarchies with virtual Base ClassesAdditional Information on Multiple Inheritance25.9. Wrap-UpSummarySection 24.2 const_cast OperatorSection 24.3 namespacesSection 25.4 Operator KeywordsSection 24.5 mutable Class MembersSection 24.6 Pointers to Class Members (.* and ->*)Section 25.7 Multiple InheritanceSection 24.8 Multiple Inheritance and virtual Base ClassesTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
A. Operator Precedence and Associativity Chart
A.1. Operator Precedence
B. ASCII Character Set
C. Fundamental Types
D. Number Systems
D.1. IntroductionD.2. Abbreviating Binary Numbers as Octal and Hexadecimal NumbersD.3. Converting Octal and Hexadecimal Numbers to Binary NumbersD.4. Converting from Binary, Octal or Hexadecimal to DecimalD.5. Converting from Decimal to Binary, Octal or HexadecimalD.6. Negative Binary Numbers: Two’s Complement NotationSummaryTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
E. C Legacy Code Topics
E.1. IntroductionE.2. Redirecting Input/Output on UNIX/Linux/Mac OS X and Windows SystemsE.3. Variable-Length Argument ListsE.4. Using Command-Line ArgumentsE.5. Notes on Compiling Multiple-Source-File ProgramsE.6. Program Termination with exit and atexitE.7. Type Qualifier volatileE.8. Suffixes for Integer and Floating-Point ConstantsE.9. Signal HandlingE.10. Dynamic Memory Allocation with calloc and reallocE.11. Unconditional Branch: gotoE.12. UnionsE.13. Linkage SpecificationsE.14. Wrap-UpSummarySection E.2 Redirecting Input/Output on UNIX/Linux/Mac OS X and Windows SystemsSection E.3 Variable-Length Argument ListsSection E.4 Using Command-Line ArgumentsSection E.5 Notes on Compiling Multiple-Source-File ProgramsSection E.6 Program Termination with exit and atexitSection E.7 Type Qualifier volatileSection E.8 Suffixes for Integer and Floating-Point ConstantsSection E.9 Signal HandlingSection E.10 Dynamic Memory Allocation with calloc and reallocSection E.11 Unconditional Branch: gotoSection E.12 UnionsSection E.13 Linkage SpecificationsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
F. Preprocessor
F.1. IntroductionF.2. The #include Preprocessor DirectiveF.3. The #define Preprocessor Directive: Symbolic ConstantsF.4. The #define Preprocessor Directive: MacrosF.5. Conditional CompilationF.6. The #error and #pragma Preprocessor DirectivesF.7. Operators # and ##F.8. Predefined Symbolic ConstantsF.9. AssertionsF.10. Wrap-UpSummarySection F.2 The #include Preprocessor DirectiveSection F.3 The #define Preprocessor Directive: Symbolic ConstantsSection F.4 The #define Preprocessor Directive: MacrosSection F.5 Conditional CompilationSection F.6 The #error and #pragma Preprocessor DirectivesSection F.7 Operators # and ##Section F.8 Predefined Symbolic ConstantsSection F.9 AssertionsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
G. ATM Case Study Code
G.1. ATM Case Study ImplementationG.2. Class ATMATM Class Member-Function DefinitionsG.3. Class ScreenScreen Class Member-Function DefinitionsG.4. Class KeypadKeypad Class Member-Function DefinitionG.5. Class CashDispenserCashDispenser Class Member-Function DefinitionsG.6. Class DepositSlotG.7. Class AccountAccount Class Member-Function DefinitionsG.8. Class BankDatabaseBankDatabase Class Member-Function DefinitionsG.9. Class TransactionG.10. Class BalanceInquiryG.11. Class WithdrawalWithdrawal Class Member-Function DefinitionsG.12. Class DepositDeposit Class Member-Function DefinitionsG.13. Test Program ATMCaseStudy.cppG.14. Wrap-Up
H. UML 2: Additional Diagram Types
H.1. IntroductionH.2. Additional Diagram Types
I. Using the Visual Studio Debugger
I.1. IntroductionI.2. Breakpoints and the Continue CommandI.3. Locals and Watch WindowsI.4. Controlling Execution Using the Step Into, Step Over, Step Out and Continue CommandsI.5. Autos WindowI.6. Wrap-UpSummarySection I.1 IntroductionSection I.2 Breakpoints and the Continue CommandSection I.3 Locals and Watch WindowsSection I.4 Controlling Execution Using the Step Into, Step Over, Step Out and Continue CommandsSection I.5 Autos WindowTerminologySelf-Review ExercisesAnswers to Self-Review Exercises
J. Using the GNU C++ Debugger
J.1. IntroductionJ.2. Breakpoints and the run, stop, continue and print CommandsJ.3. print and set CommandsJ.4. Controlling Execution Using the step, finish and next CommandsJ.5. watch CommandJ.6. Wrap-UpSummarySection J.1 IntroductionSection J.2 Breakpoints and the run, stop, continue and print CommandsSection J.3 print and set CommandsSection J.4 Controlling Execution Using the step, finish and next CommandsSection J.5 watch CommandTerminologySelf-Review ExercisesAnswers to Self-Review Exercises
Bibliography

Content preview from C++ How to Program, Sixth Edition

Chapter 7. Arrays and Vectors

	Now go, write it before them in a table, and note it in a book.
	--Isaiah 30:8

	Begin at the beginning, ... and go on till you come to the end: then stop.
	--Lewis Carroll

	To go beyond is as wrong as to fall short.
	--Confucius

OBJECTIVES

In this chapter you’ll learn:

To use the array data structure to represent a set of related data items.
To use arrays to store, sort and search lists and tables of values.
To declare arrays, initialize arrays and refer to the individual elements of arrays.
To pass arrays to functions.
Basic searching and sorting techniques.
To declare and manipulate multidimensional arrays.
To use C++ Standard Library class template vector.

Outline
7.1	Introduction
7.2	Arrays
7.3	Declaring Arrays
7.4	Examples Using ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9780136085669Purchase book

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

C++ How to Program, Sixth Edition

by P. J. Deitel - Deitel & Associates, Inc., H. M. Deitel - Deitel & Associates, Inc.

Chapter 7. Arrays and Vectors

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.