From Jason Turner

[unord.map.syn]

C++23 → Trunk 2.3 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/tmpa31vitq8/{from.md → to.md} +6 -6
tmp/tmpa31vitq8/{from.md → to.md} RENAMED
@@ -20,35 +20,35 @@ namespace std {
20
  class Pred = equal_to<Key>,
21
  class Alloc = allocator<pair<const Key, T>>>
22
  class unordered_multimap;
23
 
24
  template<class Key, class T, class Hash, class Pred, class Alloc>
25
- bool operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& a,
26
  const unordered_map<Key, T, Hash, Pred, Alloc>& b);
27
 
28
  template<class Key, class T, class Hash, class Pred, class Alloc>
29
- bool operator==(const unordered_multimap<Key, T, Hash, Pred, Alloc>& a,
30
  const unordered_multimap<Key, T, Hash, Pred, Alloc>& b);
31
 
32
  template<class Key, class T, class Hash, class Pred, class Alloc>
33
- void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x,
34
  unordered_map<Key, T, Hash, Pred, Alloc>& y)
35
  noexcept(noexcept(x.swap(y)));
36
 
37
  template<class Key, class T, class Hash, class Pred, class Alloc>
38
- void swap(unordered_multimap<Key, T, Hash, Pred, Alloc>& x,
39
  unordered_multimap<Key, T, Hash, Pred, Alloc>& y)
40
  noexcept(noexcept(x.swap(y)));
41
 
42
  // [unord.map.erasure], erasure for unordered_map
43
  template<class K, class T, class H, class P, class A, class Predicate>
44
- typename unordered_map<K, T, H, P, A>::size_type
45
  erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred);
46
 
47
  // [unord.multimap.erasure], erasure for unordered_multimap
48
  template<class K, class T, class H, class P, class A, class Predicate>
49
- typename unordered_multimap<K, T, H, P, A>::size_type
50
  erase_if(unordered_multimap<K, T, H, P, A>& c, Predicate pred);
51
 
52
  namespace pmr {
53
  template<class Key,
54
  class T,
 
20
  class Pred = equal_to<Key>,
21
  class Alloc = allocator<pair<const Key, T>>>
22
  class unordered_multimap;
23
 
24
  template<class Key, class T, class Hash, class Pred, class Alloc>
25
+ constexpr bool operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& a,
26
  const unordered_map<Key, T, Hash, Pred, Alloc>& b);
27
 
28
  template<class Key, class T, class Hash, class Pred, class Alloc>
29
+ constexpr bool operator==(const unordered_multimap<Key, T, Hash, Pred, Alloc>& a,
30
  const unordered_multimap<Key, T, Hash, Pred, Alloc>& b);
31
 
32
  template<class Key, class T, class Hash, class Pred, class Alloc>
33
+ constexpr void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x,
34
  unordered_map<Key, T, Hash, Pred, Alloc>& y)
35
  noexcept(noexcept(x.swap(y)));
36
 
37
  template<class Key, class T, class Hash, class Pred, class Alloc>
38
+ constexpr void swap(unordered_multimap<Key, T, Hash, Pred, Alloc>& x,
39
  unordered_multimap<Key, T, Hash, Pred, Alloc>& y)
40
  noexcept(noexcept(x.swap(y)));
41
 
42
  // [unord.map.erasure], erasure for unordered_map
43
  template<class K, class T, class H, class P, class A, class Predicate>
44
+ constexpr typename unordered_map<K, T, H, P, A>::size_type
45
  erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred);
46
 
47
  // [unord.multimap.erasure], erasure for unordered_multimap
48
  template<class K, class T, class H, class P, class A, class Predicate>
49
+ constexpr typename unordered_multimap<K, T, H, P, A>::size_type
50
  erase_if(unordered_multimap<K, T, H, P, A>& c, Predicate pred);
51
 
52
  namespace pmr {
53
  template<class Key,
54
  class T,