Defined in header <array> | ||
---|---|---|
Defined in header <deque> | ||
Defined in header <forward_list> | ||
Defined in header <iterator> | ||
Defined in header <list> | ||
Defined in header <map> | ||
Defined in header <regex> | ||
Defined in header <set> | ||
Defined in header <span> | (since C++20) | |
Defined in header <string> | ||
Defined in header <string_view> | (since C++17) | |
Defined in header <unordered_map> | ||
Defined in header <unordered_set> | ||
Defined in header <vector> | ||
(1) | ||
template< class C > auto rbegin( C& c ) -> decltype(c.rbegin()); | (since C++14) (until C++17) | |
template< class C > constexpr auto rbegin( C& c ) -> decltype(c.rbegin()); | (since C++17) | |
(1) | ||
template< class C > auto rbegin( const C& c ) -> decltype(c.rbegin()); | (since C++14) (until C++17) | |
template< class C > constexpr auto rbegin( const C& c ) -> decltype(c.rbegin()); | (since C++17) | |
(2) | ||
template< class T, std::size_t N > std::reverse_iterator<T*> rbegin( T (&array)[N] ); | (since C++14) (until C++17) | |
template< class T, std::size_t N > constexpr std::reverse_iterator<T*> rbegin( T (&array)[N] ); | (since C++17) | |
(3) | ||
template< class T > std::reverse_iterator<const T*> rbegin( std::initializer_list<T> il ); | (since C++14) (until C++17) | |
template< class T > constexpr std::reverse_iterator<const T*> rbegin(std::initializer_list<T> il); | (since C++17) | |
(4) | ||
template< class C > auto crbegin( const C& c ) -> decltype(std::rbegin(c)); | (since C++14) (until C++17) | |
template< class C > constexpr auto crbegin( const C& c ) -> decltype(std::rbegin(c)); | (since C++17) |
Returns an iterator to the reverse-beginning of the given range.
c
.std::reverse_iterator<const T*>
to the reverse-beginning of the std::initializer_list
il
.c
.c | - | a container or view with a rbegin member function |
array | - | an array of arbitrary type |
il | - | an initializer_list |
c.rbegin()
std::reverse_iterator<T*>(array + N)
std::reverse_iterator<const T*>(il.end())
c.rbegin()
May throw implementation-defined exceptions.
Custom overloads of rbegin
may be provided for classes and enumerations that do not expose a suitable rbegin()
member function, yet can be iterated.
Overloads of | (since C++20) |
The overload for std::initializer_list
is necessary because it does not have a member function rbegin
.
#include <iostream> #include <vector> #include <iterator> int main() { std::vector<int> v = { 3, 1, 4 }; auto vi = std::rbegin(v); // the type of `vi` is std::vector<int>::reverse_iterator std::cout << "*vi = " << *vi << '\n'; *std::rbegin(v) = 42; // OK: after assignment v[2] == 42 // *std::crbegin(v) = 13; // error: the location is read-only int a[] = { -5, 10, 15 }; auto ai = std::rbegin(a); // the type of `ai` is std::reverse_iterator<int*> std::cout << "*ai = " << *ai << '\n'; auto il = { 3, 1, 4 }; // the type of `it` below is std::reverse_iterator<int const*>: for (auto it = std::rbegin(il); it != std::rend(il); ++it) std::cout << *it << ' '; }
Output:
*vi = 4 *ai = 15 4 1 3
(C++11)(C++14) | returns an iterator to the beginning of a container or array (function template) |
(C++11)(C++14) | returns an iterator to the end of a container or array (function template) |
(C++14) | returns a reverse end iterator for a container or array (function template) |
(C++20) | returns a reverse iterator to a range (customization point object) |
(C++20) | returns a reverse iterator to a read-only range (customization point object) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
https://en.cppreference.com/w/cpp/iterator/rbegin