Simplify the nlargest() code using heappushpop().

2008-03-13 19:33:34 +00:00 · 2008-03-13 19:33:34 +00:00 · 83aa6a3b1a
parent 53bdf09343
commit 83aa6a3b1a
1 changed files with 2 additions and 6 deletions
--- a/Lib/heapq.py
+++ b/Lib/heapq.py
@ -193,13 +193,9 @@ def nlargest(n, iterable):
    if not result:
        return result
    heapify(result)
-    _heapreplace = heapreplace
-    sol = result[0]         # sol --> smallest of the nlargest
+    _heappushpop = heappushpop
    for elem in it:
-        if elem <= sol:
-            continue
-        _heapreplace(result, elem)
-        sol = result[0]
+        heappushpop(result, elem)
    result.sort(reverse=True)
    return result