std::multiset<Key,Compare,Allocator>::rbegin, std::multiset<Key,Compare,Allocator>::
From cppreference.com
reverse_iterator rbegin(); |
(1) | (noexcept since C++11) |
const_reverse_iterator rbegin() const; |
(2) | (noexcept since C++11) |
const_reverse_iterator crbegin() const noexcept; |
(3) | (since C++11) |
Returns a reverse iterator to the first element of the reversed multiset
. It corresponds to the last element of the non-reversed multiset
. If the multiset
is empty, the returned iterator is equal to rend()
Parameters
(none)
Return value
Reverse iterator to the first element.
Complexity
Constant.
Notes
Because both iterator
and const_iterator
The underlying iterator of the returned reverse iterator is the end iterator
libc++ backports crbegin()
to C++98 mode.
Example
Run this code
#include <iostream> #include <set> int main() { std::multiset<unsigned> rep{1, 2, 3, 4, 1, 2, 3, 4}; for (auto it = rep.crbegin(); it != rep.crend(); ++it) { for (auto n = *it; n > 0; --n) std::cout << "⏼" << ' '; std::cout << '\n'; } }
Output:
⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼
See also
(C++11)
|
returns a reverse iterator to the end (public member function) |
(C++14)
|
returns a reverse iterator to the beginning of a container or array (function template) |