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

[std::list](http://en.cppreference.com/w/cpp/container/list) is a doubled linked list. `std::list` needs the header `<list>`. 

Although it has a similar interface to `std::vector` or `std::deque`, `std::list` is quite different from both of them. That's due to its structure.

`std::list` makes the following points unique:

* It supports no random access.
* Accessing an arbitrary element is slow because we might have to iterate through the whole list.
* Adding or removing an element is fast, if the iterator points to the right place.
* If we add or remove an element, the iterator remains valid.


Because of its special structure, `std::list` has a few special methods.

## Special methods of `std::list`
| **Method** | **Description** | 
|-|-|
| `lis.merge(c)` | Merges the sorted list c into the sorted list `lis`, so that `lis` remains sorted. |
| `lis.merge(c, op)` | Merges the sorted list c into the sorted list `lis`, so that `lis` remains sorted. Uses `op` as sorting criteria. | 
| `lis.remove(val)` | Removes all elements from `lis` with value `val`. |
| `lis.remove_if(pre)` | Removes all elements from `lis`, fulfilling the predicate `pre`. |
| `lis.splice(pos, ... )` | Splits the elements in `lis` before `pos`. The elements can be single elements, ranges or lists. |
| `lis.unique()` | Removes adjacent element with the same value. | 
| `lis.unique(pre)` | Removes adjacent elements, fulfilling the predicate `pre`. |

Here are a few of the methods in a code snippet.

[std::list](http://en.cppreference.com/w/cpp/container/list) is a doubled linked list. `std::list` needs the header `<list>`. 

Although it has a similar interface to `std::vector` or `std::deque`, `std::list` is quite different from both of them. That's due to its structure.

`std::list` makes the following points unique:

* It supports no random access.
* Accessing an arbitrary element is slow because we might have to iterate through the whole list.
* Adding or removing an element is fast, if the iterator points to the right place.
* If we add or remove an element, the iterator remains valid.


Because of its special structure, `std::list` has a few special methods.

# Special methods of `std::list`
| **Method** | **Description** | 
|-|-|
| `lis.merge(c)` | Merges the sorted list c into the sorted list `lis`, so that `lis` remains sorted. |
| `lis.merge(c, op)` | Merges the sorted list c into the sorted list `lis`, so that `lis` remains sorted. Uses `op` as sorting criteria. | 
| `lis.remove(val)` | Removes all elements from `lis` with value `val`. |
| `lis.remove_if(pre)` | Removes all elements from `lis`, fulfilling the predicate `pre`. |
| `lis.splice(pos, ... )` | Splits the elements in `lis` before `pos`. The elements can be single elements, ranges or lists. |
| `lis.unique()` | Removes adjacent element with the same value. | 
| `lis.unique(pre)` | Removes adjacent elements, fulfilling the predicate `pre`. |

Here are a few of the methods in a code snippet.

C++ supports the linked list data structure and provides additional methods to improve the list's functionality.

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