std::deque::erase
|
|
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. |
<metanoindex/>
<tbody> </tbody> iterator erase( iterator pos ); iterator erase( const_iterator pos ); |
(1) | (até C++11) (desde C++11) |
iterator erase( iterator first, iterator last ); iterator erase( const_iterator first, const_iterator last ); |
(2) | (até C++11) (desde C++11) |
You can help to correct and verify the translation. Click here for instructions.
1)
pos.pos.You can help to correct and verify the translation. Click here for instructions.
2)
[first; last).[first; last).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. (desde C++11).
| Esta seção está incompleta Motivo: mark the change between C++03 and C++11 |
Parâmetros
| pos | - | iterador para o elemento a ser removido
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 | - | intervalo de elementos para remover
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. |
Valor de retorno
You can help to correct and verify the translation. Click here for instructions.
Exemplo
#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';
}
Saída:
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
Complexidade
1) linear in the distance between position and last.
2) linear in distance between position and the end of the container.
Veja também
apaga o conteúdo 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. (função pública membro) |