Best way to hash a dictionary

Miki Tebeka tebeka at
Mon Mar 3 13:05:41 CET 2003

Hello Andres,
> Compute the hash as the xor of the hash of the items.  That way you
> don't need to sort first, and you'll get an O(n) hash instead of
> O(n*log(n)).
Can you give an example?
Does this gives uniq keys?
(BTW: n < 20 always)


More information about the Python-list mailing list