Raymond Hettinger <raymond.hettin...@gmail.com> wrote: >Matthew Woodcraft wrote: >> In CPython, the builtin max() and min() have the property that if there >> are items with equal keys, the first item is returned. From a quick look >> at their source, I think this is true for Jython and IronPython too.
>> However, this isn't currently a documented guarantee. Could it be made >> so? (As with the decision to declare sort() stable, it seems likely that >> by now there's code out there relying on it anyway.) > That seems like a reasonable request. This behavior has been around > for a very long time is unlikely to change. Elsewhere, we've made > efforts to document sort stability (i.e. sorted(), heapq.nlargest(), > heapq.nsmallest, merge(), etc). I've submitted issue 9802 as a feature request with a concrete suggestion for the docs. -M- _______________________________________________ Python-Dev mailing list Python-Dev@python.org http://mail.python.org/mailman/listinfo/python-dev Unsubscribe: http://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
