A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/algorithm/../ranges/../container/sorted_equivalent.html below:

std::sorted_equivalent_t, std::sorted_equivalent - cppreference.com

struct sorted_equivalent_t { explicit sorted_equivalent_t() = default; };

(1) (since C++23)

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.

[edit] Standard library

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

adapts two containers to provide a collection of key-value pairs, sorted by keys
(class template) [edit] adapts a container to provide a collection of keys, sorted by keys
(class template) [edit] [edit] See also

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4