std::multiset<Key,Compare,Allocator>::erase

Removes specified elements from the container. The order of the remaining equivalent elements is preserved.

# Declarations

iterator erase( iterator pos );

(until C++23)

iterator erase( iterator pos )
requires(!std::same_as<iterator, const_iterator>);

(since C++23)

iterator erase( const_iterator pos );

(since C++11)

iterator erase( iterator first, iterator last );

(until C++11)

iterator erase( const_iterator first, const_iterator last );

(since C++11)

size_type erase( const Key& key );
template< class K >
size_type erase( K&& x );

(since C++23)

# Parameters

# Notes

Feature-test macro Value Std Feature __cpp_lib_associative_heterogeneous_erasure 202110L (C++23) Heterogeneous erasure in associative containers and unordered associative containers; overload (5)

# Example

#include <set>
#include <iostream>
 
int main()
{
    std::multiset<int> c = {1, 2, 3, 4, 1, 2, 3, 4};
 
    auto print = [&c]
    {
        std::cout << "c = { ";
        for (int n : c)
            std::cout << n << ' ';
        std::cout << "}\n";
    };
    print();
 
    std::cout << "Erase all odd numbers:\n";
    for (auto it = c.begin(); it != c.end();)
    {
        if (*it % 2 != 0)
            it = c.erase(it);
        else
            ++it;
    }
    print();
 
    std::cout << "Erase 1, erased count: " << c.erase(1) << '\n';
    std::cout << "Erase 2, erased count: " << c.erase(2) << '\n';
    std::cout << "Erase 2, erased count: " << c.erase(2) << '\n';
    print();
}

# Defect reports

DRApplied toBehavior as publishedCorrect behavior
LWG 130C++98the return type of overloads (1) and (3) was void (it is notconsistent with the erase() requirement on sequence containers)corrected to iterator
LWG 371C++98the order of equivalent elements that are noterased was not guaranteed to be preservedrequired to be preserved
LWG 2059C++11replacing overload (1) with overload (2) introduced new ambiguityadded overload (1) back

# See also