book

Discovering Modern C++: An Intensive Course for Scientists, Engineers, and Programmers

by Peter Gottschling

December 2015

Intermediate to advanced

480 pages

14h 45m

English

Addison-Wesley Professional

Read now

Unlock full access

Reasons to Learn C++Reasons to Read This BookThe Beauty and the BeastLanguages in Science and EngineeringTypographical Conventions
1.1 Our First Program1.2 Variables1.2.1 Constants1.2.2 Literals1.2.3 Non-narrowing Initialization1.2.4 Scopes1.3 Operators1.3.1 Arithmetic Operators1.3.2 Boolean Operators1.3.3 Bitwise Operators1.3.4 Assignment1.3.5 Program Flow1.3.6 Memory Handling1.3.7 Access Operators1.3.8 Type Handling1.3.9 Error Handling1.3.10 Overloading1.3.11 Operator Precedence1.3.12 Avoid Side Effects!1.4 Expressions and Statements1.4.1 Expressions1.4.2 Statements1.4.3 Branching1.4.4 Loops1.4.5 goto1.5 Functions1.5.1 Arguments1.5.2 Returning Results1.5.3 Inlining1.5.4 Overloading1.5.5 main Function1.6 Error Handling1.6.1 Assertions1.6.2 Exceptions1.6.3 Static Assertions1.7 I/O1.7.1 Standard Output1.7.2 Standard Input1.7.3 Input/Output with Files1.7.4 Generic Stream Concept1.7.5 Formatting1.7.6 Dealing with I/O Errors1.8 Arrays, Pointers, and References1.8.1 Arrays1.8.2 Pointers1.8.3 Smart Pointers1.8.4 References1.8.5 Comparison between Pointers and References1.8.6 Do Not Refer to Outdated Data!1.8.7 Containers for Arrays1.9 Structuring Software Projects1.9.1 Comments1.9.2 Preprocessor Directives1.10 Exercises1.10.1 Age1.10.2 Arrays and Pointers1.10.3 Read the Header of a Matrix Market File
2.1 Program for Universal Meaning Not for Technical Details2.2 Members2.2.1 Member Variables2.2.2 Accessibility2.2.3 Access Operators2.2.4 The Static Declarator for Classes2.2.5 Member Functions2.3 Setting Values: Constructors and Assignments2.3.1 Constructors2.3.2 Assignment2.3.3 Initializer Lists2.3.4 Uniform Initialization2.3.5 Move Semantics2.4 Destructors2.4.1 Implementation Rules2.4.2 Dealing with Resources Properly2.5 Method Generation Résumé2.6 Accessing Member Variables2.6.1 Access Functions2.6.2 Subscript Operator2.6.3 Constant Member Functions2.6.4 Reference-Qualified Members2.7 Operator Overloading Design2.7.1 Be Consistent!2.7.2 Respect the Priority2.7.3 Member or Free Function2.8 Exercises2.8.1 Polynomial2.8.2 Move Assignment2.8.3 Initializer List2.8.4 Resource Rescue

