|
You are here |
samwho.dev | ||
| | | | |
blog.demofox.org
|
|
| | | | | Hash tables are great in that you can hash a key and then use that hash as an index into an array to get the information associated with that key. That is very fast, so long as you use a fast hash function. The story doesn't end there though because hash functions can have collisions... | |
| | | | |
ticki.github.io
|
|
| | | | | These are my thoughts on designing fast, high-quality non-cryptographic hash functions. | |
| | | | |
randorithms.com
|
|
| | | | | If you want to observe a hash function in the wild, all you need to do is look under the hood of the nearest key-value store. Hashing is a fundamentally simp... | |
| | | | |
www.integralist.co.uk
|
|
| | | |||