flurrything

10 ms·

1. 31.▲
   by flurrything 8y ago

   The secondary hash must primarily be good at mapping the hashed value into a slot: that is, be as cheap as possible (ideally 0 cycles, fib hashing is ~5 cycles) if the primary hash was good while preventing catastrophic performance if the p
2. 32.▲
   by flurrything 8y ago

   The whole point of fibonacci hashing is making hash tables more resistant to bad hash functions. Expecting everybody to be using the perfect hash function for each case is extremely naive, and even then, it just takes somebody else refactor
3. 33.▲
   by flurrything 9y ago

   That link is broken, but if it's the paper I think it is, the key result is that you can extend safe Rust with safe components that do use `unsafe` as long as you are able to prove these components to be sound. The same is not true of