| /external/python/cpython3/Lib/test/ |
| D | test_heapq.py | 208 self.assertEqual(list(self.module.nlargest(n, data)),
210 self.assertEqual(list(self.module.nlargest(n, data, key=f)),
357 self.module.nlargest, self.module.nsmallest):
365 for f in (self.module.nlargest, self.module.nsmallest):
373 for f in (self.module.nlargest, self.module.nsmallest):
382 for f in (self.module.nlargest, self.module.nsmallest):
388 self.module.nlargest, self.module.nsmallest):
392 for f in (self.module.nlargest, self.module.nsmallest):
|
| /external/python/cpython2/Lib/test/ |
| D | test_heapq.py | 197 self.assertEqual(self.module.nlargest(n, data),
199 self.assertEqual(self.module.nlargest(n, data, key=f),
344 self.module.nlargest, self.module.nsmallest):
352 for f in (self.module.nlargest, self.module.nsmallest):
361 for f in (self.module.nlargest, self.module.nsmallest):
367 self.module.nlargest, self.module.nsmallest):
371 for f in (self.module.nlargest, self.module.nsmallest):
|
| /external/autotest/client/cros/image_comparison/ |
| D | rgb_image_comparer.py | 70 logging.debug(heapq.nlargest(max_debug_count, colorstuples))
80 logging.debug(heapq.nlargest(max_debug_count, above_thres_tuples))
|
| /external/v8/tools/ignition/ |
| D | bytecode_dispatches_report.py | 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/python/cpython2/Lib/ |
| D | heapq.py | 203 def nlargest(n, iterable): function
435 _nlargest = nlargest
436 def nlargest(n, iterable, key=None): function
|
| D | collections.py | 495 return _heapq.nlargest(n, self.iteritems(), key=_itemgetter(1))
|
| D | difflib.py | 745 result = heapq.nlargest(n, result)
|
| /external/chromium-trace/catapult/common/py_utils/py_utils/ |
| D | memory_debug.py | 75 sorted_pinfo_groups = heapq.nlargest(
|
| /external/tensorflow/tensorflow/contrib/session_bundle/ |
| D | gc.py | 95 keepers = [paths[i] for _, i in heapq.nlargest(n, heap)]
|
| /external/tensorflow/tensorflow/contrib/learn/python/learn/utils/ |
| D | gc.py | 100 keepers = [paths[i] for _, i in heapq.nlargest(n, heap)]
|
| /external/python/cpython2/Modules/ |
| D | _heapqmodule.c | 296 nlargest(PyObject *self, PyObject *args) in nlargest() function
559 {"nlargest", (PyCFunction)nlargest,
|
| /external/python/cpython3/Lib/ |
| D | heapq.py | 524 def nlargest(n, iterable, key=None): function
|
| D | difflib.py | 33 from heapq import nlargest as _nlargest
|
| /external/python/cpython2/Doc/library/ |
| D | functools.rst | 27 :func:`max`, :func:`heapq.nlargest`, :func:`heapq.nsmallest`,
|
| D | heapq.rst | 100 .. function:: nlargest(n, iterable[, key])
|
| /external/python/cpython3/Doc/library/ |
| D | heapq.rst | 111 .. function:: nlargest(n, iterable, key=None)
|
| D | functools.rst | 27 :func:`max`, :func:`heapq.nlargest`, :func:`heapq.nsmallest`,
|
| D | functions.rst | 882 ``heapq.nlargest(1, iterable, key=keyfunc)``.
|
| /external/python/cpython3/Lib/collections/ |
| D | __init__.py | 584 return _heapq.nlargest(n, self.items(), key=_itemgetter(1))
|
| /external/python/cpython2/Doc/ |
| D | glossary.rst | 444 :func:`heapq.nlargest`, and :func:`itertools.groupby`.
|
| /external/python/cpython3/Doc/ |
| D | glossary.rst | 611 :func:`heapq.nsmallest`, :func:`heapq.nlargest`, and
|
| /external/python/cpython3/Doc/whatsnew/ |
| D | 2.4.rst | 1079 data. In addition, the module has two new functions :func:`nlargest` and
|
| D | 2.5.rst | 1361 * The :func:`nsmallest` and :func:`nlargest` functions in the :mod:`heapq`
|
| /external/python/cpython2/Doc/whatsnew/ |
| D | 2.4.rst | 1079 data. In addition, the module has two new functions :func:`nlargest` and
|
| /external/python/cpython3/Misc/NEWS.d/ |
| D | 3.5.0a1.rst | 3674 Simplified and optimized heaqp.nlargest() and nmsmallest() to make fewer
|