book

Programming: Principles and Practice Using C++, 3rd Edition

by Bjarne Stroustrup

April 2024

Beginner

656 pages

23h 19m

English

Addison-Wesley Professional

Read now

Unlock full access

Includes

Has Sandbox

Previous EditionsAcknowledgments
0.1 The structure of this book0.2 A philosophy of teaching and learning0.3 ISO standard C++0.4 PPP support0.5 Author biography0.6 Bibliography
1.1 Programs1.2 The classic first program1.3 Compilation1.4 Linking1.5 Programming environments
2.1 Input2.2 Variables2.3 Input and type2.4 Operations and operators2.5 Assignment and initialization2.6 Names2.7 Types and objects2.8 Type safety2.9 Conversions2.10 Type deduction: auto

3.1 Computation3.2 Objectives and tools3.3 Expressions3.4 Statements3.5 Functions3.6 vector3.7 Language features
4.1 Introduction4.2 Sources of errors4.3 Compile-time errors4.4 Link-time errors4.5 Run-time errors4.6 Exceptions4.7 Avoiding and finding errors
5.1 A problem5.2 Thinking about the problem5.3 Back to the calculator!5.4 Back to the drawing board5.5 Turning a grammar into code5.6 Trying the first version5.7 Trying the second version5.8 Token streams5.9 Program structure
6.1 Introduction6.2 Input and output6.3 Error handling6.4 Negative numbers6.5 Remainder: %6.6 Cleaning up the code6.7 Recovering from errors6.8 Variables
7.1 Technicalities7.2 Declarations and definitions7.3 Scope7.4 Function call and return7.5 Order of evaluation7.6 Namespaces7.7 Modules and headers
8.1 User-defined types8.2 Classes and members8.3 Interface and implementation8.4 Evolving a class: Date8.5 Enumerations8.6 Operator overloading8.7 Class interfaces
9.1 Input and output9.2 The I/O stream model9.3 Files9.4 I/O error handling9.5 Reading a single value9.6 User-defined output operators9.7 User-defined input operators9.8 A standard input loop9.9 Reading a structured file9.10 Formatting9.11 String streams
10.1 Why graphics?10.2 A display model10.3 A first example10.4 Using a GUI library10.5 Coordinates10.6 Shapes10.7 Using Shape primitives10.8 Getting the first example to run
11.1 Overview of graphics classes11.2 Point and Line11.3 Lines11.4 Color11.5 Line_style11.6 Polylines11.7 Closed shapes11.8 Text11.9 Mark11.10 Image
12.1 Design principles12.2 Shape12.3 Base and derived classes12.4 Other Shape functions12.5 Benefits of object-oriented programming
13.1 Introduction13.2 Graphing simple functions13.3 Function13.4 Axis13.5 Approximation13.6 Graphing data
14.1 User-interface alternatives14.2 The “Next” button14.3 A simple window14.4 Button and other Widgets14.5 An example: drawing lines14.6 Simple animation14.7 Debugging GUI code
15.1 Introduction15.2 vector basics15.3 Memory, addresses, and pointers15.4 Free store and pointers15.5 Destructors15.6 Access to elements15.7 An example: lists15.8 The this pointer
16.1 Arrays16.2 Pointers and references16.3 C-style strings16.4 Alternatives to pointer use16.5 An example: palindromes
17.1 Introduction17.2 Access to elements17.3 List initialization17.4 Copying and moving17.5 Essential operations17.6 Other useful operations17.7 Remaining Vector problems17.8 Changing size17.9 Our Vector so far
18.1 Templates18.2 Generalizing Vector18.3 Range checking and exceptions18.4 Resources and exceptions18.5 Resource-management pointers
19.1 Storing and processing data19.2 Sequences and iterators19.3 Linked lists19.4 Generalizing Vector yet again19.5 An example: a simple text editor19.6 vector, list, and string
20.1 Associative containers20.2 Map20.3 unordered_map20.4 Timing20.5 Set20.6 Container overview20.7 Ranges and iterators
21.1 Standard-library algorithms21.2 Function objects21.3 Numerical algorithms21.4 Copying21.5 Sorting and searching

Content preview from Programming: Principles and Practice Using C++, 3rd Edition

Part III

Data and Algorithms

Part III focuses on the C++ standard library’s containers and algorithms framework (often referred to as the STL). It shows how containers (such as vector, list, and map) are implemented and used. In doing so, we introduce pointers, arrays, dynamic memory, exceptions, and templates. As part of that, we introduce the fundamental principles and techniques of generic programming. We also demonstrate the design and use of standard-library algorithms (such as sort, find, and inner_product).

Chapter 15: Vector and Free Store

Chapter 16: Arrays, Pointers, and References

Chapter 17: Essential Operations

Chapter 18: Templates and Exceptions

Chapter 19: Containers and Iterators

Chapter 20: Maps and Sets

Chapter 21: Algorithms ...