Method push

src/1/implementing_a_priority_queue/example.py:12–14

(self, item, priority)

        self._index = 0

    def push(self, item, priority):
        heapq.heappush(self._queue, (-priority, self._index, item))
        self._index += 1

    def pop(self):
        return heapq.heappop(self._queue)[-1]