It removes all elements from the set container.
DeclarationFollowing are the ways in which std::set::clear works in various C++ versions.
C++98void clear();C++11
void clear() noexcept;Return value
none
ExceptionsIt never throws exceptions.
Time complexityTime complexity is contstant.
ExampleThe following example shows the usage of std::set::clear.
#include <iostream> #include <set> int main () { std::set<int> myset; myset.insert (10); myset.insert (20); myset.insert (30); std::cout << "myset contains:"; for (std::set<int>::iterator it = myset.begin(); it!=myset.end(); ++it) std::cout << ' ' << *it; std::cout << '\n'; myset.clear(); myset.insert (111); myset.insert (222); std::cout << "myset contains:"; for (std::set<int>::iterator it = myset.begin(); it!=myset.end(); ++it) std::cout << ' ' << *it; std::cout << '\n'; return 0; }
The above program will compile and execute properly.
myset contains: 10 20 30 myset contains: 111 222
set.htm
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4