3 ms·

I think he didn't mean tries which don't generally need hashing but was trying to implement a lock-free map based on Concurrent Hash-Array Mapped Tries. I had

by aatd86 4y ago

I think he didn't mean tries which don't generally need hashing but was trying to implement a lock-free map based on Concurrent Hash-Array Mapped Tries. I had done that myself as an exercise a few years back and had to extract the hash function from the runtime that is used for maps. In any case, the performance was terrible and code brittle. (lack of sumtypes). Since then, I've learnt to not bother too much and just use the builtin maps. Never had an issue for my use-cases.

awmarthur 4y ago
(OP) I'm mostly interesting in a fast hash for writing a generic, concurrent hash map. The reference to Tries came from the original issue in the Golang repo about possible uses for a standard library hash function: https://github.com/golang/go/issues/21195 https://github.com/golang/go/issues/21195 And you're right, the Trie implementation linked there was indeed a Hash-Array Mapped Tried: https://pkg.go.dev/github.com/lleo/go-hamt-key#Key https://pkg.go.dev/github.com/lleo/go-hamt-key#Key