std::reverse_iterator<Iter>::operator++,+,+=,--,-,-=
来自 cppreference.cn
< cpp | iterator | reverse iterator
reverse_iterator& operator++(); |
(1) | (constexpr since C++17) |
reverse_iterator& operator--(); |
(2) | (constexpr since C++17) |
reverse_iterator operator++( int ); |
(3) | (constexpr since C++17) |
reverse_iterator operator--( int ); |
(4) | (constexpr since C++17) |
reverse_iterator operator+( difference_type n ) const; |
(5) | (constexpr since C++17) |
reverse_iterator operator-( difference_type n ) const; |
(6) | (constexpr since C++17) |
reverse_iterator& operator+=( difference_type n ); |
(7) | (constexpr since C++17) |
reverse_iterator& operator-=( difference_type n ); |
(8) | (constexpr since C++17) |
以相反方向递增或递减底层迭代器。
重载 | 等价于 |
---|---|
(1) | --current ; return *this;
|
(2) | ++current ; return *this;
|
(3) | reverse_iterator tmp = *this; --current ; return tmp; |
(4) | reverse_iterator tmp = *this; ++current ; return tmp;
|
(5) | return reverse_iterator(current - n);
|
(6) | return reverse_iterator(current + n);
|
(7) | current -= n; return *this;
|
(8) | current += n; return *this;
|
目录 |
[edit] 参数
n | - | 相对于当前位置的位置 |
[edit] 返回值
如上所述。
[edit] 示例
运行此代码
#include <iostream> #include <iterator> #include <list> #include <vector> int main() { std::vector v{0, 1, 2, 3, 4}; auto rv = std::reverse_iterator{v.rbegin()}; std::cout << *(++rv) << ' '; // 3 std::cout << *(--rv) << ' '; // 4 std::cout << *(rv + 3) << ' '; // 1 rv += 3; std::cout << rv[0] << ' '; // 1 rv -= 3; std::cout << rv[0] << '\n'; // 4 std::list l{5, 6, 7, 8}; auto rl = std::reverse_iterator{l.rbegin()}; std::cout << *(++rl) << ' '; // OK: 3 std::cout << *(--rl) << '\n'; // OK: 4 // The following statements raise compilation error because the // underlying iterator does not model the random access iterator: // *(rl + 3) = 13; // rl += 3; // rl -= 3; }
输出
3 4 1 1 4 7 8
[edit] 参见
推进迭代器 (函数模板) | |
计算两个迭代器适配器之间的距离 (函数模板) |