std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::empty
From cppreference.com
bool empty() const noexcept;
|
(since C++11) | |
Checks if the container has no elements, i.e. whether begin() == end().
Return value
true if the container is empty, false otherwise.
Complexity
Constant.
Example
The following code uses empty to check if a std::unordered_multiset<int> contains any elements:
Run this code
#include <iostream>
#include <unordered_set>
int main()
{
std::unordered_multiset<int> numbers;
std::cout << std::boolalpha;
std::cout << "Initially, numbers.empty(): " << numbers.empty() << '\n';