HomeSort by relevance Sort by last modified time
    Searched refs:heapq (Results 1 - 12 of 12) sorted by null

  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
sched.py 31 import heapq namespace
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 namespace
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 namespace
747 result = heapq.nlargest(n, result)
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
sched.py 31 import heapq namespace
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 namespace
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 namespace
747 result = heapq.nlargest(n, result)
    [all...]
  /build/tools/releasetools/
rangelib.py 16 import heapq namespace
131 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
149 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
168 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
188 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
229 for p, d in heapq.merge(zip(self.data, itertools.cycle((-5, +5))),
blockimgdiff.py 19 import heapq namespace
269 sid = heapq.heappop(free_stash_ids)
302 heapq.heappush(free_stash_ids, sid)
561 heapq.heapify(S)
564 _, _, xf = heapq.heappop(S)
569 heapq.heappush(S, (u.NetStashChange(), u.order, u))
  /external/chromium_org/tools/perf/measurements/
loading_measurement_analyzer.py 19 import heapq namespace
138 slowest = heapq.nlargest(self.num_slowest_urls, values)
  /external/chromium_org/tools/telemetry/telemetry/core/backends/chrome/
desktop_browser_backend.py 6 import heapq namespace
238 most_recent_dump = heapq.nlargest(1, dumps, os.path.getmtime)[0]

Completed in 294 milliseconds