unordered
| ktprime-emhash | unordered | |
|---|---|---|
| 1 | 10 | |
| - | 53 | |
| - | - | |
| - | 9.2 | |
| - | 2 days ago | |
| C++ | ||
| - | Boost Software License 1.0 |
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.
ktprime-emhash
unordered
-
Effortless Performance Improvements in C++: std::unordered_map
We added two new benchmarks to Boost.Unordered, word_count and word_size, and the second one ends up testing a small hash table (114 elements in 64 bit, even fewer in 32 bit because we use a smaller input file there.)
-
Inside boost::unordered_flat_map
Hi, we have seen similar gains with __forceinline in MSVC, looks like this compiler is not particularly aggressive at inlining. Could you please file an issue at Boost.Unordered repo so what we don't forget? Thank you
-
Boost 1.81 will have boost::unordered_flat_map...
You can request a feature be added by opening an issue in https://github.com/boostorg/unordered.
-
boost::unordered map is a new king of data structures
Here are the results of our uint32.cpp synthetic benchmark under VS2022 Release x64:
-
Advancing the state of the art for <code>std::unordered_map</code> implementations
You can run these benchmarks yourself from the Boost develop branch, they are in the Unordered repo. Since Unordered is header-only, there should be need to build Boost but you do need to bootstrap and then run b2 headers to create the symlinks in boost/.
-
New Boost.Unordered containers have BIG improvements!
Make sure you checkout the preview.md for instructions on how to build nightly Boost in a way that's non-intrusive to your system and works with CMake.
What are some alternatives?
unordered_dense - A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
flat_hash_map - A very fast hashtable
robin-hood-hashing - Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
FetchBoostContent - CMake FetchContent for Boost libraries
robin-map - C++ implementation of a fast hash map and hash set using robin hood hashing
hashtable-benchmarks - An Evaluation of Linear Probing Hashtable Algorithms
Hopscotch map - C++ implementation of a fast hash map and hash set using hopscotch hashing
boostdep - A tool to create Boost module dependency reports
emhash - Fast and memory efficient c++ flat hash map/set
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.