1. 复制整个list
Copying and incrementing/decrementing the copy is the only way it can be done.
You can write wrapper functions to hide it (and as mentioned in answers, C++11 has std::prev/std::next which do just that (and Boost defines similar functions). But they are wrappers around this "copy and increment" operation, so you don't have to worry that you're doing it "wrong".
2. 使用C++0x或者C++11中的 pre 和 next
In C++0x, this functionality is neatly wrapped up in the std::prev function, which your C++ Standard Library implementation may support. If not, it looks something like this:
template <typename BidiIt>
BidiIt prev(BidiIt x, typename std::iterator_traits<BidiIt>::difference_type n=1)
{
std::advance(x, -n);
return x;
}For C++11, there are the two methods you are looking for called std::prev and std::next. You can find them in the iterator library.
Example from cppreference.com
#include <iostream>
#include <iterator>
#include <vector>
int main()
{
std::list<int> v{ 3, 1, 4 };
auto it = v.begin();
auto nx = std::next(it, 2);
std::cout << *it << ' ' << *nx << '
';
}Output:
3 43. 使用Boost中的 prior 和 next
A simple precanned solution are prior and next from Boost.utility. They take advantage of operator-- and operator++ but don't require you to create a temporary.
4. 创建新的iterator
std::list is only bidirecitonally iterable, so you can only move the iterator one position at a time. You thus need to create a new iterator:
iter_copy = iter;
--iter;Obviously, you are responsible for ensuring that a previous element actually exists before you decrement the iterator.
Reference:
http://stackoverflow.com/questions/10137214/how-get-next-previous-element-in-stdlist-without-incrementing-decrementing
http://stackoverflow.com/questions/5586377/how-to-access-the-previous-element-in-a-c-list-iterator-loop