|
|
| Line 1,822: |
Line 1,822: |
| | ! {{cpp/container/table cell ho | /queue }} | | ! {{cpp/container/table cell ho | /queue }} |
| | ! {{cpp/container/table cell ho | /priority_queue }} | | ! {{cpp/container/table cell ho | /priority_queue }} |
| − | ! {{cpp/container/table cell ho | /flat_set }} | + | ! {{cpp/container/table cell h23 | /flat_set }} |
| − | ! {{cpp/container/table cell ho | /flat_multiset }} | + | ! {{cpp/container/table cell h23 | /flat_multiset }} |
| − | ! {{cpp/container/table cell ho | /flat_map }} | + | ! {{cpp/container/table cell h23 | /flat_map }} |
| − | ! {{cpp/container/table cell ho | /flat_multimap }} | + | ! {{cpp/container/table cell h23 | /flat_multimap }} |
| | |- | | |- |
| | | colspan="2" | | | | colspan="2" | |
Revision as of 02:14, 25 September 2022
The Containers library is a generic collection of class templates and algorithms that allow programmers to easily implement common data structures like queues, lists and stacks. There are two(until C++11)three(since C++11) classes of containers:
- sequence containers,
- associative containers, and
- unordered associative containers,
|
(since C++11) |
each of which is designed to support a different set of operations.
The container manages the storage space that is allocated for its elements and provides member functions to access them, either directly or through iterators (objects with properties similar to pointers).
Most containers have at least several member functions in common, and share functionalities. Which container is the best for the particular application depends not only on the offered functionality, but also on its efficiency for different workloads.
Sequence containers
Sequence containers implement data structures which can be accessed sequentially.
|
|
fixed-sized inplace contiguous array
(class template) [edit]
|
|
|
dynamic contiguous array
(class template) [edit]
|
|
|
double-ended queue
(class template) [edit]
|
|
|
singly-linked list
(class template) [edit]
|
|
|
doubly-linked list
(class template) [edit]
|
Associative containers
Associative containers implement sorted data structures that can be quickly searched (O(log n) complexity).
|
|
collection of unique keys, sorted by keys
(class template) [edit]
|
|
|
collection of key-value pairs, sorted by keys, keys are unique
(class template) [edit]
|
|
|
collection of keys, sorted by keys
(class template) [edit]
|
|
|
collection of key-value pairs, sorted by keys
(class template) [edit]
|
Unordered associative containers (since C++11)
Unordered associative containers implement unsorted (hashed) data structures that can be quickly searched (O(1) amortized, O(n) worst-case complexity).
|
|
collection of unique keys, hashed by keys
(class template) [edit]
|
|
|
collection of key-value pairs, hashed by keys, keys are unique
(class template) [edit]
|
|
|
collection of keys, hashed by keys
(class template) [edit]
|
|
|
collection of key-value pairs, hashed by keys
(class template) [edit]
|
Container adaptors
Container adaptors provide a different interface for sequential containers.
|
|
adapts a container to provide stack (LIFO data structure)
(class template) [edit]
|
|
|
adapts a container to provide queue (FIFO data structure)
(class template) [edit]
|
|
|
adapts a container to provide priority queue
(class template) [edit]
|
|
|
adapts a container to provide a collection of unique keys, sorted by keys
(class template) [edit]
|
|
|
adapts two containers to provide a collection of key-value pairs, sorted by unique keys
(class template) [edit]
|
|
|
adapts a container to provide a collection of keys, sorted by keys
(class template) [edit]
|
|
|
adapts two containers to provide a collection of key-value pairs, sorted by keys
(class template) [edit]
|
Iterator invalidation
Read-only methods never invalidate iterators or references. Methods which modify the contents of a container may invalidate iterators and/or references, as summarized in this table.
| Category
|
Container
|
After insertion, are...
|
After erasure, are...
|
Conditionally
|
| iterators valid?
|
references valid?
|
iterators valid?
|
references valid?
|
| Sequence containers
|
array
|
N/A
|
N/A
|
|
| vector
|
No
|
N/A
|
Insertion changed capacity
|
| Yes
|
Yes
|
Before modified element(s)
(for insertion only if capacity didn't change)
|
| No
|
No
|
At or after modified element(s)
|
| deque
|
No
|
Yes
|
Yes, except erased element(s)
|
Modified first or last element
|
| No
|
No
|
Modified middle only
|
| list
|
Yes
|
Yes, except erased element(s)
|
|
| forward_list
|
Yes
|
Yes, except erased element(s)
|
|
| Associative containers
|
set
multiset
map
multimap
|
Yes
|
Yes, except erased element(s)
|
|
| Unordered associative containers
|
unordered_set
unordered_multiset
unordered_map
unordered_multimap
|
No
|
Yes
|
N/A
|
Insertion caused rehash
|
| Yes
|
Yes, except erased element(s)
|
No rehash
|
Here, insertion refers to any method which adds one or more elements to the container and erasure refers to any method which removes one or more elements from the container.
Unless otherwise specified (either explicitly or by defining a function in terms of other functions), passing a container as an argument to a library function never invalidate iterators to, or change the values of, objects within that container.
The past-the-end iterator deserves particular mention. In general this iterator is invalidated as though it were a normal iterator to a non-erased element. So std::set::end is never invalidated, std::unordered_set::end is invalidated only on rehash(since C++11), std::vector::end is always invalidated (since it is always after the modified elements), and so on.
There is one exception: an erasure which deletes the last element of a std::deque does invalidate the past-the-end iterator, even though it is not an erased element of the container (or an element at all). Combined with the general rules for std::deque iterators, the net result is that the only modifying operation which does not invalidate std::deque::end is an erasure which deletes the first element, but not the last.
Thread safety
- All container functions can be called concurrently by different threads on different containers. More generally, the C++ standard library functions do not read objects accessible by other threads unless those objects are directly or indirectly accessible via the function arguments, including the this pointer.
- All const member functions can be called concurrently by different threads on the same container. In addition, the member functions
begin(), end(), rbegin(), rend(), front(), back(), data(), find(), lower_bound(), upper_bound(), equal_range(), at(), and, except in associative containers, operator[], behave as const for the purposes of thread safety (that is, they can also be called concurrently by different threads on the same container). More generally, the C++ standard library functions do not modify objects unless those objects are accessible, directly or indirectly, via the function's non-const arguments, including the this pointer.
- Different elements in the same container can be modified concurrently by different threads, except for the elements of std::vector<bool> (for example, a vector of std::future objects can be receiving values from multiple threads).
- Iterator operations (e.g. incrementing an iterator) read, but do not modify the underlying container, and may be executed concurrently with operations on other iterators on the same container, with the const member functions, or reads from the elements. Container operations that invalidate any iterators modify the container and cannot be executed concurrently with any operations on existing iterators even if those iterators are not invalidated.
- Elements of the same container can be modified concurrently with those member functions that are not specified to access these elements. More generally, the C++ standard library functions do not read objects indirectly accessible through their arguments (including other elements of a container) except when required by its specification.
- In any case, container operations (as well as algorithms, or any other C++ standard library functions) may be parallelized internally as long as this does not change the user-visible results (e.g. std::transform may be parallelized, but not std::for_each which is specified to visit each element of a sequence in order)
|
(since C++11) |
Function table
|
|
- functions present in C++03
|
|
|
- functions present since C++11
|
|
|
- functions present since C++17
|
|
|
- functions present since C++20
|
|
|
- functions present since C++23
|
Member function table
- Note: functions in two different extract lines have different meanings and syntax:
- ↑ e.g., node_type extract(const_iterator) or node_type extract(Key&)
- ↑ e.g., container_type extract() &&
Non-member function table
Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
| DR
|
Applied to
|
Behavior as published
|
Correct behavior
|
| LWG 51
|
C++98
|
container iterators might be invalidated
by arbitrary library operation
|
they are only invalidated
when specified
|
See also
C++ named requirements:
|
|
numeric arrays, array masks and array slices
(class template) [edit]
|
|
|
stores and manipulates sequences of characters
(class template) [edit]
|
|
|
read-only string view
(class template) [edit]
|
|
|
a non-owning view over a contiguous sequence of objects
(class template) [edit]
|
|
|
a multi-dimensional non-owning array view
(class template) [edit]
|
