From: Raymond Hettinger <rhettinger@users.noreply.github.com>
Date: Mon, 23 Feb 2026 18:31:35 +0000 (-0600)
Subject: Indexing is more straight-forward (and faster) than unpacking (gh-145154)
X-Git-Tag: v3.15.0a7~172
X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=c7d7105b8d230741a5fa04924701d5245d07dace;p=thirdparty%2FPython%2Fcpython.git

Indexing is more straight-forward (and faster) than unpacking (gh-145154)
---

diff --git a/Lib/heapq.py b/Lib/heapq.py
index f944376bcd29..a3af6dc05bff 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]