All Sequence Containers

All Sequence Containers

A compact index of the standard sequence containers, adapters, and the main tradeoffs that matter when choosing among them.

How to use this reference page

Use reference pages to confirm names, categories, nearby facilities, and the constraints that matter before writing or reviewing code.

Scan the top of the page first to identify the primary types, functions, or algorithm families involved.
Use the nearby-page links when your question is really about a companion header, related algorithm family, or broader subsystem.
Validate tricky behavior with a small compileable example before relying on memory for details like invalidation, ordering, allocation, or lifetime rules.

All Sequence Containers

Owning sequence containers

std::array
std::vector
std::deque
std::list
std::forward_list

Container adapters built on sequences

std::stack
std::queue
std::priority_queue

Non-owning sequence-like views

std::span
std::mdspan
std::string_view

High-value choice rules

Use std::vector by default when you need a resizable owning sequence.
Use std::array when size is fixed at compile time.
Use std::deque when frequent front insertion matters.
Use std::list and std::forward_list only when node-based behavior is genuinely needed.
Use std::span or std::string_view for non-owning parameters.

Important operational differences

vector provides contiguous storage and best cache locality.
deque is not contiguous in the same way as vector.
node-based containers preserve iterator/reference stability better under many operations.
adapters intentionally hide most of the underlying container interface.

Example in practice

#include <map>
#include <string>

int main() {
    std::map<std::string, int> counts{std::pair{"Ada", 1}, std::pair{"Bjarne", 2}};
    auto [it, inserted] = counts.insert({"Grace", 3});
    return inserted ? it->second : 1;
}