std::vector, default construction, C++11 and breaking changes

by

Does the C++03 standard mandate that std::vector must have a constructor defined as above, i.e. with a default argument? In particular is there a guarantee that the entries of the vector object get copied instead of default constructed?

Yes, the specified behavior is that x is copied n times so that the container is initialized to contain with n elements that are all copies of x.

What does the C++11 Standard say about this same point?

In C++11 this constructor has been turned into two constructors.

vector(size_type n, const T& x, const Allocator& = Allocator()); // (1)
explicit vector(size_type n);                                    // (2)

Except for the fact that it no longer has a default argument for the second parameter, (1) works the same way as it does in C++03: x is copied n times.

In lieu of the default argument for x, (2) has been added. This constructor value-initializes n elements in the container. No copies are made.

If you require the old behavior, you can ensure that (1) is called by providing a second argument to the constructor invocation:

std::vector<S> v(42, S());

I see this as a possibility for a breaking change between C++03 and C++11. I see this as a possibility for a breaking change between C++03 and C++11. Has this issue been investigated? Solved?

Yes, as your example demonstrates, this is indeed a breaking change.

As I am not a member of the C++ standardization committee (and I haven’t paid particularly close attention to library-related papers in the mailings), I don’t know to what degree this breaking change was discussed.

More Related Contents:

  1. Can std::vector emplace_back copy construct from an element of the vector itself?
  2. How to Systematically use each item in a Vector [closed]
  3. Thou shalt not inherit from std::vector
  4. What’s the most efficient way to erase duplicates and sort a vector?
  5. vector vs. list in STL
  6. How do I sort a std::vector by the values of a different std::vector?
  7. Why can’t simple initialize (with braces) 2D std::array? [duplicate]
  8. Is it safe to assume that STL vector storage is always contiguous?
  9. Is the size of std::array defined by standard
  10. How to get std::vector pointer to the raw data?
  11. Efficient way of reading a file into an std::vector?
  12. Looking for C++ STL-like vector class but using stack storage
  13. Why is the C++ initializer_list behavior for std::vector and std::array different?
  14. How to initialize std::vector from C-style array?
  15. Appending a vector to a vector [duplicate]
  16. Sorting a vector in descending order
  17. std::map emplace without copying value
  18. Why is it OK to return a ‘vector’ from a function?
  19. Is the use of std::vector objects in C++ acceptable, or should I use an alternative?
  20. std::optional specialization for reference types
  21. Sorting a std::vector by the string?
  22. Cleaning up an STL list/vector of pointers
  23. How do I erase elements from STL containers?
  24. What happens when you call data() on a std::vector?
  25. Vector Iterators Incompatible
  26. Why can’t I replace std::map with std::unordered_map
  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. C++11 std::to_string(double) – No trailing zeros

Leave a Comment