std::deque<T,Allocator>::empty

bool empty() const;

Vérifie si le conteneur n'a pas d'éléments, c'est-à-dire si begin() == end().

Valeur de retour

true si le conteneur est vide, false sinon.

Complexité

Constante.

Exemple

#include <deque>
#include <iostream>
int main()
{
    std::deque<int> numbers;
    std::cout << std::boolalpha;
    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';
}

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

Voir aussi