Searched refs:heappush (Results 1 – 12 of 12) sorted by relevance
/third_party/python/Lib/test/ |
D | test_heapq.py | 58 self.module.heappush(heap, item) 71 self.assertRaises(TypeError, self.module.heappush, []) 73 self.assertRaises(TypeError, self.module.heappush, None, None) 97 self.module.heappush(heap, item) 175 self.module.heappush(heap, item) 383 for f in (self.module.heappush, self.module.heapreplace, 390 for f in (self.module.heappush, self.module.heapreplace): 399 for f in (self.module.heappush, self.module.heapreplace): 406 self.module.heappush, self.module.heapreplace, 427 self.module.heappush(heap, SideEffectLT(5, heap)) [all …]
|
/third_party/python/Lib/asyncio/ |
D | queues.py | 228 def _put(self, item, heappush=heapq.heappush): argument 229 heappush(self._queue, item)
|
D | base_events.py | 731 heapq.heappush(self._scheduled, timer)
|
/third_party/python/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)
|
/third_party/python/Lib/ |
D | queue.py | 6 from heapq import heappush, heappop 236 heappush(self.queue, item)
|
D | sched.py | 75 heapq.heappush(self._queue, event)
|
D | heapq.py | 130 def heappush(heap, item): function
|
/third_party/cef/tools/yapf/yapf/yapflib/ |
D | reformatter.py | 312 heapq.heappush(p_queue, _QueueItem(_OrderedPenalty(0, count), node)) 372 heapq.heappush(p_queue, _QueueItem(_OrderedPenalty(penalty, count), node))
|
/third_party/python/Doc/tutorial/ |
D | stdlib2.rst | 344 >>> from heapq import heapify, heappop, heappush 347 >>> heappush(data, -5) # add a new entry
|
/third_party/python/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 | 1985 This is more efficient than making a call to :func:`heappush` and then
|
/third_party/python/Misc/ |
D | HISTORY | 5269 - Issue #17278: Fix a crash in heapq.heappush() and heapq.heappop() when
|