std::flat_set<Key,Compare,KeyContainer>::rbegin,std::flat_set<Key,Compare,KeyContainer>::crbegin
From cppreference.com
C++
Containers library
(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(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 |
reverse_iterator rbegin()noexcept; | (1) | (since C++23) (constexpr since C++26) |
const_reverse_iterator rbegin()constnoexcept; | (2) | (since C++23) (constexpr since C++26) |
const_reverse_iterator crbegin()constnoexcept; | (3) | (since C++23) (constexpr since C++26) |
Returns a reverse iterator to the first element of the reversed*this. It corresponds to the last element of the non-reversed*this.
If*this is empty, the returned iterator is equal torend().
Contents |
[edit]Return value
Reverse iterator to the first element.
[edit]Complexity
Constant.
[edit]Notes
Because bothiterator andconst_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.
Theunderlying iterator of the returned reverse iterator is theend iterator. Hence the returned iterator is invalidated if and when the end iterator is invalidated.
[edit]Example
Run this code
#include <iostream>#include <flat_set> int main(){std::flat_set<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:
⏼ ⏼ ⏼ ⏼⏼ ⏼ ⏼⏼ ⏼⏼
[edit]See also
| returns a reverse iterator to the end (public member function)[edit] | |
(C++14) | returns a reverse iterator to the beginning of a container or array (function template)[edit] |
