◐ Shell clean mode source ↗

std::deque – cppreference.com

Aus cppreference.com

<tbody> </tbody>

definiert in Header `<deque>`

`template< class T, class Allocator = std::allocator<T> > class deque;`

std::deque (double-ended queue) ist eine indizierte Sequenz Container, schnelles Einfügen und Löschen sowohl am Anfang und am Ende ermöglicht. Zusätzlich, Insertion und Deletion an jedem Ende eines deque nie ungültig Zeiger oder Verweise auf den Rest der Elemente .

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.

Was std::vector Gegensatz sind die Elemente einer deque nicht zusammenhängend gespeichert: typische Implementierungen verwenden eine Reihe von individuell zugeordneten Arrays fester Größe .

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.

Die Speicherung des deque automatisch ausgedehnt und zusammengezogen nach Bedarf. Erweiterung einer deque ist billiger als der Ausbau einer std::vector, weil es sich nicht um das Kopieren der vorhandenen Elemente zu einem neuen Speicherort .

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.

Die Komplexität (Wirkungsgrad) des gemeinsamen Operationen auf deques ist wie folgt:

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.

Random Access - konstante 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.
Das Einsetzen oder Entfernen von Elementen am Ende oder Anfang - fortgeführten konstanten 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.
Das Einsetzen oder Entfernen von Elementen - linear 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 erfüllt die Anforderungen der Container, AllocatorAwareContainer, SequenceContainer und ReversibleContainer .

Original:

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

Mitglied Typen


Mitglied Typ 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` [edit]

`allocator_type`	`Allocator` [edit]

`size_type`	vorzeichenloser ganzzahliger Typ (in der Regel `size_t`)[edit]

`difference_type`	vorzeichenbehafteter Typ (usually `ptrdiff_t`) [edit]

`reference`	`Allocator::reference` (bis C + +11) `value_type&` (seit C++11) [edit]

`const_reference`	`Allocator::const_reference` (bis C + +11) `const value_type&` (seit C++11) [edit]

`pointer`	`Allocator::pointer` (bis C + +11) `std::allocator_traits<Allocator>::pointer` (seit C++11) [edit]

`const_pointer`	`Allocator::const_pointer` (bis C + +11) `std::allocator_traits<Allocator>::const_pointer` (seit C++11) [edit]

`iterator`	`RandomAccessIterator` [edit]

`const_iterator`	Constant random access iterator 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. [edit]

`reverse_iterator`	`std::reverse_iterator<iterator>` [edit]

`const_reverse_iterator`	`std::reverse_iterator<const_iterator>` [edit]

Member-Funktionen


(constructor)	konstruiert die `deque` (öffentliche Elementfunktion) [edit]

(destructor)	zerstört die `deque` (öffentliche Elementfunktion) [edit]

operator=	weist Werte auf den Behälter 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. (öffentliche Elementfunktion) [edit]

assign	weist Werte auf den Behälter 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. (öffentliche Elementfunktion) [edit]

get_allocator	liefert den zugehörigen Allocator (öffentliche Elementfunktion) [edit]
Elementzugriff zerstört 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	Zugriff auf angegebene Element mit Überprüfung von Grenzen 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. (öffentliche Elementfunktion) [edit]

operator[]	Zugriff auf angegebene Element 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. (öffentliche Elementfunktion) [edit]

front	Zugriff auf das erste Element 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. (öffentliche Elementfunktion) [edit]

back	Zugriff auf das letzte Element (öffentliche Elementfunktion) [edit]
Iteratoren 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	liefert einen Iterator an den Anfang 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. (öffentliche Elementfunktion) [edit]

end cend	liefert einen Iterator bis zum Ende 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. (öffentliche Elementfunktion) [edit]

rbegin crbegin	gibt einen umgekehrten Iterator an den Anfang 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. (öffentliche Elementfunktion) [edit]

rend crend	gibt einen umgekehrten Iterator bis zum Ende 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. (öffentliche Elementfunktion) [edit]
Kapazität 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	prüft, ob der Container leer ist 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. (öffentliche Elementfunktion) [edit]

size	liefert die Anzahl der Elemente 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. (öffentliche Elementfunktion) [edit]

max_size	gibt die maximal mögliche Anzahl von Elementen 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. (öffentliche Elementfunktion) [edit]

shrink_to_fit (C++11)	verringert den Speicherbedarf durch Freigeben ungenutzten Speichers (öffentliche Elementfunktion) [edit]
Modifiers 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	löscht den Inhalt 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. (öffentliche Elementfunktion) [edit]

insert	Elemente einfügen 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. (öffentliche Elementfunktion) [edit]

emplace (C++11)	constructs element in-place (öffentliche Elementfunktion) [edit]

erase	löscht Elemente 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. (öffentliche Elementfunktion) [edit]

push_back	fügt Elemente am Ende 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. (öffentliche Elementfunktion) [edit]

emplace_back (C++11)	baut Elemente-Platz am Ende 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. (öffentliche Elementfunktion) [edit]

pop_back	entfernt das letzte Element 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. (öffentliche Elementfunktion) [edit]

push_front	Elemente am Listenanfang einfügen (öffentliche Elementfunktion) [edit]

emplace_front (C++11)	Konstruiert Elemente in-place am Anfang 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. (öffentliche Elementfunktion) [edit]

pop_front	entfernt das erste Element 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. (öffentliche Elementfunktion) [edit]

resize	ändert die Anzahl der gespeicherten Elemente (öffentliche Elementfunktion) [edit]

swap	tauscht die Inhalte 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. (öffentliche Elementfunktion) [edit]

Non-Member-Funktionen