| ||||||||||||||||||||||
| Range primitives | |||||||
| |||||||
| Range concepts | |||||||||||||||||||
| |||||||||||||||||||
| Range factories | |||||||||
| |||||||||
| Range adaptors | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Helper items | |||||||||||||||||
| |||||||||||||||||
| Member functions | ||||
(C++26) | ||||
| Deduction guides | ||||
| Iterator | ||||
| Member functions | ||||
| Non-member functions | ||||
| Sentinel | ||||
| Member functions | ||||
| Non-member functions | ||||
Defined in header <ranges> | ||
template<ranges::forward_range V> requiresranges::view<V> | (1) | (since C++23) |
namespace views{ inlineconstexpr/* unspecified */ slide=/* unspecified */; | (2) | (since C++23) |
Call signature | ||
template<ranges::viewable_range R> constexprranges::viewauto slide( R&& r,ranges::range_difference_t<R> n); | (since C++23) | |
template<class DifferenceType> constexpr/* range adaptor object */ slide( DifferenceType&& n); | (since C++23) | |
Helper concepts | ||
template<class V> concept/*slide-caches-nothing*/= | (3) | (exposition only*) |
template<class V> concept/*slide-caches-last*/= | (4) | (exposition only*) |
template<class V> concept/*slide-caches-first*/= | (5) | (exposition only*) |
slide_view is a range adaptor that takes aview and a numbern and produces a view whosemth element (a “window”) is a view over[m, m + n - 1] elements of the original view.Ifn is not greater than0, the behavior is undefined.
slide_view always modelsforward_range, and modelsbidirectional_range,random_access_range, orsized_range if adaptedview type models the corresponding concept.
Contents |
| Member | Description |
Vbase_ | the underlying view (exposition-only member object*) |
ranges::range_difference_t<V>n_ | the “window” size (exposition-only member object*) |
non-propagating-cache<ranges::iterator_t<V>>cached_begin_(present only if V models theslide-caches-first) | an object that caches the result ofbegin()(exposition-only member object*) |
non-propagating-cache<ranges::iterator_t<V>>cached_end_(present only if V models theslide-caches-last) | an object that caches the result ofend()(exposition-only member object*) |
constructs aslide_view(public member function)[edit] | |
| returns an iterator to the beginning (public member function)[edit] | |
| returns an iterator or a sentinel to the end (public member function)[edit] | |
returns the number of elements, provided only if the underlying (adapted) range satisfiessized_range(public member function)[edit] | |
(C++26) | returns the approximate size of the resultingapproximately_sized_range(public member function)[edit] |
Inherited fromstd::ranges::view_interface | |
returns whether the derived view is empty, provided only if it satisfiessized_range orforward_range(public member function of std::ranges::view_interface<D>)[edit] | |
(C++23) | returns a constant iterator to the beginning of the range (public member function of std::ranges::view_interface<D>)[edit] |
(C++23) | returns a sentinel for the constant iterator of the range (public member function of std::ranges::view_interface<D>)[edit] |
| returns whether the derived view is not empty, provided only ifranges::empty is applicable to it (public member function of std::ranges::view_interface<D>)[edit] | |
returns the first element in the derived view, provided if it satisfiesforward_range(public member function of std::ranges::view_interface<D>)[edit] | |
returns the last element in the derived view, provided only if it satisfiesbidirectional_range andcommon_range(public member function of std::ranges::view_interface<D>)[edit] | |
returns thenth element in the derived view, provided only if it satisfiesrandom_access_range(public member function of std::ranges::view_interface<D>)[edit] | |
(C++23) | the iterator type (exposition-only member class template*) |
(C++23) | the sentinel type used whenslide_view is not acommon_range(exposition-only member class template*) |
template<class V> constexprboolranges::enable_borrowed_range<slide_view<V>>= | (since C++23) | |
This specialization ofranges::enable_borrowed_range makesslide_view satisfyborrowed_range when the underlying view satisfies it.
There are similarities betweenranges::adjacent_view andranges::slide_view:
N.S - N + 1, whereS is the size of an adaptedview such thatS >= N > 0.The following table shows the differences between these adaptors:
| View adaptor | value_type | The window sizeN |
|---|---|---|
| ranges::adjacent_view | std::tuple | A template parameter |
| ranges::slide_view | ranges::range | A runtime argument |
| Feature-test macro | Value | Std | Feature |
|---|---|---|---|
__cpp_lib_ranges_slide | 202202L | (C++23) | std::ranges::slide_view |
#include <algorithm>#include <initializer_list>#include <iostream>#include <ranges> auto print_subrange=[](std::ranges::viewable_rangeauto&& r){std::cout<<'[';for(char space[]{0,0};auto elem: r)std::cout<< space<< elem,*space=' ';std::cout<<"] ";}; int main(){constauto v={1,2,3,4,5,6}; std::cout<<"All sliding windows of width:\n";for(constunsigned width: std::views::iota(1U, 1U+ v.size())){autoconst windows= v| std::views::slide(width);std::cout<<"W = "<< width<<": "; std::ranges::for_each(windows, print_subrange);std::cout<<'\n';}}
Output:
All sliding windows of width W:W = 1: [1] [2] [3] [4] [5] [6] W = 2: [1 2] [2 3] [3 4] [4 5] [5 6] W = 3: [1 2 3] [2 3 4] [3 4 5] [4 5 6] W = 4: [1 2 3 4] [2 3 4 5] [3 4 5 6] W = 5: [1 2 3 4 5] [2 3 4 5 6] W = 6: [1 2 3 4 5 6]
aview consisting of tuples of references to adjacent elements of the adapted view(class template)(range adaptor object)[edit] | |
a range ofviews that areN-sized non-overlapping successive chunks of the elements of anotherview(class template)(range adaptor object)[edit] |
