std::erase_if (std::unordered_multiset)

 

C++

Language

Standard Library Headers

Freestanding and hosted implementations

Named requirements

Language support library

Concepts library (C++20)

Diagnostics library

Utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

 

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

span (C++20)

 

std::unordered_multiset

Member functions

unordered_multiset::unordered_multiset

unordered_multiset::~unordered_multiset

unordered_multiset::operator=

unordered_multiset::get_allocator

Iterators

unordered_multiset::beginunordered_multiset::cbegin

unordered_multiset::endunordered_multiset::cend

Capacity

unordered_multiset::empty

unordered_multiset::size

unordered_multiset::max_size

Modifiers

unordered_multiset::clear

unordered_multiset::insert

unordered_multiset::emplace

unordered_multiset::emplace_hint

unordered_multiset::erase

unordered_multiset::swap

unordered_multiset::extract (C++17)

unordered_multiset::merge (C++17)

Lookup

unordered_multiset::count

unordered_multiset::find

unordered_multiset::contains (C++20)

unordered_multiset::equal_range

Bucket interface

unordered_multiset::begin(size_type)unordered_multiset::cbegin(size_type)

unordered_multiset::end(size_type)unordered_multiset::cend(size_type)

unordered_multiset::bucket_count

unordered_multiset::max_bucket_count

unordered_multiset::bucket_size

unordered_multiset::bucket

Hash policy

unordered_multiset::load_factor

unordered_multiset::max_load_factor

unordered_multiset::rehash

unordered_multiset::reserve

Observers

unordered_multiset::hash_function

unordered_multiset::key_eq

Deduction guides(C++17)

 

Defined in header <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);	(1)	(since C++20)

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.

See also

removeremove_if

removes elements satisfying specific criteria (function template)