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

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;
  }
}

Language
Standard library headers
Concepts
Utilities library
Strings library
Containers library
Algorithms library
Iterators library
Numerics library
Input/output library
Localizations library
Regular expressions library (C++11)
Atomic operations library (C++11)
Thread support library (C++11)
Technical Specifications

Filesystem library (filesystem TS)
Library fundamentals (library fundamentals TS)
Library fundamentals 2 (library fundamentals 2 TS)
Extensions for parallelism (parallelism TS)
Concepts (concepts TS)
Extensions for concurrency (concurrency TS)

experimental::propagate_const
experimental::not_fn
experimental::observer_ptr
experimental::make_array
experimental::ostream_joiner
experimental::gcd
experimental::lcm
experimental::source_location
detection idiom
uniform container erasure

Contents

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