/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

samwho.dev
| | ticki.github.io
2.1 parsecs away

Travel
| | These are my thoughts on designing fast, high-quality non-cryptographic hash functions.
| | blog.demofox.org
2.2 parsecs away

Travel
| | 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
1.9 parsecs away

Travel
| | About the many types of hash functions, their use-cases, dos and don'ts, with suggestions for currently accepted algorithms.
| | emre.me
17.5 parsecs away

Travel
| 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).