5 c++ iterator list vector decrement
我正在iterator
通过一个向后和向前移动vector
.
我可以检查迭代器是否像这样运行:
++my_iterator;
if ( my_iterator == my_vector.end() )
{
--my_iterator; // if I want to stop the iterator at the end.
my_iterator = my_vector.begin(); // if I want the iterator to wraparound.
}
Run Code Online (Sandbox Code Playgroud)
但是我该如何检查它是否从一开始就用完了?
编辑:我可以这样做吗?
--my_iterator;
if ( my_iterator == my_vector.rend() )
{
my_iterator = my_vector.begin(); // if I want to stop the iterator at the beginning.
my_iterator = --(my_vector.rbegin()); // if I want the iterator to wraparound.
}
Run Code Online (Sandbox Code Playgroud)
或者我必须这样做?
std::vector< T >::iterator temp_reverse_iterator = reverse_iterator< T >( my_iterator );
++temp_reverse_iterator;
if ( temp_reverse_iterator == my_vector.rend() )
{
my_iterator = my_vector.begin(); // if I want to stop the iterator at the beginning.
my_iterator = --(my_vector.end()); // if I want the iterator to wraparound.
}
else
{
my_iterator = temp_reverse_iterator.base(); // do I need to -- this?
}
Run Code Online (Sandbox Code Playgroud)
这两个例子在逻辑上是否合理?
我想知道如果您使用Boost Circular Buffer而不是 astd::vector
作为底层数据结构,对您来说是否会更容易。
但是,要回答您的实际问题:您通过检查迭代器是否等于 来检查是否在开头处换行v.begin()
。
#include <vector>
#include <cassert>
template <class T> void
Increment( typename std::vector<T>::iterator& it, std::vector<T>& v )
{
assert(v.size() > 0);
++it;
if(it == v.end())
it = v.begin();
}
template <class T> void
Decrement( typename std::vector<T>::iterator& it, std::vector<T>& v )
{
assert(v.size() > 0);
if(it == v.begin())
it = v.end();
--it;
}
int main() {
std::vector<int> v;
v.push_back(0);
v.push_back(1);
std::vector<int>::iterator it;
it = v.begin();
Decrement(it, v);
assert(*it == 1);
Increment(it, v);
assert(*it == 0);
}
Run Code Online (Sandbox Code Playgroud)