| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| sched.py | 31 import heapq
54 heapq.heappush(self._queue, event)
74 heapq.heapify(self._queue)
106 pop = heapq.heappop
120 heapq.heappush(q, event)
130 # Use heapq to sort the queue rather than using 'sorted(self._queue)'.
131 # With heapq, two events scheduled at the same time will show in
134 return map(heapq.heappop, [events]*len(events))
|
| Queue.py | 9 import heapq
224 def _put(self, item, heappush=heapq.heappush):
227 def _get(self, heappop=heapq.heappop):
|
| collections.py | 12 import heapq as _heapq
|
| difflib.py | 35 import heapq
747 result = heapq.nlargest(n, result)
[all...] |
| /external/python/cpython2/Lib/ |
| sched.py | 31 import heapq
54 heapq.heappush(self._queue, event)
74 heapq.heapify(self._queue)
106 pop = heapq.heappop
120 heapq.heappush(q, event)
130 # Use heapq to sort the queue rather than using 'sorted(self._queue)'.
131 # With heapq, two events scheduled at the same time will show in
134 return map(heapq.heappop, [events]*len(events))
|
| Queue.py | 9 import heapq
224 def _put(self, item, heappush=heapq.heappush):
227 def _get(self, heappop=heapq.heappop):
|
| difflib.py | 33 import heapq
745 result = heapq.nlargest(n, result)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| sched.py | 31 import heapq
54 heapq.heappush(self._queue, event)
74 heapq.heapify(self._queue)
106 pop = heapq.heappop
120 heapq.heappush(q, event)
130 # Use heapq to sort the queue rather than using 'sorted(self._queue)'.
131 # With heapq, two events scheduled at the same time will show in
134 return map(heapq.heappop, [events]*len(events))
|
| Queue.py | 9 import heapq
224 def _put(self, item, heappush=heapq.heappush):
227 def _get(self, heappop=heapq.heappop):
|
| collections.py | 12 import heapq as _heapq
|
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| sched.py | 31 import heapq
54 heapq.heappush(self._queue, event)
74 heapq.heapify(self._queue)
106 pop = heapq.heappop
120 heapq.heappush(q, event)
130 # Use heapq to sort the queue rather than using 'sorted(self._queue)'.
131 # With heapq, two events scheduled at the same time will show in
134 return map(heapq.heappop, [events]*len(events))
|
| Queue.py | 9 import heapq
224 def _put(self, item, heappush=heapq.heappush):
227 def _get(self, heappop=heapq.heappop):
|
| collections.py | 12 import heapq as _heapq
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| sched.py | 31 import heapq
54 heapq.heappush(self._queue, event)
74 heapq.heapify(self._queue)
106 pop = heapq.heappop
120 heapq.heappush(q, event)
130 # Use heapq to sort the queue rather than using 'sorted(self._queue)'.
131 # With heapq, two events scheduled at the same time will show in
134 return map(heapq.heappop, [events]*len(events))
|
| Queue.py | 9 import heapq
224 def _put(self, item, heappush=heapq.heappush):
227 def _get(self, heappop=heapq.heappop):
|
| collections.py | 12 import heapq as _heapq
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| sched.py | 31 import heapq
54 heapq.heappush(self._queue, event)
74 heapq.heapify(self._queue)
106 pop = heapq.heappop
120 heapq.heappush(q, event)
130 # Use heapq to sort the queue rather than using 'sorted(self._queue)'.
131 # With heapq, two events scheduled at the same time will show in
134 return map(heapq.heappop, [events]*len(events))
|
| Queue.py | 9 import heapq
224 def _put(self, item, heappush=heapq.heappush):
227 def _get(self, heappop=heapq.heappop):
|
| collections.py | 12 import heapq as _heapq
|
| /external/autotest/client/cros/image_comparison/ |
| rgb_image_comparer.py | 5 import heapq, logging
70 logging.debug(heapq.nlargest(max_debug_count, colorstuples))
80 logging.debug(heapq.nlargest(max_debug_count, above_thres_tuples))
|
| /external/autotest/site_utils/rpm_control_system/ |
| frontend_server.py | 7 import heapq
258 heap_entry = heapq.heappop(self._dispatcher_minheap)
267 heapq.heappush(self._dispatcher_minheap, heap_entry)
286 heapq.heappush(self._dispatcher_minheap, heap_entry)
319 heapq.heapify(self._dispatcher_minheap)
328 # Heapq guarantees the head of the heap is in the '0' index.
334 heapq.heappop(self._dispatcher_minheap)
|
| /build/make/tools/releasetools/ |
| rangelib.py | 16 import heapq
153 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
171 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
190 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
210 for _, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
251 for p, d in heapq.merge(zip(self.data, itertools.cycle((-5, +5))),
|
| blockimgdiff.py | 20 import heapq
868 heapq.heapify(S)
871 _, _, xf = heapq.heappop(S)
876 heapq.heappush(S, (u.NetStashChange(), u.order, u))
[all...] |
| /external/v8/tools/ignition/ |
| bytecode_dispatches_report.py | 9 import heapq
67 return heapq.nlargest(top_count, flattened_counters_generator(),
110 return (heapq.nlargest(top_count, sources,
112 heapq.nlargest(top_count, destinations, key=lambda x: x[1]))
|
| /external/autotest/scheduler/ |
| drone_manager.py | 1 import heapq
193 # heapq of _DroneHeapWrappers
427 heapq.heappush(self._drone_queue, _DroneHeapWrapper(drone))
431 heapq.heapify(self._drone_queue)
658 drone = heapq.heappop(self._drone_queue).drone
[all...] |
