std::multiset<Key,Compare,Allocator>::rend, std::multiset<Key,Compare,Allocator>::
From cppreference.com
C++
Containers library
| Sequence | ||||
|
(C++11)
|
||||
|
(C++26)
|
||||
|
(C++11)
|
||||
| Associative | ||||
| Unordered associative | ||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
| Adaptors | ||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
| Views | ||||
|
(C++20)
|
||||
|
(C++23)
|
||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::multiset
| Member functions | |||||||||||||||||||||||||||
| Non-member functions | |||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||
| Deduction guides(C++17) | |||||||||||||||||||||||||||
reverse_iterator rend(); |
(1) | (noexcept since C++11) |
const_reverse_iterator rend() const; |
(2) | (noexcept since C++11) |
const_reverse_iterator crend() const noexcept; |
(3) | (since C++11) |
Returns a reverse iterator to the element following the last element of the reversed multiset. It corresponds to the element preceding the first element of the non-reversed multiset
Parameters
(none)
Return value
Reverse iterator to the element following the last element.
Complexity
Constant.
Notes
Because both iterator and const_iterator
libc++ backports crend() 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 beginning (public member function) |
|
(C++14)
|
returns a reverse end iterator for a container or array (function template) |