std::deque::erase

 

C++

Language

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Containers library

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::deque

Member functions

deque::deque

deque::~deque

deque::operator=

deque::assign

deque::get_allocator

Element access

deque::front

deque::back

Iterators

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

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

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

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

Capacity

deque::empty

deque::size

deque::max_size

deque::shrink_to_fit

Modifiers

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)	(until C++11) (since C++11)
iterator erase( iterator first, iterator last ); iterator erase( const_iterator first, const_iterator last );	(2)	(until C++11) (since C++11)

Removes specified elements from the container.

1) Removes the element at pos.

2) Removes the elements in the range [first; last).

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. (since C++11).

Parameters

pos	-	iterator to the element to remove
first, last	-	range of elements to remove

Return value

iterator following the last removed element.

Example

#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

Complexity

1) linear in the distance between position and last.

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

See also

clear	clears the contents (public member function)