What happen to pointers when vectors need more memory and realocate memory?

by

Short answer: Everything will be fine. Don’t worry about this and get back to work.

Medium answer: Adding elements to or removing them from a vector invalidates all iterators and references/pointers (possibly with the exception of removing from the back). Simple as that. Don’t refer to any old iterators and obtain new ones after such an operation. Example:

std::vector<int> v = get_vector();

int & a = v[6];
int * b = &v[7];
std::vector<int>::iterator c = v.begin();
std::advance(it, 8);

v.resize(100);

Now a, b and c are all invalid: You cannot use a, and you cannot dereference b or c.

Long answer: The vector keeps track of dynamic memory. When the memory is exhausted, it allocates a new, larger chunk elsewhere and copies (or moves) all the old elements over (and then frees up the old memory, destroying the old objects). Memory allocation and deallocation is done by the allocator (typically std::allocator<T>), which in turn usually invokes ::operator new() to fetch memory, which in turn usually calls malloc(). Details may vary and depend on your platform. In any event, any previously held references, pointers or iterators are no longer valid (presumably because they refer to the now-freed memory, though it’s not specified in the standard why they’re invalid).

More Related Contents:

  1. What do I need to do before deleting elements in a vector of pointers to dynamically allocated objects?
  2. Avoid memory leaks in C++ Pointers [closed]
  3. Is it safe to delete a NULL pointer?
  4. Dynamically allocating an array of objects
  5. How to avoid memory leaks when using a vector of pointers to dynamically allocated objects in C++?
  6. Determine the size of a C++ array programmatically?
  7. How to use an iterator?
  8. How to know if a pointer points to the heap or the stack?
  9. std::vector and contiguous memory of multidimensional arrays
  10. Pointer-to-pointer dynamic two-dimensional array
  11. Initial capacity of vector in C++
  12. What happens when you deallocate a pointer twice or more in C++?
  13. Check if a pointer points to allocated memory on the heap
  14. Reason why not to have a DELETE macro for C++
  15. vector memory allocation strategy
  16. “Right” way to deallocate an std::vector object
  17. What does “dereferencing” a pointer mean?
  18. delete vs delete[] [duplicate]
  19. How to get memory usage at runtime using C++?
  20. Why are references not reseatable in C++
  21. When vectors are allocated, do they use memory on the heap or the stack?
  22. How can I create cartesian product of vector of vectors?
  23. How to return a std::string.c_str()
  24. how does the ampersand(&) sign work in c++? [duplicate]
  25. How to properly replace global new & delete operators
  26. Dereferencing an invalid pointer, then taking the address of the result
  27. What is a void pointer and what is a null pointer?
  28. Performance cost of passing by value vs. by reference or by pointer?
  29. Increment void pointer by one byte? by two?
  30. Is a Linked-List implementation without using pointers possible or not?

Leave a Comment