C++17 Standard Library Quick Reference: A Pocket Guide to Data Structures, Algorithms, and Functions

© Peter Van Weert and Marc Gregoire 2019

Peter Van Weert and Marc GregoireC++17 Standard Library Quick Referencehttps://doi.org/10.1007/978-1-4842-4923-9_3

3. Containers

Peter Van Weert¹  and Marc Gregoire²

(1)

Kessel-Lo, Belgium

(2)

Meldert, Belgium

 

The C++ Standard Library provides a selection of different data structures called containers that you can use to store collections of data elements. Containers work in tandem with algorithms, described in Chapter 4. Containers and algorithms are designed in such a way that they do not need to know about each other. The interaction between them is accomplished with iterators. All containers provide iterators, and algorithms only need iterators to be able to perform their work.

This chapter starts by explaining ...