deduction guides for std::flat_multimap
Defined in header <flat_map> | ||
|---|---|---|
template< class KeyContainer, class MappedContainer,
class Compare = std::less<typename KeyContainer::value_type> >
flat_multimap( KeyContainer, MappedContainer, Compare = Compare() )
-> flat_multimap<typename KeyContainer::value_type,
typename MappedContainer::value_type,
Compare, KeyContainer, MappedContainer>;
| (1) | (since C++23) |
template< class KeyContainer, class MappedContainer, class Allocator >
flat_multimap( KeyContainer, MappedContainer, Allocator )
-> flat_multimap<typename KeyContainer::value_type,
typename MappedContainer::value_type,
std::less<typename KeyContainer::value_type>,
KeyContainer, MappedContainer>;
| (2) | (since C++23) |
template< class KeyContainer, class MappedContainer,
class Compare, class Allocator >
flat_multimap( KeyContainer, MappedContainer, Compare, Allocator )
-> flat_multimap<typename KeyContainer::value_type,
typename MappedContainer::value_type,
Compare, KeyContainer, MappedContainer>;
| (3) | (since C++23) |
template< class KeyContainer, class MappedContainer,
class Compare = std::less<typename KeyContainer::value_type> >
flat_multimap( std::sorted_equivalent_t, KeyContainer, MappedContainer,
Compare = Compare() )
-> flat_multimap<typename KeyContainer::value_type,
typename MappedContainer::value_type,
Compare, KeyContainer, MappedContainer>;
| (4) | (since C++23) |
template< class KeyContainer, class MappedContainer, class Allocator >
flat_multimap( std::sorted_equivalent_t, KeyContainer, MappedContainer,
Allocator )
-> flat_multimap<typename KeyContainer::value_type,
typename MappedContainer::value_type,
std::less<typename KeyContainer::value_type>,
KeyContainer, MappedContainer>;
| (5) | (since C++23) |
template< class KeyContainer, class MappedContainer,
class Compare, class Allocator>
flat_multimap( std::sorted_equivalent_t, KeyContainer, MappedContainer,
Compare, Allocator )
-> flat_multimap<typename KeyContainer::value_type,
typename MappedContainer::value_type,
Compare, KeyContainer, MappedContainer>;
| (6) | (since C++23) |
template< class InputIt,
class Compare = std::less</*iter-key-t*/<InputIt>> >
flat_multimap( InputIt, InputIt, Compare = Compare() )
-> flat_multimap</*iter-key-t*/<InputIt>,
/*iter-mapped-t*/<InputIt>, Compare>;
| (7) | (since C++23) |
template< class InputIt,
class Compare = std::less</*iter-key-t*/<InputIt>> >
flat_multimap( std::sorted_equivalent_t, InputIt, InputIt,
Compare = Compare() )
-> flat_multimap</*iter-key-t*/<InputIt>,
/*iter-mapped-t*/<InputIt>, Compare>;
| (8) | (since C++23) |
template< ranges::input_range R,
class Compare = std::less</*range-key-t*/<R>>,
class Allocator = allocator<byte> >
flat_multimap( std::from_range_t, R&&, Compare = Compare(),
Allocator = Allocator() )
-> flat_multimap</*range-key-t*/<R>, /*range-mapped-t*/<R>, Compare,
std::vector</*range-key-t*/<R>,
/*alloc-rebind*/<Allocator,
/*range-key-t*/<R>>>,
std::vector</*range-mapped-t*/<R>,
/*alloc-rebind*/<Allocator,
/*range-mapped-t*/<R>>>>;
| (9) | (since C++23) |
template< ranges::input_range R, class Allocator >
flat_multimap( std::from_range_t, R&&, Allocator )
-> flat_multimap</*range-key-t*/<R>, /*range-mapped-t*/<R>,
std::less</*range-key-t*/<R>>,
std::vector</*range-key-t*/<R>,
/*alloc-rebind*/<Allocator,
/*range-key-t*/<R>>>,
std::vector</*range-mapped-t*/<R>,
/*alloc-rebind*/<Allocator,
/*range-mapped-t*/<R>>>>;
| (10) | (since C++23) |
template< class Key, class T, class Compare = std::less<Key> >
flat_multimap( std::initializer_list<pair<Key, T>>, Compare = Compare() )
-> flat_multimap<Key, T, Compare>;
| (11) | (since C++23) |
template< class Key, class T, class Compare = std::less<Key> >
flat_multimap( std::sorted_equivalent_t, std::initializer_list<pair<Key, T>>,
Compare = Compare() )
-> flat_multimap<Key, T, Compare>;
| (12) | (since C++23) |
| Exposition-only helper type aliases | ||
template< class InputIt >
using /*iter-val-t*/ =
typename std::iterator_traits<InputIt>::value_type;
| (exposition only*) | |
template< class InputIt >
using /*iter-key-t*/ =
std::remove_const_t< std::tuple_element_t<0, /*iter-val-t*/<InputIt>>>;
| (exposition only*) | |
template< class InputIt >
using /*iter-mapped-t*/ =
std::tuple_element_t<1, /*iter-val-t*/<InputIt>>;
| (exposition only*) | |
template< class Allocator, class T >
using /*alloc-rebind*/ =
typename std::allocator_traits<Allocator>::template rebind_alloc<T>;
| (exposition only*) | |
template< ranges::input_range Range >
using /*range-key-t*/ =
std::remove_const_t<typename ranges::range_value_t<Range>::first_type>;
| (exposition only*) | |
template< ranges::input_range Range >
using /*range-mapped-t*/ =
typename ranges::range_value_t<Range>::second_type;
| (exposition only*) |
These deduction guides are provided for to allow deduction from:
std::sorted_equivalent_t tag, a key-container, a mapped-container and a comparator.std::sorted_equivalent_t tag, a key-container, a mapped-container and an allocator.std::sorted_equivalent_t tag, a key-container, a mapped-container, a comparator and an allocator.std::sorted_equivalent_t tag, an iterator range and a comparator.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.
Example
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
https://en.cppreference.com/cpp/container/flat_multimap/deduction_guides