std::experimental::erase_if (std::unordered_set)

From cppreference.com

Defined in header <experimental/unordered_set>
template <class K, class H, class P, class A, class Predicate>
void erase_if(std::unordered_set<K, H, P, A>& c, Predicate 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;
  }
}

Contents

[edit] Parameters

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

[edit] Complexity

Linear.

[edit] Example

[edit] See also

removes elements satisfying specific criteria
(function template)