[issue21424] Simplify and speed-up heaqp.nlargest()

Changes by Raymond Hettinger : -- resolution: -> fixed status: open -> closed ___ Python tracker ___ ___ Python-bugs-list mailing lis

[issue21424] Simplify and speed-up heaqp.nlargest()

Roundup Robot added the comment: New changeset 31950174f60f by Raymond Hettinger in branch 'default': Issue 21424: Apply the nlargest() optimizations to nsmallest() as well. http://hg.python.org/cpython/rev/31950174f60f -- ___ Python tracker

[issue21424] Simplify and speed-up heaqp.nlargest()

Changes by Raymond Hettinger : -- keywords: +patch Added file: http://bugs.python.org/file35213/rip_nsmallest.diff ___ Python tracker ___

[issue21424] Simplify and speed-up heaqp.nlargest()

Roundup Robot added the comment: New changeset fadc06047314 by Raymond Hettinger in branch 'default': Issue #21424: Optimize heaqp.nlargest() to make fewer tuple comparisons. http://hg.python.org/cpython/rev/fadc06047314 -- nosy: +python-dev ___ Pyth

[issue21424] Simplify and speed-up heaqp.nlargest()

Changes by Antoine Pitrou : -- nosy: +tim.peters ___ Python tracker ___ ___ Python-bugs-list mailing list Unsubscribe: https://mail.p

[issue21424] Simplify and speed-up heaqp.nlargest()

New submission from Raymond Hettinger: Consolidate the logic for nlargest() into a single function. Remove both the C and pure Python base underlying code. With all the logic in a single function, it only becomes necessary to create, store, and compare the data tuples when a need item is add