/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
|
difflib.py | 35 import heapq 747 result = heapq.nlargest(n, result) [all...] |
/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
|
difflib.py | 35 import heapq 747 result = heapq.nlargest(n, result) [all...] |
/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))
|
/build/tools/releasetools/ |
rangelib.py | 16 import heapq 140 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))), 158 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))), 177 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))), 197 for _, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))), 238 for p, d in heapq.merge(zip(self.data, itertools.cycle((-5, +5))),
|
blockimgdiff.py | 22 import heapq 381 sid = heapq.heappop(free_stash_ids) 443 heapq.heappush(free_stash_ids, sid) 859 heapq.heapify(S) 862 _, _, xf = heapq.heappop(S) 867 heapq.heappush(S, (u.NetStashChange(), u.order, u)) [all...] |
/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)
|
/external/chromium-trace/catapult/third_party/mapreduce/mapreduce/ |
context.py | 35 import heapq 176 largest = heapq.nlargest(self._LARGEST_ITEMS_TO_LOG,
|
shuffler.py | 31 import heapq 363 heapq.heapreplace(readers, 366 heapq.heappop(readers)
|
/external/autotest/scheduler/ |
drone_manager.py | 2 import heapq 184 # heapq of _DroneHeapWrappers 412 heapq.heappush(self._drone_queue, _DroneHeapWrapper(drone)) 416 heapq.heapify(self._drone_queue) 655 drone = heapq.heappop(self._drone_queue).drone [all...] |
/external/chromium-trace/catapult/telemetry/telemetry/internal/backends/chrome/ |
desktop_browser_backend.py | 7 import heapq 429 most_recent_dump = heapq.nlargest(1, dumps, os.path.getmtime)[0]
|
/external/chromium-trace/catapult/third_party/gsutil/gslib/commands/ |
rsync.py | 20 import heapq 644 out_file.writelines(heapq.merge(*chunk_files)) [all...] |
/external/chromium-trace/catapult/telemetry/third_party/pyfakefs/pyfakefs/ |
fake_filesystem.py | 86 import heapq 381 open_fd = heapq.heappop(self.free_fd_heap) 397 heapq.heappush(self.free_fd_heap, file_obj.filedes) [all...] |
/external/chromium-trace/catapult/third_party/pyfakefs/pyfakefs/ |
fake_filesystem.py | 86 import heapq 399 open_fd = heapq.heappop(self.free_fd_heap) 415 heapq.heappush(self.free_fd_heap, file_obj.filedes) [all...] |