mirrors
/
cpython
mirror of https://github.com/python/cpython.git
2
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Issue 9802: Document min()/max() sort stability

This commit is contained in:
Raymond Hettinger 2010-09-14 23:13:42 +00:00
parent 1006bd459b
commit 476a31ef1e
1 changed files with 8 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Doc/library/functions.rst
View File

@ -634,6 +634,10 @@ are always available. They are listed here in alphabetical order.
The optional keyword-only *key* argument specifies a one-argument ordering
function like that used for :meth:`list.sort`.
If multiple items are maximal, the function returns the first one encountered.
This is consistent with other sort-stability preserving tools such as
``sorted(iterable, key=keyfunc, reverse=True)[0]` and
``heapq.nlargest(1, iterable, key=keyfunc)``.
.. function:: memoryview(obj)
:noindex:
@ -651,6 +655,10 @@ are always available. They are listed here in alphabetical order.
The optional keyword-only *key* argument specifies a one-argument ordering
function like that used for :meth:`list.sort`.
If multiple items are minimal, the function returns the first one encountered.
This is consistent with other sort-stability preserving tools such as
``sorted(iterable, key=keyfunc)[0]` and
``heapq.nsmallest(1, iterable, key=keyfunc)``.
.. function:: next(iterator[, default])