| commit | bb3a13cb4378fdafcf365521bca5b3a062b9d856 | [log] [tgz] |
|---|---|---|
| author | Petr Hosek <phosek@google.com> | Tue May 15 20:57:41 2018 -0700 |
| committer | Petr Hosek <phosek@google.com> | Tue May 15 20:57:41 2018 -0700 |
| tree | 5764339477f86d78720f038cf53c67b71c9a99bc | |
| parent | f65c8cd9722e73ab2e972d0ea12f0ff854cb142d [diff] |
Update README.fuchsia Change-Id: Id980958cab4e4f2967cb92402d68d4eb5f200fa6
MurmurHash3 general hash bashed lookup function implementation
MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup. This implementation implements version 3 of MurmurHash.
clib:
$ clib install jwerle/murmurhash.c
source:
$ git clone git@github.com:jwerle/murmurhash.c.git $ cd murmurhash.c $ make $ make install
#include <stdlib.h> #include <string.h> #include <murmurhash.h> int main (void) { uint32_t seed = 0; const char *key = "kinkajou"; uint32_t hash = murmurhash(key, (uint32_t) strlen(key), seed); // 0xb6d99cf8 return 0; }
A command line executable is also available:
$ echo -n kinkajou | murmur 3067714808
$ echo -n panda | murmur --seed=10 1406483717
uint32_t murmurhash (const char *key, uint32_t len, uint32_t seed);
Returns a murmur hash of key based on seed using the MurmurHash3 algorithm.
MIT