Explore the full potential of C++ by mastering the standard library.

Become a C++ Programmer

The C++ standard library is a collection of all the tools and utilities available in C++. It received its latest update in 2017, known as C++17. The update introduces many new features that further optimize our code. This module will help us fully grasp C++ and use it to its full potential.

C++ Standard Library

The global functions `std::begin, std::end, std::prev, std::next, std::distance` and `std::advance` make your handling of the iterators a lot easier. Only the function `std::prev` requires a bidirectional iterator. All functions need the header `<iterator>`. The table gives you an overview:

| **Global function** | **Description** |
|-|-|
| `std::begin(cont)` | Returns a begin iterator to the container `cont`. | 
| `std::end(cont)` | Returns an end iterator to the container `cont`. |
| `std::rbegin(cont)` | Returns a reverse begin iterator to the container `cont`. | 
| `std::rend(cont)` | Returns a reverse end iterator to the container `cont`. |
| `std::cbegin(cont)` | Returns a constant begin iterator to the container `cont`. | 
| `std::cend(cont)` | Returns a constant end iterator to the container `cont`. |
| `std::crbegin(cont)` | Returns a reverse constant begin iterator to the container `cont`. | 
| `std::crend(cont)` | Returns a reverse constant end iterator to the container `cont`. |
| `std::prev(it)` | Returns an iterator, which points to a position before `it` | 
| `std::next(it)` | Returns an iterator, which points to a position after `it`. | 
| `std::distance(fir, sec)` | Returns the number of elements between `fir` and `sec`. |
| `std::advance(it, n)` | Puts the iterator `it` n positions further. |
 Useful functions for iterators 

Now, the application of the useful functions.

The global functions `std::begin, std::end, std::prev, std::next, std::distance` and `std::advance` make your handling of the iterators a lot easier. Only the function `std::prev` requires a bidirectional iterator. All functions need the header `<iterator>`. The table gives you an overview:

| **Global function** | **Description** |
|-|-|
| `std::begin(cont)` | Returns a begin iterator to the container `cont`. | 
| `std::end(cont)` | Returns an end iterator to the container `cont`. |
| `std::rbegin(cont)` | Returns a reverse begin iterator to the container `cont`. | 
| `std::rend(cont)` | Returns a reverse end iterator to the container `cont`. |
| `std::cbegin(cont)` | Returns a constant begin iterator to the container `cont`. | 
| `std::cend(cont)` | Returns a constant end iterator to the container `cont`. |
| `std::crbegin(cont)` | Returns a reverse constant begin iterator to the container `cont`. | 
| `std::crend(cont)` | Returns a reverse constant end iterator to the container `cont`. |
| `std::prev(it)` | Returns an iterator, which points to a position before `it` | 
| `std::next(it)` | Returns an iterator, which points to a position after `it`. | 
| `std::distance(fir, sec)` | Returns the number of elements between `fir` and `sec`. |
| `std::advance(it, n)` | Puts the iterator `it` n positions further. |
 Useful functions for iterators 

Now, the application of the useful functions.

C++ offers several tools to make the iteration process simpler yet safer.

The Standard Library

Overview

Application of Libraries

Useful Functions

Adaptors for Functions

Pairs and Tuples

Reference Wrappers

Smart Pointers

Type Traits

Time Library

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

Containers in General

Sequential Containers

Associative Containers in General

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

Conclusion