| /external/python/cpython3/Lib/ |
| heapq.py | 12 item = heappop(heap) # pops the smallest item from the heap
24 - Our heappop() method returns the smallest item, not the largest.
127 __all__ = ['heappush', 'heappop', 'heapify', 'heapreplace', 'merge',
135 def heappop(heap): function
148 This is more efficient than heappop() followed by heappush(), and can be
162 """Fast version of a heappush followed by a heappop."""
180 """Maxheap version of a heappop."""
190 """Maxheap version of a heappop followed by a heappush."""
240 # heappop() a lot, in accord with theory. Here are typical results from 3
255 # heappop() compares): list.sort() is (unsurprisingly!) more efficien
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| heapq.py | 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',
146 def heappop(heap):
function
160 This is more efficient than heappop() followed by heappush(), and can be
174 """Fast version of a heappush followed by a heappop."""
235 return map(heappop, repeat(h, min(n, len(h))))
275 # heappop() a lot, in accord with theory. Here are typical results from 3
290 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
330 _heappop, _heapreplace, _StopIteration = heappop, heapreplace, StopIteration
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| heapq.py | 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):
function
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
[all...] |
| /external/python/cpython2/Lib/ |
| heapq.py | 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): function
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, StopIteratio
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| heapq.py | 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): function
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, StopIteratio
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| heapq.py | 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): function
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, StopIteratio
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| heapq.py | 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): function
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, StopIteratio
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| heapq.py | 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): function
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, StopIteratio
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
| _heapqmodule.c | 147 heappop(PyObject *self, PyObject *heap)
function
214 This is more efficient than heappop() followed by heappush(), and can be\n\
261 heappush() followed by a separate call to heappop().");
549 {"heappop", (PyCFunction)heappop,
574 item = heappop(heap) # pops the smallest item from the heap\n\
586 - Our heappop() method returns the smallest item, not the largest.\n\
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/ |
| _heapqmodule.c | 146 heappop(PyObject *self, PyObject *heap)
function
213 This is more efficient than heappop() followed by heappush(), and can be\n\
260 heappush() followed by a separate call to heappop().");
548 {"heappop", (PyCFunction)heappop,
573 item = heappop(heap) # pops the smallest item from the heap\n\
585 - Our heappop() method returns the smallest item, not the largest.\n\
|
| /external/python/cpython2/Modules/ |
| _heapqmodule.c | 146 heappop(PyObject *self, PyObject *heap) function
213 This is more efficient than heappop() followed by heappush(), and can be\n\
265 heappush() followed by a separate call to heappop().");
553 {"heappop", (PyCFunction)heappop,
578 item = heappop(heap) # pops the smallest item from the heap\n\
590 - Our heappop() method returns the smallest item, not the largest.\n\
|
| /external/python/cpython3/Modules/ |
| _heapqmodule.c | 161 heappop(PyObject *self, PyObject *heap) function
206 This is more efficient than heappop() followed by heappush(), and can be\n\
258 heappush() followed by a separate call to heappop().");
459 PyDoc_STRVAR(heappop_max_doc, "Maxheap variant of heappop.");
482 {"heappop", (PyCFunction)heappop,
509 item = heappop(heap) # pops the smallest item from the heap\n\
521 - Our heappop() method returns the smallest item, not the largest.\n\
|
