You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: Evolution/0006-combineLatest.md
+1-1
Original file line number
Diff line number
Diff line change
@@ -13,7 +13,7 @@
13
13
14
14
## Introduction
15
15
16
-
Similar to the `zip` algorithm there is a need to combine the latest values from multiple input asynchronous sequences. Since `AsyncSequence` augments the concept of sequence with the characteristic of time it means that the composition of elements may not just be pairwise emissions but instead be temporal composition. This means that it is useful to emit a new tuple _when_ a value is produced. The `combineLatest` algorithm provides precicely that.
16
+
Similar to the `zip` algorithm there is a need to combine the latest values from multiple input asynchronous sequences. Since `AsyncSequence` augments the concept of sequence with the characteristic of time it means that the composition of elements may not just be pairwise emissions but instead be temporal composition. This means that it is useful to emit a new tuple _when_ a value is produced. The `combineLatest` algorithm provides precisely that.
Copy file name to clipboardExpand all lines: Evolution/0010-buffer.md
+2-2
Original file line number
Diff line number
Diff line change
@@ -28,7 +28,7 @@ By applying the buffer operator to the previous example, the file can be read as
28
28
29
29
## Proposed Solution
30
30
31
-
We propose to extend `AsyncSequence` with a `buffer()` operator. This operator will return an `AsyncBuffereSequence` that wraps the source `AsyncSequence` and handle the buffering mechanism.
31
+
We propose to extend `AsyncSequence` with a `buffer()` operator. This operator will return an `AsyncBufferSequence` that wraps the source `AsyncSequence` and handle the buffering mechanism.
32
32
33
33
This operator will accept an `AsyncBufferSequencePolicy`. The policy will dictate the behaviour in case of a buffer overflow.
34
34
@@ -43,7 +43,7 @@ public struct AsyncBufferSequencePolicy: Sendable {
43
43
}
44
44
```
45
45
46
-
And the public API of `AsyncBuffereSequence` will be:
46
+
And the public API of `AsyncBufferSequence` will be:
Copy file name to clipboardExpand all lines: Evolution/NNNN-rate-limits.md
+1-1
Original file line number
Diff line number
Diff line change
@@ -18,7 +18,7 @@
18
18
19
19
## Introduction
20
20
21
-
When events can potentially happen faster than the desired consumption rate, there are multiple ways to handle the situation. One approach is to only emit values after a given period of time of inactivity, or "quiescence", has elapsed. This algorithm is commonly referred to as debouncing. A very close reelativee is an apporach to emit values after a given period has elapsed. These emitted values can be reduced from the values encountered during the waiting period. This algorithm is commonly referred to as throttling.
21
+
When events can potentially happen faster than the desired consumption rate, there are multiple ways to handle the situation. One approach is to only emit values after a given period of time of inactivity, or "quiescence", has elapsed. This algorithm is commonly referred to as debouncing. A very close relative is an approach to emit values after a given period has elapsed. These emitted values can be reduced from the values encountered during the waiting period. This algorithm is commonly referred to as throttling.
0 commit comments