std::flat_set<Key,Compare,KeyContainer>:: clear

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

Invalidates any references, pointers, and iterators referring to contained elements.

Complexity

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

Example

#include <iostream>
#include <string_view>
#include <flat_set>
void print_info(std::string_view rem, const std::flat_set<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_set<int> container{1, 2, 3};
    print_info("Before clear: ", container);
    container.clear();
    print_info("After clear: ", container);
}

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

See also