sliding_window.py 文件源码

def pop(self):
        # Will remove item from the heap.
        value = heapq.heappop(self.heap)
        if self.max:
            value *= -1
        return value

    # def delete(self, index):
    # # Magic heapify.
    # self.heap[index] = self.heap[-1]  # Move root to index i.
    # self.heap.pop()  # pop() last element in array O(1).
    # if index < len(self.heap):  # Need to sift things.
    # # Magical internal heapify functions that does stuff in log n.
    #     heapq._siftup(self.heap, index)
    #     heapq._siftdown(self.heap, 0, index)