std::flat_multiset<Key,Compare,KeyContainer>::rend, std::flat_multiset<Key,Compare,KeyContainer>::crend
From cppreference.com
< cpp | container | flat multiset
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::flat_multiset
flat_multiset::rendflat_multiset::crend
reverse_iterator rend() noexcept;
(1)
(since C++23) (constexpr since C++26)
const_reverse_iterator rend() const noexcept;
(2)
(since C++23) (constexpr since C++26)
const_reverse_iterator crend() const noexcept;
(3)
(since C++23) (constexpr since C++26)
Returns a reverse iterator past the last element of the reversed *this. It corresponds to the element preceding the first element of the non-reversed *this.
This returned iterator only acts as a sentinel. It is not guaranteed to be dereferenceable.
Contents
[edit] Return value
Reverse iterator to the element following the last element.
[edit] Complexity
Constant.
Notes
Because both iterator and const_iterator are constant iterators (and may in fact be the same type), it is not possible to mutate the elements of the container through an iterator returned by any of these member functions.
[edit] Example
Run this code
#include <iostream> #include <flat_set> int main() { std::flat_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:
⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