public member function
<set>
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
multiset container.
Internally,
multiset containers keep their elements ordered from lower to higher, therefore
rbegin returns the element with the highest key value in the container.
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
multiset 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
|
// multiset::rbegin/rend
#include <iostream>
#include <set>
using namespace std;
int main ()
{
int myints[] = {77,16,2,30,30};
multiset<int> mymultiset (myints,myints+5);
multiset<int>::reverse_iterator rit;
cout << "mymultiset contains:";
for ( rit=mymultiset.rbegin() ; rit != mymultiset.rend(); rit++ )
cout << " " << *rit;
cout << endl;
return 0;
}
|
Output:
mymultiset contains: 77 30 30 16 2
|
Complexity
Constant.
See also
- multiset::rend
- Return reverse iterator to reverse end (public member function)
- multiset::begin
- Return iterator to beginning (public member function)
- multiset::end
- Return iterator to end (public member function)