std::ranges::stride_view<V>::size
From cppreference.com
< cpp | ranges | stride view
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Ranges library
(C++23)(C++23)
(C++26)(C++26)
(C++23)(C++23)
(C++26)(C++26)
(C++26)(C++26)
(C++23)(C++23)
(C++23)(C++23)
(C++23)(C++23)
(C++23)(C++23)
(C++23)(C++23)
(C++23)
(C++23)(C++23)
(C++23)
(C++23)(C++23)
(C++23)(C++23)
(C++23)(C++23)
(C++23)(C++23)
(C++23)(C++23)
std::ranges::stride_view
stride_view::size
(C++26)
constexpr auto size() requires ranges::sized_range <V>;
(since C++23)
constexpr auto size() const requires ranges::sized_range <const V>;
(since C++23)
Returns the number of elements.
Let base_ be the underlying view and stride_ be the stored stride value. Equivalent to:
return /*to-unsigned-like*/(/*div-ceil*/(ranges::distance (base_), stride_));
Contents
[edit] Parameters
(none)
[edit] Return value
The number of elements. The returned value is calculated as if by expression
(ranges::size (base_) / stride_) + ((ranges::size (base_) % stride_ ? 1 : 0).
[edit] Example
Run this code
#include <forward_list> #include <ranges> int main() { namespace vs = std::views; constexpr static auto v = {1, 2, 3, 4, 5}; static_assert ( vs::stride(v, 1).size() == 5 and vs::stride(v, 2).size() == 3 and vs::stride(v, 3).size() == 2 and vs::stride(v, 4).size() == 2 and vs::stride(v, 5).size() == 1 and vs::stride(v, 6).size() == 1 ); std::forward_list list{v}; // auto s = vs::stride(list, 2).size(); // Error: not a sized_range }