diff options
| author | Ned Deily <nad@acm.org> | 2013-07-15 19:08:13 -0700 |
|---|---|---|
| committer | Ned Deily <nad@acm.org> | 2013-07-15 19:08:13 -0700 |
| commit | 676d7aa905864157de630e5360291ccf7e6e997a (patch) | |
| tree | c77f076475afcad4acbf4fa84eba7128004d1368 /Doc | |
| parent | 224a599c0c0755a3a2602a9f0051a6707c8e1162 (diff) | |
| download | cpython-git-676d7aa905864157de630e5360291ccf7e6e997a.tar.gz | |
Issue #18471: Fix typo in heapq documentation (reported by François Pinard).
Diffstat (limited to 'Doc')
| -rw-r--r-- | Doc/library/heapq.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index 768dfdc67b..4f1a682a87 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -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 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 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 heap. So, a heap is a good structure for implementing schedulers (this is what I used for my MIDI sequencer :-). |