def add(self, item): if item is None: return if len(self._heap) < self._n: heapq.heappush(self._heap, item) else: heapq.heappushpop(self._heap, item)