Concatenating two std::vectors

by 
vector1.insert( vector1.end(), vector2.begin(), vector2.end() );

More Related Contents:

  1. How to cheaply assign C-style array to std::vector?
  2. How do I print out the contents of a vector?
  3. Thou shalt not inherit from std::vector
  4. How do I print out the contents of a vector?
  5. What’s the most efficient way to erase duplicates and sort a vector?
  6. std::vector::resize() vs. std::vector::reserve()
  7. Is std::vector so much slower than plain arrays?
  8. vector vs. list in STL
  9. How do I erase an element from std::vector by index?
  10. How to get std::vector pointer to the raw data?
  11. C++ Erase vector element by value rather than by position? [duplicate]
  12. Looking for C++ STL-like vector class but using stack storage
  13. Appending a vector to a vector [duplicate]
  14. Sorting a vector in descending order
  15. How do I print the elements of a C++ vector in GDB?
  16. Why is it OK to return a ‘vector’ from a function?
  17. What’s faster, iterating an STL vector with vector::iterator or with at()?
  18. vector::at vs. vector::operator[]
  19. Is the use of std::vector objects in C++ acceptable, or should I use an alternative?
  20. Sorting a std::vector by the string?
  21. array vs vector vs list
  22. Cleaning up an STL list/vector of pointers
  23. Converting between C++ std::vector and C array without copying
  24. std::vector reserve() and push_back() is faster than resize() and array index, why?
  25. std::vector resize downward
  26. Vector Iterators Incompatible
  27. Why the libc++ std::vector internally keeps three pointers instead of one pointer and two sizes?
  28. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  29. STL vectors with uninitialized storage?
  30. “Right” way to deallocate an std::vector object

Leave a Comment