python中列表的概念,Python 2：集合和列表中'in'关键字的不同含义

Consider this snippet:

class SomeClass(object):

def __init__(self, someattribute="somevalue"):

self.someattribute = someattribute

def __eq__(self, other):

return self.someattribute == other.someattribute

def __ne__(self, other):

return not self.__eq__(other)

list_of_objects = [SomeClass()]

print(SomeClass() in list_of_objects)

set_of_objects = set([SomeClass()])

print(SomeClass() in set_of_objects)

which evaluates to:

True

False

Can anyone explain why the 'in' keyword has a different meaning for sets and lists?

I would have expected both to return True, especially when the type being tested has equality methods defined.

解决方案

The meaning is the same, but the implementation is different. Lists simply examine each object, checking for equality, so it works for your class. Sets first hash the objects, and if they don't implement hash properly, the set appears not to work.

Your class defines __eq__, but doesn't define __hash__, and so won't work properly for sets or as keys of dictionaries. The rule for __eq__ and __hash__ is that two objects that __eq__ as True must also have equal hashes. By default, objects hash based on their memory address. So your two objects that are equal by your definition don't provide the same hash, so they break the rule about __eq__ and __hash__.

If you provide a __hash__ implementation, it will work fine. For your sample code, it could be:

def __hash__(self):

return hash(self.someattribute)