How can I remove an item in STL iterator?

[Allerdyce.John]

How can I emove an item in STL iterator without use the STL algorithm?
I know we can use stl erase, find_if to remove items from a STL vector
, but how can I do the same without using STL algorithm?

vector<int> srcVector;
vector<int> destVector;

for (vector<int>::i terator itr = srcVector; itr != srcVector; itr++) {
int i = (*itr);

// if i contains in destVector, remove that from both srcVector
and destVector

}

[TB]

Al************@ gmail.com skrev:

How can I emove an item in STL iterator without use the STL algorithm?
I know we can use stl erase, find_if to remove items from a STL vector
, but how can I do the same without using STL algorithm?

vector<int> srcVector;
vector<int> destVector;

for (vector<int>::i terator itr = srcVector; itr != srcVector; itr++) {
int i = (*itr);

// if i contains in destVector, remove that from both srcVector
and destVector

}

std::vector<int > v(10);
v.erase(v.begin () + 4); // deletes 5th element

--
TB @ SWEDEN

[Roland Pibinger]

On 5 Mar 2006 09:20:48 -0800, in comp.lang.c++ you wrote:

How can I emove an item in STL iterator without use the STL algorithm?
I know we can use stl erase, find_if to remove items from a STL vector
, but how can I do the same without using STL algorithm?

vector<int> srcVector;
vector<int> destVector;

for (vector<int>::i terator itr = srcVector; itr != srcVector; itr++) {
int i = (*itr);

// if i contains in destVector, remove that from both srcVector
and destVector

for (vector<int>::i terator itr = srcVector.begin ();
itr != srcVector.end() ; ) {

vector<int>::it erator posDest
= std::find (destVector.beg in(), destVector.end( ), *itr)

if (posDest != destVector.end( )) {
srcVector.remov e (itr);
destVector.remo ve (posDest);
} else {
++itr;
}
}

Not tested. Does not work for duplicate entries in srcVector or
destVector. Replace 'std::find' with your own 'find' function if you
don't want std::algorithms .

Best wishes,
Roland Pibinger

[Allerdyce.John]

Thanks. My question is: "Is it save to call remove of a STL container
as you are iterator thru the same STL container ? " Like the example
above posting.

[Roland Pibinger]

On 5 Mar 2006 11:45:16 -0800, Al************@ gmail.com wrote:

Thanks. My question is: "Is it save to call remove of a STL container
as you are iterator thru the same STL container ? " Like the example
above posting.

Actually the right remove function is erase, e.g,
srcVector.erase (itr);

WRT to your question: "iterators and references become invalid only
from the first element erased through the end of the sequence"
http://www.dinkumware.com/manuals/re...#vector::erase

Best wishes,
Roland Pibigner

[Roland Pibinger]

On Sun, 05 Mar 2006 20:56:32 GMT, rp*****@yahoo.c om (Roland Pibinger)
wrote:

WRT to your question: "iterators and references become invalid only
from the first element erased through the end of the sequence"
http://www.dinkumware.com/manuals/re...#vector::erase

After having read that sentence again I see that my solution is
probably not valid.

Sorry for the confusion. STL is too complicated for a quick answer.
Roland Pibinger

[Acer]

codes below are SGI STL sourcecode for vector<T>::eras e(iterator
position);

they are inline in .h

iterator erase(iterator position)
{
if( position+1 != end() )
copy( position+1, finish, position);
//u can find this function's definition in <algorithm>
--finish;
destory(finish) ; //<memory>; part of the allocator
return position;
}

Because finish's type is vector<T>::iter ator, and actually is T*.
Therefore, destory will call finish->~T(); to deconstruct item.

[Roland Pibinger]

On Sun, 05 Mar 2006 18:33:10 GMT, rp*****@yahoo.c om (Roland Pibinger)
wrote:

if (posDest != destVector.end( )) {
srcVector.remov e (itr);
destVector.remo ve (posDest);
} else {
++itr;
}
}

The correct code is:

if (posDest != destVector.end( )) {
itr = srcVector.erase (itr);
destVector.eras e (posDest);
} else {
++itr;
}
}