Microsoft KB Archive/158085

= How to use the list::assign, list::empty, and list::erase STL functions in Visual C++ =

Article ID: 158085

Article Last Modified on 8/11/2005

-

APPLIES TO

 The Standard C++ Library, when used with:  Microsoft Visual C++ 4.2 Enterprise Edition

 Microsoft Visual C++ 5.0 Enterprise Edition

 Microsoft Visual C++ 6.0 Enterprise Edition

 Microsoft Visual C++ 4.2 Professional Edition</li></ul>

 Microsoft Visual C++ 5.0 Professional Edition</li></ul>

 Microsoft Visual C++ 6.0 Professional Edition</li></ul>

 Microsoft Visual C++ 6.0 Standard Edition</li></ul>

 Microsoft Visual C++ .NET 2002 Standard Edition</li></ul>

 Microsoft Visual C++ .NET 2003 Standard Edition</li></ul> </li></ul>

-

<div class="notice_section">

This article was previously published under Q158085

<div class="notice_section">

NOTE: Microsoft Visual C++ .NET (2002) and Visual C++ .NET (2003) support both the managed code model that is provided by the .NET Framework and the unmanaged native Windows code model. The information in this article applies to unmanaged Visual C++ code only.

<div class="summary_section">

SUMMARY
The sample code below illustrates how to use the list::assign, list::empty, and list::erase STL functions in Visual C++.

<div class="moreinformation_section">

Prototype
void assign(const_iterator first, const_iterator last); void assign(size_type n, const T& x = T); iterator erase(iterator it); iterator erase(iterator first, iterator last); bool empty const; NOTE: The class/parameter names in the prototype may not match the version in the header file. Some have been modified to improve readability.

Description
The first member function replaces the sequence controlled by *this with the sequence [first, last). The second member function replaces the sequence controlled by *this with a repetition of n elements of value x.

The third member function removes the element of the controlled sequence pointed to by it. The fourth member function removes the elements of the controlled sequence 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.

The last member function returns true for an empty controlled sequence.

Sample Code
////////////////////////////////////////////////////////////////////// // // Compile options needed: -GX // // assign.cpp : Shows the various ways to assign and erase elements //              from a list<T>. // // Functions: // //   list::assign //   list::empty //   list::erase // // Written by Andrew Bradnan // Copyright (c) 1996 Microsoft Corporation. All rights reserved. //////////////////////////////////////////////////////////////////////


 * 1) include
 * 2) include

using namespace std; // std c++ libs implemented in std #endif
 * 1) if _MSC_VER > 1020  // if VC++ version is > 4.2

typedef list<int, allocator > LISTINT;

void main

{

LISTINT listOne; LISTINT listAnother; LISTINT::iterator i;

// Add some data listOne.push_front (2); listOne.push_front (1); listOne.push_back (3);

listAnother.push_front(4);

listAnother.assign(listOne.begin, listOne.end);

// 1 2 3   for (i = listAnother.begin; i != listAnother.end; ++i) cout << *i << " "; cout << endl;

listAnother.assign(4, 1);

// 1 1 1 1   for (i = listAnother.begin; i != listAnother.end; ++i) cout << *i << " "; cout << endl;

listAnother.erase(listAnother.begin);

// 1 1 1   for (i = listAnother.begin; i != listAnother.end; ++i) cout << *i << " "; cout << endl;

listAnother.erase(listAnother.begin, listAnother.end); if (listAnother.empty) cout << "All gone\n";

} Program Output is: <pre class="fixed_text">1 2 3 1 1 1 1 1 1 1 All gone

<div class="references_section">