std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>:: empty
|
(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 |
| Member types | ||||
| Member functions | ||||
| Non-member functions | ||||
| Helper classes | ||||
| Tags | ||||
| Deduction guides | ||||
|
bool
empty
(
)
const
noexcept
;
|
(seit C++23) | |
Prüft, ob die zugrundeliegenden Container keine Elemente enthalten. Entspricht: return begin ( ) == end ( ) ; .
Inhaltsverzeichnis |
Parameter
(keine)
Rückgabewert
true wenn die zugrundeliegenden Container leer sind, false andernfalls.
Komplexität
Konstante.
Beispiel
Der folgende Code verwendet
empty
um zu prüfen, ob ein
std::
flat_multimap
<
int
,
int
>
Elemente enthält:
#include <iostream> #include <flat_map> #include <utility> int main() { std::flat_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'; }
Ausgabe:
Initially, numbers.empty(): true After adding elements, numbers.empty(): false
Siehe auch
|
gibt die Anzahl der Elemente zurück
(public member function) |
|
|
(C++17)
|
prüft, ob der Container leer ist
(function template) |