Lines Matching refs:heappop
12 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',
137 def heappop(heap):
150 This is more efficient than heappop() followed by heappush(), and can be
164 """Fast version of a heappush followed by a heappop."""
182 """Maxheap version of a heappop."""
192 """Maxheap version of a heappop followed by a heappush."""
242 # heappop() a lot, in accord with theory. Here are typical results from 3
257 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
344 _heappop = heappop