Advancing the state of the art for <code>std::unordered_map</code> implementations

• unordered

  10 53 9.2 C++

  Boost.org unordered module

  

I suppose it's possible to meet all the requirements by using a variation of e.g. absl::node_hash_map and retain good performance. But the goal here is not merely good performance; you also need to be faster than the closed addressing implementations. And for instance, on uint64 keys under GCC -O3 I get

• emhash

  2 411 8.1 C++

  Fast and memory efficient c++ flat hash map/set

O(1) iteration is fine in my flat hash map https://github.com/ktprime/emhash/blob/master/hash_table8.hpp

• InfluxDB

  www.influxdata.com featured

  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