Lines Matching refs:heappop
14 item = heappop(heap) # pops the smallest item from the heap
26 - Our heappop() method returns the smallest item, not the largest.
129 __all__ = ['heappush', 'heappop', 'heapify', 'heapreplace', 'merge',
145 def heappop(heap):
159 This is more efficient than heappop() followed by heappush(), and can be
173 """Fast version of a heappush followed by a heappop."""
191 """Maxheap version of a heappush followed by a heappop."""
277 # heappop() a lot, in accord with theory. Here are typical results from 3
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
368 _heappop, _heapreplace, _StopIteration = heappop, heapreplace, StopIteration
476 sort.append(heappop(heap))
