Re: Alternative?

From:

Victor Bazarov <v.bazarov@comcast.invalid>

Newsgroups:

comp.lang.c++

Date:

Wed, 01 Oct 2014 19:44:18 -0400

Message-ID:

<m0i3kj$qdj$1@dont-email.me>

On 10/1/2014 7:36 PM, Christopher Pisz wrote:

On 10/1/2014 5:50 PM, Scott Neugroschl wrote:

On 10/1/2014 3:49 PM, Scott Neugroschl wrote:

On 10/1/2014 3:36 PM, MikeCopeland wrote:

I'm scanning a std::vector and deleting certain elements as I
traverse the vector. Help mI've received here suggest that I must
use a
scalar index for this process, even though I'm using an iterator to
traverse the vector.
I know that I can use the "itertor-vector,begin()" comoutation to
obtain the specific index, but this seems awkward. Is there an STL
function that does this, or is there a cleaner way? Please advise.
TIA

Why do you need an index?

What's wrong with...

std::vector<T> v;
std::vector<T>::iterator it = v.begin();
while (it != v.end())
{
if (*it matches criteria)

// CORRECTION HERE
it = v.erase(it); // per C++03 23.1.1/7

else
++it;
}

Oops. typo. See correction above.

Not enough info given really. If you expect to go front to back, and
delete multiple elements, then that's probably the best way. You can
also look at std::find_if in <algorithm>.

You probably meant std::remove_if ...

V
--
I do not respond to top-posted replies, please don't ask