| commit | 752ec1ce55a27c3de09b94872b0eb6256c67157a | [log] [tgz] |
|---|---|---|
| author | Benjamin Lerman <qsr@chromium.org> | Tue Feb 07 10:08:24 2017 +0100 |
| committer | Benjamin Lerman <qsr@chromium.org> | Tue Feb 07 10:08:24 2017 +0100 |
| tree | 081d14ad626af584cc06d7ba38c69147136d0d9f | |
| parent | c872e05d652a39c598f9af447a97c5a9b2d98478 [diff] |
Add BUILD.gn file. Change-Id: I556c51261156e01e9b62d759e0760829e3195c4a
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