std::experimental::erase_if (std::unordered_multiset)

From cppreference.com

Defined in header <experimental/unordered_set>
template< class Key, class Hash, class KeyEqual, class Alloc, class Pred >
void erase_if(std::unordered_multiset<Key,Hash,KeyEqual,Alloc>& c, Pred pred);
(library fundamentals TS v2)

Erases all elements that satisfy the predicate pred from the container. Equivalent to

for (auto i = c.begin(), last = c.end(); i != last; ) {
  if (pred(*i)) {
    i = c.erase(i);
  } else {
    ++i;
  }
}

Parameters

c - container from which to erase
pred - predicate that determines which elements should be erased

Complexity

Linear.

Example

See also

removes elements satisfying specific criteria
(function template)