https://github.com/python/cpython/commit/e753887bd2f61eba4bfeca05db3290693d027239
commit: e753887bd2f61eba4bfeca05db3290693d027239
branch: 3.13
author: Rodrigo Girão Serrão
<[email protected]>
committer: hugovk <[email protected]>
date: 2025-11-06T17:37:31Z
summary:
[3.13] Minor documentation improvements (GH-140626) (#141161)
files:
M Doc/library/heapq.rst
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index d3c4b920ba500a..4db2a4eca8dbbd 100644
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -42,6 +42,11 @@ populated list into a heap via function :func:`heapify`.
The following functions are provided:
+.. function:: heapify(x)
+
+ Transform list *x* into a heap, in-place, in linear time.
+
+
.. function:: heappush(heap, item)
Push the value *item* onto the *heap*, maintaining the heap invariant.
@@ -61,11 +66,6 @@ The following functions are provided:
followed by a separate call to :func:`heappop`.
-.. function:: heapify(x)
-
- Transform list *x* into a 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*.
_______________________________________________
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]
