std::set::rbegin, std::set::crbegin

[edit template]

`reverse_iterator rbegin();`		( C++11)
`reverse_iterator rbegin() noexcept;`		( C++11)
`const_reverse_iterator rbegin() const;`		( C++11)
`const_reverse_iterator rbegin() const noexcept;`		( C++11)
`const_reverse_iterator crbegin() const noexcept;`		( C++11)

set. set. set - , rend().

[range-rbegin-rend.svg]

()

.

iterator, const_iterator ( ), , -.

#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';
    }
}

:







(C++20)

(C++20)
(C++11)





(C++20)


/

(C++11)
(C++11)
(C++11)
(C++17)


array (C++11)
vector
vector<bool>
deque
forward_list (C++11)
list

set
multiset
map
multimap

unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)

stack
queue
priority_queue
flat_set (C++23)
flat_multiset (C++23)
flat_map (C++23)
flat_multimap (C++23)

span (C++20)
mdspan (C++23)

-
,

-
set::set
set::~set
set::operator=
set::get_allocator

set::beginset::cbegin (C++11)
set::endset::cend (C++11)
set::rbeginset::crbegin (C++11)
set::rendset::crend (C++11)

set::empty
set::size
set::max_size

set::clear
set::insert
set::insert_range (C++23)
set::emplace (C++11)
set::emplace_hint (C++11)
set::erase
set::swap
set::extract (C++17)
set::merge (C++17)

set::count
set::find
set::contains (C++20)
set::equal_range
set::lower_bound
set::upper_bound

set::key_comp
set::value_comp
,
std::swap
erase_if (C++20)
operator==operator!=operator<operator>operator<=operator>=operator<=> ( C++20)( C++20)( C++20)( C++20)( C++20)(C++20)
(C++17)

cppreference.com

std::set::rbegin, std::set::crbegin

See also