# std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::clear

> C++ Atlas: `cppatlas.com/w/cpp/container/unordered_multiset/clear` | Source: https://en.cppreference.com/w/cpp/container/unordered_multiset/clear | Domain: Containers | Standards: C++11

Erases all elements from the container. After this call, size() returns zero.

## Official Specification Summary (cppreference)

```cpp
void clear() noexcept; // (since C++11)
```

Erases all elements from the container. After this call, `size()` returns zero.

Invalidates any references, pointers, and iterators referring to contained elements. May also invalidate past-the-end iterators.

### Parameters

(none)

### Return value

(none)

### Complexity

Linear in the size of the container, i.e., the number of elements.

### Example

```cpp
#include <iostream>
#include <string_view>
#include <unordered_set>

void print_info(std::string_view rem, const std::unordered_multiset<int>& v)
{
    std::cout << rem << "{ ";
    for (const auto& value : v)
        std::cout << value << ' ';
    std::cout << "}\n";
    std::cout << "Size=" << v.size() << '\n';
}

int main()
{
    std::unordered_multiset<int> container{1, 2, 3};
    print_info("Before clear: ", container);
    container.clear();
    print_info("After clear: ", container);
}
```

Possible output:

```text
Before clear: { 1 2 3 }
Size=3
After clear: { }
Size=0
```

### Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

| DR | Applied to | Behavior as published | Correct behavior |
| --- | --- | --- | --- |
| LWG 2550 | C++11 | for unordered associative containers, unclear if complexity is linear in the number of elements or buckets | clarified that it's linear in the number of elements |

### See also

- [`erase`](https://en.cppreference.com/w/cpp/container/unordered_multiset/erase): erases elements (public member function)

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