| commit | 277842eff12eba1ceeeba1cee93db3ec99d5c95a | [log] [tgz] |
|---|---|---|
| author | Raymond Hettinger <python@rcn.com> | Sun May 11 01:55:46 2014 -0700 |
| committer | Raymond Hettinger <python@rcn.com> | Sun May 11 01:55:46 2014 -0700 |
| tree | c88048d92f55d57585192c1274d8476d7ffc9ac9 | |
| parent | d6a46ae7059a5597aab614226f345bfb7dd67c16 [diff] |
Issue #21424: Optimize heaqp.nlargest() to make fewer tuple comparisons. Consolidates the logic for nlargest() into a single function so that decoration tuples (elem,order) or (key, order, elem) only need to be formed when a new element is added to the heap. Formerly, a tuple was created for every element regardless of whether it was added to the heap. The change reduces the number of tuples created, the number of ordering integers created, and total number of tuple comparisons.