Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
bialpio
on Feb 13, 2019
|
parent
|
context
|
favorite
| on:
Fast Perfect Hashing
It's smaller than the key, but the size of the domain is the number of items you've put in the array.
bialpio
on Feb 13, 2019
[–]
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?
gumby
on Feb 13, 2019
|
parent
[–]
In this degenerate case the "hash function" is base_address+(index*sizeof(memory_address))
bialpio
on Feb 14, 2019
|
root
|
parent
[–]
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.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: