[Python-checkins] r69849 - python/branches/py3k/Lib/heapq.py

Sat Feb 21 23:10:21 CET 2009

Author: raymond.hettinger
Date: Sat Feb 21 23:10:18 2009
New Revision: 69849
Log:
Port r69838: Speedup and simplify negative counter using count's new step argument.
Modified:
 python/branches/py3k/Lib/heapq.py
Modified: python/branches/py3k/Lib/heapq.py
==============================================================================

--- python/branches/py3k/Lib/heapq.py	(original)
+++ python/branches/py3k/Lib/heapq.py	Sat Feb 21 23:10:18 2009
@@ -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
 
