deductiongu...td::multimap(3)
πΈ NAME πΈ
Okay so this is the C++ Standard Library manual page for deduction guides for std::multimap, section 3, and the name is literally deduction guides for std::multimap β deduction guides for std::multimap. No cap, that's the whole NAME situation. π«Ά
β¨ Synopsis β¨
Defined in header <map> β yes bestie, <map> is the header, write it down. π
π Overload (1) β since C++17 π
template< class InputIt,
class Comp = std::less<iter_key_t<InputIt>>,
class Alloc = std::allocator<iter_to_alloc_t<InputIt>> >
multimap( InputIt, InputIt, Comp = Comp(), Alloc = Alloc() )
-> multimap<iter_key_t<InputIt>, iter_val_t<InputIt>,
Comp, Alloc>;
π Overload (2) β since C++17 π
template< class Key,
class T,
class Comp = std::less<Key>,
class Alloc = std::allocator<std::pair<const Key, T>> >
multimap( std::initializer_list<std::pair<Key, T>>, Comp = Comp(), Alloc = Alloc() )
-> multimap<Key, T, Comp, Alloc>;
π Overload (3) β since C++17 π
template< class InputIt, class Alloc >
multimap( InputIt, InputIt, Alloc )
-> multimap<iter_key_t<InputIt>, iter_val_t<InputIt>,
std::less<iter_key_t<InputIt>>, Alloc>;
π Overload (4) β since C++17 π
template< class Key, class T, class Alloc >
multimap( std::initializer_list<std::pair<Key, T>>, Alloc )
-> multimap<Key, T, std::less<Key>, Alloc>;
π Overload (5) β since C++23 π
template< ranges::input_range R, class Compare = std::less<range_key_t<R>>,
class Alloc = std::allocator<range_to_alloc_t<R>> >
multimap( std::from_range_t, R&&, Compare = Compare(), Alloc = Alloc() )
-> multimap<range_key_t<R>, range_mapped_t<R>, Compare, Alloc>;
π Overload (6) β since C++23 π
template< ranges::input_range R, class Alloc >
multimap( std::from_range_t, R&&, Alloc )
-> multimap<range_key_t<R>, range_mapped_t<R>,
std::less<range_key_t<R>>, Alloc>;
π Exposition-only helper type aliases π
iter_val_t
template< class InputIter >
using iter_val_t =
typename std::iterator_traits<InputIter>::value_type;
(exposition only*)
iter_key_t
template< class InputIter >
using iter_key_t =
std::remove_const_t< std::tuple_element_t<0,
iter_val_t<InputIter>>>;
(exposition only*)
iter_mapped_t
template< class InputIter >
using iter_mapped_t =
std::tuple_element_t<1, iter_val_t<InputIter>>;
(exposition only*)
iter_to_alloc_t
template< class InputIter >
using iter_to_alloc_t =
std::pair<std::add_const_t<tuple_element_t<0,
iter_val_t<InputIter>>>,
std::tuple_element_t<1,
iter_val_t<InputIter>>>;
(exposition only*)
range_key_t
template< ranges::input_range Range >
using range_key_t =
std::remove_const_t<typename
ranges::range_value_t<Range>::first_type>;
(since C++23) (exposition only*)
range_mapped_t
template< ranges::input_range Range >
using range_mapped_t =
typename ranges::range_value_t<Range>::second_type;
(since C++23) (exposition only*)
range_to_alloc_t
template< ranges::input_range Range >
using range_to_alloc_t =
std::pair<std::add_const_t<typename
ranges::range_value_t<Range>::first_type>,
typename ranges::range_value_t<Range>::second_type>;
(since C++23) (exposition only*)
1-4) These deduction guides are provided for multimap to allow deduction from an iterator range (overloads (1,3)) and std::initializer_list (overloads (2,4)). Slay.
5,6) These deduction guides are provided for multimap to allow deduction from a std::from_range_t tag and an input_range. Adorable.
These overloads participate in overload resolution only if InputIt satisfies LegacyInputIterator, Alloc satisfies Allocator, and Comp does not satisfy Allocator.
Note, bestie: the extent to which the library determines that a type does not satisfyLegacyInputIteratoris 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 satisfyAllocatoris unspecified, except that as a minimum the member typeAlloc::value_typemust exist and the expressionstd::declval<Alloc&>().allocate(std::size_t{})must be well-formed when treated as an unevaluated operand.
π¦ Notes π¦
Feature-test macro
- Feature-test macro:
__cpp_lib_containers_ranges - Value:
202202L - Std:
(C++23) - Feature: Ranges-aware construction and insertion; overload
(5,6)
π Example π
Run this code, bestie β the comments are literally doing the teaching here. β¨
// Run this code
#include <map>
int main()
{
// std::multimap m1 = {{"foo", 1}, {"bar", 2}};
// Error: braced-init-list has no type; cannot deduce
// pair<Key, T> from {"foo", 1} or {"bar", 2}
std::multimap m1 = {std::pair{"foo", 2}, {"bar", 3}}; // guide #2
std::multimap m2(m1.begin(), m1.end()); // guide #1
}
π Defect reports π
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
- DR
LWG 3025β Applied toC++17β Behavior as published: initializer-list guides takestd::pair<const Key, T>β Correct behavior: usestd::pair<Key, T>periodt.
That's the whole page, bestie π β source/version and date: cppreference.com, 2024.06.10. You survived the template soup. π«Ά
π¦ where this page comes from
- nixpkgs unstable: stdman 2024.07.05
- opensuse-leap 16.0: stdman 2024.07.05-bp160.1.9 Β· MIT
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms