Is there any advantage of using map over unordered_map in case of trivial keys?

by

Don’t forget that map keeps its elements ordered. If you can’t give that up, obviously you can’t use unordered_map.

Something else to keep in mind is that unordered_map generally uses more memory. map just has a few house-keeping pointers, and memory for each object. Contrarily, unordered_map has a big array (these can get quite big in some implementations), and then additional memory for each object. If you need to be memory-aware, map should prove better, because it lacks the large array.

So, if you need pure lookup-retrieval, I’d say unordered_map is the way to go. But there are always trade-offs, and if you can’t afford them, then you can’t use it.

Just from personal experience, I found an enormous improvement in performance (measured, of course) when using unordered_map instead of map in a main entity look-up table.

On the other hand, I found it was much slower at repeatedly inserting and removing elements. It’s great for a relatively static collection of elements, but if you’re doing tons of insertions and deletions the hashing + bucketing seems to add up. (Note, this was over many iterations.)

More Related Contents:

  1. Why can’t I compile an unordered_map with a pair as key?
  2. Why is std::unordered_map slow, and can I use it more effectively to alleviate that?
  3. How to choose between map and unordered_map?
  4. What is the fastest way to change a key of an element inside std::map
  5. Is NaN a valid key value for associative containers?
  6. Hashtable in C++?
  7. How to overload std::swap()
  8. Why does C++ compilation take so long?
  9. Why is std::map implemented as a red-black tree?
  10. How std::unordered_map is implemented
  11. Fastest way to determine if an integer is between two integers (inclusive) with known sets of values
  12. Efficient way of storing Huffman tree
  13. How do exceptions work (behind the scenes) in c++
  14. Is the order of iterating through std::map known (and guaranteed by the standard)?
  15. Does a C++11 range-based for loop condition get evaluated every cycle?
  16. Super high performance C/C++ hash map (table, dictionary) [closed]
  17. linux perf: how to interpret and find hotspots
  18. Is there a 128 bit integer in C++?
  19. What is the Fastest Method for High Performance Sequential File I/O in C++?
  20. C++ cout printing slowly
  21. Fastest way to get a positive modulo in C/C++
  22. Do c++ templates make programs slow?
  23. Using std::map where V has no usable default constructor
  24. How can I make the map::find operation case insensitive?
  25. Benefits of using reserve() in a vector – C++
  26. error for hash function of pair of ints
  27. Which is faster/preferred: memset or for loop to zero out an array of doubles?
  28. Is it possible to implement lock free map in C++
  29. C++ Serialization Performance
  30. Why is pow(int, int) so slow?

Leave a Comment