How to choose between map and unordered_map?

by 
                       | map              | unordered_map
---------------------------------------------------------
element ordering       | strict weak      | n/a 
                       |                  |
common implementation  | balanced tree    | hash table
                       | or red-black tree|  
                       |                  |
search time            | log(n)           | O(1) if there are no hash collisions
                       |                  | Up to O(n) if there are hash collisions 
                       |                  | O(n) when hash is the same for any key
                       |                  |     
Insertion time         | log(n)+rebalance | Same as search
                       |                  | 
Deletion time          | log(n)+rebalance | Same as search
                       |                  | 
needs comparators      | only operator <  | only operator ==
                       |                  |
needs hash function    | no               | yes
                       |                  |
common use case        | when good hash is| In most other cases. 
                       | not possible or  | 
                       | too slow. Or when|
                       | order is required|

More Related Contents:

  1. Why is std::map implemented as a red-black tree?
  2. c++ push reference node to stl list
  3. How can I use std::maps with user-defined types as key?
  4. Is there any advantage of using map over unordered_map in case of trivial keys?
  5. Why can’t I compile an unordered_map with a pair as key?
  6. How to retrieve all keys (or values) from a std::map and put them into a vector?
  7. Const map element access
  8. Why does the C++ STL not provide any “tree” containers?
  9. How to find if a given key exists in a C++ std::map
  10. Looking for C++ STL-like vector class but using stack storage
  11. In STL maps, is it better to use map::insert than []?
  12. Is there a way to access the underlying container of STL container adaptors?
  13. Is the order of iterating through std::map known (and guaranteed by the standard)?
  14. std::map emplace without copying value
  15. Relative performance of std::vector vs. std::list vs. std::slist?
  16. A proper way to create a matrix in c++
  17. Efficiency of the STL priority_queue
  18. What is the default hash function used in C++ std::unordered_map?
  19. How does C++ STL unordered_map resolve collisions?
  20. How can I sort an STL map by value?
  21. Is NaN a valid key value for associative containers?
  22. Using std::map where V has no usable default constructor
  23. How can I make the map::find operation case insensitive?
  24. Why can’t I replace std::map with std::unordered_map
  25. error for hash function of pair of ints
  26. How can I copy one map into another using std::copy?
  27. STL map containing references does not compile
  28. Order Statistic Tree in C++
  29. C++ inserting unique_ptr in map
  30. Advantages of std::for_each over for loop

Leave a Comment