About Lookup3

◄ Previous: Tutorials

lookup3.c, by Bob Jenkins, May 2006, Public Domain. These are functions for producing 32-bit hashes for hash table lookup. hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final() are externally useful functions. Routines to test the hash are included if SELF_TEST is defined. You can use this free for any purpose. It's in the public domain. It has no warranty. You probably want to use hashlittle(). hashlittle() and hashbig() hash byte arrays. hashlittle() is is faster than hashbig() on little-endian machines. Intel and AMD are little-endian machines. On second thought, you probably want hashlittle2(), which is identical to hashlittle() except it returns two 32-bit hashes for the price of one.
You could implement hashbig2() if you wanted but I haven't bothered . -by Bob Jenkins

About lookup3.h

the header file exposes hashlittle , hashlittle2 and hashbig from the lookup3.c file made by Bob Jenkins So more information about them and what the original creator document for each function are documented at lookup3.h

How to:

To Start using lookup3.h add this include

#include <SNF/lookup3.h>