| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
|
|
|
| |
The hash implementation was taken from the GitHub project below
where it was released into the public domain. MurmurHash3 should be
faster and less complex than the Lookup3 hash it replaces.
* https://github.com/aappleby/smhasher
Signed-off-by: Paul Moore <paul@paul-moore.com>
|
|
|
|
|
| |
Reported-by: Brian Cain <brian.cain@gmail.com>
Signed-off-by: Paul Moore <pmoore@redhat.com>
|
|
|
|
|
|
|
| |
Style improvements as well as a wrapper function to select the "best"
hash for a given situation. Some unused functions were also removed.
Signed-off-by: Paul Moore <pmoore@redhat.com>
|
|
|
|
|
|
|
|
| |
There is still a lot of style/formatting work that should probably
be done to this file, but this cleans it up enough so it passes our
basic style checks.
Signed-off-by: Paul Moore <pmoore@redhat.com>
|
|
Add Bob Jenkin's lookup3.c hash implementation and clean it up ever so
slightly for our use.
This is the license attached to the hashing implementation:
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.
Source link (February 6th, 2012):
http://burtleburtle.net/bob/c/lookup3.c
Signed-off-by: Paul Moore <pmoore@redhat.com>
|