Data.PerfectHash.Hashing

Implements the specialized hash function for this perfect hashing algorithm.

Documentation

primeFNV :: Int

This choice of prime number was taken from the Python implementation on Steve Hanov's page.

hash

Arguments

:: ToHashableChunks a

=> Int

nonce

-> a

key

-> Int

Uses the "FNV-1a" algorithm from the FNV website:

hash = offset_basis
for each octet_of_data to be hashed
        hash = hash xor octet_of_data
        hash = hash * FNV_prime
return hash

The interface is comparable to the hashWithSalt function from the hashable package.