# std::experimental::erase_if (std::unordered_set)

> C++ Atlas: `cppatlas.com/w/cpp/experimental/unordered_set/erase_if` | Source: https://en.cppreference.com/w/cpp/experimental/unordered_set/erase_if | Domain: Technical specifications

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

## Official Specification Summary (cppreference)

```cpp
// Defined in header <experimental/unordered_set>

template< class Key, class Hash, class KeyEqual, class Alloc, class Pred >
void erase_if( std::unordered_set<Key, Hash, KeyEqual, Alloc>& c, Pred pred ); // (library fundamentals TS v2)
```

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

```cpp
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 determines which elements should be erased

### Complexity

Linear.

### Example

```cpp
#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_set<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:

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

### See also

- [`remove`](https://en.cppreference.com/w/cpp/algorithm/remove), [`remove_if`](https://en.cppreference.com/w/cpp/algorithm/remove): removes elements satisfying specific criteria (function template)

---
Attribution: content from https://en.cppreference.com/w/cpp/experimental/unordered_set/erase_if (cppreference.com), licensed under CC-BY-SA 3.0 and GFDL. Modified: converted to markdown, study notes added. Offline snapshot of 9 February 2025.