Method pushpop

recipes/Python/440673_Safe_heap_queue_class/recipe-440673.py:36–40

Equivalent to "heap.push(); return heap.popmin()" but more efficient.

(self, item)

        return self._unwrap(heapq.heapreplace(self._lst, self._wrap(item)))

    def pushpop(self, item):
        'Equivalent to "heap.push(); return heap.popmin()" but more efficient.'
        if self and self[0] < item:
            return self.replace(item)
        return item

    def iterpop(self):
        '''Return a destructive iterator over the heap's elements.