Min/Max heap for python

heap.py

import heapq

class Heap(object):
    def __init__(self, max=False):
        self.max = max
        self.data = []
    @property
    def delta(self):
        return -1 if self.max else 1
    def push(self, item):
        heapq.heappush(self.data, self.delta * item)
    def pop(self):
        return heapq.heappop(self.data) * self.delta
    def top(self):
        return self.delta * self.data[0]
    def __len__(self):
        return len(self.data)