|
6444 | 6444 | template<class T, class Allocator> |
6445 | 6445 | constexpr bool operator==(const deque<T, Allocator>& x, const deque<T, Allocator>& y); |
6446 | 6446 | template<class T, class Allocator> |
6447 | | - constexpr @\placeholder{synth-three-way-result}@<T> operator<=>(const deque<T, Allocator>& x, |
6448 | | - @\itcorr@ const deque<T, Allocator>& y); |
| 6447 | + constexpr @\placeholder{synth-three-way-result}@<T> |
| 6448 | + operator<=>(const deque<T, Allocator>& x, const deque<T, Allocator>& y); |
6449 | 6449 |
|
6450 | 6450 | template<class T, class Allocator> |
6451 | 6451 | constexpr void swap(deque<T, Allocator>& x, deque<T, Allocator>& y) |
|
6940 | 6940 | constexpr bool operator==(const forward_list<T, Allocator>& x, |
6941 | 6941 | const forward_list<T, Allocator>& y); |
6942 | 6942 | template<class T, class Allocator> |
6943 | | - constexpr @\placeholder{synth-three-way-result}@<T> operator<=>(const forward_list<T, Allocator>& x, |
6944 | | - @\itcorr@ const forward_list<T, Allocator>& y); |
| 6943 | + constexpr @\placeholder{synth-three-way-result}@<T> |
| 6944 | + operator<=>(const forward_list<T, Allocator>& x, |
| 6945 | + const forward_list<T, Allocator>& y); |
6945 | 6946 |
|
6946 | 6947 | template<class T, class Allocator> |
6947 | 6948 | constexpr void swap(forward_list<T, Allocator>& x, forward_list<T, Allocator>& y) |
|
8994 | 8995 | template<class T, class Allocator> |
8995 | 8996 | constexpr bool operator==(const list<T, Allocator>& x, const list<T, Allocator>& y); |
8996 | 8997 | template<class T, class Allocator> |
8997 | | - constexpr @\placeholder{synth-three-way-result}@<T> operator<=>(const list<T, Allocator>& x, |
8998 | | - @\itcorr@ const list<T, Allocator>& y); |
| 8998 | + constexpr @\placeholder{synth-three-way-result}@<T> |
| 8999 | + operator<=>(const list<T, Allocator>& x, const list<T, Allocator>& y); |
8999 | 9000 |
|
9000 | 9001 | template<class T, class Allocator> |
9001 | 9002 | constexpr void swap(list<T, Allocator>& x, list<T, Allocator>& y) |
|
9787 | 9788 | template<class T, class Allocator> |
9788 | 9789 | constexpr bool operator==(const vector<T, Allocator>& x, const vector<T, Allocator>& y); |
9789 | 9790 | template<class T, class Allocator> |
9790 | | - constexpr @\placeholder{synth-three-way-result}@<T> operator<=>(const vector<T, Allocator>& x, |
9791 | | - @\itcorr@ const vector<T, Allocator>& y); |
| 9791 | + constexpr @\placeholder{synth-three-way-result}@<T> |
| 9792 | + operator<=>(const vector<T, Allocator>& x, const vector<T, Allocator>& y); |
9792 | 9793 |
|
9793 | 9794 | template<class T, class Allocator> |
9794 | 9795 | constexpr void swap(vector<T, Allocator>& x, vector<T, Allocator>& y) |
|
10575 | 10576 |
|
10576 | 10577 | \pnum |
10577 | 10578 | Unless described below, all operations have the same requirements and |
10578 | | -semantics as the primary \tcode{vector} template, except that operations |
| 10579 | +semantics as the \tcode{vector} primary template, except that operations |
10579 | 10580 | dealing with the \tcode{bool} value type map to bit values in the |
10580 | 10581 | container storage and |
10581 | 10582 | \tcode{allocator_traits::construct}\iref{allocator.traits.members} |
|
12585 | 12586 | constexpr bool operator==(const set<Key, Compare, Allocator>& x, |
12586 | 12587 | const set<Key, Compare, Allocator>& y); |
12587 | 12588 | template<class Key, class Compare, class Allocator> |
12588 | | - constexpr @\placeholder{synth-three-way-result}@<Key> operator<=>(const set<Key, Compare, Allocator>& x, |
12589 | | - @\itcorr@ const set<Key, Compare, Allocator>& y); |
| 12589 | + constexpr @\placeholder{synth-three-way-result}@<Key> |
| 12590 | + operator<=>(const set<Key, Compare, Allocator>& x, |
| 12591 | + const set<Key, Compare, Allocator>& y); |
12590 | 12592 |
|
12591 | 12593 | template<class Key, class Compare, class Allocator> |
12592 | 12594 | constexpr void swap(set<Key, Compare, Allocator>& x, |
|
13489 | 13491 |
|
13490 | 13492 | template<@\exposconcept{container-compatible-range}@<value_type> R> |
13491 | 13493 | 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()); |
| 13494 | + const hasher& hf = hasher(), const key_equal& eql = key_equal(), |
| 13495 | + const allocator_type& a = allocator_type()); |
13494 | 13496 | constexpr unordered_map(const unordered_map&); |
13495 | 13497 | constexpr unordered_map(unordered_map&&); |
13496 | 13498 | constexpr explicit unordered_map(const Allocator&); |
|
13510 | 13512 | : unordered_map(f, l, n, hasher(), key_equal(), a) { } |
13511 | 13513 | template<class InputIterator> |
13512 | 13514 | constexpr unordered_map(InputIterator f, InputIterator l, size_type n, const hasher& hf, |
13513 | | - const allocator_type& a) |
| 13515 | + const allocator_type& a) |
13514 | 13516 | : unordered_map(f, l, n, hf, key_equal(), a) { } |
13515 | 13517 | template<@\exposconcept{container-compatible-range}@<value_type> R> |
13516 | 13518 | constexpr unordered_map(from_range_t, R&& rg, size_type n, const allocator_type& a) |
|
13523 | 13525 | const allocator_type& a) |
13524 | 13526 | : unordered_map(il, n, hasher(), key_equal(), a) { } |
13525 | 13527 | constexpr unordered_map(initializer_list<value_type> il, size_type n, const hasher& hf, |
13526 | | - const allocator_type& a) |
| 13528 | + const allocator_type& a) |
13527 | 13529 | : unordered_map(il, n, hf, key_equal(), a) { } |
13528 | 13530 | constexpr ~unordered_map(); |
13529 | 13531 | constexpr unordered_map& operator=(const unordered_map&); |
|
0 commit comments