Port r69838: Speedup and simplify negative counter using count's new step argument.
diff --git a/Lib/heapq.py b/Lib/heapq.py
index 529fc2b..b361631 100644
--- a/Lib/heapq.py
+++ b/Lib/heapq.py
@@ -130,7 +130,7 @@
'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 @@
# 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