[issue23549] heapq docs should be more precise about how to access the smallest element

Changes by Eli Bendersky : -- resolution: -> fixed status: open -> closed ___ Python tracker ___ ___ Python-bugs-list mailing list Un

[issue23549] heapq docs should be more precise about how to access the smallest element

Roundup Robot added the comment: New changeset b61578bb5014 by Eli Bendersky in branch '2.7': Issue #23549: Clarify confusion in heapq doc - accessing the mininmal element https://hg.python.org/cpython/rev/b61578bb5014 -- ___ Python tracker

[issue23549] heapq docs should be more precise about how to access the smallest element

Roundup Robot added the comment: New changeset 8ddda7d1f8e3 by Eli Bendersky in branch '3.4': Issue #23549: Clarify confusion in heapq doc - accessing the mininmal element https://hg.python.org/cpython/rev/8ddda7d1f8e3 New changeset 642247a536d5 by Eli Bendersky in branch 'default': Issue #23549

[issue23549] heapq docs should be more precise about how to access the smallest element

Eli Bendersky added the comment: Raymond - gentle ping. Do you see a reason not to check this in? -- ___ Python tracker ___ ___ Pytho

[issue23549] heapq docs should be more precise about how to access the smallest element

Eli Bendersky added the comment: Good catch. Attaching a new version of the patch with the typo fixed. -- Added file: http://bugs.python.org/file38280/issue23549.2.patch ___ Python tracker

[issue23549] heapq docs should be more precise about how to access the smallest element

Martin Panter added the comment: “Smalest” is spelt with a double L. -- nosy: +vadmium ___ Python tracker ___ ___ Python-bugs-list mai

[issue23549] heapq docs should be more precise about how to access the smallest element

Changes by Raymond Hettinger : -- assignee: docs@python -> rhettinger nosy: +rhettinger ___ Python tracker ___ ___ Python-bugs-list ma

[issue23549] heapq docs should be more precise about how to access the smallest element

Eli Bendersky added the comment: Proposed patch (generated vs. the 3.4 docs) is attached -- keywords: +patch Added file: http://bugs.python.org/file38277/issue23549.1.patch ___ Python tracker __

[issue23549] heapq docs should be more precise about how to access the smallest element

New submission from Eli Bendersky: The heapq documentation has this paragraph after the doc of nsmallest: The latter two functions perform best for smaller values of n. For larger values, it is more efficient to use the sorted() function. Also, when n==1, it is more efficient to use the buil