Searched refs:heapq (Results 1 - 8 of 8) sorted by relevance
| /third_party/python/Lib/ |
| H A D | sched.py | 27 import heapq namespace
75 heapq.heappush(self._queue, event)
96 heapq.heapify(self._queue)
133 pop = heapq.heappop
162 # Use heapq to sort the queue rather than using 'sorted(self._queue)'.
163 # With heapq, two events scheduled at the same time will show in
167 return list(map(heapq.heappop, [events]*len(events)))
|
| H A D | queue.py | 6 from heapq import heappush, heappop
|
| H A D | difflib.py | 33 from heapq import nlargest as _nlargest
|
| /third_party/node/deps/v8/tools/testrunner/testproc/ |
| H A D | util.py | 6 import heapq namespace
68 heapq.heappush(self.data, (elem_k, self.extra_key(), elem))
70 heapq.heappop(self.data)
|
| /third_party/node/deps/v8/tools/ignition/ |
| H A D | bytecode_dispatches_report.py | 12 import heapq namespace
70 return heapq.nlargest(top_count, flattened_counters_generator(),
113 return (heapq.nlargest(top_count, sources,
115 heapq.nlargest(top_count, destinations, key=lambda x: x[1]))
|
| /third_party/python/Lib/asyncio/ |
| H A D | queues.py | 4 import heapq namespace
227 def _put(self, item, heappush=heapq.heappush):
230 def _get(self, heappop=heapq.heappop):
|
| H A D | base_events.py | 20 import heapq namespace
747 heapq.heappush(self._scheduled, timer)
1866 heapq.heapify(new_scheduled)
1873 handle = heapq.heappop(self._scheduled)
1895 handle = heapq.heappop(self._scheduled)
|
| /third_party/python/Lib/collections/ |
| H A D | __init__.py | 621 import heapq namespace
622 return heapq.nlargest(n, self.items(), key=_itemgetter(1))
|
Completed in 9 milliseconds