deque::erase and deque::clear
Collapse the table of content
Expand the table of content
Important This document may not represent best practices for current development, links to downloads and other resources may no longer be valid. Current recommended version can be found here. ArchiveDisclaimer

deque::erase and deque::clear 

Illustrates how to use the deque::erase and deque::clear Standard Template Library (STL) functions in Visual C++.

iterator erase(
   iterator Iter
iterator erase(
   iterator First,
   iterator Last
); void clear( ) const;


The class/parameter names in the prototype do not match the version in the header file. Some have been modified to improve readability.

The first erase member function removes the element of the container pointed to by Iter. The second erase member function removes the elements of the container in the range [First, Last). Both return an iterator that designates the first element remaining beyond any elements removed, or end if no such element exists. Removing N elements causes N destructor calls and an assignment for each of the elements between the insertion point and the nearer end of the sequence. Removing an element at either end invalidates only iterators and references that designate the erased elements. Otherwise, erasing an element invalidates all iterators and references. The clear member function calls erase(begin, end).

// deque_erase_clear.cpp 
// compile with: /EHsc
// Functions:
//    erase
//    clear
//    begin
//    end

#include <iostream>
#include <deque>

using namespace std;

typedef deque<int >  INTDEQUE;
void print_contents (INTDEQUE  deque);

int main()
    // create a and with elements 1,2,3,4 and 5
    INTDEQUE  a;

    //print the contents
    print_contents (a);

    //  erase the second element
    print_contents (a);

    //erase the last two elements
    print_contents (a);

    //clear a
    print_contents (a);

void print_contents (INTDEQUE  deque) {
    INTDEQUE::iterator pdeque;

    cout <<"The output is: ";

        for(pdeque = deque.begin();
        pdeque != deque.end();
        cout << *pdeque <<" " ;


The output is: 1 2 3 4 5 
The output is: 1 3 4 5 
The output is: 1 3 
The output is: 

Header: <deque>

© 2015 Microsoft