Summary

In this chapter, we introduced sequential containers – containers whose elements can be accessed in sequence. We looked at the array, vector, deque, list, and forward_list sequential containers.

We saw what functionality they offer and how we can operate on them, and we saw how they are implemented and how storage works for vector and list.

We followed this up with associative containers, containers that allow the fast lookup of their elements, always kept in order. Set, multiset, map, and multimap are part of this category.

We looked at the operations they support and how map and multimap are used to associate a value to a key. We also saw their unordered version, which does not keep elements in order but provides higher performance. Unordered_set and unordered_map are in this category.

Finally, we looked at unconventional containers. String is used to manipulate sequences of characters, pair and tuple are used to hold various elements of different types, optional is used to add optionality...