https://github.com/python/cpython/commit/c7d7105b8d230741a5fa04924701d5245d07dace
commit: c7d7105b8d230741a5fa04924701d5245d07dace
branch: main
author: Raymond Hettinger <[email protected]>
committer: rhettinger <[email protected]>
date: 2026-02-23T12:31:35-06:00
summary:
Indexing is more straight-forward (and faster) than unpacking (gh-145154)
files:
M Lib/heapq.py
diff --git a/Lib/heapq.py b/Lib/heapq.py
index f944376bcd291f..a3af6dc05bff37 100644
--- a/Lib/heapq.py
+++ b/Lib/heapq.py
@@ -511,7 +511,7 @@ def nsmallest(n, iterable, key=None):
for elem in it:
if elem < top:
_heapreplace(result, (elem, order))
- top, _order = result[0]
+ top = result[0][0]
order += 1
result.sort()
return [elem for (elem, order) in result]
@@ -529,7 +529,7 @@ def nsmallest(n, iterable, key=None):
k = key(elem)
if k < top:
_heapreplace(result, (k, order, elem))
- top, _order, _elem = result[0]
+ top = result[0][0]
order += 1
result.sort()
return [elem for (k, order, elem) in result]
@@ -569,7 +569,7 @@ def nlargest(n, iterable, key=None):
for elem in it:
if top < elem:
_heapreplace(result, (elem, order))
- top, _order = result[0]
+ top = result[0][0]
order -= 1
result.sort(reverse=True)
return [elem for (elem, order) in result]
@@ -587,7 +587,7 @@ def nlargest(n, iterable, key=None):
k = key(elem)
if top < k:
_heapreplace(result, (k, order, elem))
- top, _order, _elem = result[0]
+ top = result[0][0]
order -= 1
result.sort(reverse=True)
return [elem for (k, order, elem) in result]
_______________________________________________
Python-checkins mailing list -- [email protected]
To unsubscribe send an email to [email protected]
https://mail.python.org/mailman3//lists/python-checkins.python.org
Member address: [email protected]
