Simple heap wrapper library.

heaps.py

import heapq


class Heap(object):
    _heap = []
    
    def __init__(self, l=()):
        _heap = list(l)
        heapq.heapify(_heap)
    
    def isempty(self):
        if len(self._heap) == 0:
            return True
        return False
    
    def getroot(self):
        return self._heap[0] if len(self._heap) != 0 else 0
    
    def __len__(self):
        return len(self._heap)
    
    def push(self, item):
        raise NotImplementedError
    
    def pop(self):
        raise NotImplementedError
    
    def pushpop(self, item):
        raise NotImplementedError
    
    def replace(self, item):
        raise NotImplementedError


class HeapMax(Heap):
    def push(self, item):
        heapq.heappush(self._heap, -item)
    
    def pop(self):
        return -heapq.heappop(self._heap)
    
    def view_max(self):
        return self.getroot()
    
    def pushpop(self, item):
        return -heapq.heappushpop(self._heap, -item)
    
    def replace(self, item):
        return -heapq.heapreplace(self._heap, -item)


class HeapMin(Heap):
    def push(self, item):
        heapq.heappush(self._heap, item)
    
    def pop(self):
        return heapq.heappop(self._heap)
    
    def view_min(self):
        return self.getroot()
    
    def pushpop(self, item):
        return heapq.heappushpop(self._heap, item)
    
    def replace(self, item):
        return heapq.heapreplace(self._heap, item)

Constructor for HeapMax:

  def __init__(self, l=[]):
      self._heap = [-a for a in l]
      heapq.heapify(self._heap)
  
  def __str__(self):
      return f'{[-a for a in self._heap]}'
  
  def __repr__(self):
      return f'{[-a for a in self._heap]}'

Printing HeapMin:

    def __len__(self):
        return len(self._heap)
    
    def __str__(self):
        return f'{self._heap}'