Microsoft KB Archive/158578

= How to use the set::rbegin and set::rend STL functions in Visual C++ =

Article ID: 158578

Article Last Modified on 1/11/2006

-

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++ 2005 Express Edition</li></ul>

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

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

-

<div class="notice_section">

This article was previously published under Q158578

<div class="notice_section">

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

<div class="summary_section">

SUMMARY
The following sample code illustrates how to use the set::rbegin and set::rend STL functions in Visual C++.

<div class="moreinformation_section">

Prototype
template<class _K, class _Pr, class _A> class set { public: // Function 1:

const_reverse_iterator rbegin const;

// Function 2: const_reverse_iterator rend 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 rbegin function returns a reverse bidirectional iterator that points just beyond the end of the controlled sequence. The rend function returns a reverse bidirectional iterator that points at the first element of the sequence.

Sample Code
////////////////////////////////////////////////////////////////////// // // Compile options needed: -GX // // SetRbeginRend.cpp: //     Illustrates how to use the rbegin function to get a reverse //     bidirectional iterator that points just beyond the end of //      the controlled sequence. It also illustrates how to use //     the rend function to get a reverse bidirectional iterator //     that points at the first element of the sequence. // // Functions: // //   rbegin      Returns a reverse bidirectional iterator that points //               just beyond the end of the controlled sequence. //   rend        Returns a reverse bidirectional iterator that points //               at the first element of the sequence. // // Written by Derek Jamison // of Microsoft Technical Support, // Copyright (c) 1996 Microsoft Corporation. All rights reserved. //////////////////////////////////////////////////////////////////////


 * 1) pragma warning(disable:4786)


 * 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 set<int,less ,allocator > SET_INT;

void main {

SET_INT s1; SET_INT::reverse_iterator i; cout << "s1.insert(5)" << endl; s1.insert(5); cout << "s1.insert(10)" << endl; s1.insert(10); cout << "s1.insert(15)" << endl; s1.insert(15); cout << "s1.insert(20)" << endl; s1.insert(20);

// displays: 20,15,10,5

for (i=s1.rbegin;i!=s1.rend;i++)

cout << "s1 has " << *i << " in its set." << endl;

}

Program Output
s1.insert(5) s1.insert(10) s1.insert(15) s1.insert(20) s1 has 20 in its set. s1 has 15 in its set. s1 has 10 in its set. s1 has 5 in its set.

<div class="references_section">