std::experimental::erase_if(std::unordered_set) (3) - Linux Manuals

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

NAME

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

Synopsis


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


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


 This section is incomplete
 Reason: no example

See also


          removes elements satisfying specific criteria
remove (function template)
remove_if

Pages related to std::experimental::erase_if(std::unordered_set)