Containers and Data Structures

The crew that stores and manages your data. This group takes each container's internal representation, growth and iterator-invalidation rules, and complexity costs apart in full, and the "Container Selection Guide" lays out a decision path for picking a container by operation. If you haven't yet gotten your hands on the structures themselves — dynamic arrays, hash tables, and the like — walk through the "Data Structures Primer" sub-series first; get the foundation in place before coming back up.

STARTFINISHData Structures Primer: The Structures Underneath the Containers→STARTFINISHContainer Selection Guide→STARTFINISHarray: A Fixed-Size Array→STARTFINISHDeep Dive into vector→STARTFINISHDeep Dive into string→STARTFINISHdeque, list, and forward_list→STARTFINISHDeep Dive into map and set→STARTFINISHDeep Dive into unordered_map and set→STARTFINISHspan: A Non-Owning View→STARTFINISHContainer Adapters→STARTFINISHNew Standard Containers (C++23/26)→STARTFINISHinitializer_list→STARTFINISHObject Size and Trivial Types→STARTFINISHCustom Allocators→