set::rbegin
public member function
reverse_iterator rbegin();
const_reverse_iterator rbegin() const;
Return reverse iterator to reverse beginning
Returns a reverse iterator referring to the last element in the set container.
Internally, set containers keep their elements ordered from lower to higher, therefore rbegin returns the element with the highest key in the set.
Notice that rbegin does not refer to the same element as end, but to the element right before it.
Parameters
none
Return Value
A reverse iterator to the reverse beginning of the sequence.
Both reverse_iterator and const_reverse_iterator are member types. In the set class template, these are reverse bidirectional iterators, defined as reverse_iterator<iterator> and reverse_iterator<const_iterator> respectively.
Example
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
// set::rbegin/rend
#include <iostream>
#include <set>
using namespace std;
int main ()
{
int myints[] = {78,21,64,49,17};
set<int> myset (myints,myints+5);
set<int>::reverse_iterator rit;
cout << "myset contains:";
for ( rit=myset.rbegin() ; rit != myset.rend(); rit++ )
cout << " " << *rit;
cout << endl;
return 0;
}
|
Output:
myset contains: 78 64 49 21 17
|
Complexity
Constant.
See also
| set::rend | Return reverse iterator to reverse end (public member function) |
| set::begin | Return iterator to beginning (public member function) |
| set::end | Return iterator to end (public member function) |
|