|
13489 | 13489 |
|
13490 | 13490 | template<@\exposconcept{container-compatible-range}@<value_type> R> |
13491 | 13491 | constexpr unordered_map(from_range_t, R&& rg, size_type n = @\seebelow@, |
13492 | | - const hasher& hf = hasher(), const key_equal& eql = key_equal(), |
13493 | | - const allocator_type& a = allocator_type()); |
| 13492 | + const hasher& hf = hasher(), const key_equal& eql = key_equal(), |
| 13493 | + const allocator_type& a = allocator_type()); |
13494 | 13494 | constexpr unordered_map(const unordered_map&); |
13495 | 13495 | constexpr unordered_map(unordered_map&&); |
13496 | 13496 | constexpr explicit unordered_map(const Allocator&); |
|
13510 | 13510 | : unordered_map(f, l, n, hasher(), key_equal(), a) { } |
13511 | 13511 | template<class InputIterator> |
13512 | 13512 | constexpr unordered_map(InputIterator f, InputIterator l, size_type n, const hasher& hf, |
13513 | | - const allocator_type& a) |
| 13513 | + const allocator_type& a) |
13514 | 13514 | : unordered_map(f, l, n, hf, key_equal(), a) { } |
13515 | 13515 | template<@\exposconcept{container-compatible-range}@<value_type> R> |
13516 | 13516 | constexpr unordered_map(from_range_t, R&& rg, size_type n, const allocator_type& a) |
|
13523 | 13523 | const allocator_type& a) |
13524 | 13524 | : unordered_map(il, n, hasher(), key_equal(), a) { } |
13525 | 13525 | constexpr unordered_map(initializer_list<value_type> il, size_type n, const hasher& hf, |
13526 | | - const allocator_type& a) |
| 13526 | + const allocator_type& a) |
13527 | 13527 | : unordered_map(il, n, hf, key_equal(), a) { } |
13528 | 13528 | constexpr ~unordered_map(); |
13529 | 13529 | constexpr unordered_map& operator=(const unordered_map&); |
|
0 commit comments