| commit | 83aa6a3b1a6a406b3cde2fa7daa5d5b1db0cc6a7 | [log] [tgz] |
|---|---|---|
| author | Raymond Hettinger <python@rcn.com> | Thu Mar 13 19:33:34 2008 +0000 |
| committer | Raymond Hettinger <python@rcn.com> | Thu Mar 13 19:33:34 2008 +0000 |
| tree | 3f9d71d12360e412dce2a6ee48636e37599951e4 | |
| parent | 53bdf093437349907807da9143f9c2bdcea9ab3a [diff] [blame] |
Simplify the nlargest() code using heappushpop().
diff --git a/Lib/heapq.py b/Lib/heapq.py index 23f5fcb..4af9af1 100644 --- a/Lib/heapq.py +++ b/Lib/heapq.py
@@ -193,13 +193,9 @@ 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