deduction guides for std::flat_multiset

 

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

 

std::flat_multiset

Member types

Member functions

flat_multiset::flat_multiset   flat_multiset::operator= Iterators flat_multiset::beginflat_multiset::cbegin flat_multiset::endflat_multiset::cend flat_multiset::rbeginflat_multiset::crbegin flat_multiset::rendflat_multiset::crend Capacity flat_multiset::size flat_multiset::max_size flat_multiset::empty Observers flat_multiset::key_comp flat_multiset::value_comp Modifiers flat_multiset::clear flat_multiset::insert flat_multiset::insert_range flat_multiset::emplace flat_multiset::emplace_hint flat_multiset::erase flat_multiset::swap flat_multiset::extract flat_multiset::replace Lookup flat_multiset::count flat_multiset::find flat_multiset::contains flat_multiset::equal_range flat_multiset::lower_bound flat_multiset::upper_bound

Non-member functions

swap(std::flat_multiset) erase_if(std::flat_multiset)    operator==operator<=>

Helper classes

uses_allocator<std::flat_multiset>

Tags

sorted_equivalent         sorted_equivalent_t

Deduction guides

 

Defined in header <flat_set>
template< class KeyContainer,           class Compare = std::less<typename KeyContainer::value_type> > flat_multiset( KeyContainer, Compare = Compare() )     -> flat_multiset<typename KeyContainer::value_type, Compare, KeyContainer>;	(1)	(since C++23)
template< class KeyContainer, class Allocator > flat_multiset( KeyContainer, Allocator )     -> flat_multiset<typename KeyContainer::value_type,                      std::less<typename KeyContainer::value_type>, KeyContainer>;	(2)	(since C++23)
template< class KeyContainer, class Compare, class Allocator > flat_multiset( KeyContainer, Compare, Allocator )     -> flat_multiset<typename KeyContainer::value_type, Compare, KeyContainer>;	(3)	(since C++23)
template< class KeyContainer,           class Compare = std::less<typename KeyContainer::value_type> > flat_multiset( std::sorted_equivalent_t, KeyContainer, Compare = Compare() )     -> flat_multiset<typename KeyContainer::value_type, Compare, KeyContainer>;	(4)	(since C++23)
template< class KeyContainer, class Allocator > flat_multiset( std::sorted_equivalent_t, KeyContainer, Allocator )     -> flat_multiset<typename KeyContainer::value_type,                      std::less<typename KeyContainer::value_type>, KeyContainer>;	(5)	(since C++23)
template< class KeyContainer, class Compare, class Allocator > flat_multiset( std::sorted_equivalent_t, KeyContainer, Compare, Allocator )     -> flat_multiset<typename KeyContainer::value_type, Compare, KeyContainer>;	(6)	(since C++23)
template< class InputIter,           class Compare = std::less</*iter-value-type*/<InputIter>> > flat_multiset( InputIter, InputIter, Compare = Compare() )     -> flat_multiset</*iter-value-type*/<InputIter>, Compare>;	(7)	(since C++23)
template< class InputIter,           class Compare = std::less</*iter-value-type*/<InputIter>> > flat_multiset( std::sorted_equivalent_t, InputIter, InputIter, Compare = Compare() )     -> flat_multiset</*iter-value-type*/<InputIter>, Compare>;	(8)	(since C++23)
template< ranges::input_range R,           class Compare = std::less<ranges::range_value_t<R>>,           class Allocator = std::allocator<ranges::range_value_t<R>> > flat_multiset( std::from_range_t, R&&, Compare = Compare(), Allocator = Allocator() )     -> flat_multiset<ranges::range_value_t<R>, Compare,                      std::vector<ranges::range_value_t<R>,                      /*alloc-rebind*/<Allocator, ranges::range_value_t<R>>>>;	(9)	(since C++23)
template< ranges::input_range R, class Allocator > flat_multiset( std::from_range_t, R&&, Allocator )     -> flat_multiset<ranges::range_value_t<R>, std::less<ranges::range_value_t<R>>,                      std::vector<ranges::range_value_t<R>,                      /*alloc-rebind*/<Allocator, ranges::range_value_t<R>>>>;	(10)	(since C++23)
template< class Key, class Compare = std::less<Key> > flat_multiset( std::initializer_list<Key>, Compare = Compare() )     -> flat_multiset<Key, Compare>;	(11)	(since C++23)
template< class Key, class Compare = std::less<Key> > flat_multiset( std::sorted_equivalent_t,                std::initializer_list<Key>, Compare = Compare() )     -> flat_multiset<Key, Compare>;	(12)	(since C++23)

These deduction guides are provided for to allow deduction from:

1) A container and a comparator.

2) A container and an allocator.

3) A container, a comparator and an allocator.

4) The std::sorted_equivalent_t tag, a container and a comparator.

5) The std::sorted_equivalent_t tag, a container and an allocator.

6) The std::sorted_equivalent_t tag, a container, a comparator and an allocator.

7) An iterator range and a comparator.

8) The std::sorted_equivalent_t tag, an iterator range and a comparator.

9) The std::from_range_t tag, an input_range range, a comparator and an allocator.

10) The std::from_range_t tag, an input_range range and an allocator.

11) The std::initializer_list and a comparator.

12) The std::sorted_equivalent_t tag, the std::initializer_list and a comparator.

These overloads participate in overload resolution only if InputIt satisfies LegacyInputIterator, Alloc satisfies Allocator, and Comp does not satisfy Allocator.

Note: the extent to which the library determines that a type does not satisfy LegacyInputIterator is unspecified, except that as a minimum integral types do not qualify as input iterators. Likewise, the extent to which it determines that a type does not satisfy Allocator is unspecified, except that as a minimum the member type Alloc::value_type must exist and the expression std::declval<Alloc&>().allocate(std::size_t{}) must be well-formed when treated as an unevaluated operand.