MinimalPerfectHash.jl

CHD{K, V}(iter; max_collision=16777216, gamma=1.25, check_duplicates=true)

CHD(iter) construct a minmal perfect hash dictionary CHD of the values generated by the given iterable object.

chd_keyindex(chd::CHD{K, V}, key::K)

Get the index of the key in chd. Returns -1 if not found.