tmp/tmpn9h1p6fb/{from.md → to.md}
RENAMED
|
@@ -0,0 +1,22 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#### Erasure <a id="unord.multiset.erasure">[[unord.multiset.erasure]]</a>
|
| 2 |
+
|
| 3 |
+
``` cpp
|
| 4 |
+
template<class K, class H, class P, class A, class Predicate>
|
| 5 |
+
typename unordered_multiset<K, H, P, A>::size_type
|
| 6 |
+
erase_if(unordered_multiset<K, H, P, A>& c, Predicate pred);
|
| 7 |
+
```
|
| 8 |
+
|
| 9 |
+
*Effects:* Equivalent to:
|
| 10 |
+
|
| 11 |
+
``` cpp
|
| 12 |
+
auto original_size = c.size();
|
| 13 |
+
for (auto i = c.begin(), last = c.end(); i != last; ) {
|
| 14 |
+
if (pred(*i)) {
|
| 15 |
+
i = c.erase(i);
|
| 16 |
+
} else {
|
| 17 |
+
++i;
|
| 18 |
+
}
|
| 19 |
+
}
|
| 20 |
+
return original_size - c.size();
|
| 21 |
+
```
|
| 22 |
+
|