A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion

• unordered_dense

  12 730 7.1 C++

  A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion

• robin-hood-hashing

  23 1,465 0.0 C++

  Discontinued Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20

The implementation is mostly inspired by this comment and lessons learned from my older robin-hood-hashing hashmap.

• WorkOS

  workos.com sponsored

  The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

  

• STC

  89 1,104 9.2 C

  A modern, user friendly, generic, type-safe and fast C99 container library: String, Vector, Sorted and Unordered Map and Set, Deque, Forward List, Smart Pointers, Bitset and Random numbers. (by stclib)

  

Yes, great to see this compact implementation! I will add it to my STC cmap benchmark.

• hashtable-benchmarks

  8 29 4.7 Java

  An Evaluation of Linear Probing Hashtable Algorithms

I will probably never get around to porting my bidirectional linear probing integer hash set from Java to C++, but I hope someone can try adapting BLP to general C++ hashmaps and hashsets, because it significantly outperforms Robin Hood in my benchmarks.

• flat_hash_map

  10 1,677 0.0 C++

  A very fast hashtable

When int64 is the key, then the winner remains the unorder map from Malte Skarupke if (and only if) associated with a custom allocator.

• InfluxDB

  www.influxdata.com sponsored

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

Suggest a related project