[Haskell-cafe] Re: Optimizing a hash function

[apfelmus at quantentunnel.de]

> Yesterday evening I had a go at porting Bob Jenkins' hash function
> (http://www.burtleburtle.net/bob/c/lookup3.c) to Haskell.

If you need hash functions, I hope that you don't need them to become a
hash table necromancer: this dark data structure simply does not fit
well into Haskell. Tries are a better alternative:

  Ralf Hinze. Generalizing generalized tries. Journal of Functional
  Programming, 10(4):327-351, July 2000
  http://www.informatik.uni-bonn.de/~ralf/publications/GGTries.ps.gz

Otherwise, take care to conduct hash experiments inside Otiluke's
Resilient Sphere only.

Regards,
apfelmus