std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>::rbegin, std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>::crbegin
From cppreference.com
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_map
flat_map::rbeginflat_map::crbegin
reverse_iterator rbegin() noexcept;
(1)
(since C++23) (constexpr since C++26)
const_reverse_iterator rbegin() const noexcept;
(2)
(since C++23) (constexpr since C++26)
const_reverse_iterator crbegin() const noexcept;
(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 to rend().
Contents
[edit] Return value
Reverse iterator to the first element.
[edit] Complexity
Constant.
[edit] Notes
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.
[edit] Example
Run this code
#include <iomanip> #include <iostream> #include <string_view> #include <flat_map> int main() { const std::flat_map <int, std::string_view > coins { {10, "dime"}, {100, "dollar"}, {50, "half dollar"}, {5, "nickel"}, {1, "penny"}, {25, "quarter"} }; // initializer entries in name alphabetical order std::cout << "US coins in circulation, largest to smallest denomination:\n"; for (auto it = coins.crbegin(); it != coins.crend(); ++it) std::cout << std::setw (11) << it->second << " = ¢" << it->first << '\n'; }
Output:
US coins in circulation, largest to smallest denomination: dollar = 100ドル half dollar = 50ドル quarter = 25ドル dime = 10ドル nickel = 5ドル penny = 1ドル
[edit] See also
(C++14)
(function template) [edit]