deduction guides for std::map
                
                
                
|   Defined in header  <map>
  | 
||
|   template< class InputIt,           class Comp = std::less<iter_key_t<InputIt>>,  | 
(1) | (since C++17) | 
|   template< class Key,           class T,  | 
(2) | (since C++17) | 
|   template< class InputIt, class Alloc > map( InputIt, InputIt, Alloc )  | 
(3) | (since C++17) | 
|   template< class Key, class T, class Alloc > map( std::initializer_list<std::pair<Key, T>>, Alloc )  | 
(4) | (since C++17) | 
|   template< ranges::input_range R, class Compare = std::less<range_key_t<R>,           class Alloc = std::allocator<range_to_alloc_t<R>> >  | 
(5) | (since C++23) | 
|   template< ranges::input_range R, class Alloc > map( std::from_range_t, R&&, Alloc )  | 
(6) | (since C++23) | 
|   Exposition-only helper type aliases  | 
||
|   template< class InputIter > using iter_val_t =  | 
(exposition only*) | |
|   template< class InputIter > using iter_key_t =  | 
(exposition only*) | |
|   template< class InputIter > using iter_mapped_t =  | 
(exposition only*) | |
|   template< class InputIter > using iter_to_alloc_t =  | 
(exposition only*) | |
|   template< ranges::input_range Range > using range_key_t =  | 
 (since C++23)  (exposition only*)  | 
|
|   template< ranges::input_range Range > using range_mapped_t =  | 
 (since C++23)  (exposition only*)  | 
|
|   template< ranges::input_range Range > using range_to_alloc_t =  | 
 (since C++23)  (exposition only*)  | 
|
map to allow deduction from an iterator range (overloads (1,3)) and std::initializer_list (overloads (2,4)).map to allow deduction from a std::from_range_t tag and an input_range.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.
Notes
| Feature-test macro | Value | Std | Feature | 
|---|---|---|---|
__cpp_lib_containers_ranges | 
202202L | (C++23) | Ranges-aware construction and insertion; overload (5,6) | 
Example
Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
| DR | Applied to | Behavior as published | Correct behavior | 
|---|---|---|---|
| LWG 3025 | C++17 | initializer-list guides take std::pair<const Key, T> | use std::pair<Key, T> |