| commit | b25aa36f83a3cd2200f2bc479e594458e27794a3 | [log] [tgz] |
|---|---|---|
| author | Raymond Hettinger <python@rcn.com> | Sat Jun 12 08:33:36 2004 +0000 |
| committer | Raymond Hettinger <python@rcn.com> | Sat Jun 12 08:33:36 2004 +0000 |
| tree | afdd8051a7b152562b6a4a006fe7fe814113021e | |
| parent | 2e6694086f07d293d1907891f68cec6076d44f73 [diff] |
Improve the memory performance and speed of heapq.nsmallest() by using an alternate algorithm when the number of selected items is small relative to the full iterable.