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

C++ has eight different [associative containers](http://en.cppreference.com/w/cpp/container). Four of them are associative containers with sorted keys: `std::set`, `std::map`, `std::multiset` and `std::multimap`. The other four are associative containers with unsorted keys: `std::unordered_set`, `std::unordered_map`, `std::unordered_multiset` and `std::unordered_multimap`. The associative containers are special containers. That means they support all of the operations described in the chapter [Interface of all containers](https://www.educative.io/courses/cpp-standard-library-including-cpp-14-and-cpp-17/introduction-qVDKZMPQgp3).

# Overview

All eight ordered and unordered containers have in common that they associate a key with a value. You can use the key to get the value. To get a classification of the associative containers, three simple questions need to be answered:

* Are the keys sorted?
* Does the key have an associated value?
* Can a key appear more than once?

The following table with 
$2^3$ = 8 rows give the answers to the three questions. I answer a fourth question in the table. How fast is the access time of a key in the best case?

| **Associative container** | **Sorted** | **Associated value** | **More identical keys** | **Access time** | 
|-|-|-|-|-|
| `std::set` | yes | no | no | logarithmic |
| `std::unordered_set` | no | no | no | constant |
| `std::map` | yes | yes | no | logarithmic |
| `std::unordered_map` | no | yes | no | constant |
| `std::multiset` | yes | no | yes | logarithmic |
| `std::unordered_multiset` | no | no | yes | constant |
| `std::multimap` | yes | yes | yes | logarithmic |
| `std::unordered_multimap` | no | yes | yes | constant |
 Characteristics for associative containers 


Since C++98, C++ has ordered associative containers; with C++11, C++ has in addition unordered associative containers. Both classes have a very similar interface. That's the reason that the following code sample is identical for `std::map` and `std::unordered_map`. To be more precise, the interface of `std::unordered_map` is a superset of the interface of `std::map`. The same holds for the remaining three unordered associative containers. So the porting of your code from the ordered to unordered containers is quite easy.

You can initialize the containers with an initialiser list and add new elements with the index operator. To access the first element of the key/value pair `p`, you have `p.first`, and for the second element, you have `p.second`. `p.first` is the key and `p.second` is the associated value of the pair.

C++ has eight different [associative containers](http://en.cppreference.com/w/cpp/container). Four of them are associative containers with sorted keys: `std::set`, `std::map`, `std::multiset` and `std::multimap`. The other four are associative containers with unsorted keys: `std::unordered_set`, `std::unordered_map`, `std::unordered_multiset` and `std::unordered_multimap`. The associative containers are special containers. That means they support all of the operations described in the chapter [Interface of all containers](https://www.educative.io/courses/cpp-standard-library-including-cpp-14-and-cpp-17/introduction-qVDKZMPQgp3).

# Overview

All eight ordered and unordered containers have in common that they associate a key with a value. You can use the key to get the value. To get a classification of the associative containers, three simple questions need to be answered:

* Are the keys sorted?
* Does the key have an associated value?
* Can a key appear more than once?

The following table with 
$2^3$ = 8 rows give the answers to the three questions. I answer a fourth question in the table. How fast is the access time of a key in the best case?

| **Associative container** | **Sorted** | **Associated value** | **More identical keys** | **Access time** | 
|-|-|-|-|-|
| `std::set` | yes | no | no | logarithmic |
| `std::unordered_set` | no | no | no | constant |
| `std::map` | yes | yes | no | logarithmic |
| `std::unordered_map` | no | yes | no | constant |
| `std::multiset` | yes | no | yes | logarithmic |
| `std::unordered_multiset` | no | no | yes | constant |
| `std::multimap` | yes | yes | yes | logarithmic |
| `std::unordered_multimap` | no | yes | yes | constant |
 Characteristics for associative containers 


Since C++98, C++ has ordered associative containers; with C++11, C++ has in addition unordered associative containers. Both classes have a very similar interface. That's the reason that the following code sample is identical for `std::map` and `std::unordered_map`. To be more precise, the interface of `std::unordered_map` is a superset of the interface of `std::map`. The same holds for the remaining three unordered associative containers. So the porting of your code from the ordered to unordered containers is quite easy.

You can initialize the containers with an initialiser list and add new elements with the index operator. To access the first element of the key/value pair `p`, you have `p.first`, and for the second element, you have `p.second`. `p.first` is the key and `p.second` is the associated value of the pair.

After sequential containers, let's enter the world of associative containers and learn about the principle of key/value pairs.

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