constexpr /*iterator*/& operator++(); | (1) | (since C++23) |
constexpr /*iterator*/ operator++( int ); | (2) | (since C++23) |
constexpr /*iterator*/& operator--()
requires ranges::bidirectional_range<Base>;
| (3) | (since C++23) |
constexpr /*iterator*/ operator--( int )
requires ranges::bidirectional_range<Base>;
| (4) | (since C++23) |
constexpr /*iterator*/& operator+=( difference_type n )
requires ranges::random_access_range<Base>;
| (5) | (since C++23) |
constexpr /*iterator*/& operator-=( difference_type n )
requires ranges::random_access_range<Base>;
| (6) | (since C++23) |
Advances or decrements the iterator.
Let current_ and last_ele_ be the underlying iterators to the begin and end of the sliding window.
current_ = ranges::next(current_); last_ele_ = ranges::next(last_ele_); // if last_ele_ is present return *this;
current_ and last_ele_ (if present) must be incrementable.auto tmp = *this; ++*this; return tmp;
current_ = ranges::prev(current_); last_ele_ = ranges::prev(last_ele_); // if last_ele_ is present return *this;
current_ and last_ele_ (if present) must be decrementable.auto tmp = *this; --*this; return tmp;
current_ = current_ + n; last_ele_ = last_ele_ + n; // if last_ele_ is present return *this;
current_ + n and last_ele_ + n (if last_ele_ is present) must have well-defined behavior.current_ = current_ - n; last_ele_ = last_ele_ - n; // if last_ele_ is present return *this;
current_ - n and last_ele_ - n (if last_ele_ is present) must have well-defined behavior.| 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/slide_view/iterator/operator_arith