[issue6614] heapq.nsmallest and nlargest should be smarter/more usable/more consistent

[Raymond Hettinger]

Raymond Hettinger <rhettinger at users.sourceforge.net> added the comment:

FWIW, 2.7 and 3.1 already have automatic selection of sort()/min()/max()
alternatives.  They use pure python to dispatch to the underlying C
functions:

http://svn.python.org/view/python/branches/release31-maint/Lib/heapq.py?revision=73579&view=markup

----------
assignee:  -> rhettinger
nosy: +rhettinger
resolution:  -> out of date
status: open -> closed
type: behavior -> performance
versions: +Python 3.2 -Python 2.5, Python 2.6, Python 3.0, Python 3.1

_______________________________________
Python tracker <report at bugs.python.org>
<http://bugs.python.org/issue6614>
_______________________________________