Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
haberman
on May 29, 2012
|
parent
|
context
|
favorite
| on:
Which hashing algorithm is best for uniqueness and...
It won't be a compile-time constant unless your hash table is incapable of resizing. And modulo arithmetic on arbitrary values is
slow
(20-94 cycles of latency on Sandy Bridge).
mseebach
on May 30, 2012
[–]
Hmm, good point. Is that also true for JIT compilers?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: