From Jason Turner

[unord.set.syn]

C++23 → Trunk 2.2 KB 15 lines
Current Draft | LaTeX Source
Archived: C++23
Markdown: C++23 | Trunk
Explore in Adventure Game

Diff to HTML by rtfpessoa

Files changed (1) hide show
  1. tmp/tmpl2php7ql/{from.md → to.md} +6 -6
tmp/tmpl2php7ql/{from.md → to.md} RENAMED
@@ -18,35 +18,35 @@ namespace std {
18
  class Pred = equal_to<Key>,
19
  class Alloc = allocator<Key>>
20
  class unordered_multiset;
21
 
22
  template<class Key, class Hash, class Pred, class Alloc>
23
- bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& a,
24
  const unordered_set<Key, Hash, Pred, Alloc>& b);
25
 
26
  template<class Key, class Hash, class Pred, class Alloc>
27
- bool operator==(const unordered_multiset<Key, Hash, Pred, Alloc>& a,
28
  const unordered_multiset<Key, Hash, Pred, Alloc>& b);
29
 
30
  template<class Key, class Hash, class Pred, class Alloc>
31
- void swap(unordered_set<Key, Hash, Pred, Alloc>& x,
32
  unordered_set<Key, Hash, Pred, Alloc>& y)
33
  noexcept(noexcept(x.swap(y)));
34
 
35
  template<class Key, class Hash, class Pred, class Alloc>
36
- void swap(unordered_multiset<Key, Hash, Pred, Alloc>& x,
37
  unordered_multiset<Key, Hash, Pred, Alloc>& y)
38
  noexcept(noexcept(x.swap(y)));
39
 
40
  // [unord.set.erasure], erasure for unordered_set
41
  template<class K, class H, class P, class A, class Predicate>
42
- typename unordered_set<K, H, P, A>::size_type
43
  erase_if(unordered_set<K, H, P, A>& c, Predicate pred);
44
 
45
  // [unord.multiset.erasure], erasure for unordered_multiset
46
  template<class K, class H, class P, class A, class Predicate>
47
- typename unordered_multiset<K, H, P, A>::size_type
48
  erase_if(unordered_multiset<K, H, P, A>& c, Predicate pred);
49
 
50
  namespace pmr {
51
  template<class Key,
52
  class Hash = hash<Key>,
 
18
  class Pred = equal_to<Key>,
19
  class Alloc = allocator<Key>>
20
  class unordered_multiset;
21
 
22
  template<class Key, class Hash, class Pred, class Alloc>
23
+ constexpr bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& a,
24
  const unordered_set<Key, Hash, Pred, Alloc>& b);
25
 
26
  template<class Key, class Hash, class Pred, class Alloc>
27
+ constexpr bool operator==(const unordered_multiset<Key, Hash, Pred, Alloc>& a,
28
  const unordered_multiset<Key, Hash, Pred, Alloc>& b);
29
 
30
  template<class Key, class Hash, class Pred, class Alloc>
31
+ constexpr void swap(unordered_set<Key, Hash, Pred, Alloc>& x,
32
  unordered_set<Key, Hash, Pred, Alloc>& y)
33
  noexcept(noexcept(x.swap(y)));
34
 
35
  template<class Key, class Hash, class Pred, class Alloc>
36
+ constexpr void swap(unordered_multiset<Key, Hash, Pred, Alloc>& x,
37
  unordered_multiset<Key, Hash, Pred, Alloc>& y)
38
  noexcept(noexcept(x.swap(y)));
39
 
40
  // [unord.set.erasure], erasure for unordered_set
41
  template<class K, class H, class P, class A, class Predicate>
42
+ constexpr typename unordered_set<K, H, P, A>::size_type
43
  erase_if(unordered_set<K, H, P, A>& c, Predicate pred);
44
 
45
  // [unord.multiset.erasure], erasure for unordered_multiset
46
  template<class K, class H, class P, class A, class Predicate>
47
+ constexpr typename unordered_multiset<K, H, P, A>::size_type
48
  erase_if(unordered_multiset<K, H, P, A>& c, Predicate pred);
49
 
50
  namespace pmr {
51
  template<class Key,
52
  class Hash = hash<Key>,