The Standard Template Library in C++, examples explains and code archive
Sequence containers implement data structures that can be accessed sequentially.
array Static contiguous array
vector Dynamic contiguous array
deque Double-ended queue
forward_list Singly-linked list
list Doubly-linked list
Associative containers implement sorted data structures that can be quickly searched (O(log n) complexity).
Set Collection of unique keys, sorted by keys
Map Collection of key-value pairs, sorted by keys, keys are unique.
multiset Collection of keys, sorted by keys
multimap Collection of key-value pairs, sorted by keys
Unordered associative containers implement unsorted (hashed) data structures that can be quickly searched (O(1) amortized, O(n) worst-case complexity).
unordered_set Collection of unique keys, hashed by keys.
unordered_map Collection of key-value pairs, hashed by keys, keys are unique.
unordered_multiset Collection of keys, hashed by keys
unordered_multimap Collection of key-value pairs, hashed by keys
Container adapters provide a different interface for sequential containers.
stack Adapts a container to provide stack (LIFO data structure).
queue Adapts a container to provide queue (FIFO data structure).
priority_queue Adapts a container to provide priority queue.