Namensräume
Varianten

    std::deque

    Aus cppreference.com

    This page has been machine-translated from the English version of the wiki using Google Translate.

    The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here.

    Click here for the English version of this page


     
    C++
     
    Container-Bibliothek
     
    std :: deque
    Member-Funktionen
    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
    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.
    deque::front
    deque::back
    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.
    deque::begin
    deque::cbegin
    (C++11)
    deque::end
    deque::cend
    (C++11)
    deque::rbegin
    deque::crbegin
    (C++11)
    deque::rend
    deque::crend
    (C++11)
    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.
    deque::empty
    deque::size
    deque::max_size
    deque::shrink_to_fit
    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.
    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
     
    <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