std::deque::empty

 

C++

Язык

Понятия (концепции)

Утилиты

Строки

Контейнеры

Алгоритмы

Итераторы

Работа с числами

Ввод / вывод

Локализация

Регулярные выражения (C++11)

Атомарные примитивы (C++11)

Потоки (C++11)

 

Контейнеры

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

зЬй :: дека

Член функций 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.

deque::deque

deque::~deque

deque::operator=

deque::assign

deque::get_allocator

Элемент доступа Original: Element access The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

deque::front

deque::back

Итераторы Original: Iterators The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

deque::begin deque::cbegin (C++11)

deque::end deque::cend (C++11)

deque::rbegin deque::crbegin (C++11)

deque::rend deque::crend (C++11)

Потенциала Original: Capacity The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

deque::empty

deque::size

deque::max_size

deque::shrink_to_fit

Модификаторы Original: Modifiers The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

deque::clear

deque::insert

deque::emplace

deque::erase

deque::push_front

deque::emplace_front

deque::pop_front

deque::push_back

deque::emplace_back

deque::pop_back

deque::resize

deque::swap

 

bool empty() const;

Проверки, если контейнер не имеет элементов, т.е. является ли 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.

Параметры

(Нет)

Original:

(none)

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

Возвращаемое значение

true если контейнер пуст, false иначе

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.

Исключения

noexcept-спецификация:  

noexcept

  (начиная с C++11)

Сложность

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.

Пример

Следующий код использует empty, чтобы проверить, std::deque<int> содержит никаких элементов

Original:

The following code uses empty to check if a std::deque<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 <deque>
#include <iostream>
 
int main()
{
    std::deque<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';
}

Вывод:

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

See also

size	возвращает количество элементов 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. (public функция-член)