Python Heap

python_heap.py

from heapq import *

class Heap():

    def __init__(self):
        self.heap = []

    def heappush(self, item):
        """Push the value item onto the heap, maintaining the heap invariant."""
        heappush(self.heap, item)

    def heappop(self):
        """Pop and return the smallest item from the heap, maintaining the heap invariant."""
        return heappop(self.heap)

    def heappushpop(self, item):
        """Push item on the heap, then pop and return the smallest item from the heap."""
        return heappushpop(self.heap, item)

    def heapreplace(self, item):
        """
        Pop and return the smallest item from the heap, and also push the new item. The heap size doesn’t change.
        If the heap is empty, IndexError is raised.
        """
        return heapreplace(self.heap, item)

    def size(self):
        return len(self.heap)

    def heapsort(self):
        h = []
        for value in self.heap:
            heappush(h, value)
        self.heap = [heappop(h) for i in range(len(h))]

    def __repr__(self):
        return str(self.heap)