public member function
<set>
reverse_iterator rbegin();
const_reverse_iterator rbegin() const;
reverse_iterator rbegin() noexcept;
const_reverse_iterator rbegin() const noexcept;
Return reverse iterator to reverse beginning
Returns a reverse iterator pointing to the last element in the container (i.e., its reverse beginning).
Reverse iterators iterate backwards: increasing them moves them towards the beginning of the container.
rbegin points to the element preceding the one that would be pointed to by member end.
Return Value
A reverse iterator to the reverse beginning of the sequence container.
If the multiset object is const-qualified, the function returns a const_reverse_iterator. Otherwise, it returns a reverse_iterator.
Member types reverse_iterator and const_reverse_iterator are reverse bidirectional iterator types pointing to elements. See multiset member types.
Example
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
|
// multiset::rbegin/rend
#include <iostream>
#include <set>
int main ()
{
int myints[] = {77,16,2,30,30};
std::multiset<int> mymultiset (myints,myints+5);
std::cout << "mymultiset contains:";
for (std::multiset<int>::reverse_iterator rit=mymultiset.rbegin(); rit!=mymultiset.rend(); ++rit)
std::cout << ' ' << *rit;
std::cout << '\n';
return 0;
}
| |
Output:
mymultiset contains: 77 30 30 16 2
|
Iterator validity
No changes.
Data races
The container is accessed (neither the const nor the non-const versions modify the container).
Concurrently accessing the elements of a multiset is safe.
Exception safety
No-throw guarantee: this member function never throws exceptions.
The copy construction or assignment of the returned iterator is also guaranteed to never throw.
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
)