Discover C++17's new features and tools to optimize your code. Explore fundamentals and advanced techniques, and gain insights through hands-on coding exercises to master C++.

cpp17.tar.gz

c++17

C++17N

adaptor

C++ is one of the most prominent programming languages in the world. Along with optimized performance, the diverse functionality it offers has kept the language relevant for two decades. The C++ Standard Library, which is the collection of all the tools and utilities available in C++, received its latest update in 2017. Known as C++17, the update introduces many new features that further optimize our code.

Join us in this course as we venture into the vast world of C++17. We’ll examine the fundamentals of the language, before moving on to more complex yet powerful tools. You can also experiment with the code provided and hence, gain a higher understanding of how things work. This course is perfect for anyone willing to fully grasp C++ and use it to its full potential. Welcome aboard!

Rick Audet

Arguably the quickest and easiest way to get up to speed on
the most important parts of the C++ standard library. Recommended for any modern C++ programmer.

Senior Engineer, Dolby Laboratories

Odin Holmes

Das Buch beinhaltet, wie der Name schon sagt, eine recht ausführliche Beschreibung der STL. Dabei merkt Mann deutlich dass der Autor auch selber auf hohem Niveau programmiert. Es gibt oft den ein oder andere Tipp oder Wink in die richtige Richtung die bei Bücher von Berufsautoren oft fehlen. Z.B. die Aussage dass std::vector für 95% aller Fälle die beste Wahl ist oder dass std::async meistens die erste Wahl sein sollte lenkt der Leser geschickt in die richtige Richtung.

Auch die Auswahl an Komponente aus der STL ist sehr gut getroffen (keiner kann in ein kürzen Buch die ganze STL beschreiben). Oft sehe ich, vor allem in Deutschsprachige Literatur, dass die Auswahl eher auf Komponente trifft die leicht zu beschreiben sind und nicht auf die Nützlichen. Eine gute und dennoch kürze Beschreibung vom std::regex z.B. ist weiß Gott nicht einfach aber in diesem Fall ist es der Autor sehr gelungen.

CEO/CTO at Auto-Intern GmbH

Ramon Wartala

Die 215 Seiten plus Index des ’C++ kurz & gut’ vom Autor Rainer Grimm stellen ein gelungene Destillat viel umfangreicherer Texte zum Thema da. So nimmt das Kapitel über die klassischen Algorithmen der Standardbibliothek ganze 131 Seiten ein. Selbst kurze Beispiele für die Anwendung der wichtigsten Bestandteile der Standardbibliothek passen eng gedruckt in das schmale Büchlein. Auch wenn heute Tools wie Dash oder entsprechend ausgestattete IDEs, mehr und mehr den Platz derartiger Desktop-Referenzen einnehmen, ist das ’kurz & gut’ zu C++ Standardbibliothek ein leichter und mobiler Begleiter für jeden C++ Entwickler. Und als Kindle Version um so bequemer mitzunehmen.

Director Technology at Performance Media GmbH

C++ Standard Library including C++ 14 & C++ 17

