From e663bf61b63781e5b2d86e8a44fe59cbbef856e4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Rodrigo=20Gir=C3=A3o=20Serr=C3=A3o?=
 <5621605+rodrigogiraoserrao@users.noreply.github.com>
Date: Sun, 26 Oct 2025 14:30:20 +0000
Subject: [PATCH 1/2] Fix indentation in 'see also'.

The only necessary tweak was deleting one space from the line with the comment '.. XXX Add references...' because the four spaces were making the whole thing be interpreted as a blockquote.
See more: https://stackoverflow.com/a/4783854
---
 Doc/library/concurrent.interpreters.rst | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Doc/library/concurrent.interpreters.rst b/Doc/library/concurrent.interpreters.rst
index 41ea6af3b226e9..55036090e8d5b8 100644
--- a/Doc/library/concurrent.interpreters.rst
+++ b/Doc/library/concurrent.interpreters.rst
@@ -29,12 +29,12 @@ Actual concurrency is available separately through
 .. seealso::
 
    :class:`~concurrent.futures.InterpreterPoolExecutor`
-      combines threads with interpreters in a familiar interface.
+      Combines threads with interpreters in a familiar interface.
 
-    .. XXX Add references to the upcoming HOWTO docs in the seealso block.
+   .. XXX Add references to the upcoming HOWTO docs in the seealso block.
 
    :ref:`isolating-extensions-howto`
-       how to update an extension module to support multiple interpreters
+      How to update an extension module to support multiple interpreters.
 
    :pep:`554`
 

From 8611cdacae07e450a300634ec76c88eb2adcc3be Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Rodrigo=20Gir=C3=A3o=20Serr=C3=A3o?=
 <5621605+rodrigogiraoserrao@users.noreply.github.com>
Date: Sun, 26 Oct 2025 14:31:22 +0000
Subject: [PATCH 2/2] Reorder min-heap functions.

This is a more reasonable order and matches the order of the functions for the max-heap section.
---
 Doc/library/heapq.rst | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index 95ef72469b18ef..5049262306a228 100644
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -58,6 +58,11 @@ functions, respectively.
 The following functions are provided for min-heaps:
 
 
+.. function:: heapify(x)
+
+   Transform list *x* into a min-heap, in-place, in linear time.
+
+
 .. function:: heappush(heap, item)
 
    Push the value *item* onto the *heap*, maintaining the min-heap invariant.
@@ -77,11 +82,6 @@ The following functions are provided for min-heaps:
    followed by a separate call to :func:`heappop`.
 
 
-.. function:: heapify(x)
-
-   Transform list *x* into a min-heap, in-place, in linear time.
-
-
 .. function:: heapreplace(heap, item)
 
    Pop and return the smallest item from the *heap*, and also push the new *item*.