C++20
C++20
About the Book
My book C++20 is a tutorial and a reference for the C++20 standard. It teaches you C++20 and provides details of this new, thrilling C++ standard. The exciting factor is mainly due to the big four of C++20.
- Concepts change the way we think and program templates. They are semantic categories for the template parameters and enable you to express your intention directly in the type system. If something goes wrong, you get a clear error message.
- The new ranges library enables it to perform algorithms directly on the container, compose the algorithm with the pipe symbol, and apply them to infinite data streams.
- Thanks to coroutines, asynchronous programming in C++ has become mainstream. Coroutines are the base for cooperative tasks, event loops, infinite data streams, or pipelines.
- Modules overcome the restrictions of header files. They promise a lot. For example, the separation of header and source files becomes obsolete as the preprocessor. Ultimately, we have faster built time and an easier way to build packages.
Packages
The Book
PDF
EPUB
WEB
English
C++20 Team Edition: Five Copies
Get five copies to the price of three. This package includes all code examples.
PDF
EPUB
WEB
English
Bundles that include this book
Reader Testimonials
Sandor Dargo
Senior Software Development Engineer at Amadeus
'C++ 20: Get the details' is exactly the book you need right now if you want to immerse yourself in the latest version of C++. It's a complete guide, Rainer doesn't only discuss the flagship features of C++20, but also every minor addition to the language. Luckily, the book includes tons of example code, so even if you don't have direct access yet to the latest compilers, you will have a very good idea of what you can expect from the different features. A highly recommended read!
Adrian Tam
Director of Data Science, Synechron Inc.
C++ has evolved a lot from its birth. With C++20, it is like a new language now. Surely this book is not a primer to teach you inheritance or overloading, but if you need to bring your C++ knowledge up to date, this is the right book. You will be surprised about the new features C++20 brought into C++. This book gives you clear explanations with concise examples. Its organization allows you to use it as a reference later. It can help you unleash the old language into its powerful future.
Harishankar Yadav
Full-time independent Trainer and Mentor for C++ and OOPs, Guidelines, and best practices.
A great work by Rainer and a fantastic book on C++20. With Lots of easy-to-understand, grasp code examples. I have never thought that I will have such a wonderful book covering everything about C++20 with great details and easy language. I am sure this book will change the perception about C++ at all levels of C++ programmers. A must-have book on C++20 on your desk.
Table of Contents
-
- Reader Testimonials
-
Introduction
-
Conventions
- Special Fonts
- Special Boxes
-
Source Code
- Compilation of the Programs
- How should you read the Book?
-
Personal Notes
- Acknowledgments
- About Me
-
Conventions
-
About C++
-
1. Historical Context
- 1.1 C++98
- 1.2 C++03
- 1.3 TR1
- 1.4 C++11
- 1.5 C++14
- 1.6 C++17
-
2. Standardization
- 2.1 Stage 3
- 2.2 Stage 2
- 2.3 Stage 1
-
1. Historical Context
-
A Quick Overview of C++20
-
3. C++20
-
3.1 The Big Four
- 3.1.1 Concepts
- 3.1.2 Modules
- 3.1.3 The Ranges Library
- 3.1.4 Coroutines
-
3.2 Core Language
- 3.2.1 Three-Way Comparison Operator
- 3.2.2 Designated Initialization
-
3.2.3
consteval
andconstinit
- 3.2.4 Template Improvements
- 3.2.5 Lambda Improvements
- 3.2.6 New Attributes
-
3.3 The Standard Library
-
3.3.1
std::span
- 3.3.2 Container Improvements
- 3.3.3 Arithmetic Utilities
- 3.3.4 Formatting Library
- 3.3.5 Calendar and Time Zones
-
3.3.1
-
3.4 Concurrency
- 3.4.1 Atomics
- 3.4.2 Semaphores
- 3.4.3 Latches and Barriers
- 3.4.4 Cooperative Interruption
-
3.4.5
std::jthread
- 3.4.6 Synchronized Outputstreams
-
3.1 The Big Four
-
3. C++20
-
The Details
-
4. Core Language
-
4.1 Concepts
- 4.1.1 Two Wrong Approaches
- 4.1.2 Advantages of Concepts
- 4.1.3 The long, long History
- 4.1.4 Use of Concepts
- 4.1.5 Constrained and Unconstrained Placeholders
- 4.1.6 Abbreviated Function Templates
- 4.1.7 Predefined Concepts
- 4.1.8 Define Concepts
- 4.1.9 Requires Expressions
- 4.1.10 User-Defined Concepts
-
4.2 Modules
- 4.2.1 A First Example
- 4.2.2 Advantages
- 4.2.3 The Details
- 4.2.4 Further Aspects
-
4.3 Equality Comparison and Three-Way Comparison
- 4.3.1 Comparison before C++20
- 4.3.2 Comparison since C++20
- 4.3.3 Comparison Categories
- 4.3.4 Compiler-Generated Equality and Spaceship Operator
- 4.3.5 Rewriting Expressions
- 4.3.6 User-Defined and Auto-Generated Comparison Operators
-
4.4 Designated Initialization
- 4.4.1 Aggregate Initialization
- 4.4.2 Named Initialization of Class Members
-
4.5
consteval
andconstinit
-
4.5.1
consteval
-
4.5.2
constinit
-
4.5.3 Comparison of
const
,constexpr
,consteval
, andconstinit
- 4.5.4 Solving the Static Initialization Order Fiasco
-
4.5.1
-
4.6 Template Improvements
- 4.6.1 Conditionally Explicit Constructor
- 4.6.2 Non-Type Template Parameters (NTTP)
-
4.7 Lambda Improvements
- 4.7.1 Template Parameter for Lambdas
-
4.7.2 Detection of the Implicit Copy of the
this
Pointer - 4.7.3 Lambdas in an Unevaluated Context and Stateless Lambdas can be Default-Constructed and Copy-Assigned
-
4.7.4
consteval
Lambdas - 4.7.5 Pack Expansion in Init-Capture
-
4.8 New Attributes
-
4.8.1
[[nodiscard("reason")]]
-
4.8.2
[[likely]]
and[[unlikely]]
-
4.8.3
[[no_unique_address]]
-
4.8.1
-
4.9 Further Improvements
-
4.9.1
volatile
- 4.9.2 Range-based for loop with Initializers
-
4.9.3 Virtual
constexpr
function -
4.9.4 The new Character Type of UTF-8 Strings:
char8_t
-
4.9.5
using
enum
in Local Scopes - 4.9.6 Default Member Initializers for Bit Fields
-
4.9.1
-
4.1 Concepts
-
5. The Standard Library
-
5.1 The Ranges Library
- 5.1.1 Ranges
- 5.1.2 Views
- 5.1.3 Range Adaptors
- 5.1.4 Direct on the Container
- 5.1.5 Function Composition
- 5.1.6 Lazy Evaluation
- 5.1.7 Define a View
-
5.1.8
std
Algorithms versusstd::ranges
Algorithms - 5.1.9 Design Choices
-
5.2
std::span
- 5.2.1 Static versus Dynamic Extent
- 5.2.2 Creation
- 5.2.3 Automatically Deduces the Size of a Contiguous Sequence of Objects
- 5.2.4 Modifying the Referenced Objects
-
5.2.5
std::span
’s Operations - 5.2.6 A Constant Range of Modifiable Elements
-
5.2.7 Dangers of
std::span
-
5.3 Container and Algorithm Improvements
-
5.3.1
constexpr
Containers and Algorithms -
5.3.2
std::array
- 5.3.3 Consistent Container Erasure
-
5.3.4
contains
for Associative Containers - 5.3.5 Shift the Content of a Container
- 5.3.6 String prefix and suffix checking
-
5.3.7 Vectorized Execution Policy:
std::execution::unseq
-
5.3.1
-
5.4 Arithmetic Utilities
- 5.4.1 Safe Comparison of Integers
- 5.4.2 Mathematical Constants
- 5.4.3 Midpoint and Linear Interpolation
- 5.4.4 Bit Manipulation
-
5.5 Formatting Library
- 5.5.1 Formatting Functions
- 5.5.2 Format String
- 5.5.3 User-Defined Types
- 5.5.4 Internationalization
-
5.6 Calendar and Time Zones
- 5.6.1 Basic Chrono Terminology
- 5.6.2 Basic Types and Literals
- 5.6.3 Time of Day
- 5.6.4 Calendar Dates
- 5.6.5 Time Zones
- 5.6.6 Chrono I/O
-
5.7 Further Improvements
-
5.7.1
std::bind_front
-
5.7.2
std::is_constant_evaluated
-
5.7.3
std::ssize
-
5.7.4
std::source_location
-
5.7.5
std::to_address
-
5.7.1
-
5.1 The Ranges Library
-
6. Concurrency
-
6.1 Coroutines
- 6.1.1 A Generator Function
- 6.1.2 Characteristics
- 6.1.3 The Framework
- 6.1.4 Awaitables and Awaiters
- 6.1.5 The Workflows
-
6.1.6
co_return
-
6.1.7
co_yield
-
6.1.8
co_await
-
6.2 Atomics
-
6.2.1
std::atomic_ref
- 6.2.2 Atomic Smart Pointer
-
6.2.3
std::atomic_flag
Extensions -
6.2.4
std::atomic
Extensions
-
6.2.1
- 6.3 Semaphores
-
6.4 Latches and Barriers
-
6.4.1
std::latch
-
6.4.2
std::barrier
-
6.4.1
-
6.5 Cooperative Interruption
-
6.5.1
std::stop_source
-
6.5.2
std::stop_token
-
6.5.3
std::stop_callback
- 6.5.4 A General Mechanism to Send Signals
- 6.5.5 Joining Threads
-
6.5.6 New
wait
Overloads for thecondition_variable_any
-
6.5.1
-
6.6
std::jthread
- 6.6.1 Automatically Joining
-
6.6.2 Cooperative Interruption of a
std::jthread
- 6.7 Synchronized Output Streams
-
6.1 Coroutines
-
7. Case Studies
-
7.1 A Flavor of Python
-
7.1.1
filter
-
7.1.2
map
- 7.1.3 List Comprehension
-
7.1.1
-
7.2 Variations of Futures
- 7.2.1 A Lazy Future
- 7.2.2 Execution on Another Thread
-
7.3 Modification and Generalization of a Generator
- 7.3.1 Modifications
- 7.3.2 Generalization
- 7.3.3 Iterator Protocol
-
7.4 Various Job Workflows
- 7.4.1 The Transparent Awaiter Workflow
- 7.4.2 Automatically Resuming the Awaiter
- 7.4.3 Automatically Resuming the Awaiter on a Separate Thread
-
7.5 Fast Synchronization of Threads
- 7.5.1 Condition Variables
-
7.5.2
std::atomic_flag
-
7.5.3
std::atomic<bool>
- 7.5.4 Semaphores
- 7.5.5 All Numbers
-
7.1 A Flavor of Python
-
4. Core Language
- Epilogue
-
Further Information
-
8. C++23 and Beyond
-
8.1 C++23
- 8.1.1 Core Language
- 8.1.2 The Standard Library
-
8.2 Beyond C++23
- 8.2.1 Contracts
- 8.2.2 Reflection
- 8.2.3 Pattern Matching
-
8.1 C++23
- 9. Feature Testing
-
10. Glossary
- 10.1 Aggregate
- 10.2 Automatic Storage Duration
- 10.3 Awaitable
- 10.4 Awaiter
- 10.5 Callable
- 10.6 Callable Unit
- 10.7 Concurrency
- 10.8 Critical Section
- 10.9 Data Race
- 10.10 Deadlock
- 10.11 Dynamic Storage Duration
- 10.12 Eager Evaluation
- 10.13 Executor
- 10.14 Function Objects
- 10.15 Lambda Expressions
- 10.16 Lazy Evaluation
- 10.17 Literal Type
- 10.18 Lock-free
- 10.19 Lost Wakeup
- 10.20 Math Laws
- 10.21 Memory Location
- 10.22 Memory Model
- 10.23 Non-blocking
- 10.24 Object
- 10.25 Parallelism
- 10.26 POD (Plain Old Data)
- 10.27 Predicate
- 10.28 RAII
- 10.29 Race Conditions
- 10.30 Regular Type
- 10.31 Scalar Type
- 10.32 SemiRegular
- 10.33 Short-Circuit Evaluation
- 10.34 Standard-Layout Type
- 10.35 Static Storage Duration
- 10.36 Spurious Wakeup
- 10.37 The Big Four
- 10.38 The Big Six
- 10.39 Thread
- 10.40 Thread Storage Duration
- 10.41 Time Complexity
- 10.42 Translation Unit
- 10.43 Trivial Type
- 10.44 Type Erasure
- 10.45 Undefined Behavior
-
Index
- A
- B
- C
- DE
- FG
- HIJKL
- M
- NOPR
- S
- T
- UV
- WYZ
-
8. C++23 and Beyond
The Leanpub 60 Day 100% Happiness Guarantee
Within 60 days of purchase you can get a 100% refund on any Leanpub purchase, in two clicks.
Now, this is technically risky for us, since you'll have the book or course files either way. But we're so confident in our products and services, and in our authors and readers, that we're happy to offer a full money back guarantee for everything we sell.
You can only find out how good something is by trying it, and because of our 100% money back guarantee there's literally no risk to do so!
So, there's no reason not to click the Add to Cart button, is there?
See full terms...
Earn $8 on a $10 Purchase, and $16 on a $20 Purchase
We pay 80% royalties on purchases of $7.99 or more, and 80% royalties minus a 50 cent flat fee on purchases between $0.99 and $7.98. You earn $8 on a $10 sale, and $16 on a $20 sale. So, if we sell 5000 non-refunded copies of your book for $20, you'll earn $80,000.
(Yes, some authors have already earned much more than that on Leanpub.)
In fact, authors have earnedover $13 millionwriting, publishing and selling on Leanpub.
Learn more about writing on Leanpub
Free Updates. DRM Free.
If you buy a Leanpub book, you get free updates for as long as the author updates the book! Many authors use Leanpub to publish their books in-progress, while they are writing them. All readers get free updates, regardless of when they bought the book or how much they paid (including free).
Most Leanpub books are available in PDF (for computers) and EPUB (for phones, tablets and Kindle). The formats that a book includes are shown at the top right corner of this page.
Finally, Leanpub books don't have any DRM copy-protection nonsense, so you can easily read them on any supported device.
Learn more about Leanpub's ebook formats and where to read them