std::sorted_unique_t, std::sorted_unique

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Execution support library (C++26)

Technical specifications

Symbols index

External libraries

 

Containers library

Sequence

array (C++11)

vector

vector<bool>

inplace_vector (C++26)

deque

forward_list (C++11)

list

Associative

set

multiset

map

multimap

Unordered associative

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

Adaptors

stack

queue

priority_queue

flat_set (C++23)

flat_multiset (C++23)

flat_map (C++23)

flat_multimap (C++23)

Views

span (C++20)

mdspan (C++23)

Tables

Iterator invalidation

Member function table

Non-member function table

 

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

1) The type std::sorted_unique_t can be used in the function's (including constructor's) parameter list to match the intended tag.

2) The corresponding std::sorted_unique instance of (1) is a disambiguation tag that can be passed to the functions of std::flat_map and std::flat_set to indicate that the input range or container is sorted (with respect to the comparator used in flat container adaptor) and all elements of such container or range are unique.

Standard library

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

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

See also

sorted_equivalentsorted_equivalent_t (C++23)	indicates that elements of a range are sorted (uniqueness is not required) (tag)
from_range_tfrom_range (C++23)	from-range construction tag (tag)
in_placein_place_typein_place_indexin_place_tin_place_type_tin_place_index_t (C++17)	in-place construction tag (tag)