std::flat_multiset<Key,Compare,KeyContainer>::erase

Since C++23

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

# Declarations

iterator erase( iterator position );

(since C++23)

iterator erase( const_iterator pos );

(since C++23)

iterator erase( const_iterator first, const_iterator last );

(since C++23)

size_type erase( const Key& key );

(since C++23)

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

(since C++23)

# Parameters

pos: iterator to the element to remove
first, last: range of elements to remove
key: key value of the elements to remove
x: a value of any type that can be transparently compared with a key denoting the elements to remove

# Example

#include <flat_set>
#include <iostream>
 
int main()
{
    std::flat_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();
}

# See also

clear