summaryrefslogtreecommitdiff
path: root/Lib/heapq.py
diff options
context:
space:
mode:
authorGeorg Brandl <georg@python.org>2009-01-03 22:03:11 +0000
committerGeorg Brandl <georg@python.org>2009-01-03 22:03:11 +0000
commitfe427895b58769840f1f61a82ea0cdfe55150347 (patch)
treeba6fc9493239a122199292caada1e9345d26e8f6 /Lib/heapq.py
parentc63785db867804de8b676ddddcc90c3fcbf2c111 (diff)
downloadcpython-git-fe427895b58769840f1f61a82ea0cdfe55150347.tar.gz
Manually merge r68095,68186,68187,68188,68190 from 2.6 branch.
Diffstat (limited to 'Lib/heapq.py')
-rw-r--r--Lib/heapq.py8
1 files changed, 8 insertions, 0 deletions
diff --git a/Lib/heapq.py b/Lib/heapq.py
index 0a83b76b46..c13d6500b6 100644
--- a/Lib/heapq.py
+++ b/Lib/heapq.py
@@ -354,6 +354,10 @@ def nsmallest(n, iterable, key=None):
Equivalent to: sorted(iterable, key=key)[:n]
"""
+ if key is None:
+ it = izip(iterable, count()) # decorate
+ result = _nsmallest(n, it)
+ return map(itemgetter(0), result) # undecorate
in1, in2 = tee(iterable)
it = izip(imap(key, in1), count(), in2) # decorate
result = _nsmallest(n, it)
@@ -365,6 +369,10 @@ def nlargest(n, iterable, key=None):
Equivalent to: sorted(iterable, key=key, reverse=True)[:n]
"""
+ if key is None:
+ it = izip(iterable, imap(neg, count())) # decorate
+ result = _nlargest(n, it)
+ return map(itemgetter(0), result) # undecorate
in1, in2 = tee(iterable)
it = izip(imap(key, in1), imap(neg, count()), in2) # decorate
result = _nlargest(n, it)