diff options
| author | Raymond Hettinger <python@rcn.com> | 2009-02-21 22:10:18 +0000 |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2009-02-21 22:10:18 +0000 |
| commit | bd171bcfc416c71d2f5e3615f6a064dc2737e09b (patch) | |
| tree | 3f19e51b9ebbbf8ae9a6ad3a4bf954b8ce719fdb /Lib/heapq.py | |
| parent | 934896dc0977ea25dc37c13117525f2394625cee (diff) | |
| download | cpython-git-bd171bcfc416c71d2f5e3615f6a064dc2737e09b.tar.gz | |
Port r69838: Speedup and simplify negative counter using count's new step argument.
Diffstat (limited to 'Lib/heapq.py')
| -rw-r--r-- | Lib/heapq.py | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/Lib/heapq.py b/Lib/heapq.py index 529fc2b5e7..b3616312d9 100644 --- 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 |