Professional C++, 5th Edition

18Standard Library Containers

WHAT'S IN THIS CHAPTER?

• Containers overview: requirements on elements and general error handling
• Sequential containers: vector, deque, list, forward_list, and array
• How to use the span class
• Container adapters: queue, priority_queue, and stack
• Associative containers: the pair utility, map, multimap, set, and multiset
• Unordered associative containers or hash tables: unordered_map, unordered_multimap, unordered_set, and unordered_multiset
• Other containers: standard C-style arrays, string s, streams, and bitset

WILEY.COM DOWNLOADS FOR THIS CHAPTER

Please note that all the code examples for this chapter are available as part of this chapter's code download on the book's website at www.wiley.com/go/proc++5e on the Download Code tab.

This chapter of the Standard Library deep-dive chapters covers the available containers. It explains the different containers, their categories, and what the trade-offs are between them. Some containers are discussed in much more detail compared to others. Once you know how to work with a container of each category, you will have no problems using any of the other containers from the same category. Consult your favorite Standard Library Reference for a complete reference of all methods of all containers.

CONTAINERS OVERVIEW

Containers in the Standard Library are generic data structures that are useful for storing collections of data. You should rarely need to use a standard C-style array, write a linked ...