constexpr /*iterator*/& operator++(); | (1) | (since C++23) |
constexpr void operator++( int ); | (2) | (since C++23) |
constexpr /*iterator*/ operator++( int ) requires ranges::forward_range<Base>; | (3) | (since C++23) |
constexpr /*iterator*/& operator--() requires ranges::bidirectional_range<Base>; | (4) | (since C++23) |
constexpr /*iterator*/ operator--( int ) requires ranges::bidirectional_range<Base>; | (5) | (since C++23) |
constexpr /*iterator*/& operator+=( difference_type n ) requires ranges::random_access_range<Base>; | (6) | (since C++23) |
constexpr /*iterator*/& operator-=( difference_type n ) requires ranges::random_access_range<Base>; | (7) | (since C++23) |
Increments or decrements the iterator.
Let current_
, end_
, stride_
, and missing_
be the data members of the iterator.
missing_ = ranges::advance(current_, stride_, end_); return *this
current_
should not be equal to end_
.++*this;
.auto tmp = *this; ++*this; return tmp;
.ranges::advance(current_, missing_ - stride_); missing_ = 0; return *this;
auto tmp = *this; --*this; return tmp;
.if (n > 0) { ranges::advance(current_, stride_ * (n - 1)); missing_ = ranges::advance(current_, stride_, end_); } else if (n < 0) { ranges::advance(current_, stride_ * n + missing_); missing_ = 0; } return *this;
If n > 0
, then before the call to this function the ranges::distance(current_, end_)
must be greater than stride_ * (n - 1)
. Note that if n < 0
, the ranges::distance(current_, end_)
is always greater than (non-positive) stride_ * (n - 1)
.
return *this += -n;
n | - | position relative to current location |
*this
*this
that was made before the change
(C++23) | performs iterator arithmetic (function) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
https://en.cppreference.com/w/cpp/ranges/stride_view/iterator/operator_arith