-
Notifications
You must be signed in to change notification settings - Fork 7
/
Priotityset.py
72 lines (50 loc) · 1.59 KB
/
Priotityset.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
# coding: utf-8
import heapq
class Item(object):
def __init__(self, score, path):
self.__score = score
self.__path = path
@property
def score(self):
return self.__score
@property
def path(self):
return self.__path
def __lt__(self, other):
return self.__score < other.score
def __le__(self, other):
return self.__score <= other.score
def __eq__(self, other):
return self.__score == other.score
def __ne__(self, other):
return self.__score != other.score
def __gt__(self, other):
return self.__score > other.score
def __ge__(self, other):
return self.__score >= other.score
def __str__(self):
return '< score={0}, path={1} >'.format(self.__score, self.__path)
def __repr__(self):
return self.__str__()
class PrioritySet(object):
def __init__(self, capacity):
self.capacity = capacity
self.data = []
def put(self, score, path):
assert(isinstance(path, list) == True)
heapq.heappush(self.data, [score, Item(score, path)])
while len(self.data) > self.capacity:
heapq.heappop(self.data)
def __len__(self):
return len(self.data)
def __iter__(self):
for item in self.data:
yield item[1]
def __str__(self):
s = '[ \n'
for item in self.data:
s = s + '\t' + str(item[1]) + '\n'
s += ']'
return s
def __repr__(self):
return self.__str__()