| /external/python/cpython3/Lib/test/ |
| D | test_heapq.py | 57 self.module.heappush(heap, item)
70 self.assertRaises(TypeError, self.module.heappush, [])
72 self.assertRaises(TypeError, self.module.heappush, None, None)
96 self.module.heappush(heap, item)
174 self.module.heappush(heap, item)
382 for f in (self.module.heappush, self.module.heapreplace,
389 for f in (self.module.heappush, self.module.heapreplace):
398 for f in (self.module.heappush, self.module.heapreplace):
405 self.module.heappush, self.module.heapreplace,
426 self.module.heappush(heap, SideEffectLT(5, heap))
[all …]
|
| /external/python/cpython2/Lib/test/ |
| D | test_heapq.py | 39 self.module.heappush(heap, item)
52 self.assertRaises(TypeError, self.module.heappush, [])
54 self.assertRaises(TypeError, self.module.heappush, None, None)
78 self.module.heappush(heap, item)
149 self.module.heappush(heap, item)
343 for f in (self.module.heappush, self.module.heapreplace,
350 for f in (self.module.heappush, self.module.heapreplace):
359 for f in (self.module.heappush, self.module.heapreplace):
366 self.module.heappush, self.module.heapreplace,
390 self.module.heappush(heap, SideEffectLT(5, heap))
|
| /external/python/cpython3/Lib/asyncio/ |
| D | queues.py | 235 def _put(self, item, heappush=heapq.heappush): argument
236 heappush(self._queue, item)
|
| D | base_events.py | 732 heapq.heappush(self._scheduled, timer)
|
| /external/python/cpython2/Lib/ |
| D | sched.py | 54 heapq.heappush(self._queue, event)
120 heapq.heappush(q, event)
|
| D | Queue.py | 224 def _put(self, item, heappush=heapq.heappush): argument
225 heappush(self.queue, item)
|
| D | heapq.py | 140 def heappush(heap, item): function
478 heappush(heap, item)
|
| /external/python/cpython2/Doc/library/ |
| D | heapq.rst | 44 .. function:: heappush(heap, item)
58 *heap*. The combined action runs more efficiently than :func:`heappush`
74 :func:`heappush` and can be more appropriate when using a fixed-size heap.
143 ... heappush(h, value)
156 >>> heappush(h, (5, 'write code'))
157 >>> heappush(h, (7, 'release product'))
158 >>> heappush(h, (1, 'write spec'))
159 >>> heappush(h, (3, 'create tests'))
209 heappush(pq, entry)
|
| /external/libaom/libaom/tools/ |
| D | gen_constrained_tokenset.py | 82 heapq.heappush(v, (adj_err, i))
92 heapq.heappush(v, (adj_err, i))
|
| /external/python/cpython3/Doc/library/ |
| D | heapq.rst | 43 .. function:: heappush(heap, item)
58 *heap*. The combined action runs more efficiently than :func:`heappush`
73 :func:`heappush` and can be more appropriate when using a fixed-size heap.
145 ... heappush(h, value)
158 >>> heappush(h, (5, 'write code'))
159 >>> heappush(h, (7, 'release product'))
160 >>> heappush(h, (1, 'write spec'))
161 >>> heappush(h, (3, 'create tests'))
221 heappush(pq, entry)
|
| D | random.rst | 504 from heapq import heappush, heappop
523 heappush(servers, service_completed)
|
| /external/python/cpython3/Lib/ |
| D | queue.py | 6 from heapq import heappush, heappop
236 heappush(self.queue, item)
|
| D | sched.py | 76 heapq.heappush(self._queue, event)
|
| D | heapq.py | 130 def heappush(heap, item): function
|
| /external/autotest/site_utils/rpm_control_system/ |
| D | frontend_server.py | 291 heapq.heappush(self._dispatcher_minheap, heap_entry)
310 heapq.heappush(self._dispatcher_minheap, heap_entry)
|
| /external/python/cpython2/Modules/ |
| D | _heapqmodule.c | 121 heappush(PyObject *self, PyObject *args) in heappush() function
549 {"heappush", (PyCFunction)heappush,
|
| /external/yapf/yapf/yapflib/ |
| D | reformatter.py | 329 heapq.heappush(p_queue, _QueueItem(_OrderedPenalty(0, count), node))
389 heapq.heappush(p_queue, _QueueItem(_OrderedPenalty(penalty, count), node))
|
| /external/python/cpython2/Doc/tutorial/ |
| D | stdlib2.rst | 342 >>> from heapq import heapify, heappop, heappush
345 >>> heappush(data, -5) # add a new entry
|
| /external/python/cpython3/Doc/tutorial/ |
| D | stdlib2.rst | 344 >>> from heapq import heapify, heappop, heappush
347 >>> heappush(data, -5) # add a new entry
|
| /external/toolchain-utils/crosperf/ |
| D | results_cache.py | 709 heapq.heappush(cmd_top5_cpu_use[cmd_with_pid], round(cpu_use, 1))
|
| /external/python/cpython3/Doc/whatsnew/ |
| D | 2.3.rst | 1314 The :mod:`heapq` module provides :func:`heappush` and :func:`heappop` functions
1321 ... heapq.heappush(heap, item)
|
| /external/python/cpython2/Doc/whatsnew/ |
| D | 2.3.rst | 1314 The :mod:`heapq` module provides :func:`heappush` and :func:`heappop` functions
1321 ... heapq.heappush(heap, item)
|
| D | 2.6.rst | 1981 This is more efficient than making a call to :func:`heappush` and then
|
| /external/python/cpython2/Misc/NEWS.d/ |
| D | 2.7.4rc1.rst | 746 Fix a crash in heapq.heappush() and heapq.heappop() when the list is being
|
| /external/python/pyfakefs/pyfakefs/ |
| D | fake_filesystem.py | 1291 heapq.heappush(self._free_fd_heap, file_des)
|