In a tight loop (50-100ns/cycle) I am using a dict filled with randomly generated UInt64 keys. I think that they could be used directly in a hashmap, without hashing, so I am looking for a hashmap with a custom (here the identity) hash function. I hope to gain 2.5ns per cycle: julia> @btime hash(…

[image] tisztamo: I was not able to quickly find a package that allows that. Is there any? Just wrap your keys in a new type: struct MyKey val::UInt end Base.hash(a::MyKey, h::UInt) = xor(a.val, h) Base.(==)(a::MyKey, b::MyKey) = a.val == b.val

Dictionary with custom hash function

General Usage

stevengj Split this topic November 23, 2023, 1:37pm 8

3 posts were split to a new topic: Trouble defining hash/isequal for an interval type

Topic		Replies	Views
Custom hash function in dict is very slow? Performance	3	913	April 20, 2021
`getindex` function for a `Dict{X,Int}` with keys of custom type `X` behaves not as expected : keys not found New to Julia dictionary	3	1239	July 30, 2018
Performance issues when working with dict Performance dictionary	11	1752	November 16, 2022
Really Fast Hash Set and Map Internals & Design	20	6370	August 29, 2018
Different Dicts hashing to the same value General Usage question	6	1286	January 13, 2017

Dictionary with custom hash function

Related topics