Namespace
Varianti

std::deque::erase

Da cppreference.com.
< cpp‎ | container‎ | deque

[edit template]

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
 
iterator erase( iterator pos );
iterator erase( const_iterator pos );
 (1) (fino al c++11)
(dal C++11)
iterator erase( iterator first, iterator last );
iterator erase( const_iterator first, const_iterator last );
 (2) (fino al c++11)
(dal C++11)
Rimuove gli elementi specificati dal contenitore.
Original:
Removes specified elements from the container.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
1)
Rimuove l'elemento in pos.
Original:
Removes the element at pos.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
2)
Rimuove gli elementi della gamma [first; last).
Original:
Removes the elements in the range [first; last).
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
All iterators and references are invalidated, unless the erased elements are at the end or the beginning of the container, in which case only the iterators and references to the erased elements are invalidated. If the last element is erased or invalidated, the past-the-end iterator is also invalidated. (dal C++11).
This section is incomplete
Reason: mark the change between C++03 and C++11

Indice

[modifica] Parametri

pos -
iteratore all'elemento da rimuovere
Original:
iterator to the element to remove
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
first, last -
intervallo di elementi da rimuovere
Original:
range of elements to remove
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[modifica] Valore di ritorno

iteratore dopo l'ultimo elemento rimosso.
Original:
iterator following the last removed element.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[modifica] Esempio

#include <deque>
#include <iostream>
 
 
int main( )
{
    std::deque<int> c{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
    for (auto &i : c) {
        std::cout << i << " ";
    }
    std::cout << '\n';
 
    c.erase(c.begin());
 
    for (auto &i : c) {
        std::cout << i << " ";
    }
    std::cout << '\n';
 
    c.erase(c.begin()+2, c.begin()+5);
 
    for (auto &i : c) {
        std::cout << i << " ";
    }
    std::cout << '\n';
}

Output: 

0 1 2 3 4 5 6 7 8 9
1 2 3 4 5 6 7 8 9
1 2 6 7 8 9


[modifica] Complessità

1) linear in the distance between position and last.

2) linear in distance between position and the end of the container.

[modifica] Vedi anche
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]
Estratto da "https://it.cppreference.com/mwiki/index.php?title=cpp/container/deque/erase&oldid=25148"