Dictionary with custom hash function

General Usage
, ,
7

I am sorry. This is missing a lot of steps for me:

How would the dict be defined?

mydict = Dict{MyKey, String}()
akey = MyKey(10)
mydict[akey] = "foo"

This seems restrictive. Key values need to be integers to convert to UInt. It’s actually slower than a normal dictionary.

I am looking for a simple and faster hashing algorithm for very small dicts (4-10 entries) that are accessed in a very lot loop. The values for each entry will never be changed–this is basically a lookup table. However, my lookup table is actually a dict of dicts. LittleDict proved to be slower than normal dict when nested.

Thanks.