Searched refs:heappop (Results 1 - 7 of 7) sorted by relevance
| /third_party/python/Lib/test/ |
| H A D | test_heapq.py | 17 func_names = ['heapify', 'heappop', 'heappush', 'heappushpop', 'heapreplace',
62 item = self.module.heappop(heap)
74 self.assertRaises(TypeError, self.module.heappop, None)
99 self.module.heappop(heap)
107 yield self.module.heappop(heap)
176 heap_sorted = [self.module.heappop(heap) for i in range(size)]
251 return [self.module.heappop(data).x for i in range(len(data))]
381 for f in (self.module.heapify, self.module.heappop):
388 for f in (self.module.heapify, self.module.heappop):
397 for f in (self.module.heapify, self.module.heappop)
[all...] |
| /third_party/python/Lib/asyncio/ |
| H A D | queues.py | 230 def _get(self, heappop=heapq.heappop):
231 return heappop(self._queue)
|
| H A D | base_events.py | 1873 handle = heapq.heappop(self._scheduled)
1895 handle = heapq.heappop(self._scheduled)
|
| /third_party/python/Lib/ |
| H A D | sched.py | 133 pop = heapq.heappop
167 return list(map(heapq.heappop, [events]*len(events)))
|
| H A D | queue.py | 6 from heapq import heappush, heappop namespace
239 return heappop(self.queue)
|
| H A D | heapq.py | 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): function
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() compare
[all...] |
| /third_party/node/deps/v8/tools/testrunner/testproc/ |
| H A D | util.py | 70 heapq.heappop(self.data)
|
Completed in 8 milliseconds