sparsepp
dense_hash_map
sparsepp | dense_hash_map | |
---|---|---|
4 | 1 | |
1,230 | 36 | |
- | - | |
1.1 | 0.0 | |
about 1 year ago | over 2 years ago | |
C++ | C++ | |
GNU General Public License v3.0 or later | MIT License |
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.
sparsepp
-
Updating map_benchmarks: Send your hashmaps!
Also, I'm testing https://github.com/greg7mdp/sparsepp which is based on google's sparsehash
-
Who here is ready to see some 64MB blocks on mainnet?
Hey thanks for the mention /u/jtoomim. I see that you used sparsepp in CoinsViewCache. A phmap::flat_hash_map would probably be similar for memory usage, but likely faster (because of parallel lookup with SSE instructions and contiguous memory storage in one array).
dense_hash_map
-
Updating map_benchmarks: Send your hashmaps!
https://github.com/Jiwan/dense_hash_map is also a good flat hash map.
What are some alternatives?
PEGTL - Parsing Expression Grammar Template Library
flat_hash_map - A very fast hashtable
Inja - A Template Engine for Modern C++
google-sparsehash - Clone of google-sparsehash
Hashmaps - Various open addressing hashmap algorithms in C++
qc-hash - Extremely fast unordered map and set library for C++20
LSHBOX - A c++ toolbox of locality-sensitive hashing (LSH), provides several popular LSH algorithms, also support python and matlab.
eytzinger - Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
dynamic_bitset - Simple Useful Libraries: C++17/20 header-only dynamic bitset
hashtable-bench - A benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible
Optional Argument in C++ - Named Optional Arguments in C++17
fph-table - Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup