adjacent_view
is a range adaptor that takes a
view
, and produces a
view
whose
i
th
element (a âwindowâ) is a
std::tuplethat holds
N
references to the elements
[
i
,
i + N - 1
]
of the original view.
Let
S
be the size of the original view. Then the size of produced view is:
S >= N
,The name
views::pairwisedenotes a
RangeAdaptorObjectthat behaves exactly as
views::adjacent<2>.
adjacent_view
always models forward_range
, and models bidirectional_range
, random_access_range
, or sized_range
if adapted view
type models the corresponding concept.
V
base_
the underlying view
adjacent_view
sized_range
approximately_sized_range
sized_range
or forward_range
std::ranges::view_interface<D>
) [edit] returns a constant iterator to the beginning of the range
std::ranges::view_interface<D>
) [edit] returns a sentinel for the constant iterator of the range
std::ranges::view_interface<D>
) [edit] returns whether the derived view is not empty, provided only if ranges::empty is applicable to it
std::ranges::view_interface<D>
) [edit] returns the first element in the derived view, provided if it satisfies forward_range
std::ranges::view_interface<D>
) [edit] returns the last element in the derived view, provided only if it satisfies bidirectional_range
and common_range
std::ranges::view_interface<D>
) [edit] returns the n
th element in the derived view, provided only if it satisfies random_access_range
std::ranges::view_interface<D>
) [edit] [edit] Deduction guides
(none)
[edit] Nested classes the iterator typeadjacent_view
is not a common_range
This specialization of ranges::enable_borrowed_range makes adjacent_view
satisfy borrowed_range
when the underlying view satisfies it.
views::adjacent only accepts forward ranges even when N
is 0
.
There are similarities between ranges::adjacent_view and ranges::slide_view:
N
.S - N + 1
, where S
is the size of an adapted view
such that S >= N > 0
.The following table shows the differences between these adaptors:
[edit] Example#include <array> #include <format> #include <iostream> #include <ranges> #include <tuple> int main() { constexpr std::array v{1, 2, 3, 4, 5, 6}; std::cout << "v = [1 2 3 4 5 6]\n"; for (int i{}; std::tuple t : v | std::views::adjacent<3>) { auto [t0, t1, t2] = t; std::cout << std::format("e = {:<{}}[{} {} {}]\n", "", 2 * i++, t0, t1, t2); } }
Output:
v = [1 2 3 4 5 6] e = [1 2 3] e = [2 3 4] e = [3 4 5] e = [4 5 6][edit] 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 4098 C++23 views::adjacent<0> used to accept input-only ranges made rejected [edit] ReferencesRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4