SysTutorials

Linux Manual Pages › Section 3

stdexperimentalerase_ifstdunordered_map(3)

std::experimental::erase_if(std::unordered_map) - std::experimental::erase_if(std::unordered_map)

Synopsis

Defined in header<experimental / unordered_map>
    template <class Key, class T, class Hash, class KeyEqual, class Alloc, class Pred>
    (library fundamentals TS v2)
        void erase_if(std::unordered_map<Key, T, 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