3.1 Function Templates3.1.1 Instantiation3.1.2 Parameter Type Deduction3.1.3 Dealing with Errors in Templates3.1.4 Mixing Types3.1.5 Uniform Initialization3.1.6 Automatic return Type3.2 Namespaces and Function Lookup3.2.1 Namespaces3.2.2 Argument-Dependent Lookup3.2.3 Namespace Qualification or ADL3.3 Class Templates3.3.1 A Container Example3.3.2 Designing Uniform Class and Function Interfaces3.4 Type Deduction and Definition3.4.1 Automatic Variable Type3.4.2 Type of an Expression3.4.3 decltype(auto)3.4.4 Defining Types3.5 A Bit of Theory on Templates: Concepts3.6 Template Specialization3.6.1 Specializing a Class for One Type3.6.2 Specializing and Overloading Functions3.6.3 Partial Specialization3.6.4 Partially Specializing Functions3.7 Non-Type Parameters for Templates3.8 Functors3.8.1 Function-like Parameters3.8.2 Composing Functors3.8.3 Recursion3.8.4 Generic Reduction3.9 Lambda3.9.1 Capture3.9.2 Capture by Value3.9.3 Capture by Reference3.9.4 Generalized Capture3.9.5 Generic Lambdas3.10 Variadic Templates3.11 Exercises3.11.1 String Representation3.11.2 String Representation of Tuples3.11.3 Generic Stack3.11.4 Iterator of a Vector3.11.5 Odd Iterator3.11.6 Odd Range3.11.7 Stack of bool3.11.8 Stack with Custom Size3.11.9 Deducing Non-type Template Arguments3.11.10 Trapezoid Rule3.11.11 Functor3.11.12 Lambda3.11.13 Implement make_unique
4.1 Standard Template Library4.1.1 Introductory Example4.1.2 Iterators4.1.3 Containers4.1.4 Algorithms4.1.5 Beyond Iterators4.2 Numerics4.2.1 Complex Numbers4.2.2 Random Number Generators4.3 Meta-programming4.3.1 Limits4.3.2 Type Traits4.4 Utilities4.4.1 Tuple4.4.2 function4.4.3 Reference Wrapper4.5 The Time Is Now4.6 Concurrency4.7 Scientific Libraries Beyond the Standard4.7.1 Other Arithmetics4.7.2 Interval Arithmetic4.7.3 Linear Algebra4.7.4 Ordinary Differential Equations4.7.5 Partial Differential Equations4.7.6 Graph Algorithms4.8 Exercises4.8.1 Sorting by Magnitude4.8.2 STL Container4.8.3 Complex Numbers
5.1 Let the Compiler Compute5.1.1 Compile-Time Functions5.1.2 Extended Compile-Time Functions5.1.3 Primeness5.1.4 How Constant Are Our Constants?5.2 Providing and Using Type Information5.2.1 Type Traits5.2.2 Conditional Exception Handling5.2.3 A const-Clean View Example5.2.4 Standard Type Traits5.2.5 Domain-Specific Type Properties5.2.6 enable_if5.2.7 Variadic Templates Revised5.3 Expression Templates5.3.1 Simple Operator Implementation5.3.2 An Expression Template Class5.3.3 Generic Expression Templates5.4 Meta-Tuning: Write Your Own Compiler Optimization5.4.1 Classical Fixed-Size Unrolling5.4.2 Nested Unrolling5.4.3 Dynamic Unrolling–Warm-up5.4.4 Unrolling Vector Expressions5.4.5 Tuning an Expression Template5.4.6 Tuning Reduction Operations5.4.7 Tuning Nested Loops5.4.8 Tuning Résumé5.5 Exercises5.5.1 Type Traits5.5.2 Fibonacci Sequence5.5.3 Meta-Program for Greatest Common Divisor5.5.4 Vector Expression Template5.5.5 Meta-List
6.1 Basic Principles6.1.1 Base and Derived Classes6.1.2 Inheriting Constructors6.1.3 Virtual Functions and Polymorphic Classes6.1.4 Functors via Inheritance6.2 Removing Redundancy6.3 Multiple Inheritance6.3.1 Multiple Parents6.3.2 Common Grandparents6.4 Dynamic Selection by Sub-typing6.5 Conversion6.5.1 Casting between Base and Derived Classes6.5.2 const-Cast6.5.3 Reinterpretation Cast6.5.4 Function-Style Conversion6.5.5 Implicit Conversions6.6 CRTP6.6.1 A Simple Example6.6.2 A Reusable Access Operator6.7 Exercises6.7.1 Non-redundant Diamond Shape6.7.2 Inheritance Vector Class6.7.3 Clone Function
7.1 Implementation of ODE Solvers7.1.1 Ordinary Differential Equations7.1.2 Runge-Kutta Algorithms7.1.3 Generic Implementation7.1.4 Outlook7.2 Creating Projects7.2.1 Build Process7.2.2 Build Tools7.2.3 Separate Compilation7.3 Some Final Words
A.1 More Good and Bad Scientific SoftwareA.2 Basics in DetailA.2.1 More about Qualifying LiteralsA.2.2 static VariablesA.2.3 More about ifA.2.4 Duff’s DeviceA.2.5 More about mainA.2.6 Assertion or Exception?A.2.7 Binary I/OA.2.8 C-Style I/OA.2.9 Garbarge CollectionA.2.10 Trouble with MacrosA.3 Real-World Example: Matrix InversionA.4 Class DetailsA.4.1 Pointer to MemberA.4.2 More Initialization ExamplesA.4.3 Accessing Multi-dimensional ArraysA.5 Method GenerationA.5.1 Controlling the GenerationA.5.2 Generation RulesA.5.3 Pitfalls and Design GuidesA.6 Template DetailsA.6.1 Uniform InitializationA.6.2 Which Function Is Called?A.6.3 Specializing for Specific HardwareA.6.4 Variadic Binary I/OA.7 Using std::vector in C++03A.8 Dynamic Selection in Old StyleA.9 Meta-Programming DetailsA.9.1 First Meta-Program in HistoryA.9.2 Meta-FunctionsA.9.3 Backward-Compatible Static AssertionA.9.4 Anonymous Type ParametersA.9.5 Benchmark Sources of Dynamic UnrollingA.9.6 Benchmark for Matrix Product
B.1 gccB.2 DebuggingB.2.1 Text-Based DebuggerB.2.2 Debugging with Graphical Interface: DDDB.3 Memory AnalysisB.4 gnuplotB.5 Unix, Linux, and Mac OS
C.1 Value CategoriesC.2 Operator OverviewC.3 Conversion RulesC.3.1 PromotionC.3.2 Other ConversionsC.3.3 Usual Arithmetic ConversionsC.3.4 Narrowing