unordered_dense
A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion (by martinus)
unordered
Boost.org unordered module (by boostorg)
| unordered_dense | unordered | |
|---|---|---|
| 12 | 10 | |
| 730 | 53 | |
| - | - | |
| 7.1 | 9.2 | |
| 24 days ago | 3 days ago | |
| C++ | C++ | |
| MIT License | Boost Software License 1.0 |
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.
unordered_dense
Posts with mentions or reviews of unordered_dense.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-07-09.
- unordered_dense: A Fast & Densely Stored Hashmap And Hashset Based On Robin-Hood Backward Shift Deletion
- unordered_dense: A fast, densely stored hashmap based on backward shift deletion
-
boost::unordered standalone
That's deprecated. Use https://github.com/martinus/unordered_dense instead And yes, tell use if it's any better(it should)
-
Is there an accepted way to order qualifiers?
No, I've deprecated it because the code has become a mess, I rewrote it quite differently and with much higher code quality and more features here: https://github.com/martinus/unordered_dense
-
Effortless Performance Improvements in C++: std::unordered_map
When no ordering is necessary and the number of elements is larger than 20, nothing beats https://github.com/martinus/unordered_dense (for general use).
-
Effortless Performance Improvements in C++: std:unordered_map
https://github.com/martinus/unordered_dense
Check this one out, it's a successor to this idea. Boost also introduced a very performant flat_hash_map in 1.81
-
Fuzzing is Cool, Actually
I have an API fuzz test for a hash map here: https://github.com/martinus/unordered_dense/blob/main/test/fuzz/api.cpp
-
A container with set interface based on std::vector
That sounds a bit like ankerl::unordered_dense::set: https://github.com/martinus/unordered_dense
- Inside boost::unordered_flat_map
- martinus/unordered_dense v1.4.0: A fast & densely stored hashmap, Now with heterogeneous overloads
unordered
Posts with mentions or reviews of unordered.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-02.
-
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?
When comparing unordered_dense and unordered you can also consider the following projects:
robin-map - C++ implementation of a fast hash map and hash set using robin hood hashing
flat_hash_map - A very fast hashtable
STC - A modern, user friendly, generic, type-safe and fast C99 container library: String, Vector, Sorted and Unordered Map and Set, Deque, Forward List, Smart Pointers, Bitset and Random numbers.
FetchBoostContent - CMake FetchContent for Boost libraries
robin-hood-hashing - Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
Hopscotch map - C++ implementation of a fast hash map and hash set using hopscotch hashing
boostdep - A tool to create Boost module dependency reports
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
emhash - Fast and memory efficient c++ flat hash map/set
hashtable-benchmarks - An Evaluation of Linear Probing Hashtable Algorithms
unordered_dense vs robin-map
unordered vs flat_hash_map
unordered_dense vs STC
unordered vs FetchBoostContent
unordered_dense vs robin-hood-hashing
unordered vs Hopscotch map
unordered_dense vs flat_hash_map
unordered vs boostdep
unordered_dense vs parallel-hashmap
unordered vs emhash
unordered_dense vs hashtable-benchmarks
unordered vs robin-map