gtl
google-sparsehash
| gtl | google-sparsehash | |
|---|---|---|
| 5 | 1 | |
| 90 | 17 | |
| - | - | |
| 7.1 | 10.0 | |
| 30 days ago | over 12 years ago | |
| C++ | Shell | |
| Apache License 2.0 | BSD 3-clause "New" or "Revised" 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.
gtl
-
Inside boost::concurrent_flat_map
gtl library author here. Very nice writeup! Reading it made me think, and I believe I know why gtl::parallel_flat_hash_map performs comparatively worse for high-skew scenarios (just pushed a fix in gtl).
-
Boost 1.81 will have boost::unordered_flat_map...
I do this as well in my phmap and gtl implementations. It makes the tables look worse in benchmarks like the above, but prevents really bad surprises occasionally.
-
Comprehensive C++ Hashmap Benchmarks 2022
Thanks a lot for the great benchmark, Martin. Glad you used different hash functions, because I do sacrifice some speed to make sure that the performance of my hash maps doesn't degrade drastically with poor hash functions. Happy to see that my phmap and gtl (the C++20 version) performed well.
-
It is now trivial to cache pure functions with highly efficient, concurrent cache.
This is very easy to do with the latest version of gtl. And it is extremely efficient, as the caching mechanism uses the parallel hashmap, which internally is divided into N submaps each with its own mutex, reducing mutex contention to a minimum.
-
Updating map_benchmarks: Send your hashmaps!
AFAIK sparsepp has been dropped entirely in favor of the containers in GTL: https://github.com/greg7mdp/gtl
google-sparsehash
-
Updating map_benchmarks: Send your hashmaps!
google sparsehash would be interesting to see. From what I understand it's the predecessor to the Abseil containers. Would be nice to see a comparison
What are some alternatives?
eytzinger - Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
fph-table - Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
dense_hash_map - A simple replacement for std::unordered_map
Google Test - GoogleTest - Google Testing and Mocking Framework
qc-hash - Extremely fast unordered map and set library for C++20
flat_hash_map - A very fast hashtable
CppPerformanceBenchmarks
libcudacxx - [ARCHIVED] The C++ Standard Library for your entire system. See https://github.com/NVIDIA/cccl
sparsepp - A fast, memory efficient hash map for C++
hashtable-bench - A benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible