-
I recently did the work to pull boost::unordered out of the rest of boost and make it standalone for one of my own projects. I figured I'd link it here too in case it was useful to someone: https://github.com/MikePopoloski/boost_unordered
-
CodeRabbit
CodeRabbit: AI Code Reviews for Developers. Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.
-
robin-hood-hashing
Discontinued Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
Also, FYI there is robin_hood::unordered_{map,set} which has very high performance, and is header-only and standalone.
-
unordered_dense
A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
That's deprecated. Use https://github.com/martinus/unordered_dense instead And yes, tell use if it's any better(it should)
Related posts
-
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
-
If this isn't the perfect data structure, why?
-
Solving “Two Sum” in C with a tiny hash table
-
Convenient Containers v1.0.3: Better compile speed, faster maps and sets