| /external/python/cpython3/Lib/test/ |
| D | test_heapq.py | 43 item = self.module.heappop(heap)
55 self.assertRaises(TypeError, self.module.heappop, None)
80 self.module.heappop(heap)
88 yield self.module.heappop(heap)
150 heap_sorted = [self.module.heappop(heap) for i in range(size)]
219 return [self.module.heappop(data).x for i in range(len(data))]
354 for f in (self.module.heapify, self.module.heappop):
361 for f in (self.module.heapify, self.module.heappop):
369 for f in (self.module.heapify, self.module.heappop):
378 for f in (self.module.heapify, self.module.heappop):
[all …]
|
| /external/python/cpython2/Lib/test/ |
| D | test_heapq.py | 43 item = self.module.heappop(heap)
55 self.assertRaises(TypeError, self.module.heappop, None)
80 self.module.heappop(heap)
88 yield self.module.heappop(heap)
150 heap_sorted = [self.module.heappop(heap) for i in range(size)]
207 return [self.module.heappop(data).x for i in range(len(data))]
341 for f in (self.module.heapify, self.module.heappop):
348 for f in (self.module.heapify, self.module.heappop):
357 for f in (self.module.heapify, self.module.heappop):
365 for f in (self.module.heapify, self.module.heappop,
[all …]
|
| /external/python/cpython3/Lib/asyncio/ |
| D | queues.py | 231 def _get(self, heappop=heapq.heappop): argument
232 return heappop(self._queue)
|
| D | base_events.py | 1707 handle = heapq.heappop(self._scheduled)
1748 handle = heapq.heappop(self._scheduled)
|
| /external/python/cpython2/Lib/ |
| D | Queue.py | 227 def _get(self, heappop=heapq.heappop): argument
228 return heappop(self.queue)
|
| D | sched.py | 106 pop = heapq.heappop
134 return map(heapq.heappop, [events]*len(events))
|
| D | heapq.py | 145 def heappop(heap): function
368 _heappop, _heapreplace, _StopIteration = heappop, heapreplace, StopIteration
481 sort.append(heappop(heap))
|
| /external/python/cpython3/Lib/ |
| D | sched.py | 134 pop = heapq.heappop
167 return list(map(heapq.heappop, [events]*len(events)))
|
| D | queue.py | 5 from heapq import heappush, heappop
236 return heappop(self.queue)
|
| D | heapq.py | 135 def heappop(heap): function
342 _heappop = heappop
|
| /external/python/cpython2/Doc/library/ |
| D | heapq.rst | 49 .. function:: heappop(heap)
59 followed by a separate call to :func:`heappop`.
73 This one step operation is more efficient than a :func:`heappop` followed by
144 ... return [heappop(h) for i in range(len(h))]
160 >>> heappop(h)
219 priority, count, task = heappop(pq)
|
| D | itertools.rst | 808 heapiter = iter_except(functools.partial(heappop, h), IndexError)
|
| /external/python/cpython3/Doc/library/ |
| D | heapq.rst | 48 .. function:: heappop(heap)
59 followed by a separate call to :func:`heappop`.
72 This one step operation is more efficient than a :func:`heappop` followed by
146 ... return [heappop(h) for i in range(len(h))]
162 >>> heappop(h)
231 priority, count, task = heappop(pq)
|
| D | itertools.rst | 823 iter_except(functools.partial(heappop, h), IndexError) # priority queue iterator
|
| /external/autotest/site_utils/rpm_control_system/ |
| D | frontend_server.py | 373 heap_entry = heapq.heappop(self._dispatcher_minheap)
449 heapq.heappop(self._dispatcher_minheap)
|
| /external/python/cpython3/Modules/ |
| D | _heapqmodule.c | 161 heappop(PyObject *self, PyObject *heap) in heappop() function
482 {"heappop", (PyCFunction)heappop,
|
| /external/python/cpython2/Modules/ |
| D | _heapqmodule.c | 146 heappop(PyObject *self, PyObject *heap) in heappop() function
553 {"heappop", (PyCFunction)heappop,
|
| /external/libaom/libaom/tools/ |
| D | gen_constrained_tokenset.py | 85 (adj_err, i) = heapq.heappop(v)
|
| /external/yapf/yapf/yapflib/ |
| D | reformatter.py | 338 heapq.heappop(p_queue)
357 _ReconstructPath(initial_state, heapq.heappop(p_queue).state_node)
|
| /external/python/cpython2/Doc/tutorial/ |
| D | stdlib2.rst | 342 >>> from heapq import heapify, heappop, heappush
346 >>> [heappop(data) for i in range(3)] # fetch the three smallest entries
|
| /external/python/cpython3/Doc/tutorial/ |
| D | stdlib2.rst | 344 >>> from heapq import heapify, heappop, heappush
348 >>> [heappop(data) for i in range(3)] # fetch the three smallest entries
|
| /external/autotest/scheduler/ |
| D | drone_manager.py | 681 drone = heapq.heappop(self._drone_queue).drone
|
| /external/python/dateutil/dateutil/ |
| D | rrule.py | 1320 heapq.heappop(self.genlist)
|
| /external/python/cpython2/Doc/whatsnew/ |
| D | 2.3.rst | 1314 The :mod:`heapq` module provides :func:`heappush` and :func:`heappop` functions
1325 >>> heapq.heappop(heap)
1327 >>> heapq.heappop(heap)
|
| /external/python/cpython3/Doc/whatsnew/ |
| D | 2.3.rst | 1314 The :mod:`heapq` module provides :func:`heappush` and :func:`heappop` functions
1325 >>> heapq.heappop(heap)
1327 >>> heapq.heappop(heap)
|