At Mon, 12 May 2014 12:05:45 +0200,
Justus Winter wrote:
>
> Use an integer hash function to derive the index from the key. This
> should reduce the number of collisions.
>
> * libihash/ihash.c (hash_int32): New function.
> (find_index): Use hash_int32 on the key to derive the index.
> (add_one): Likewise.
> ---
> libihash/ihash.c | 23 +++++++++++++++++++++--
> 1 file changed, 21 insertions(+), 2 deletions(-)
>
> diff --git a/libihash/ihash.c b/libihash/ihash.c
> index d670fee..1de4c35 100644
> --- a/libihash/ihash.c
> +++ b/libihash/ihash.c
> @@ -81,6 +81,25 @@ static const unsigned int ihash_nsizes = (sizeof
> ihash_sizes
> / sizeof ihash_sizes[0]);
>
>
> +/* Integer hashing follows Thomas Wang's paper about his 32/64-bits
> + mix functions :
> + - http://www.concentric.net/~Ttwang/tech/inthash.htm */
This URL is not valid ("ttwang.cnc.net Not Available. The domain
ttwang.cnc.net which you are trying to access is currently
unavailable..."). Do you have a more stable URL? At least mention
the name of the paper.
:) Neal
