From 79cae38d52578aca4352e7facd7fbcc808fef4d0 Mon Sep 17 00:00:00 2001
From: Raymond Hettinger <raymond.hettinger@gmail.com>
Date: Mon, 23 Feb 2026 11:59:04 -0600
Subject: [PATCH] Indexing is more straight-forward (and faster) than unpacking

---
 Lib/heapq.py | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

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]