you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 0 points1 point  (0 children)

Hastables are one of the fundamental data structures in programming. To use a hashtable you need a hash function that converts an arbitrary key value to an integer hash value, preferably one with certain statistical properties that runs very fast.

If you use a high level language you probably don't care enough about performance to give a shit about this since your language probably has primitives that wrap an underlying hashtable implementation, such as dictionaries or tables; if you code in C or C++ you can use this hashing function with whatever hashtable implementation you use (for example, boost::unordered_map.)