std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::empty
From cppreference.com
< cpp | container | unordered map
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::unordered_map
unordered_map::empty
(C++17)
(C++17)
(C++23)
(C++17)
(C++17)
(C++20)
(until C++20)
Deduction guides (C++17)
bool empty() const noexcept;
(since C++11) (constexpr since C++26)
Checks if the container has no elements.
Contents
[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::unordered_map <int, int> contains any elements:
Run this code
#include <iostream> #include <unordered_map> #include <utility> int main() { std::unordered_map <int,int> numbers; std::cout << std::boolalpha ; std::cout << "Initially, numbers.empty(): " << numbers.empty() << '\n'; numbers.emplace(42, 13); numbers.insert(std::make_pair (13317, 123)); std::cout << "After adding elements, numbers.empty(): " << numbers.empty() << '\n'; }
Output:
Initially, numbers.empty(): true After adding elements, numbers.empty(): false