std::unordered_multiset<Key,Hash,KeyEqual,Allocator>:: empty

Vérifie si le conteneur ne contient aucun élément.

Valeur de retour

true si le conteneur est vide, false sinon.

Complexité

Constante.

Exemple

#include <iostream>
#include <unordered_set>
int main()
{
    std::unordered_multiset<int> numbers;
    std::cout << std::boolalpha;
    std::cout << "Initially, numbers.empty(): " << numbers.empty() << '\n';
    numbers.insert(42);
    numbers.insert(19937);
    std::cout << "After adding elements, numbers.empty(): " << numbers.empty() << '\n';
}

Initially, numbers.empty(): true
After adding elements, numbers.empty(): false

Voir aussi