Port r69838: Speedup and simplify negative counter using count's new step argument.

diff --git a/Lib/heapq.py b/Lib/heapq.py
index 529fc2b5e71b3eb1f4eafe5868e3649f5f4c1886..b3616312d9136c00bc597dc64ff131b70a38485b 100644 (file)
--- a/Lib/heapq.py
+++ b/Lib/heapq.py
@@ -130,7 +130,7 @@ __all__ = ['heappush', 'heappop', 'heapify', 'heapreplace', 'merge',
            'nlargest', 'nsmallest', 'heappushpop']
 
 from itertools import islice, repeat, count, tee, chain
-from operator import itemgetter, neg
+from operator import itemgetter
 import bisect
 
 def heappush(heap, item):
@@ -413,13 +413,13 @@ def nlargest(n, iterable, key=None):
 
     # When key is none, use simpler decoration
     if key is None:
-        it = zip(iterable, map(neg, count()))               # decorate
+        it = zip(iterable, count(0,-1))                     # decorate
         result = _nlargest(n, it)
         return list(map(itemgetter(0), result))             # undecorate
 
     # General case, slowest method
     in1, in2 = tee(iterable)
-    it = zip(map(key, in1), map(neg, count()), in2)         # decorate
+    it = zip(map(key, in1), count(0,-1), in2)               # decorate
     result = _nlargest(n, it)
     return list(map(itemgetter(2), result))                 # undecorate