有序集在功能上是有序字典的特例。
字典的键是独一无二的。因此,如果忽略有序字典中的值(例如,通过赋值)None),则基本上有一个有序集。
截至Python3.1的确有collections.OrderedDict..下面是OrderedSet的示例实现。(请注意,只需要定义或重写几个方法:collections.OrderedDict和collections.MutableSet(做重物。)import collectionsclass OrderedSet(collections.OrderedDict, collections.MutableSet):
def update(self, *args, **kwargs):
if kwargs:
raise TypeError("update() takes no keyword arguments")
for s in args:
for e in s:
self.add(e)
def add(self, elem):
self[elem] = None
def discard(self, elem):
self.pop(elem, None)
def __le__(self, other):
return all(e in other for e in self)
def __lt__(self, other):
return self <= other and self != other def __ge__(self, other):
return all(e in self for e in other)
def __gt__(self, other):
return self >= other and self != other def __repr__(self):
return 'OrderedSet([%s])' % (', '.join(map(repr, self.keys())))
def __str__(self):
return '{%s}' % (', '.join(map(repr, self.keys())))
difference = property(lambda self: self.__sub__)
difference_update = property(lambda self: self.__isub__)
intersection = property(lambda self: self.__and__)
intersection_update = property(lambda self: self.__iand__)
issubset = property(lambda self: self.__le__)
issuperset = property(lambda self: self.__ge__)
symmetric_difference = property(lambda self: self.__xor__)
symmetric_difference_update = property(lambda self: self.__ixor__)
union = property(lambda self: self.__or__)