std::experimental::erase_if (std::unordered_multiset)
From cppreference.com
< cpp | experimental
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)
Experimental
Filesystem library (filesystem TS)
Library fundamentals (library fundamentals TS)
Library fundamentals 2 (library fundamentals TS v2)
Library fundamentals 3 (library fundamentals TS v3)
Extensions for parallelism (parallelism TS)
Extensions for parallelism 2 (parallelism TS v2)
Extensions for concurrency (concurrency TS)
Extensions for concurrency 2 (concurrency TS v2)
Concepts (concepts TS)
Ranges (ranges TS)
Reflection (reflection TS)
Mathematical special functions (special functions TR)
Merged into ISO C++ The functionality described on this page was merged into the mainline ISO C++ standardas of 11/2018, see std::erase_if (since C++20)
Defined in header
<experimental/unordered_set>
template< class Key, class Hash, class KeyEqual, class Alloc, class Pred >
void erase_if( std::unordered_multiset <Key, Hash, KeyEqual, Alloc>& c, Pred pred );
(library fundamentals TS v2)
void erase_if( std::unordered_multiset <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; }
Contents
[edit] Parameters
c
-
container from which to erase
pred
-
predicate that determines which elements should be erased
[edit] Complexity
Linear.
[edit] Example
Run this code
#include <experimental/unordered_set> #include <iostream> template<typename Os, typename Container> inline Os& operator<<(Os& os, Container const& container) { os << "{ "; for (const auto& item : container) os << item << ' '; return os << '}'; } int main() { std::unordered_multiset <int> data{3, 3, 4, 5, 5, 6, 6, 7, 2, 1, 0}; std::cout << "Original:\n" << data << '\n'; auto divisible_by_3 = [](auto const& x) { return (x % 3) == 0; }; std::experimental::erase_if(data, divisible_by_3); std::cout << "Erase all items divisible by 3:\n" << data << '\n'; }
Possible output:
Original:
{ 0 1 2 7 6 6 5 5 4 3 3 }
Erase all items divisible by 3:
{ 1 2 7 5 5 4 }