std::vector::erase

 

C++

Язык

Понятия (концепции)

Утилиты

Строки

Контейнеры

Алгоритмы

Итераторы

Работа с числами

Ввод / вывод

Локализация

Регулярные выражения (C++11)

Атомарные примитивы (C++11)

Потоки (C++11)

 

Контейнеры

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

std::vector

Член функций 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.

vector::vector

vector::~vector

vector::operator=

vector::assign

vector::get_allocator

Элемент доступа 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.

vector::at

vector::operator[]

vector::front

vector::back

vector::data (C++11)

Итераторы Original: Iterators The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

vector::begin vector::cbegin (C++11)

vector::end vector::cend (C++11)

vector::rbegin vector::crbegin (C++11)

vector::rend vector::crend (C++11)

Потенциала Original: Capacity The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

vector::empty

vector::size

vector::max_size

vector::reserve

vector::capacity

vector::shrink_to_fit (C++11)

Модификаторы Original: Modifiers The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

vector::clear

vector::insert

vector::emplace (C++11)

vector::erase

vector::push_back

vector::emplace_back (C++11)

vector::pop_back

vector::resize

vector::swap

 

iterator erase( iterator pos ); iterator erase( const_iterator pos );	(1)	(до C++11) (начиная с C++11)
iterator erase( iterator first, iterator last ); iterator erase( const_iterator first, const_iterator last );	(2)	(до C++11) (начиная с C++11)

Удаляет указанные элементы из контейнера.

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)

Удаляет элемент 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)

Удаляет элементы в диапазоне [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.

Iterators and references to the erased elements and to the elements between them and the end of the container are invalidated.

Параметры

pos	-	итератор на элемент для удаления 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	-	диапазон элементов для удаления 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.

Возвращаемое значение

Итератор, следующих за последним удаленным элементом.

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.

Пример

#include <vector>
#include <iostream>
 
 
int main( )
{
    std::vector<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';
}

Вывод:

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

Сложность

1) linear in the distance between position and last.

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

См. также

clear	удаляет содержимое (public функция-член)