hashing function taking a seed

martinus / robin-hood-hashing

Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20

https://gitter.im/martinus/robin-hood-hashing

MIT License

1.5k stars 142 forks source link

Closed MathieuDutSik closed 2 years ago

MathieuDutSik commented 3 years ago

There are several use case where having a hash function that takes a seed as input makes sense:

Suppose we use a hash function for partitioning a set and a unordered_map for storing them. In that case you want different seeds being used.
We may want to compute hash iteratively. An example of such scenario is when the data is not serialized as a single void const* ptr, size_t len.

What do you think?

martinus commented 2 years ago

I don't think this should be part of robin_hood hash, but you can easily create your own wrapper that uses a seed.