std::set<Key,Compare,Allocator>::rbegin, std::set<Key,Compare,Allocator>::crbegin

< cpp‎ | container‎ | set
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 set. It corresponds to the last element of the non-reversed set. If the set is empty, the returned iterator is equal to rend().



[edit] Parameters


[edit] Return value

Reverse iterator to the first element.

[edit] Complexity


[edit] 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.

The underlying iterator of the returned reverse iterator is the end iterator. Hence the returned iterator is invalidated if and when the end iterator is invalidated.

libc++ backports crbegin() to C++98 mode.

[edit] Example

#include <iostream>
#include <set>
int main()
    std::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';


⏼ ⏼ ⏼ ⏼
⏼ ⏼ ⏼
⏼ ⏼

[edit] See also

returns a reverse iterator to the end
(public member function) [edit]
returns a reverse iterator to the beginning of a container or array
(function template) [edit]