Skip to content

gh-62480: Remove first-person language from heapq documentation #144665

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
bBlazewavE wants to merge 4 commits into
base: main
Choose a base branch
from
Open

gh-62480: Remove first-person language from heapq documentation #144665

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
7a9906e
Remove first-person language from heapq documentation
bBlazewavE Feb 10, 2026
b03c5db
Merge branch 'main' into fix-personalized-docs-heapq
bBlazewavE Feb 10, 2026
b819b29
Simplify closing sentence in heapq Theory section
bBlazewavE Feb 10, 2026
01b318a
Remove inaccurate MIDI sequencer reference from heapq docs
bBlazewavE Feb 10, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 3 additions & 5 deletions Doc/library/heapq.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
I used for my MIDI sequencer :-).
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
Expand All @@ -404,8 +403,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. 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.

.. rubric:: Footnotes

Expand All @@ -415,6 +413,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! :-)
Loading