Scroll to navigation

std::sorted_equivalent_t,std::sorted_equivalent(3) C++ Standard Libary std::sorted_equivalent_t,std::sorted_equivalent(3)

NAME

std::sorted_equivalent_t,std::sorted_equivalent - std::sorted_equivalent_t,std::sorted_equivalent

Synopsis


Defined in header <flat_map>
Defined in header <flat_set>
struct sorted_equivalent_t { explicit sorted_equivalent_t() = (1) (since C++23)
default; };
inline constexpr sorted_equivalent_t sorted_equivalent{}; (2) (since C++23)


1) The type std::sorted_equivalent_t can be used in the function's (including
constructor's) parameter list to match the intended tag.
2) The corresponding std::sorted_equivalent instance of (1) is a disambiguation tag
that can be passed to the functions of std::flat_multimap and std::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.

Standard library


The following standard library container adaptors use (1,2) as disambiguation tags:


flat_multimap adapts two containers to provide a collection of key-value pairs,
(C++23) sorted by keys
(class template)
flat_multiset adapts a container to provide a collection of keys, sorted by keys
(C++23) (class template)

See also


sorted_unique indicates that elements of a range are sorted and unique
sorted_unique_t (tag)
(C++23)
from_range_t from-range construction tag
from_range (tag)
(C++23)
in_place
in_place_type
in_place_index in-place construction tag
in_place_t (tag)
in_place_type_t
in_place_index_t
(C++17)

2024.06.10 http://cppreference.com