std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::clear - cppreference.com (original) (raw)
| void clear() noexcept; | | (since C++11) (constexpr since C++26) | | ---------------------- | | ------------------------------------- |
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.
[edit] Complexity
Linear in the size of the container, i.e., the number of elements.
[edit] Example
Possible output:
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 complexityis linear in the number of elements or buckets | clarified that it's linear in the number of elements |