Choice between vector::resize() and vector::reserve()

by

The two functions do vastly different things!

The resize() method (and passing argument to constructor is equivalent to that) will insert or delete appropriate number of elements to the vector to make it given size (it has optional second argument to specify their value). It will affect the size(), iteration will go over all those elements, push_back will insert after them and you can directly access them using the operator[].

The reserve() method only allocates memory, but leaves it uninitialized. It only affects capacity(), but size() will be unchanged. There is no value for the objects, because nothing is added to the vector. If you then insert the elements, no reallocation will happen, because it was done in advance, but that’s the only effect.

So it depends on what you want. If you want an array of 1000 default items, use resize(). If you want an array to which you expect to insert 1000 items and want to avoid a couple of allocations, use reserve().

EDIT: Blastfurnace’s comment made me read the question again and realize, that in your case the correct answer is don’t preallocate manually. Just keep inserting the elements at the end as you need. The vector will automatically reallocate as needed and will do it more efficiently than the manual way mentioned. The only case where reserve() makes sense is when you have reasonably precise estimate of the total size you’ll need easily available in advance.

EDIT2: Ad question edit: If you have initial estimate, then reserve() that estimate. If it turns out to be not enough, just let the vector do it’s thing.

More Related Contents:

  1. C++: Vector subscript out of range
  2. How to enforce move semantics when a vector grows?
  3. Correct way to work with vector of arrays
  4. Why isn’t vector a STL container?
  5. reduce the capacity of an stl vector
  6. How to sum up elements of a C++ vector?
  7. C++ delete vector, objects, free memory
  8. Finding the centroid of a polygon?
  9. What is the difference between std::array and std::vector? When do you use one over other? [duplicate]
  10. how do you insert the value in a sorted vector?
  11. C++ for-loop – size_type vs. size_t
  12. Bjarne Stroustrup says we must avoid linked lists
  13. Reorder vector using a vector of indices [duplicate]
  14. C++ std::vector vs array in the real world
  15. Compute Median of Values Stored In Vector – C++?
  16. Vector that can have 3 different data types C++
  17. c++: can vector contain objects of type Derived?
  18. Why can’t I create a vector of lambdas (of the same type) in C++11?
  19. Does resizing a vector invalidate iterators?
  20. How to downsize std::vector?
  21. C++ convert vector to vector
  22. Get the first column of a matrix represented by a vector of vectors
  23. Is std::vector memory freed upon a clear?
  24. Why doesn’t emplace_back() use uniform initialization?
  25. Getting a vector into a function that expects a vector
  26. How can I get the maximum or minimum value in a vector?
  27. Initializing a ublas vector from a C array
  28. Benefits of using reserve() in a vector – C++
  29. iterator for 2d vector
  30. Checking if all elements of a vector are equal in C++

Leave a Comment