/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_heapq.py | 12 # _heapq.nlargest/nsmallest are saved in heapq._nlargest/_smallest when 180 self.assertEqual(self.module.nsmallest(n, data), sorted(data)[:n]) 181 self.assertEqual(self.module.nsmallest(n, data, key=f), 335 self.module.nlargest, self.module.nsmallest): 343 for f in (self.module.nlargest, self.module.nsmallest): 352 for f in (self.module.nlargest, self.module.nsmallest): 358 self.module.nlargest, self.module.nsmallest): 362 for f in (self.module.nlargest, self.module.nsmallest):
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_heapq.py | 12 # _heapq.nlargest/nsmallest are saved in heapq._nlargest/_smallest when 180 self.assertEqual(self.module.nsmallest(n, data), sorted(data)[:n]) 181 self.assertEqual(self.module.nsmallest(n, data, key=f), 335 self.module.nlargest, self.module.nsmallest): 343 for f in (self.module.nlargest, self.module.nsmallest): 352 for f in (self.module.nlargest, self.module.nsmallest): 358 self.module.nlargest, self.module.nsmallest): 362 for f in (self.module.nlargest, self.module.nsmallest):
|
/external/chromium_org/third_party/bintrees/ |
NEWS.txt | 55 * added heap methods: min, max, nlarges, nsmallest ...
|
README.txt | 128 * nsmallest(i[,pop]) -> get list of i smallest items (k, v), O(i*log(n))
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
heapq.py | 130 'nlargest', 'nsmallest', 'heappushpop'] 221 def nsmallest(n, iterable): function 392 # Extend the implementations of nsmallest and nlargest to use a key= argument 393 _nsmallest = nsmallest 394 def nsmallest(n, iterable, key=None): function
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
heapq.py | 130 'nlargest', 'nsmallest', 'heappushpop'] 221 def nsmallest(n, iterable): function 392 # Extend the implementations of nsmallest and nlargest to use a key= argument 393 _nsmallest = nsmallest 394 def nsmallest(n, iterable, key=None): function
|
/external/chromium_org/third_party/bintrees/bintrees/ |
__init__.py | 122 * nsmallest(i[,pop]) -> get list of i smallest items (k, v), O(i*log(n))
|
treemixin.py | 123 * nsmallest(i[,pop]) -> get list of i smallest items (k, v), O(i*log(n)) 573 def nsmallest(self, n, pop=False): member in class:TreeMixin 574 """ T.nsmallest(n) -> get list of n smallest items (k, v).
|