Using C++ vector::insert() to add to end of vector

by

a.push_back(x) is defined to have identical semantics to (void)a.insert(a.end(),x) for sequence containers that support it.

See table 68 in ISO/IEC 14882:2003 23.1.1/12 [lib.sequence.reqmts].

Screenshot of Table 68 taken from International Standard ISO/IEC 14882:2003 at https://cs.nyu.edu/courses/fall11/CSCI-GA.2110-003/documents/c++2003std.pdf

Regarding the running time of vector.push_back(x) vs. vector.insert(vector.end(), x) consider the emphasized part:

Table 68 lists sequence operations that are provided for some types of sequential containers but not others. An implementation shall provide these operations for all container types shown in the ‘‘container’’ column, and shall implement them so as to take amortized constant time.

Related Contents:

  1. Sorting a vector in descending order
  2. C++ STL Vectors: Get iterator from index?
  3. What is the difference between cbegin and begin for vector?
  4. What happens if you increment an iterator that is equal to the end iterator of an STL container
  5. What’s the benefit of std::back_inserter over std::inserter?
  6. Convert iterator to pointer?
  7. What’s faster, iterating an STL vector with vector::iterator or with at()?
  8. Appending a vector to a vector [duplicate]
  9. Why can’t I make a vector of references?
  10. Best way to extract a subvector from a vector?
  11. What’s the most efficient way to erase duplicates and sort a vector?
  12. C++ Erase vector element by value rather than by position? [duplicate]
  13. vector vs. list in STL
  14. Why use iterators instead of array indices?
  15. Is std::vector so much slower than plain arrays?
  16. How to initialize std::vector from C-style array?
  17. Why are Standard iterator ranges [begin, end) instead of [begin, end]?
  18. How do I reverse a C++ vector?
  19. What does iterator->second mean?
  20. what is the difference between const_iterator and iterator? [duplicate]
  21. Why isn’t vector a STL container?
  22. Iterating C++ vector from the end to the beginning
  23. How to navigate through a vector using iterators? (C++)
  24. C++ convert vector to vector
  25. Why is it OK to return a ‘vector’ from a function?
  26. Alternative to vector
  27. How to iterate through a list of objects in C++?
  28. Vector erase iterator
  29. What is an iterator’s default value?
  30. How to avoid memory leaks when using a vector of pointers to dynamically allocated objects in C++?
  31. iterate vector, remove certain items as I go
  32. How to use an iterator?
  33. C++ std::vector emplace vs insert [duplicate]
  34. Replace an element into a specific position of a vector
  35. How do I sort a std::vector by the values of a different std::vector? [duplicate]
  36. Why no emplacement iterators in C++11 or C++14?
  37. Is it safe to assume that STL vector storage is always contiguous?
  38. How to remove constness of const_iterator?
  39. Is there a sorted container in the STL?
  40. Resizing a C++ std::vector without initializing data [duplicate]
  41. std::vector, default construction, C++11 and breaking changes
  42. array vs vector vs list
  43. Does vector::erase() on a vector of object pointers destroy the object itself?
  44. Types of iterator : Output vs. Input vs. Forward vs. Random Access Iterator
  45. Cleaning up an STL list/vector of pointers
  46. Multiply vector elements by a scalar value using STL
  47. How are iterators and pointers related?
  48. C++ vector that *doesn’t* initialize its members?
  49. Will a call to std::vector::clear() set std::vector::capacity() to zero?
  50. std::vector reserve() and push_back() is faster than resize() and array index, why?

Leave a Comment