«

On Fri, 22 Aug 2003 11:52:30 GMT, "sks_cpp" <>
wrote:

>// C is a container of pointers
>
>template<typename Container>
>
>void deleteObjects(Container& C)
>
>{
>
> C::iterator i = C.begin();
>
> while( i != C.end() )
>
> {
>
> C::iterator j = i++;
>
> delete *j;
>
> C.erase(j);
>
> }
>
>}
>
>I read online somewhere that this works for list, set, and map but NOT
>vector and deque. Is that correct?

Yes. For vector, iterators after the erase are invalidated. For deque,
all iterators are invalidated if the erase isn't at the start or end.

Tom

> > >
> > >I read online somewhere that this works for list, set, and map but NOT
> > >vector and deque. Is that correct?
> >
> > Yes. For vector, iterators after the erase are invalidated. For deque,
> > all iterators are invalidated if the erase isn't at the start or end.
>
> So, how are you supposed do the above for vector and deque?
>
> Thanks,
> Satish
>

I think Victor's final answer works for all containers, and its simpler and
more efficient, amazing.

john