std::erase_if (std::map)
From cppreference.com
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::map (C++11)
(C++11)
(C++11)
(C++11)
(C++17)
(C++17)
(C++23)
(C++17)
(C++11)
(C++11)
(C++17)
(C++20)
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
Deduction guides (C++17)
Defined in header
<map>
template< class Key, class T, class Compare, class Alloc,
(since C++20) class Pred >
std::map <Key, T, Compare, Alloc>::size_type
erase_if( std::map <Key, T, Compare, Alloc>& c,
(constexpr since C++26)
Erases all elements that satisfy the predicate pred from c.
Equivalent to
auto old_size = c.size(); for (auto first = c.begin(), last = c.end(); first != last;) { if (pred(*first)) first = c.erase(first); else ++first; } return old_size - c.size();
[edit] Parameters
c
-
container from which to erase
pred
-
predicate that returns true if the element should be erased
[edit] Return value
The number of erased elements.
[edit] Complexity
Linear.
[edit] Example
Run this code
#include <iostream> #include <map> void println(auto rem, const auto& container) { std::cout << rem << '{'; for (char sep[]{0, ' ', 0}; const auto& [key, value] : container) std::cout << sep << '{' << key << ", " << value << '}', *sep = ','; std::cout << "}\n"; } int main() { std::map <int, char> data { {1, 'a'}, {2, 'b'}, {3, 'c'}, {4, 'd'}, {5, 'e'}, {4, 'f'}, {5, 'g'}, {5, 'g'}, }; println("Original:\n", data); const auto count = std::erase_if (data, [](const auto& item) { const auto& [key, value] = item; return (key & 1) == 1; }); println("Erase items with odd keys:\n", data); std::cout << count << " items removed.\n"; }
Output:
Original:
{{1, a}, {2, b}, {3, c}, {4, d}, {5, e}}
Erase items with odd keys:
{{2, b}, {4, d}}
3 items removed.