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

[std::vector](http://en.cppreference.com/w/cpp/container/vector) is a homogeneous container, for which its length can be adjusted at runtime. `std::vector` needs the header `<vector>`. As it stores its elements contiguously in memory, `std::vector` supports pointer arithmetic.

for (int i= 0; i < vec.size(); ++i){
 std::cout << vec[i] == *(vec + i) << std::endl; // true
}

> 🔑 
\
Distinguish the round and curly braces by the creation of a `std::vector`
>
>If you construct a `std::vector`, you have to keep a few specialities in mind. The constructor with round braces in the following example creates a `std::vector` with 10 elements, the constructor with curly braces a `std::vector` with the element 10.
> ```C++
> std::vector<int> vec(10);
> std::vector<int> vec{10};
>```
> The same rules hold for the expressions `std::vector<int>(10, 2011)` or `std::vector<int>{10, 2011}`. In the first case, you get a `std::vector` with 10 elements, initialised to 2011. In the second case, you get a `std::vector` with elements 10 and 2011. The reason for the behaviour is, that curly braces are interpreted as initialiser lists and so, the [sequence constructor](#chapter-CreateAndDelete) is used.

# Size versus Capacity

The number of elements a `std::vector` has is usually smaller than the number of elements for which is space is already reserved. That is for a simple reason. The size of the `std::vector` can increase without an expensive allocation of new memory. 

There are a few methods for the smart handling of memory: 

| **Method** | **Description** | 
|-|-|
| `vec.size()` | Number of elements of `vec`. |
| `vec.capacity()` | Number of elements, which `vec` can have without reallocation. | 
| `vec.resize(n)` | `vec` will be increased to n elements.` |
| `vec.reserve(n)` | Reserve memory for at least n elements. |
| `vec.shrink_to_fit()` | Reduces capacity of `vec` to the size. | 
 Memory management of std::vector 

The call `vec.shrink_to_fit()` is not binding. That means the runtime can ignore it. But on the popular platforms, I always observed the desired behaviour.

So let's see the methods in the application.

> 🔑 
\
Distinguish the round and curly braces by the creation of a `std::vector`
>
>If you construct a `std::vector`, you have to keep a few specialities in mind. The constructor with round braces in the following example creates a `std::vector` with 10 elements, the constructor with curly braces a `std::vector` with the element 10.
> ```C++
> std::vector<int> vec(10);
> std::vector<int> vec{10};
>```
> The same rules hold for the expressions `std::vector<int>(10, 2011)` or `std::vector<int>{10, 2011}`. In the first case, you get a `std::vector` with 10 elements, initialised to 2011. In the second case, you get a `std::vector` with elements 10 and 2011. The reason for the behaviour is, that curly braces are interpreted as initialiser lists and so, the [sequence constructor](#chapter-CreateAndDelete) is used.

# Size versus Capacity

The number of elements a `std::vector` has is usually smaller than the number of elements for which is space is already reserved. That is for a simple reason. The size of the `std::vector` can increase without an expensive allocation of new memory. 

There are a few methods for the smart handling of memory: 

| **Method** | **Description** | 
|-|-|
| `vec.size()` | Number of elements of `vec`. |
| `vec.capacity()` | Number of elements, which `vec` can have without reallocation. | 
| `vec.resize(n)` | `vec` will be increased to n elements.` |
| `vec.reserve(n)` | Reserve memory for at least n elements. |
| `vec.shrink_to_fit()` | Reduces capacity of `vec` to the size. | 
 Memory management of std::vector 

The call `vec.shrink_to_fit()` is not binding. That means the runtime can ignore it. But on the popular platforms, I always observed the desired behaviour.

So let's see the methods in the application.

A more refined version of arrays, vectors simplify insertion and deletion of values.

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

Vectors