std::multimap<Key,T,Compare,Allocator>::empty
From cppreference.com
C++
Containers library
(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::multimap
| Member functions | |||||||
| Non-member functions | |||||||
| |||||||
| 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::multimap<int, int> contains any elements:
Run this code
#include <iostream> #include <map> #include <utility> int main() { std::multimap<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
[edit] See also
| returns the number of elements (public member function) [edit] | |
| (C++17) |
checks whether the container is empty (function template) [edit] |