Mercurial > cpython-lru_cache-weakref
changeset 84652:8a078bf3cf14
Closes #18471: Fix typo in heapq documentation (reported by François Pinard).
| author | Ned Deily <nad@acm.org> |
|---|---|
| date | Mon, 15 Jul 2013 19:09:27 -0700 |
| parents | 9213313b1a6f (current diff) e22dd5fda5a8 (diff) |
| children | 2650127ce034 |
| files | |
| diffstat | 1 files changed, 1 insertions(+), 1 deletions(-) [+] |
line wrap: on
line diff
--- a/Doc/library/heapq.rst Tue Jul 16 01:54:37 2013 +0200 +++ b/Doc/library/heapq.rst Mon Jul 15 19:09:27 2013 -0700 @@ -246,7 +246,7 @@ 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 :-).