(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::unordered_set| Member types | ||||||
| Member functions | ||||||
| Non-member functions | ||||||
| ||||||
| Deduction guides(C++17) | ||||||
bool empty()constnoexcept; | (since C++11) (constexpr since C++26) | |
Checks if the container has no elements.
Contents |
true if the container is empty,false otherwise.
Constant.
The following code usesempty to check if astd::unordered_set<int> contains any elements:
#include <iostream>#include <unordered_set> int main(){std::unordered_set<int> numbers;std::cout<<std::boolalpha;std::cout<<"Initially, numbers.empty(): "<< numbers.empty()<<'\n'; numbers.insert(42); numbers.insert(19937);std::cout<<"After adding elements, numbers.empty(): "<< numbers.empty()<<'\n';}
Output:
Initially, numbers.empty(): trueAfter adding elements, numbers.empty(): false
| returns the number of elements (public member function)[edit] | |
(C++17) | checks whether the container is empty (function template)[edit] |
