std::ranges::rbegin
| Defined in header <ranges>
|
||
| Defined in header <iterator>
|
||
| inline namespace /* unspecified */ { inline constexpr /* unspecified */ rbegin = /* unspecified */; |
(since C++20) (customization point object) |
|
| Call signature |
||
| template< class T > requires /* see below */ |
(since C++20) | |
Returns an iterator to the last element of the argument.
If T is an array type and std::remove_all_extents_t<std::remove_reference_t<T>> is incomplete, then the call to ranges::rbegin is ill-formed, no diagnostic required.
If the argument is an lvalue or ranges::enable_borrowed_range<std::remove_cv_t<T>> is true, then a call to ranges::rbegin is expression-equivalent to:
- decay-copy(t.rbegin())(until C++23)auto(t.rbegin())(since C++23), if that expression is valid and its type models std::input_or_output_iterator.
- Otherwise, decay-copy(rbegin(t))(until C++23)auto(rbegin(t))(since C++23), if
Tis a class or enumeration type, that expression is valid and its type models std::input_or_output_iterator, where the meaning ofrbeginis established as if by performing argument-dependent lookup only. - Otherwise, std::make_reverse_iterator(ranges::end(t)) if both ranges::begin(t) and ranges::end(t) are valid expressions, have the same type, and that type models std::bidirectional_iterator.
In all other cases, a call to ranges::rbegin is ill-formed, which can result in substitution failure when ranges::rbegin(t) appears in the immediate context of a template instantiation.
Contents |
Customization point objects
The name ranges::rbegin denotes a customization point object, which is a const function object of a literal