Super high performance C/C++ hash map (table, dictionary) [closed]

by

I would recommend you to try Google SparseHash (or the C11 version Google SparseHash-c11) and see if it suits your needs. They have a memory efficient implementation as well as one optimized for speed.
I did a benchmark a long time ago, it was the best hashtable implementation available in terms of speed (however with drawbacks).

More Related Contents:

  1. Hashtable in C++?
  2. c++ push reference node to stl list
  3. hash function for string
  4. Is there any advantage of using map over unordered_map in case of trivial keys?
  5. Why does the C++ map type argument require an empty constructor when using []?
  6. A std::map that keep track of the order of insertion?
  7. Why is std::map implemented as a red-black tree?
  8. How std::unordered_map is implemented
  9. Tuples( or arrays ) as Dictionary keys in C#
  10. .NET HashTable Vs Dictionary – Can the Dictionary be as fast?
  11. In STL maps, is it better to use map::insert than []?
  12. Is the order of iterating through std::map known (and guaranteed by the standard)?
  13. What is the default constructor for C++ pointer?
  14. Is hash_map part of the STL?
  15. C++ Loop through Map
  16. How to choose between map and unordered_map?
  17. What is the best way to use a HashMap in C++?
  18. Is NaN a valid key value for associative containers?
  19. Using std::map where V has no usable default constructor
  20. How can I make the map::find operation case insensitive?
  21. What would a std::map extended initializer list look like?
  22. Find mapped value of map
  23. Why Can’t I store references in a `std::map` in C++?
  24. Is it possible to map string to int faster than using hashmap?
  25. How can I copy one map into another using std::copy?
  26. Compile-time map and inverse map values
  27. Is it possible to implement lock free map in C++
  28. Hashtable to Dictionary syncroot .
  29. STL map containing references does not compile
  30. C++ “error: passing ‘const std::map’ as ‘this’ argument of …”

Leave a Comment