std::vector iterator invalidation

by

after erasing an element, is the iterator at that position still valid

No; all of the iterators at or after the iterator(s) passed to erase are invalidated.

However, erase returns a new iterator that points to the element immediately after the element(s) that were erased (or to the end if there is no such element). You can use this iterator to resume iteration.

Note that this particular method of removing odd elements is quite inefficient: each time you remove an element, all of the elements after it have to be moved one position to the left in the vector (this is O(n2)). You can accomplish this task much more efficiently using the erase-remove idiom (O(n)). You can create an is_odd predicate:

bool is_odd(int x) { return (x % 2) == 1; }

Then this can be passed to remove_if:

vec.erase(std::remove_if(vec.begin(), vec.end(), is_odd), vec.end());

More Related Contents:

  1. Sorting a vector in descending order
  2. What’s faster, iterating an STL vector with vector::iterator or with at()?
  3. What happens if you increment an iterator that is equal to the end iterator of an STL container
  4. iterator for 2d vector
  5. What is the easiest way to initialize a std::vector with hardcoded elements?
  6. Alternative to vector
  7. Why isn’t vector a STL container?
  8. Best way to extract a subvector from a vector?
  9. When vectors are allocated, do they use memory on the heap or the stack?
  10. reduce the capacity of an stl vector
  11. How to sum up elements of a C++ vector?
  12. How to avoid memory leaks when using a vector of pointers to dynamically allocated objects in C++?
  13. comparing iterators from different containers
  14. Why use non-member begin and end functions in C++11?
  15. Does vector::erase() on a vector of object pointers destroy the object itself?
  16. How are iterators and pointers related?
  17. how do you insert the value in a sorted vector?
  18. Reorder vector using a vector of indices [duplicate]
  19. What is an iterator’s default value?
  20. Checking if an iterator is valid
  21. Does resizing a vector invalidate iterators?
  22. Why does a push_back on an std::list change a reverse iterator initialized with rbegin?
  23. How to downsize std::vector?
  24. C++ convert vector to vector
  25. Getting a vector into a function that expects a vector
  26. Can std::vector emplace_back copy construct from an element of the vector itself?
  27. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  28. STL vectors with uninitialized storage?
  29. “Right” way to deallocate an std::vector object
  30. How to erase & delete pointers to objects stored in a vector?

Leave a Comment