How can I copy one map into another using std::copy?

by

You can use GMan’s answer — but the question is, why do you want to use std::copy? You should use the member function std::map<k, v>::insert instead.

m2.insert(m1.begin(), m1.end());

More Related Contents:

  1. c++ push reference node to stl list
  2. How can I use std::maps with user-defined types as key?
  3. Why use iterators instead of array indices?
  4. Why are Standard iterator ranges [begin, end) instead of [begin, end]?
  5. What happens if you call erase() on a map element while iterating from begin to end?
  6. Const map element access
  7. How to find if a given key exists in a C++ std::map
  8. Removing item from vector while iterating?
  9. In STL maps, is it better to use map::insert than []?
  10. Why use non-member begin and end functions in C++11?
  11. Sorting a vector in descending order
  12. std::map emplace without copying value
  13. What is the difference between const_iterator and non-const iterator in the C++ STL?
  14. Custom Iterator in C++
  15. how portable is end iterator decrement?
  16. Can std::begin work with array parameters and if so, how?
  17. std::vector iterator invalidation
  18. How do you copy the contents of an array to a std::vector in C++ without looping?
  19. Checking if an iterator is valid
  20. How does std::copy work with stream iterators
  21. Can raw pointers be used instead of iterators with STL algorithms for containers with linear storage?
  22. How to remove constness of const_iterator?
  23. Copying std::vector: prefer assignment or std::copy?
  24. Do STL iterators guarantee validity after collection was changed?
  25. Incrementing iterators: Is ++it more efficient than it++? [duplicate]
  26. what is the difference between const_iterator and iterator? [duplicate]
  27. iterator for 2d vector
  28. Insert into an STL queue using std::copy
  29. STL map containing references does not compile
  30. C++ inserting unique_ptr in map

Leave a Comment