/
indexedheap.py
161 lines (157 loc) · 5.06 KB
/
indexedheap.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
'''
Created on 2016/10/18
:author: hubo
'''
class IndexedHeap(object):
'''
A heap with indices
'''
__slots__ = ('heap', 'index', 'pending', 'pendingpriority')
def __init__(self):
self.heap = []
self.index = {}
self.pending = {}
self.pendingpriority = None
def push(self, value, priority):
if value in self.index:
self.setpriority(value, priority)
else:
if self.heap and self.heap[0][0] < priority:
# pending
self.index[value] = None
self.pending[value] = priority
if self.pendingpriority is None or priority < self.pendingpriority:
self.pendingpriority = priority
else:
self._push(value, priority)
def _push(self, value, priority):
self.heap.append((priority, value))
self.index[value] = len(self.heap) - 1
self._siftup(len(self.heap) - 1)
def _check_pending(self):
if self.pending and (not self.heap or self.pendingpriority <= self.heap[0][0]):
for k,v in self.pending.items():
self._push(k, v)
self.pending.clear()
self.pendingpriority = None
def remove(self, value):
if value in self.index:
pos = self.index.pop(value)
if pos is None:
del self.pending[value]
if not self.pending:
self.pendingpriority = None
return
if pos == len(self.heap) - 1:
del self.heap[-1]
self._check_pending()
return
ci = self.heap[pos]
li = self.heap.pop()
self.heap[pos] = li
self.index[li[1]] = pos
if li[0] > ci[0]:
self._siftdown(pos)
else:
self._siftup(pos)
if pos == 0:
self._check_pending()
def pop(self):
if not self.heap:
raise IndexError('pop from an empty heap')
ret = self.heap[0]
del self.index[ret[1]]
li = self.heap.pop()
if not self.heap:
self._check_pending()
return ret[1]
self.heap[0] = li
self.index[li[1]] = 0
self._siftdown(0)
self._check_pending()
return ret[1]
def poppush(self, value, priority):
if not self.heap:
raise IndexError('pop from an empty heap')
ret = self.heap[0]
del self.index[ret[1]]
self.heap[0] = (priority, value)
self.index[value] = 0
self._siftdown(0)
self._check_pending()
return ret[1]
def pushpop(self, value, priority):
if not self.heap or priority < self.heap[0][0]:
return value
return self.poppush(value, priority)
def setpriority(self, value, priority):
pos = self.index[value]
if pos is None:
if priority <= self.heap[0][0]:
del self.pending[value]
self._push(value, priority)
else:
self.pending[value] = priority
if priority < self.pendingpriority:
self.pendingpriority = priority
return
temp = self.heap[pos]
self.heap[pos] = (priority, value)
if temp[0] < priority:
self._siftdown(pos)
else:
self._siftup(pos)
self._check_pending()
def replace(self, value, value2):
pos = self.index[value]
del self.index[value]
if pos is None:
self.pending[value2] = self.pending[value]
else:
self.heap[pos] = (self.heap[pos][0], value2)
self.index[value2] = pos
def clear(self):
self.index.clear()
del self.heap[:]
self.pending.clear()
self.pendingpriority = None
def top(self):
return self.heap[0][1]
def topPriority(self):
return self.heap[0][0]
def _siftup(self, pos):
temp = self.heap[pos]
while pos > 0:
pindex = (pos - 1) // 2
pt = self.heap[pindex]
if pt[0] > temp[0]:
self.heap[pos] = pt
self.index[pt[1]] = pos
else:
break
pos = pindex
self.heap[pos] = temp
self.index[temp[1]] = pos
def _siftdown(self, pos):
temp = self.heap[pos]
l = len(self.heap)
while pos * 2 + 1 < l:
cindex = pos * 2 + 1
pt = self.heap[cindex]
if cindex + 1 < l and self.heap[cindex+1][0] < pt[0]:
cindex = cindex + 1
pt = self.heap[cindex]
if pt[0] < temp[0]:
self.heap[pos] = pt
self.index[pt[1]] = pos
else:
break
pos = cindex
self.heap[pos] = temp
self.index[temp[1]] = pos
def __len__(self):
return len(self.index)
def __nonzero__(self):
return bool(self.index)
def __contains__(self, value):
return value in self.index