std::ranges::stride_view<V>:: iterator <Const>:: operator++,--,+=,-=
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_
.
ranges::advance(current_, missing_ - stride_); missing_ = 0; return *this;
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 ) .Parameters
n | - | position relative to current location |
Return value
Example
This section is incomplete
Reason: no example |
See also
(C++23)
|
performs iterator arithmetic
(function) |