search

martinus / unordered_dense

A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
MIT License
898 stars 72 forks source link

Provide high quality & fast hash implementations for std::tuple and std::pair #101

Closed martinus closed 9 months ago

martinus commented 9 months ago

Instead of sequentially hashing one element after the other, this puts all data into a temporary std::array and hashes this buffer. The compiler can see through all of that and produce highly optimized code.