From Jason Turner

[unord.map.syn]

Diff to HTML by rtfpessoa

tmp/tmpmiu9fjjz/{from.md → to.md} RENAMED
@@ -37,14 +37,16 @@ namespace std {
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
  template<class K, class T, class H, class P, class A, class Predicate>
43
  typename unordered_map<K, T, H, P, A>::size_type
44
  erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred);
45
 
 
46
  template<class K, class T, class H, class P, class A, class Predicate>
47
  typename unordered_multimap<K, T, H, P, A>::size_type
48
  erase_if(unordered_multimap<K, T, H, P, A>& c, Predicate pred);
49
 
50
  namespace pmr {
 
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 {