std::erase_if (std::multiset)

 

C++

Compiler support

Freestanding and hosted

Language

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Technical specifications

Symbols index

External libraries

 

Containers library

Sequence

array (C++11)

vector

deque

forward_list (C++11)

list

Associative

set

multiset

map

multimap

Unordered associative

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

Adaptors

stack

queue

priority_queue

Views

span (C++20)

 

std::multiset

Member functions

multiset::multiset

multiset::~multiset

multiset::operator=

multiset::get_allocator

Iterators

multiset::beginmultiset::cbegin (C++11)

multiset::endmultiset::cend (C++11)

multiset::rbeginmultiset::crbegin (C++11)

multiset::rendmultiset::crend (C++11)

Capacity

multiset::empty

multiset::size

multiset::max_size

Modifiers

multiset::clear

multiset::insert

multiset::emplace (C++11)

multiset::emplace_hint (C++11)

multiset::erase

multiset::swap

multiset::extract (C++17)

multiset::merge (C++17)

Lookup

multiset::count

multiset::find

multiset::contains (C++20)

multiset::equal_range

multiset::lower_bound

multiset::upper_bound

Observers

multiset::key_comp

multiset::value_comp

Non-member functions

std::swap

erase_if (C++20)

operator==operator!=operator<operator>operator<=operator>=operator<=> (until C++20)(until C++20)(until C++20)(until C++20)(until C++20)(C++20)

Deduction guides(C++17)

 

Defined in header <set>
template< class Key, class Compare, class Alloc, class Pred > typename std::multiset<Key,Compare,Alloc>::size_type     erase_if( std::multiset<Key,Compare,Alloc>& c, Pred pred );		(since C++20)

Erases all elements that satisfy the predicate pred from the container. Equivalent to

auto old_size = c.size();
for (auto i = c.begin(), last = c.end(); i != last; ) {
  if (pred(*i)) {
    i = c.erase(i);
  } else {
    ++i;
  }
}
return old_size - c.size();

Parameters

c	-	container from which to erase
pred	-	predicate that returns true if the element should be erased

Return value

The number of erased elements.

Complexity

Linear.

Example

Run this code

#include <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::multiset 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; };
 
    const auto count = std::erase_if(data, divisible_by_3);
 
    std::cout << "Erase all items divisible by 3:\n" << data << '\n'
              << count << " items erased.\n";
}

Output:

Original:
{ 0 1 2 3 3 4 5 5 6 6 7 }
Erase all items divisible by 3:
{ 1 2 4 5 5 7 }
5 items erased.

See also

removeremove_if

removes elements satisfying specific criteria (function template)