book

The C++ Programming Language, 4th Edition

by Bjarne Stroustrup

May 2013

Intermediate to advanced

1376 pages

47h 26m

English

Addison-Wesley Professional

Read now

Unlock full access

Acknowledgments
Acknowledgments
Acknowledgments
Acknowledgments

1.1. The Structure of This Book1.2. The Design of C++1.3. Learning C++1.4. History1.5. Advice1.6. References
2.1. Introduction2.2. The Basics2.3. User-Defined Types2.4. Modularity2.5. Postscript2.6. Advice
3.1. Introduction3.2. Classes3.3. Copy and Move3.4. Templates3.5. Advice
4.1. Libraries4.2. Strings4.3. Stream I/O4.4. Containers4.5. Algorithms4.6. Advice
5.1. Introduction5.2. Resource Management5.3. Concurrency5.4. Small Utility Components5.5. Regular Expressions5.6. Math5.7. Advice
6.1. The ISO C++ Standard6.2. Types6.3. Declarations6.4. Objects and Values6.5. Type Aliases6.6. Advice
7.1. Introduction7.2. Pointers7.3. Arrays7.4. Pointers into Arrays7.5. Pointers and const7.6. Pointers and Ownership7.7. References7.8. Advice
8.1. Introduction8.2. Structures8.3. Unions8.4. Enumerations8.5. Advice
9.1. Introduction9.2. Statement Summary9.3. Declarations as Statements9.4. Selection Statements9.5. Iteration Statements9.6. goto Statements9.7. Comments and Indentation9.8. Advice
10.1. Introduction10.2. A Desk Calculator10.3. Operator Summary10.4. Constant Expressions10.5. Implicit Type Conversion10.6. Advice
11.1. Etc. Operators11.2. Free Store11.3. Lists11.4. Lambda Expressions11.5. Explicit Type Conversion11.6. Advice
12.1. Function Declarations12.2. Argument Passing12.3. Overloaded Functions12.4. Pre- and Postconditions12.5. Pointer to Function12.6. Macros12.7. Advice
13.1. Error Handling13.2. Exception Guarantees13.3. Resource Management13.4. Enforcing Invariants13.5. Throwing and Catching Exceptions13.6. A vector Implementation13.7. Advice
14.1. Composition Problems14.2. Namespaces14.3. Modularization and Interfaces14.4. Composition Using Namespaces14.5. Advice
15.1. Separate Compilation15.2. Linkage15.3. Using Header Files15.4. Programs15.5. Advice
16.1. Introduction16.2. Class Basics16.3. Concrete Classes16.4. Advice
17.1. Introduction17.2. Constructors and Destructors17.3. Class Object Initialization17.4. Member and Base Initialization17.5. Copy and Move17.6. Generating Default Operations17.7. Advice
18.1. Introduction18.2. Operator Functions18.3. A Complex Number Type18.4. Type Conversion18.5. Advice
19.1. Introduction19.2. Special Operators19.3. A String Class19.4. Friends19.5. Advice
20.1. Introduction20.2. Derived Classes20.3. Class Hierarchies20.4. Abstract Classes20.5. Access Control20.6. Pointers to Members20.7. Advice
21.1. Introduction21.2. Design of Class Hierarchies21.3. Multiple Inheritance21.4. Advice
22.1. Introduction22.2. Class Hierarchy Navigation22.3. Double Dispatch and Visitors22.4. Construction and Destruction22.5. Type Identification22.6. Uses and Misuses of RTTI22.7. Advice
23.1. Introduction and Overview23.2. A Simple String Template23.3. Type Checking23.4. Class Template Members23.5. Function Templates23.6. Template Aliases23.7. Source Code Organization23.8. Advice
24.1. Introduction24.2. Algorithms and Lifting24.3. Concepts24.4. Making Concepts Concrete24.5. Advice
25.1. Introduction25.2. Template Parameters and Arguments25.3. Specialization25.4. Advice
26.1. Introduction26.2. Template Instantiation26.3. Name Binding26.4. Advice
27.1. Introduction27.2. Parameterization and Hierarchy27.3. Hierarchies of Class Templates27.4. Template Parameters as Base Classes27.5. Advice
28.1. Introduction28.2. Type Functions28.3. Control Structures28.4. Conditional Definition: Enable_if28.5. A Compile-Time List: Tuple28.6. Variadic Templates28.7. SI Units Example28.8. Advice
29.1. Introduction29.2. A Matrix Template29.3. Matrix Arithmetic Operations29.4. Matrix Implementation29.5. Solving Linear Equations29.6. Advice
30.1. Introduction30.2. Headers30.3. Language Support30.4. Error Handling30.5. Advice
31.1. Introduction31.2. Container Overview31.3. Operations Overview31.4. Containers31.5. Container Adaptors31.6. Advice
32.1. Introduction32.2. Algorithms32.3. Policy Arguments32.4. Nonmodifying Sequence Algorithms32.5. Modifying Sequence Algorithms32.6. Sorting and Searching32.7. Min and Max32.8. Advice
33.1. Introduction33.2. Iterator Adaptors33.3. Range Access Functions33.4. Function Objects33.5. Function Adaptors33.6. Advice
34.1. Introduction34.2. “Almost Containers”34.3. Resource Management Pointers34.4. Allocators34.5. The Garbage Collection Interface34.6. Uninitialized Memory34.7. Advice
35.1. Introduction35.2. Time35.3. Compile-Time Rational Arithmetic35.4. Type Functions35.5. Minor Utilities35.6. Advice
36.1. Introduction36.2. Character Classification36.3. Strings36.4. Advice
37.1. Regular Expressions37.2. regex37.3. Regular Expression Functions37.4. Regular Expression Iterators37.5. regex_traits37.6. Advice
38.1. Introduction38.2. The I/O Stream Hierarchy38.3. Error Handling38.4. I/O Operations38.5. Stream Iterators38.6. Buffering38.7. Advice
39.1. Handling Cultural Differences39.2. Class locale39.3. Class facet39.4. Standard facets39.5. Convenience Interfaces39.6. Advice
40.1. Introduction40.2. Numerical Limits40.3. Standard Mathematical Functions40.4. complex Numbers40.5. A Numerical Array: valarray40.6. Generalized Numerical Algorithms40.7. Random Numbers40.8. Advice
41.1. Introduction41.2. Memory Model41.3. Atomics41.4. volatile41.5. Advice
42.1. Introduction42.2. Threads42.3. Avoiding Data Races42.4. Task-Based Concurrency42.5. Advice
43.1. Introduction43.2. Files43.3. The printf() Family43.4. C-Style Strings43.5. Memory43.6. Date and Time43.7. Etc.43.8. Advice
44.1. Introduction44.2. C++11 Extensions44.3. C/C++ Compatibility44.4. Advice

Content preview from The C++ Programming Language, 4th Edition

24. Generic Programming

Now is a good time to put your work on a firm theoretical basis.

– Sam Morgan

• Introduction

• Algorithms and Lifting

• Concepts

Discovering a Concept; Concepts and Constraints

• Making Concepts Concrete

Axioms; Multi-argument Concepts; Value Concepts; Constraints Checks; Template Definition Checking

• Advice

24.1. Introduction

What are templates for? In other words, what programming techniques are effective when you use templates? Templates offer:

• The ability to pass types (as well as values and templates) as arguments without loss of information. This implies excellent opportunities for inlining, of which current implementations take great advantage.

• Delayed type checking (done at instantiation time). This implies ...