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.

class ToNumeric a where

A Foldable of any data type may be hashed, so long as it implements an instance of this class.

Minimal complete definition

toNum

Methods

toNum :: a -> Int

Instances

ToNumeric Char

The numeric value of a character is simply its ordinal value.

Methods

toNum :: Char -> Int

ToNumeric Int

Methods

toNum :: Int -> Int

hash :: (Foldable f, ToNumeric a) => Int -> f a -> 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.