hashtable-bench
A benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible (by renzibei)
dense_hash_map
A simple replacement for std::unordered_map (by Jiwan)
| hashtable-bench | dense_hash_map | |
|---|---|---|
| 1 | 1 | |
| 12 | 36 | |
| - | - | |
| 1.7 | 0.0 | |
| 12 months ago | over 2 years ago | |
| Jupyter Notebook | C++ | |
| - | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
hashtable-bench
Posts with mentions or reviews of hashtable-bench.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-06-16.
-
Updating map_benchmarks: Send your hashmaps!
I believe that when the number of elements is larger than 4 (a rough estimation), the associative linear table won't be faster than ska::flat_hash_map or fph-table with the identity hash function. If you look at the benchmark results, you will find that the average lookup time may well be less than 2 nanoseconds when item number is smaller than one thousand on morden CPUs. For these two hash tables, there are only about ten instructions in the critical path of lookup. And this should be faster than the linear search in a associative table, where there are a lot of branches and comparing instructions. However, you should benchmark it youself to get the real conclusion. This is just a simple analysis on paper from mine. By the way, the associative table can be faster if it is implemented with hardware circuits or SIMD instructions.
dense_hash_map
Posts with mentions or reviews of dense_hash_map.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-06-16.
-
Updating map_benchmarks: Send your hashmaps!
https://github.com/Jiwan/dense_hash_map is also a good flat hash map.
What are some alternatives?
When comparing hashtable-bench and dense_hash_map you can also consider the following projects:
eytzinger - Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
flat_hash_map - A very fast hashtable
CppPerformanceBenchmarks
google-sparsehash - Clone of google-sparsehash
gtl - Greg's Template Library of useful classes.
qc-hash - Extremely fast unordered map and set library for C++20
llvm-project - The LLVM Project is a collection of modular and reusable compiler and toolchain technologies.
sparsepp - A fast, memory efficient hash map for C++
fph-table - Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
hashtable-bench vs eytzinger
dense_hash_map vs flat_hash_map
hashtable-bench vs CppPerformanceBenchmarks
dense_hash_map vs google-sparsehash
hashtable-bench vs gtl
dense_hash_map vs qc-hash
hashtable-bench vs llvm-project
dense_hash_map vs sparsepp
hashtable-bench vs qc-hash
dense_hash_map vs eytzinger
hashtable-bench vs fph-table
dense_hash_map vs fph-table