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 list container, which is considered its reverse end.
rend refers to the character right before the one that would be referred to by member begin.
Parameters
none
Return Value
An reverse iterator to the reverse end of the sequence.
Both reverse_iterator and const_reverse_iterator are member types. In the list 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
|
// list::rbegin/rend
#include <iostream>
#include <list>
using namespace std;
int main ()
{
list<int> mylist;
for (int i=1; i<=5; i++) mylist.push_back(i);
cout << "mylist contains:";
list<int>::reverse_iterator rit;
for ( rit=mylist.rbegin() ; rit != mylist.rend(); ++rit )
cout << " " << *rit;
cout << endl;
return 0;
}
|
Output:
mylist contains: 5 4 3 2 1
|
Complexity
Constant.
See also
| list::rbegin | Return reverse iterator to reverse beginning (public member function) |
| list::begin | Return iterator to beginning (public member function) |
| list::end | Return iterator to end (public member function) |
|