- Title Page
- Copyright Page
- Dedication Page
- Contents
- New Features in C++11
- Preface
- Chapter 1. Getting Started
- Part I. The Basics
- Contents
- Chapter 2. Variables and Basic Types
- Chapter 3. Strings, Vectors, and Arrays
- Chapter 4. Expressions
- Contents
- 4.1. Fundamentals
- 4.2. Arithmetic Operators
- 4.3. Logical and Relational Operators
- 4.4. Assignment Operators
- 4.5. Increment and Decrement Operators
- 4.6. The Member Access Operators
- 4.7. The Conditional Operator
- 4.8. The Bitwise Operators
- 4.9. The sizeof Operator
- 4.10. Comma Operator
- 4.11. Type Conversions
- 4.12. Operator Precedence Table
- Chapter Summary
- Defined Terms
- Chapter 5. Statements
- Chapter 6. Functions
- Chapter 7. Classes
- Part II. The C++ Library
- Contents
- Chapter 8. The IO Library
- Chapter 9. Sequential Containers
- Chapter 10. Generic Algorithms
- Chapter 11. Associative Containers
- Chapter 12. Dynamic Memory
- Part III. Tools for Class Authors
- Contents
- Chapter 13. Copy Control
- Chapter 14. Overloaded Operations and Conversions
- Contents
- 14.1. Basic Concepts
- 14.2. Input and Output Operators
- 14.3. Arithmetic and Relational Operators
- 14.4. Assignment Operators
- 14.5. Subscript Operator
- 14.6. Increment and Decrement Operators
- 14.7. Member Access Operators
- 14.8. Function-Call Operator
- 14.9. Overloading, Conversions, and Operators
- Chapter Summary
- Defined Terms
- Chapter 15. Object-Oriented Programming
- Contents
- 15.1. OOP: An Overview
- 15.2. Defining Base and Derived Classes
- 15.3. Virtual Functions
- 15.4. Abstract Base Classes
- 15.5. Access Control and Inheritance
- 15.6. Class Scope under Inheritance
- 15.7. Constructors and Copy Control
- 15.8. Containers and Inheritance
- 15.9. Text Queries Revisited
- Chapter Summary
- Defined Terms
- Chapter 16. Templates and Generic Programming
- Part IV. Advanced Topics
- Contents
- Chapter 17. Specialized Library Facilities
- Chapter 18. Tools for Large Programs
- Chapter 19. Specialized Tools and Techniques
- Appendix A. The Library
- Contents
- A.1. Library Names and Headers
- A.2. A Brief Tour of the Algorithms
- A.2.1. Algorithms to Find an Object
- A.2.2. Other Read-Only Algorithms
- A.2.3. Binary Search Algorithms
- A.2.4. Algorithms That Write Container Elements
- A.2.5. Partitioning and Sorting Algorithms
- A.2.6. General Reordering Operations
- A.2.7. Permutation Algorithms
- A.2.8. Set Algorithms for Sorted Sequences
- A.2.9. Minimum and Maximum Values
- A.2.10. Numeric Algorithms
- A.3. Random Numbers
- Index
- Add Pages
Contents
Section 15.2 Defining Base and Derived Classes
Section 15.3 Virtual Functions
Section 15.4 Abstract Base Classes
Section 15.5 Access Control and Inheritance
Section 15.6 Class Scope under Inheritance
Section 15.7 Constructors and Copy Control
Section 15.8 Containers and Inheritance
Section 15.9 Text Queries Revisited
Object-oriented programming is based on three fundamental concepts: data abstraction, which we covered in Chapter 7, and inheritance and dynamic binding, which we’ll cover in this chapter.
Inheritance and dynamic binding affect how we write our programs in two ways: They make it easier to define new classes that are similar, but not identical, to other classes, and they make it easier for us to write programs that can ignore the details of how those similar types differ.
Many applications include concepts that are related to but slightly different from one another. For example, our bookstore might offer different pricing strategies for different books. Some books might be sold only at a given price. Others might be sold subject to a discount. We might give a discount to purchasers who buy a specified number of copies of the book. Or we might give a discount for only the first few copies purchased but charge full price for any bought beyond a given limit, and so on. Object-oriented programming (OOP) is a good match to this kind of application.
-
No Comment