std::set<Key,Compare,Allocator>:: empty
| Sequence | ||||
|
(C++11)
|
||||
|
(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 |
| Member functions | |||||||||||||||||||||||||||
| Non-member functions | |||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||
| Deduction guides (C++17) | |||||||||||||||||||||||||||
|
bool
empty
(
)
const
;
|
(noexcept since C++11) | |
Checks if the container has no elements, i.e. whether begin ( ) == end ( ) .
Parameters
(none)
Return value
true if the container is empty, false otherwise.
Complexity
Constant.
Example
The following code uses
empty
to check if a
std::
set
<
int
>
contains any elements:
#include <iostream> #include <set> int main() { std::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(): 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) |