@@ -17,7 +17,7 @@ three different points in the idea maze of subscriptions, and we'll
1717encounter each of them here.
1818
1919For our purposes, a subscription is a stream of events from a publisher
20−to a subscriber, where (1) the publisher has indicated interest in that
20+to a subscriber, where (1) the subscriber has indicated interest in that
2121stream, (2) any update sent to one subscriber is sent to all subscribers
2222on the same stream, and (3) when the publisher has a new update ready,
2323they send it immediately to their subscribers instead of waiting for a
@@ -102,7 +102,7 @@ stuck in memory until the subscriber comes back online.
102102Buffers are commonly bounded by size, but this puts constraints on the
103103types of messages may be sent. They may also be bounded in time: if the
104104subscriber stops taking messages for at least X time, the buffer is
105−full. Gall taks a hybrid approach; currently the heuristic is that the
105+full. Gall takes a hybrid approach; currently the heuristic is that the
106106buffer counts as full if it has at least five messages and it has been
10710730 seconds since a message was acknowledged.
108108