From 7a9906e51ee2a3890a0938a3182d8a171277de29 Mon Sep 17 00:00:00 2001 From: bBlazewavE Date: Tue, 10 Feb 2026 10:41:09 -0300 Subject: [PATCH 1/3] Remove first-person language from heapq documentation --- Doc/library/heapq.rst | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index 5049262306a228..e2bbe483c64da0 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -378,7 +378,7 @@ contexts, where the tree holds all incoming events, and the "win" condition means the smallest scheduled time. When an event schedules other events for execution, they are scheduled into the future, so they can easily go into the heap. So, a heap is a good structure for implementing schedulers (this is what -I used for my MIDI sequencer :-). +was used for the MIDI sequencer in the standard library). Various structures for implementing schedulers have been extensively studied, and heaps are good for this, as they are reasonably speedy, the speed is almost @@ -404,8 +404,8 @@ which grows at exactly the same rate the first heap is melting. When the first heap completely vanishes, you switch heaps and start a new run. Clever and quite effective! -In a word, heaps are useful memory structures to know. I use them in a few -applications, and I think it is good to keep a 'heap' module around. :-) +In a word, heaps are useful memory structures to know. They are used in a number +of applications, and it is good to keep a 'heap' module around. :-) .. rubric:: Footnotes @@ -415,6 +415,6 @@ applications, and I think it is good to keep a 'heap' module around. :-) different, and one had to be very clever to ensure (far in advance) that each tape movement will be the most effective possible (that is, will best participate at "progressing" the merge). Some tapes were even able to read - backwards, and this was also used to avoid the rewinding time. Believe me, real + backwards, and this was also used to avoid the rewinding time. Real good tape sorts were quite spectacular to watch! From all times, sorting has always been a Great Art! :-) From b819b2903539c8eef2352af16cdc05fe02d5e367 Mon Sep 17 00:00:00 2001 From: Dimple Date: Tue, 10 Feb 2026 13:01:57 -0300 Subject: [PATCH 2/3] Simplify closing sentence in heapq Theory section Address review feedback: drop the remainder of the sentence after "heaps are useful memory structures to know" to avoid awkward impersonal rewording of the original first-person text. --- Doc/library/heapq.rst | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index e2bbe483c64da0..5408fc6b4eaf4a 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -404,8 +404,7 @@ which grows at exactly the same rate the first heap is melting. When the first heap completely vanishes, you switch heaps and start a new run. Clever and quite effective! -In a word, heaps are useful memory structures to know. They are used in a number -of applications, and it is good to keep a 'heap' module around. :-) +In a word, heaps are useful memory structures to know. .. rubric:: Footnotes From 01b318a0e5f6f63ae7c95c1a9d55d51e77310514 Mon Sep 17 00:00:00 2001 From: Dimple Date: Tue, 10 Feb 2026 13:08:23 -0300 Subject: [PATCH 3/3] Remove inaccurate MIDI sequencer reference from heapq docs Address review feedback: the parenthetical claimed a MIDI sequencer exists in the standard library, which it does not. Drop the reference and keep the sentence concise. --- Doc/library/heapq.rst | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index 5408fc6b4eaf4a..25c8d9c3e4ca6f 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -377,8 +377,7 @@ last 0'th element you extracted. This is especially useful in simulation contexts, where the tree holds all incoming events, and the "win" condition means the smallest scheduled time. When an event schedules other events for execution, they are scheduled into the future, so they can easily go into the -heap. So, a heap is a good structure for implementing schedulers (this is what -was used for the MIDI sequencer in the standard library). +heap. So, a heap is a good structure for implementing schedulers. Various structures for implementing schedulers have been extensively studied, and heaps are good for this, as they are reasonably speedy, the speed is almost