Namespace
Varianti

std::deque

Da cppreference.com.
< cpp‎ | container

Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate.

La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui.

Click here for the English version of this page


 
C++
 
Contenitori libreria
 
std :: deque
Membri funzioni
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 accesso
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
Iteratori
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)
Capacità
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
Modificatori
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
 
Elemento definito nell'header <deque>
template<

    class T,
    class Allocator = std::allocator<T>

> class deque;
std::deque (double-ended queue) è un contenitore di sequenza indicizzato che consente l'inserimento e la cancellazione veloce sia l'inizio e la fine. Inoltre, non inserimento e cancellazione alle due estremità di una deque invalida puntatori o riferimenti al resto degli elementi.
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 differenza std::vector, gli elementi di una deque non vengono memorizzati in modo contiguo: implementazioni tipiche utilizzare una sequenza di individualmente assegnate dimensione fissa array.
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.
Lo stoccaggio del deque viene automaticamente espanso e contratto in base alle esigenze. Espansione di una deque è più conveniente che l'espansione di un std::vector perché non comporta la copia degli elementi esistenti in una nuova posizione di 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 complessità (efficienza) delle operazioni comuni su deque è la seguente:
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.
  • Accesso casuale - O(1) costante
    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.
  • L'inserimento o la rimozione di elementi, alla fine o all'inizio - ammortizzato O(1) costante
    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.
  • L'inserimento o la rimozione di elementi - O(n) lineare
    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 soddisfi i requisiti di Container, AllocatorAwareContainer, SequenceContainer e 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.

Indice

[modifica] Membri tipi

Membro 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 [modifica]
allocator_type Allocator [modifica]
size_type Tipo intero senza segno (generalmente size_t)[modifica]
difference_type Tipo intero con segno (generalmente ptrdiff_t) [modifica]
reference Allocator::reference (fino al c++11)
value_type& (dal C++11) [modifica]
const_reference Allocator::const_reference (fino al c++11)
const value_type& (dal C++11) [modifica]
pointer Allocator::pointer (fino al c++11)
std::allocator_traits<Allocator>::pointer (dal C++11) [modifica]
const_pointer Allocator::const_pointer (fino al c++11)
std::allocator_traits<Allocator>::const_pointer (dal C++11) [modifica]
iterator RandomAccessIterator [modifica]
const_iterator Iteratore ad accesso casuale su costanti[modifica]
reverse_iterator std::reverse_iterator<iterator> [modifica]
const_reverse_iterator std::reverse_iterator<const_iterator> [modifica]

[modifica] Membri funzioni

 costruisce il deque
(metodo pubblico) [modifica]
distrugge il deque
(metodo pubblico) [modifica]
assegna valori al contenitore
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.

(metodo pubblico) [modifica]
assegna valori al contenitore
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.

(metodo pubblico) [modifica]
restituisce l'allocatore associato
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.

(metodo pubblico) [modifica]
Elemento accesso
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.
accedere elemento specificato con verifica dei limiti
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.

(metodo pubblico) [modifica]
accedere elemento specificato
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.

(metodo pubblico) [modifica]
accedere al primo 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.

(metodo pubblico) [modifica]
access the last element
(metodo pubblico) [modifica]
Iteratori
Original:
Iterators
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
restituisce un iteratore all'inizio
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.

(metodo pubblico) [modifica]

restituisce un iteratore fino alla fine
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.

(metodo pubblico) [modifica]

restituisce un iteratore inverso all'inizio
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.

(metodo pubblico) [modifica]

restituisce un iteratore inverso alla fine
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.

(metodo pubblico) [modifica]
Capacità
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
verifica se il contenitore è vuoto
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.

(metodo pubblico) [modifica]
restituisce il numero di elementi
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.

(metodo pubblico) [modifica]
restituisce il massimo numero possibile di elementi
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.

(metodo pubblico) [modifica]
(C++11)
riduce l'utilizzo della memoria da liberare la memoria inutilizzata
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.

(metodo pubblico) [modifica]
Modificatori
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
cancella il contenuto
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.

(metodo pubblico) [modifica]
inserti di elementi
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.

(metodo pubblico) [modifica]
(C++11)
 constructs element in-place
(metodo pubblico) [modifica]
cancella elementi
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.

(metodo pubblico) [modifica]
aggiunge elementi alla fine
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.

(metodo pubblico) [modifica]
(C++11)
costruisce elementi in-posto alla fine
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.

(metodo pubblico) [modifica]
rimuove l'ultimo 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.

(metodo pubblico) [modifica]
inserisce elementi all'inizio
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.

(metodo pubblico) [modifica]
(C++11)
costruisce elementi in posto all'inizio
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.

(metodo pubblico) [modifica]
rimuove il primo 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.

(metodo pubblico) [modifica]
changes the number of elements stored
(metodo pubblico) [modifica]
swap il contenuto
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.

(metodo pubblico) [modifica]

[modifica] Non membri funzioni
lessicografico confronta i valori nella 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.

(funzione di modello) [modifica]
specializzata l'algoritmo 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.

(funzione di modello) [modifica]
Estratto da "https://it.cppreference.com/mwiki/index.php?title=cpp/container/deque&oldid=27309"