Python heapq で最大ヒープ (max heap)

maxheap.py

from heapq import heapify, heappop, heappush, heappushpop, heapreplace
from operator import neg


class MaxHeap:
    def __init__(self, iterator):
        self.seq = list(map(neg, iterator))
        heapify(self.seq)

    def push(self, v):
        heappush(self.seq, -v)

    def pop(self):
        return -heappop(self.seq)

    def pushpop(self, v):
        return -heappushpop(self.seq, -v)

    def replace(self, v):
        return -heapreplace(self.seq, -v)

    def __len__(self):
        return len(self.seq)

    def __getitem__(self, index):
        return -self.seq[index]

    def __iter__(self):
        return map(neg, self.seq)