std::unordered_multiset::empty – cppreference.com

std::unordered_multiset::empty

Aus cppreference.com

[edit template]

<metanoindex/>

 
C++
 
Container-Bibliothek
 
std :: unordered_multiset
Member-Funktionen
Original:
Member functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_multiset::unordered_multiset
unordered_multiset::~unordered_multiset
unordered_multiset::operator=
unordered_multiset::get_allocator
Iteratoren
Original:
Iterators
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_multiset::begin
unordered_multiset::cbegin
unordered_multiset::end
unordered_multiset::cend
Kapazität
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_multiset::erase
unordered_multiset::size
unordered_multiset::max_size
Modifiers
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_multiset::clear
unordered_multiset::insert
unordered_multiset::emplace
unordered_multiset::emplace_hint
unordered_multiset::erase
unordered_multiset::swap
Lookup
Original:
Lookup
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_multiset::count
unordered_multiset::find
unordered_multiset::equal_range
Eimer Schnittstelle
Original:
Bucket interface
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_multiset::begin2
unordered_multiset::end2
unordered_multiset::bucket_count
unordered_multiset::max_bucket_count
unordered_multiset::bucket_size
unordered_multiset::bucket
Hash Politik
Original:
Hash policy
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_multiset::load_factor
unordered_multiset::max_load_factor
unordered_multiset::rehash
unordered_multiset::reserve
Beobachter
Original:
Observers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_multiset::hash_function
unordered_multiset::key_eq
 
<tbody> </tbody>
bool empty() const;
 (seit C++11)
Prüft, ob der Behälter keine Elemente, dh ob begin() == end() .
Original:
Checks if the container has no elements, i.e. whether begin() == end().
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Parameter

(None)
Original:
(none)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Rückgabewert

true wenn der Behälter leer ist, false anders
Original:
true if the container is empty, false otherwise
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Ausnahmen

noexcept specification:  
<tbody> </tbody>
noexcept
  (seit C++11)

Komplexität

Constant
Original:
Constant
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Beispiel

Der folgende Code verwendet empty, um zu überprüfen, ob ein std::unordered_multiset<int> enthält alle Elemente:
Original:
The following code uses empty to check if a std::unordered_multiset<int> contains any elements:
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

#include <unordered_multiset>
#include <iostream>
 
int main()
{
    std::unordered_multiset<int> numbers;
    std::cout << "Initially, numbers.empty(): " << numbers.empty() << '\n';

    numbers.push_back(42);
    numbers.push_back(13317); 
    std::cout << "After adding elements, numbers.empty(): " << numbers.empty() << '\n';
}

Output: 

Initially, numbers.empty(): 1
After adding elements, numbers.empty(): 0

See also