v1.1.0

Direct download: unordered_dense.h

What's Changed

• [fix] Add a missing reserve() call by @jcelerier in #15
• custom bucket types: now up to 2^64 entries are possible by @martinus in #17
• Check for at least C++17 and show an error if not
• Change bucket access from pointers to index - this is a bit faster in my benchmarks
• nonstandard API: extract() and values()

New Contributors

• @jcelerier made their first contribution in #15

Full Changelog: v1.0.2...v1.1.0

v1.0.2

Direct download: unordered_dense.h

This adds fuzzing ability, and fixes 2 bugs found with the fuzzer!
As far as I can say the implementation is now rock solid.

What's Changed

• fix #7 add API fuzzer by @martinus in #9

Full Changelog: v1.0.1...v1.0.2

v1.0.1

Direct download: unordered_dense.h

What's Changed

• Build with MSVC by @martinus in #3
• Fixed being slow in MSVC: now on par or faster than robin_hood (except deleting elements)

New Contributors

• @martinus made their first contribution in #3

Full Changelog: v1.0.0...v1.0.1

v1.0.0

Direct download: unordered_dense.h

First public release!

• Supports most of std::unordered_map and std::unordered_set API
• All operations are fast, in the same ballpark as absl::flat_hash_map.
• Densely stored, so iteration speed is blazing fast: you'll get std::vector iterators
• 100% test coverage