std::erase_if(std::unordered_map) (3) Linux Manual Page

std::erase_if(std::unordered_map) – std::erase_if(std::unordered_map)

Synopsis

Defined in header<unordered_map>

    template <class Key, class T, class Hash, class KeyEqual, class Alloc, class Pred>
    (1)(since C++ 20)

        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 returns true if the element 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