-/* This is the public domain lookup3 hash by Bob Jenkins from
- * http://burtleburtle.net/bob/c/lookup3.c, modified for style. */
-
-#define HASH_ROT(x, k) (((x) << (k)) | ((x) >> (32 - (k))))
-
-#define HASH_MIX(a, b, c) \
- do { \
- a -= c; a ^= HASH_ROT(c, 4); c += b; \
- b -= a; b ^= HASH_ROT(a, 6); a += c; \
- c -= b; c ^= HASH_ROT(b, 8); b += a; \
- a -= c; a ^= HASH_ROT(c, 16); c += b; \
- b -= a; b ^= HASH_ROT(a, 19); a += c; \
- c -= b; c ^= HASH_ROT(b, 4); b += a; \
- } while (0)
-
-#define HASH_FINAL(a, b, c) \
- do { \
- c ^= b; c -= HASH_ROT(b, 14); \
- a ^= c; a -= HASH_ROT(c, 11); \
- b ^= a; b -= HASH_ROT(a, 25); \
- c ^= b; c -= HASH_ROT(b, 16); \
- a ^= c; a -= HASH_ROT(c, 4); \
- b ^= a; b -= HASH_ROT(a, 14); \
- c ^= b; c -= HASH_ROT(b, 24); \
- } while (0)
-
-uint32_t hash_words(const uint32_t *, size_t n_word, uint32_t basis);
-uint32_t hash_2words(uint32_t, uint32_t);
-uint32_t hash_3words(uint32_t, uint32_t, uint32_t);