STL iterator arithmetic

[Generic Usenet Account]

This posting is just for clarification of my understanding. It appears
to me that only vector and deque iterators (i.e. random access
iterators) allow "iterator arithmetic" operations (like iter+2, iter-1
etc.). Kindly confirm.

Thanks,
Song

 

[Pete Becker]

This posting is just for clarification of my understanding. It appears
to me that only vector and deque iterators (i.e. random access
iterators) allow "iterator arithmetic" operations (like iter+2, iter-1
etc.). Kindly confirm.

Forward iterators support incrementing.
Bidirectional iterators support incrementing and decrementing.
Random access iterators support incrementing, decrementing, and the sort
of arithmetic that you've mentioned.

In the containers provided by the Standard C++ Library, the sequences
managed by vector and deque have random access iterators. The sequences
managed by list, set, multiset, map, and multimap have bidirectional
iterators.

In containers from other sources, check the documentation.

 

[Victor Bazarov]

This posting is just for clarification of my understanding. It appears
to me that only vector and deque iterators (i.e. random access
iterators) allow "iterator arithmetic" operations (like iter+2, iter-1
etc.). Kindly confirm.

Also, basic_string iterators are of random access variety.

V

 

[Generic Usenet Account]

I am not seeing the method definition for deleting elements at a
specified position in a vector or deque. Is that the way it is
supposed to be? Here's what I have come up with. Is there a better
way around?

Thanks,
Song

////////////////////////////////////////////
template<typename T>
void
eraseAtPosition(vector<T>& coll, size_t posn, size_t numElem = 1)
{
if(posn+numElem > coll.size())
{
cerr << "Out of bounds exception\n";
return;
}

coll.erase(coll.begin()+posn, coll.begin()+posn+numElem);
}