reverse_iterator rend();
const_reverse_iterator rend() const;
Return reverse iterator to reverse end
Returns a reverse iterator referring to the element right before the first element in the set container, which is considered its reverse end.
Notice that rend does not refer to the same element as begin, but to the element right before it.
Parameters
none
Return Value
A reverse iterator to the reverse end 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::rbegin | Return reverse iterator to reverse beginning (public member function) |
| set::begin | Return iterator to beginning (public member function) |
| set::end | Return iterator to end (public member function) |
|