> The flaw would be key1 == key2 and hash(key1) != hash(key2). Then the > set/dict could store equal items multiple times in different places > (unless it did a linear search of all members, which would make > hashing > pointless!). > > -- > Terry Jan Reedy
My understanding of a hash function was wrong in the first place. Thank to this thread, I think I got it right now. Thanks to all who have contributed, (and those who haven't, yes, I'm in a good mood now). JM -- IMPORTANT NOTICE: The contents of this email and any attachments are confidential and may also be privileged. If you are not the intended recipient, please notify the sender immediately and do not disclose the contents to any other person, use it for any purpose, or store or copy the information in any medium. Thank you. -- http://mail.python.org/mailman/listinfo/python-list
