std::ranges:: views:: slide, std::ranges:: slide_view

If n is not greater than ​ 0 ​ , the behavior is undefined.

slide_view always models forward_range , and models bidirectional_range , random_access_range , or sized_range if adapted view type models the corresponding concept.

Data members

Member functions

Deduction guides

Nested classes

Helper templates

This specialization of ranges::enable_borrowed_range makes slide_view satisfy borrowed_range when the underlying view satisfies it.

Notes

There are similarities between ranges::adjacent_view and ranges::slide_view :

• Both create “sliding window” of size N .
• Both have the same size 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:

Example

#include <algorithm>
#include <initializer_list>
#include <iostream>
#include <ranges>
auto print_subrange = [](std::ranges::viewable_range auto&& r)
{
    std::cout << '[';
    for (char space[]{0,0}; auto elem : r)
        std::cout << space << elem, *space = ' ';
    std::cout << "] ";
};
int main()
{
    const auto v = {1, 2, 3, 4, 5, 6};
    std::cout << "All sliding windows of width:\n";
    for (const unsigned width : std::views::iota(1U, 1U + v.size()))
    {
        auto const windows = v | std::views::slide(width);
        std::cout << "W = " << width << ": ";
        std::ranges::for_each(windows, print_subrange);
        std::cout << '\n';
    }
}

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]

References

See also