(self, other)
| 119 | self.push(item) |
| 120 | |
| 121 | def extend(self, other): |
| 122 | if self._key is not None: |
| 123 | other = it.imap(self._wrap, other) |
| 124 | push = heapq.heappush; lst = self._lst |
| 125 | for item in other: |
| 126 | push(lst,item) |
| 127 | |
| 128 | def sort(self): |
| 129 | lst = self._lst; pop = heapq.heappop |