std::deque

 

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

 

Заголовочный файл <deque>
template<     class T,     class Allocator = std::allocator<T> > class deque;

std::deque (двусторонняя очередь) является индексированным контейнер последовательности, что позволяет быстро вставки и удаления в начале и в конце. Кроме того, вставки и удаления с обоих концов двусторонней очереди никогда недействительными указатели или ссылки на остальные элементы.

Original:

std::deque (double-ended queue) is an indexed sequence container that allows fast insertion and deletion at both the beginning and the end. In addition, insertion and deletion at either end of a deque never invalidates pointers or references to the rest of the elements.

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

В отличие от std::vector, элементы дека не хранятся непрерывно: от типичных реализаций использовать последовательность индивидуально выделены массивы фиксированного размера.

Original:

As opposed to std::vector, the elements of a deque are not stored contiguously: typical implementations use a sequence of individually allocated fixed-size arrays.

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

Хранение дека автоматически расширяется и контракты по мере необходимости. Расширение дека дешевле, чем расширение std::vector, потому что оно не связано с копированием существующих элементов в новую ячейку памяти.

Original:

The storage of the deque is automatically expanded and contracted as needed. Expansion of a deque is cheaper than the expansion of a std::vector because it does not involve copying of the existing elements to a new memory location.

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

Сложность (КПД) общей операции на двусторонних очередей выглядит следующим образом:

Original:

The complexity (efficiency) of common operations on deques is as follows:

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

• Произвольный доступ - постоянная O(1)

  Original:

  Random access - constant O(1)

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.
• Вставка и удаление элементов в начало или конец - амортизированной постоянной O(1)

  Original:

  Insertion or removal of elements at the end or beginning - amortized constant O(1)

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.
• Вставка и удаление элементов - линейные O(n)

  Original:

  Insertion or removal of elements - linear O(n)

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

std::deque отвечает требованиям Container, AllocatorAwareContainer, SequenceContainer и ReversibleContainer.

Original:

std::deque meets the requirements of Container, AllocatorAwareContainer, SequenceContainer and ReversibleContainer.

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

Член типов

Член типа Original: Member type The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.	Definition
value_type	T
allocator_type	Allocator
size_type	Беззнаковый целочисленный тип (обычно size_t)
difference_type	Знаковый целочисленный тип (обычно std::ptrdiff_t)
reference	Allocator::reference (до C++11) value_type& (начиная с C++11)
const_reference	Allocator::const_reference (до C++11) const value_type& (начиная с C++11)
pointer	Allocator::pointer (до C++11) std::allocator_traits<Allocator>::pointer (начиная с C++11)
const_pointer	Allocator::const_pointer (до C++11) std::allocator_traits<Allocator>::const_pointer (начиная с C++11)
iterator	RandomAccessIterator
const_iterator	Константный итератор с произвольным доступом
reverse_iterator	std::reverse_iterator<iterator>
const_reverse_iterator	std::reverse_iterator<const_iterator>

Член функций

(constructor)	строит deque Original: constructs the deque The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
(destructor)	destructs the deque (public функция-член)
operator=	присваивает значения в контейнере Original: assigns values to the container The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
assign	присваивает значения в контейнере Original: assigns values to the container The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
get_allocator	возвращает связанный распределителя Original: returns the associated allocator The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
Элемент доступа 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.
at	предоставляет доступ к указанному элементу с проверкой индекса (public функция-член)
operator[]	предоставляет доступ к указанному элементу (public функция-член)
front	предоставляет доступ к первому элементу (public функция-член)
back	предоставляет доступ к последнему элементу (public функция-член)
Итераторы Original: Iterators The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
begin cbegin	возвращает итератор на первый элемент (public функция-член)
end cend	возвращает итератор на элемент, следующий за последним (public функция-член)
rbegin crbegin	возвращает обратный итератор на начало Original: returns a reverse iterator to the beginning The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
rend crend	возвращает обратный итератор до конца Original: returns a reverse iterator to the end The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
Потенциала Original: Capacity The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
empty	проверяет отсутствие элементов в контейнере (public функция-член)
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 функция-член)
max_size	возвращает максимально допустимое количество элементов (public функция-член)
shrink_to_fit (C++11)	уменьшает использование памяти, освобождая неиспользуемую память Original: reduces memory usage by freeing unused memory The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
Модификаторы Original: Modifiers The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
clear	удаляет содержимое (public функция-член)
insert	вставки элементов Original: inserts elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
emplace (C++11)	конструирует элемент "на месте" (public функция-член)
erase	удаляет элементы Original: erases elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
push_back	добавляет элементы в конец Original: adds elements to the end The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
emplace_back (C++11)	Элементы конструкций на месте в конце Original: constructs elements in-place at the end The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
pop_back	удаляет последний элемент Original: removes the last element The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
push_front	вставляет элементы в начало списка (public функция-член)
emplace_front (C++11)	конструирует элементы "на месте" в начало списка (public функция-член)
pop_front	удаляет первый элемент (public функция-член)
resize	изменяет количество хранимых элементов (public функция-член)
swap	обмениевает содержимое (public функция-член)

Не являющиеся членами функций

operator== operator!= operator< operator<= operator> operator>=	лексикографически сравнивает значения в deque Original: lexicographically compares the values in the deque The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (шаблон функции)
std::swap(std::deque)	Специализируется std::swap алгоритм Original: specializes the std::swap algorithm The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (шаблон функции)