django-orchestra-test/orchestra/utils/python.py

68 lines
1.8 KiB
Python
Raw Normal View History

2014-05-08 16:59:35 +00:00
import collections
2014-05-13 13:46:40 +00:00
def import_class(cls):
module = '.'.join(cls.split('.')[:-1])
cls = cls.split('.')[-1]
module = __import__(module, fromlist=[module])
return getattr(module, cls)
2014-05-08 16:59:35 +00:00
class OrderedSet(collections.MutableSet):
def __init__(self, iterable=None):
self.end = end = []
end += [None, end, end] # sentinel node for doubly linked list
self.map = {} # key --> [key, prev, next]
if iterable is not None:
self |= iterable
2014-07-10 10:03:22 +00:00
2014-05-08 16:59:35 +00:00
def __len__(self):
return len(self.map)
2014-07-10 10:03:22 +00:00
2014-05-08 16:59:35 +00:00
def __contains__(self, key):
return key in self.map
2014-07-10 10:03:22 +00:00
2014-05-08 16:59:35 +00:00
def add(self, key):
if key not in self.map:
end = self.end
curr = end[1]
curr[2] = end[1] = self.map[key] = [key, curr, end]
2014-07-10 10:03:22 +00:00
2014-05-08 16:59:35 +00:00
def discard(self, key):
2014-07-10 10:03:22 +00:00
if key in self.map:
2014-05-08 16:59:35 +00:00
key, prev, next = self.map.pop(key)
prev[2] = next
next[1] = prev
2014-07-10 10:03:22 +00:00
2014-05-08 16:59:35 +00:00
def __iter__(self):
end = self.end
curr = end[2]
while curr is not end:
yield curr[0]
curr = curr[2]
2014-07-10 10:03:22 +00:00
2014-05-08 16:59:35 +00:00
def __reversed__(self):
end = self.end
curr = end[1]
while curr is not end:
yield curr[0]
curr = curr[1]
2014-07-10 10:03:22 +00:00
2014-05-08 16:59:35 +00:00
def pop(self, last=True):
if not self:
raise KeyError('set is empty')
key = self.end[1][0] if last else self.end[2][0]
self.discard(key)
return key
2014-07-10 10:03:22 +00:00
2014-05-08 16:59:35 +00:00
def __repr__(self):
if not self:
return '%s()' % (self.__class__.__name__,)
return '%s(%r)' % (self.__class__.__name__, list(self))
2014-07-10 10:03:22 +00:00
2014-05-08 16:59:35 +00:00
def __eq__(self, other):
if isinstance(other, OrderedSet):
return len(self) == len(other) and list(self) == list(other)
return set(self) == set(other)