std::set<Key,Compare,Allocator>::empty
| bool empty() const; |
(until C++11) | |
| bool empty() const noexcept; |
(since C++11) (until C++20) |
|
| [[nodiscard]] bool empty() const noexcept; |
(since C++20) | |
Checks if the container has no elements, i.e. whether begin() == end().
Contents |
[edit] Parameters
(none)
[edit] Return value
true if the container is empty, false otherwise
[edit] Complexity
Constant.
[edit] Example
The following code uses empty to check if a std::set<int> contains any elements:
#include <set> #include <iostream> int main() { std::set<int> numbers; std::cout << std::boolalpha; std::cout << "Initially, numbers.empty(): " << numbers.empty() << '\n'; numbers.insert(42); numbers.insert(13317); std::cout << "After adding elements, numbers.empty(): " << numbers.empty() << '\n'; }
Output:
Initially, numbers.empty(): true After adding elements, numbers.empty(): false
See also
| returns the number of elements (public member function) | |
| (C++17) |
checks whether the container is empty (function template) |

Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
