Why Hashbrown Does a Double Lookup

Re:Why Hashbrown Does a Double Lookup by barrkel on Wednesday March 20, 2019 @06:34PM (#19447699)

The key is usually indirected, which means a pointer, which is usually bigger than the hash code.

(And of course you could use parallel arrays if you're super concerned about cache lines, though the tradeoffs would very much depend on whether hash misses or hits are the expected mode.)

[ Parent | on HN ]

Re:Why Hashbrown Does a Double Lookup by senderista on Wednesday March 20, 2019 @06:48PM (#19447775)

And if it’s not a pointer but a word-size integer, just use an invertible hash function (aka permutation aka block cipher) so you can store the hash code in place of the key :)

[ Parent | on HN ]