tmp/tmpogy3rq2n/{from.md → to.md}
RENAMED
|
@@ -35,14 +35,16 @@ namespace std {
|
|
| 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 |
template<class K, class H, class P, class A, class Predicate>
|
| 41 |
typename unordered_set<K, H, P, A>::size_type
|
| 42 |
erase_if(unordered_set<K, H, P, A>& c, Predicate pred);
|
| 43 |
|
|
|
|
| 44 |
template<class K, class H, class P, class A, class Predicate>
|
| 45 |
typename unordered_multiset<K, H, P, A>::size_type
|
| 46 |
erase_if(unordered_multiset<K, H, P, A>& c, Predicate pred);
|
| 47 |
|
| 48 |
namespace pmr {
|
|
|
|
| 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 {
|