On this page
std::ranges::views::reverse, std::ranges::reverse_view
Defined in header <ranges> |
||
|---|---|---|
|
(1) | (since C++20) |
|
(2) | (since C++20) |
| Call signature | ||
|
(since C++20) |
view with reversed order.
views::reverse(e) is expression-equivalent to one of the following expressions, except that e is evaluated only once:
e.base(), if the type ofeis a (possibly cv-qualified) specialization ofreverse_view;- otherwise, if the type of
eis (possibly cv-qualified)ranges::subrange<std::reverse_iterator<I>, std::reverse_iterator<I>, K>for some iterator typeIand valueKof typeranges::subrange_kind: ranges::subrange<I, I, K>(e.end().base(), e.begin().base(), e.size()), ifKisranges::subrange_kind::sized;- otherwise
ranges::subrange<I, I, K>(e.end().base(), e.begin().base()); - otherwise
ranges::reverse_view{e}.
views::reverse unwraps reversed views if possible.
A reverse_view always models bidirectional_range and common_range, and it models borrowed_range, sized_range, or random_access_range if the underlying view type V models the corresponding concept.
Data members
| Member name | Definition |
|---|---|
base_ (private) |
The underlying view of type V.(exposition-only member object*) |
cached_end_ (private) |
An optional-like cache object that holds either no value or the end iterator/position of the underlying view, which exists only if the underlying view type V does not model common_range.(exposition-only member object*) |
Member functions
|
(C++20)
|
constructs a reverse_view (public member function) |
|
(C++20)
|
returns the underlying view V (public member function) |
|
(C++20)
|
returns the beginning iterator of the reverse_view (public member function) |
|
(C++20)
|
returns the end iterator of the reverse_view (public member function) |
|
(C++20)
|
returns the size of the view if it is bounded (public member function) |
Inherited from |
|
|
(C++20)
|
returns whether the derived view is empty. Provided if it satisfies sized_range or forward_range. (public member function of std::ranges::view_interface<D>) |
|
(C++23)
|
returns a constant iterator to the beginning of the range. (public member function of std::ranges::view_interface<D>) |
|
(C++23)
|
returns a sentinel for the constant iterator of the range. (public member function of std::ranges::view_interface<D>) |
|
(C++20)
|
returns whether the derived view is not empty. Provided if ranges::empty is applicable to it. (public member function of std::ranges::view_interface<D>) |
|
(C++20)
|
returns the first element in the derived view. Provided if it satisfies forward_range. (public member function of std::ranges::view_interface<D>) |
|
(C++20)
|
returns the last element in the derived view. Provided if it satisfies bidirectional_range and common_range. (public member function of std::ranges::view_interface<D>) |
|
(C++20)
|
returns the nth element in the derived view. Provided if it satisfies random_access_range. (public member function of std::ranges::view_interface<D>) |
std::ranges::reverse_view::reverse_view
|
(1) | (since C++20) |
|
(2) | (since C++20) |
base_ via its default member initializer (= V()).
base_ with std::move(r).
Parameters
| r | - | range to reverse |
std::ranges::reverse_view::base
|
(1) | (since C++20) |
|
(2) | (since C++20) |
Returns the underlying view.
return base_;.
return std::move(base_);.
std::ranges::reverse_view::begin
|
(1) | (since C++20) |
|
(2) | (since C++20) |
|
(3) | (since C++20) |
std::make_reverse_iterator(ranges::next(ranges::begin(base_), ranges::end(base_))). In order to provide the amortized constant time complexity required by the range concept, this function caches the result within the cache object for use on subsequent calls.
return std::make_reverse_iterator(ranges::end(base_));.
std::ranges::reverse_view::end
|
(1) | (since C++20) |
|
(2) | (since C++20) |
Equivalent to return std::make_reverse_iterator(ranges::begin(base_));.
std::ranges::reverse_view::size
|
(1) | (since C++20) |
|
(2) | (since C++20) |
Returns the size of the view if the view is bounded.
return ranges::size(base_);.
Deduction guides
|
(since C++20) |
Helper templates
|
(since C++20) |
This specialization of std::ranges::enable_borrowed_range makes reverse_view satisfy borrowed_range when the underlying view satisfies it.
Example
#include <iostream>
#include <ranges>
int main()
{
static constexpr auto il = {3, 1, 4, 1, 5, 9};
std::ranges::reverse_view rv{il};
for (int i : rv)
std::cout << i << ' ';
std::cout << '\n';
for (int i : il | std::views::reverse)
std::cout << i << ' ';
std::cout << '\n';
// operator[] is inherited from std::view_interface
for (auto i{0U}; i != rv.size(); ++i)
std::cout << rv[i] << ' ';
std::cout << '\n';
}
Output:
9 5 1 4 1 3
9 5 1 4 1 3
9 5 1 4 1 3
Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
| DR | Applied to | Behavior as published | Correct behavior |
|---|---|---|---|
| LWG 3494 | C++20 | reverse_view was never a borrowed_range |
it is a borrowed_range if its underlying view is |
See also
| iterator adaptor for reverse-order traversal (class template) |
|
|
(C++20)
|
reverses the order of elements in a range (niebloid) |
|
(C++20)
|
creates a copy of a range that is reversed (niebloid) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
https://en.cppreference.com/w/cpp/ranges/reverse_view