std::flat_multiset<Key,Compare,KeyContainer>::clear
From cppreference.com
< cpp | container | flat multiset
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::flat_multiset
flat_multiset::clear
void clear() noexcept;
(since C++23) (constexpr since C++26)
Erases all elements from the container adaptor. After this call, size() returns zero.
Invalidates any references, pointers, and iterators referring to contained elements.
[edit] Complexity
Linear in the size of the container adaptor, i.e., the number of elements.
[edit] Example
Run this code
#include <iostream> #include <string_view> #include <flat_set> void print_info(std::string_view rem, const std::flat_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::flat_multiset <int> container{1, 2, 3}; print_info("Before clear: ", container); container.clear(); print_info("After clear: ", container); }
Output:
Before clear: { 1 2 3 }
Size=3
After clear: { }
Size=0