mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-11-27 05:44:16 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 11

Closes #18471: Fix typo in heapq documentation (reported by François Pinard).

Browse source
This commit is contained in:
Ned Deily 2013-07-15 19:09:27 -07:00
commit eaaedcdd89
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Doc/library/heapq.rst
View file

@ -246,7 +246,7 @@ A nice feature of this sort is that you can efficiently insert new items while
the sort is going on, provided that the inserted items are not "better" than the the sort is going on, provided that the inserted items are not "better" than the
last 0'th element you extracted. This is especially useful in simulation last 0'th element you extracted. This is especially useful in simulation
contexts, where the tree holds all incoming events, and the "win" condition contexts, where the tree holds all incoming events, and the "win" condition
means the smallest scheduled time. When an event schedule other events for 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 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 heap. So, a heap is a good structure for implementing schedulers (this is what
I used for my MIDI sequencer :-). I used for my MIDI sequencer :-).