|
You are here |
samwho.dev | ||
| | | | |
ticki.github.io
|
|
| | | | | These are my thoughts on designing fast, high-quality non-cryptographic hash functions. | |
| | | | |
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... | |
| | | | |
notes.volution.ro
|
|
| | | | | About the many types of hash functions, their use-cases, dos and don'ts, with suggestions for currently accepted algorithms. | |
| | | | |
emre.me
|
|
| | | A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing associative arrays1 (maps, dictionaries). | ||