mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-10-10 00:43:41 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 18

Improve the memory performance and speed of heapq.nsmallest() by using

Browse source 
an alternate algorithm when the number of selected items is small
relative to the full iterable.
This commit is contained in:
Raymond Hettinger 2004-06-12 08:33:36 +00:00
parent 2e6694086f
commit b25aa36f83
2 changed files with 24 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

1
Lib/test/test_heapq.py
View file

@ -92,6 +92,7 @@ class TestHeap(unittest.TestCase):
def test_nsmallest(self):
data = [random.randrange(2000) for i in range(1000)]
self.assertEqual(nsmallest(data, 400), sorted(data)[:400])
self.assertEqual(nsmallest(data, 50), sorted(data)[:50])
def test_largest(self):
data = [random.randrange(2000) for i in range(1000)]