(self, item, priority)
| 21 | return len(self.elements) == 0 |
| 22 | |
| 23 | def put(self, item, priority): |
| 24 | if item not in self.set: |
| 25 | heapq.heappush(self.elements, (priority, item)) |
| 26 | self.set.add(item) |
| 27 | else: |
| 28 | # update |
| 29 | # print("update", item) |
| 30 | temp = [] |
| 31 | (pri, x) = heapq.heappop(self.elements) |
| 32 | while x != item: |
| 33 | temp.append((pri, x)) |
| 34 | (pri, x) = heapq.heappop(self.elements) |
| 35 | temp.append((priority, item)) |
| 36 | for pro, xxx in temp: |
| 37 | heapq.heappush(self.elements, (pro, xxx)) |
| 38 | |
| 39 | def remove_element(self, item): |
| 40 | if item in self.set: |
no test coverage detected