| commit | f65c8cd9722e73ab2e972d0ea12f0ff854cb142d | [log] [tgz] |
|---|---|---|
| author | Damien Miller <djm@google.com> | Wed Apr 04 17:35:25 2018 +1000 |
| committer | Damien Miller <djm@google.com> | Wed Apr 04 17:35:25 2018 +1000 |
| tree | 220779f79e509aa6e71b95ff6bb44b67a8652c8e | |
| parent | 752ec1ce55a27c3de09b94872b0eb6256c67157a [diff] |
Update README.fuchsia Change-Id: Ie90ed8bacf8a213fdc6b692f4f17d8924056b6ad
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