Login Register

heapq.heappushpop()

heapq.heappushpop(heap, item)

Push item on the heap, then pop and return the smallest item from the heap. The combined action runs more efficiently than heappush() followed by a separate call to heappop().

Links:

https://docs.python.org/3.5/library/heapq.html#heapq.heappushpop

doc_python

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

heapq.heappush() heapq.heappush(heap, item) Push the value item onto the heap, maintaining the heap invariant.

heapq.nlargest() heapq.nlargest(n, iterable, key=None) Return a list with the n largest elements from the dataset defined by iterable. key, if provided, specifies

heapq.heappop() heapq.heappop(heap) Pop and return the smallest item from the heap, maintaining the heap invariant. If the heap is empty, IndexError is raised. To

heapq.heapreplace() heapq.heapreplace(heap, item) Pop and return the smallest item from the heap, and also push the new item. The heap size doesn’t change. If the hea

heapq.merge() heapq.merge(*iterables, key=None, reverse=False) Merge multiple sorted inputs into a single sorted output (for example, merge timestamped entries