deque::erase and deque::clear

MSDN Library
Development Tools and Languages
Visual Studio 2008
Visual Studio
Visual C++
Visual C++ Reference
Visual C++ Libraries Reference
Standard C++ Library
Standard Template Library Samples

abs (STL Samples)
accumulate, copy, and vector::push_back
adjacent_difference and vector::push_back
advance (STL Samples)
Basic Math Functions
basic_string::append (STL Samples)
basic_string::find_first_of (STL Samples)
basic_string::size and basic_string::resize
binary_function Structure Sample
count (STL Samples)
count_if (STL Samples)
deque::assign and deque::swap
deque::begin and deque::end

deque::erase and deque::clear
This page is specific to:.NET Framework Version:1.1 2.03.54.0

Visual C++ Standard Library

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;

Remarks

Note:
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).

Example

// 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;
    a.push_back(1);
    a.push_back(2);
    a.push_back(3);
    a.push_back(4);
    a.push_back(5);

    //print the contents
    print_contents (a);

    //  erase the second element
    a.erase(a.begin()+1);
    print_contents (a);

    //erase the last two elements
    a.erase(a.end()-2,a.end());
    print_contents (a);

    //clear a
    a.clear();
    print_contents (a);
}

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

    cout <<"The output is: ";

        for(pdeque = deque.begin();
        pdeque != deque.end();
        pdeque++)
    {
        cout << *pdeque <<" " ;
    }
        cout<<endl;
}

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

Requirements

Header: <deque>

Concepts

Standard Template Library Samples