Re:Fast Perfect Hashing
by jnwatson on Wednesday February 13, 2019 @04:20PM
(#19157126)
It is trivial to generate a mostly-randomized bijective mapping of small integers to small integers with an xor and a little byte swapping, which is what the author does with a built-in AES instruction.
The OP's point is that this isn't a particularly interesting problem. The interesting problem is generating efficient bijective mappings of large integers to very small integers.
Re:Fast Perfect Hashing
by derefr on Wednesday February 13, 2019 @06:57PM
(#19158372)
I wasn't attempting to argue the OP's point, merely answering the question posed: "what [is the] value [of randomizing your integer keys] in cases where you know you don't have collisions."
The OP's point is that this isn't a particularly interesting problem. The interesting problem is generating efficient bijective mappings of large integers to very small integers.