(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
Defined in header <flat_map> | ||
Defined in header <flat_set> | ||
struct sorted_equivalent_t{explicit sorted_equivalent_t()=default;}; | (1) | (since C++23) |
inlineconstexpr sorted_equivalent_t sorted_equivalent{}; | (2) | (since C++23) |
std::sorted_equivalent_t can be used in the function's (including constructor's) parameter list to match the intended tag.std::sorted_equivalent instance of(1) is a disambiguation tag that can be passed to the functions ofstd::flat_multimap andstd::flat_multiset to indicate that the input range or container is sorted (with respect to the comparator used in flat container adaptor), whilst uniqueness of elements is not required.The following standard library container adaptors use(1,2) as disambiguation tags:
(C++23) | adapts two containers to provide a collection of key-value pairs, sorted by keys (class template)[edit] |
(C++23) | adapts a container to provide a collection of keys, sorted by keys (class template)[edit] |
(C++23) | indicates that elements of a range are sorted and unique (tag)[edit] |
(C++23) | from-range construction tag (tag)[edit] |
| in-place construction tag (tag)[edit] |
