std::deque

 

C++

Lenguaje

Cabeceras

Conceptos

Biblioteca de utilidades

Biblioteca de cadenas

Biblioteca de contenedores

Biblioteca de algoritmos

Biblioteca de iteradores

Biblioteca numérica

Biblioteca de entrada/salida

Biblioteca de localización

Biblioteca de expresiones regulares (C++11)

Biblioteca de operaciones atómicas (C++11)

Biblioteca de tareas/subprocesos (C++11)

 

Biblioteca de contenedores

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

 

std :: deque

Las funciones miembro 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

Elemento acceso 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

Los iteradores 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)

Capacidad 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

Modificadores 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

 

Defined in header <deque>
template<     class T,     class Allocator = std::allocator<T> > class deque;

std::deque (de doble extremo cola) es un contenedor de secuencias indexado que permite la rápida inserción y deleción en ambos, el principio y el fin. Además, nunca inserción y eliminación en cualquier extremo de un deque invalida punteros o referencias para el resto de los elementos .

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.

A diferencia de std::vector, los elementos de un deque no se almacenan de forma contigua: implementaciones típicas utilizar una secuencia de individualmente asignados fijo matrices de tamaño .

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.

El almacenamiento de la deque se expande automáticamente y se contrajo, según sea necesario. La expansión de un deque es más barata que la expansión de una std::vector porque no implica la copia de los elementos existentes para una nueva posición de memoria .

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.

La complejidad (eficacia) de las operaciones comunes en deques es como sigue:

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.

• Acceso aleatorio - O(1) constante

  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.
• Inserción o extracción de elementos al final o al principio - O(1) constante amortizado

  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.
• La inserción o eliminación de elementos - O(n) lineal

  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 cumple los requisitos de Container, AllocatorAwareContainer, SequenceContainer y 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.

Tipos de miembros

Miembro de tipo 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	Tipo entero sin signo (por lo general size_t) Original: Unsigned integral type (usually size_t) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
difference_type	Signed integer type (usually ptrdiff_t)
reference	Allocator::reference (hasta C++11) value_type& (desde C++11)
const_reference	Allocator::const_reference (hasta C++11) const value_type& (desde C++11)
pointer	Allocator::pointer (hasta C++11) std::allocator_traits<Allocator>::pointer (desde C++11)
const_pointer	Allocator::const_pointer (hasta C++11) std::allocator_traits<Allocator>::const_pointer (desde C++11)
iterator	RandomAccessIterator
const_iterator	Iterador constante de acceso aleatorio Original: Constant random access iterator The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
reverse_iterator	std::reverse_iterator<iterator>
const_reverse_iterator	std::reverse_iterator<const_iterator>

Las funciones miembro

(constructor)	construye el 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. (miembro público función)
(destructor)	destructs the deque (miembro público función)
operator=	asigna valores para el contenedor 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. (miembro público función)
assign	asigna valores para el contenedor 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. (miembro público función)
get_allocator	devuelve el asignador asociado 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. (miembro público función)
Elemento acceso 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	acceder al elemento especificado con comprobación de límites Original: access specified element with bounds checking The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (miembro público función)
operator[]	acceder al elemento especificado Original: access specified element The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (miembro público función)
front	acceso al primer elemento Original: access the first element The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (miembro público función)
back	access the last element (miembro público función)
Los iteradores 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	devuelve un iterador al principio Original: returns an 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. (miembro público función)
end cend	devuelve un iterador hasta el final Original: returns an 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. (miembro público función)
rbegin crbegin	devuelve un iterador inverso al principio 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. (miembro público función)
rend crend	devuelve un iterador inverso hasta el final 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. (miembro público función)
Capacidad 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	comprueba si el recipiente está vacío Original: checks whether the container is empty The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (miembro público función)
size	devuelve el número de elementos 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. (miembro público función)
max_size	devuelve el número máximo posible de elementos Original: returns the maximum possible 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. (miembro público función)
shrink_to_fit (C++11)	reduce el uso de memoria por la liberación de memoria no utilizada 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. (miembro público función)
Modificadores 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	borra el contenido Original: clears the contents The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (miembro público función)
insert	Inserta elementos 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. (miembro público función)
emplace (C++11)	constructs element in-place (miembro público función)
erase	borra elementos 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. (miembro público función)
push_back	agrega elementos al final 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. (miembro público función)
emplace_back (C++11)	construye elementos en lugar de al final 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. (miembro público función)
pop_back	elimina el último elemento 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. (miembro público función)
push_front	inserciones elementos al principio Original: inserts elements 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. (miembro público función)
emplace_front (C++11)	construye elementos en lugar de al principio Original: constructs elements in-place at the beginning The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (miembro público función)
pop_front	elimina el primer elemento Original: removes the first element The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (miembro público función)
resize	changes the number of elements stored (miembro público función)
swap	intercambia los contenidos Original: swaps the contents The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (miembro público función)

Terceros funciones

operator== operator!= operator< operator<= operator> operator>=	lexicográficamente compara los valores del 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. (función de plantilla)
std::swap(std::deque)	el algoritmo se especializa 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. (función de plantilla)