##### cppreference.com

##### Search

Create account

##### Namespaces

- Page
- Discussion

##### Variants

##### Views

- View
- Edit
- History

##### Actions

# std::deque::erase

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

[edit template]

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

It is unspecified when the past-the-end iterator is invalidated. | (until C++11)
The past-the-end iterator is also invalidated unless the erased elements are at the beginning of the container and the last element is not erased. | (since C++11)

The iterator `pos` must be valid and dereferenceable. Thus the end() iterator (which is valid, but is not dereferencable) cannot be used as a value for `pos`.

### [edit] Parameters

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

### [edit] Return value

Iterator following the last removed element.

### [edit] Example

Run this code

    #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

### [edit] Complexity

1) Linear in the distance between `position` and `last`.
2) Linear in distance between `position` and the end of the container.

### [edit] See also

clear | clears the contents (public member function) [edit]

Retrieved from "http://en.cppreference.com/mwiki/index.php?title=cpp/container/deque/erase&oldid=50459"