Namespace
Varianti

std::unordered_multiset::empty

Da cppreference.com.

 
 
 
std :: unordered_multiset
Membri funzioni
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
Iteratori
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
Capacità
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
Modificatori
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
Benna interfaccia
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
Politica di Hash
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
Osservatori
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
 
bool empty() const;
(dal C++11)
Controlla se il contenitore non ha elementi, vale a dire se 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.

Indice

[modifica] Parametri

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

[modifica] Valore di ritorno

true se il contenitore è vuoto, false altrimenti
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.

[modifica] Eccezioni

noexcept specification:  
noexcept
  (dal C++11)

[modifica] Complessità

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.

[modifica] Esempio

Il codice seguente utilizza empty per controllare se un std::unordered_multiset<int> contiene elementi:
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

restituisce il numero di elementi
Original:
returns the number of elements
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

(membro pubblico funzione) [edit]