News for hackers. Stuff that matters.
Re:Fast Perfect Hashing by bialpio on Wednesday February 13, 2019 @12:34PM (#19154793)
It's smaller than the key, but the size of the domain is the number of items you've put in the array.
Re:Fast Perfect Hashing by bialpio on Wednesday February 13, 2019 @12:37PM (#19154817)
Actually, I might have misunderstood you. In your example, the index in the array is treated like the hash of the item you've put in there, why are we suddenly considering pointers?
Re:Fast Perfect Hashing by gumby on Wednesday February 13, 2019 @01:53PM (#19155598)
In this degenerate case the "hash function" is base_address+(index*sizeof(memory_address))
Re:Fast Perfect Hashing by bialpio on Wednesday February 13, 2019 @07:33PM (#19158595)
Not really, the function is still f(key) = <some number>, the rest is just taking the number and mapping it to the hardware that you're on.