3 ms·

Could this be solved by some sort of cuckoo hashing?

• mrjn 7y ago
  The benefit of current hashing algorithm is that Go team is maintaining it ;-). Its written in assembly and runs in single digit nanoseconds. One way to check for collision would be to either store the key as well or use another hashing algorithm (which would further decrease the probability of collision, but not eliminate it). Either would introduce some slowness, because every Get would need to be checked.
  • sethammons 7y ago
    Storing the key with the value is a solid workaround.
    • deleted 7y ago
      [deleted]