The [sequential container](http://en.cppreference.com/w/cpp/container) has a lot in [common](https://www.educative.io/courses/cpp-standard-library-including-cpp-14-and-cpp-17/introduction-qVDKZMPQgp3), but each container has its special domain. Before I dive into the details, I provide an overview of all five sequential containers of the std namespace. 

These are the sequential containers:

| **Criteria** | **Array** | **Vector** | **Deque** | **List** | **Forward List** |
|-|-|-|-|-|-|
| **Size** |static | dynamic | dynamic | dynamic | dynamic |
|
| **Implementation** |static array | dynamic array |sequence of arrays |doubly linked list |singly linked list |
|
| **Access** | random| random| random| forward and backward | forward|
|
| **Optimized for insert and delete at** | --- | end: O(1) | begin and end: O(1) | begin and end: O(1); arbitrary: O(1) | begin(1); arbitrary: O(1) | 
|
| **Memory reservation** | --- | yes| no| no| no|
|
| **Release of memory** | --- | `shrink_to_fit` | `shrink_to_fit` | always| always|
|
| **Strength** | no memory allocation; minimal memory requirements | 95% solution | insertion and deletion at the begin and end | insertion and deletion at an arbitrary position | fast insertion and deletion; minimal memory requirements | 
|
| **Weakness** | no dynamic memory; memory allocation | Insertion and deletion; at an arbitrary position: O(n) | Insertion and deletion; at an arbitrary position: O(n) | no random access | no random access |
 The sequential containers

 

A few additional remarks to the table. 

O(i) stands for the complexity (runtime) of an operation. So O(1) means that the runtime of an operation on a container is constant and is independent of the size of the container. Conversely, O(n) means that the runtime depends on the number of elements of the container. Now, what does that mean for a `std::vector`? The access time on an element is independent of the size of the `std::vector`, but the insertion or deletion of an arbitrary element with k-times more elements is k-times slower.

Although the random access on the elements of a `std::vector` has the same complexity O(1) as the random access on the element of a `std::deque`, that doesn't mean, that both operations are equally fast.

The complexity guarantee O(1) for the insertion or deletion into a doubly (`std::list`) or singly linked list (`std::forward_list`) is only guaranteed if the iterator points to the right element.

> ℹ️ **std::string is like std::vector<char>**
\
Of course, `std::string` is no container of the standard template library. But from a behavioural point of view, it is like a sequential container, especially like a `std::vector<char>`. Therefore I will treat `std::string` as a `std::vector<char>`.

The [sequential container](http://en.cppreference.com/w/cpp/container) has a lot in [common](https://www.educative.io/courses/cpp-standard-library-including-cpp-14-and-cpp-17/introduction-qVDKZMPQgp3), but each container has its special domain. Before I dive into the details, I provide an overview of all five sequential containers of the std namespace. 

These are the sequential containers:

| **Criteria** | **Array** | **Vector** | **Deque** | **List** | **Forward List** |
|-|-|-|-|-|-|
| **Size** |static | dynamic | dynamic | dynamic | dynamic |
|
| **Implementation** |static array | dynamic array |sequence of arrays |doubly linked list |singly linked list |
|
| **Access** | random| random| random| forward and backward | forward|
|
| **Optimized for insert and delete at** | --- | end: O(1) | begin and end: O(1) | begin and end: O(1); arbitrary: O(1) | begin(1); arbitrary: O(1) | 
|
| **Memory reservation** | --- | yes| no| no| no|
|
| **Release of memory** | --- | `shrink_to_fit` | `shrink_to_fit` | always| always|
|
| **Strength** | no memory allocation; minimal memory requirements | 95% solution | insertion and deletion at the begin and end | insertion and deletion at an arbitrary position | fast insertion and deletion; minimal memory requirements | 
|
| **Weakness** | no dynamic memory; memory allocation | Insertion and deletion; at an arbitrary position: O(n) | Insertion and deletion; at an arbitrary position: O(n) | no random access | no random access |
 The sequential containers

 

A few additional remarks to the table. 

O(i) stands for the complexity (runtime) of an operation. So O(1) means that the runtime of an operation on a container is constant and is independent of the size of the container. Conversely, O(n) means that the runtime depends on the number of elements of the container. Now, what does that mean for a `std::vector`? The access time on an element is independent of the size of the `std::vector`, but the insertion or deletion of an arbitrary element with k-times more elements is k-times slower.

Although the random access on the elements of a `std::vector` has the same complexity O(1) as the random access on the element of a `std::deque`, that doesn't mean, that both operations are equally fast.

The complexity guarantee O(1) for the insertion or deletion into a doubly (`std::list`) or singly linked list (`std::forward_list`) is only guaranteed if the iterator points to the right element.

> ℹ️ **std::string is like std::vector<char>**
\
Of course, `std::string` is no container of the standard template library. But from a behavioural point of view, it is like a sequential container, especially like a `std::vector<char>`. Therefore I will treat `std::string` as a `std::vector<char>`.

The first category of containers we'll study are the sequential containers. Listed below are the major features for various types of sequential containers.

Criteria	Array	Vector	Deque	List	Forward List
Size	static	dynamic	dynamic	dynamic	dynamic

Introduction

The Standard Library

Overview

Application of Libraries

Utilities

Useful Functions

Adaptors for Functions

Pairs and Tuples

Reference Wrappers

Smart Pointers

Type Traits

Time Library

std::any, std::optional, and std::variant

Interface of All Containers

Sequential Containers

Associative Containers

Ordered Associative Containers

Unordered Associative Containers

Adaptors for Containers

Iterators

Callable Units

Algorithms

Non-Modifying Algorithms

Modifying Algorithms

More Algorithms

New Algorithms with C++17

Numeric

Strings

String View

Regular Expressions

Input and Output Streams

File Systems

Multithreading

Introduction