Issue #18471: Fix typo in heapq documentation (reported by François Pinard).
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index 768dfdc..4f1a682 100644
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -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 :-).