|
10 | 10 | //===----------------------------------------------------------------------===//
|
11 | 11 |
|
12 | 12 | /// Creates an asynchronous sequence of elements from two underlying asynchronous sequences
|
13 |
| -public func merge<Base1: AsyncSequence, Base2: AsyncSequence>(_ base1: Base1, _ base2: Base2) -> AsyncMerge2Sequence<Base1, Base2> |
14 |
| -where |
15 |
| - Base1.Element == Base2.Element, |
16 |
| - Base1: Sendable, Base2: Sendable, |
17 |
| - Base1.Element: Sendable, |
18 |
| - Base1.AsyncIterator: Sendable, Base2.AsyncIterator: Sendable { |
19 |
| - return AsyncMerge2Sequence(base1, base2) |
20 |
| -} |
21 |
| - |
22 |
| -struct Merge2StateMachine<Base1: AsyncSequence, Base2: AsyncSequence>: Sendable where Base1.AsyncIterator: Sendable, Base2.AsyncIterator: Sendable, Base1.Element: Sendable, Base2.Element: Sendable { |
23 |
| - typealias Element1 = Base1.Element |
24 |
| - typealias Element2 = Base2.Element |
25 |
| - |
26 |
| - let iter1TerminatesOnNil : Bool |
27 |
| - let iter2terminatesOnNil : Bool |
28 |
| - |
29 |
| - enum Partial: @unchecked Sendable { |
30 |
| - case first(Result<Element1?, Error>, Base1.AsyncIterator) |
31 |
| - case second(Result<Element2?, Error>, Base2.AsyncIterator) |
32 |
| - } |
33 |
| - |
34 |
| - enum Either { |
35 |
| - case first(Base1.Element) |
36 |
| - case second(Base2.Element) |
37 |
| - } |
38 |
| - |
39 |
| - var state: (PartialIteration<Base1.AsyncIterator, Partial>, PartialIteration<Base2.AsyncIterator, Partial>) |
40 |
| - |
41 |
| - init(_ iterator1: Base1.AsyncIterator, terminatesOnNil iter1TerminatesOnNil: Bool = false, _ iterator2: Base2.AsyncIterator, terminatesOnNil iter2terminatesOnNil: Bool = false) { |
42 |
| - self.iter1TerminatesOnNil = iter1TerminatesOnNil |
43 |
| - self.iter2terminatesOnNil = iter2terminatesOnNil |
44 |
| - state = (.idle(iterator1), .idle(iterator2)) |
45 |
| - } |
46 |
| - |
47 |
| - mutating func apply(_ task1: Task<Merge2StateMachine<Base1, Base2>.Partial, Never>?, _ task2: Task<Merge2StateMachine<Base1, Base2>.Partial, Never>?) async rethrows -> Either? { |
48 |
| - switch await Task.select([task1, task2].compactMap ({ $0 })).value { |
49 |
| - case .first(let result, let iterator): |
50 |
| - do { |
51 |
| - guard let value = try state.0.resolve(result, iterator) else { |
52 |
| - if iter1TerminatesOnNil { |
53 |
| - state.1.cancel() |
54 |
| - return nil |
55 |
| - } |
56 |
| - return try await next() |
57 |
| - } |
58 |
| - return .first(value) |
59 |
| - } catch { |
60 |
| - state.1.cancel() |
61 |
| - throw error |
62 |
| - } |
63 |
| - case .second(let result, let iterator): |
64 |
| - do { |
65 |
| - guard let value = try state.1.resolve(result, iterator) else { |
66 |
| - if iter2terminatesOnNil { |
67 |
| - state.0.cancel() |
68 |
| - return nil |
69 |
| - } |
70 |
| - return try await next() |
71 |
| - } |
72 |
| - return .second(value) |
73 |
| - } catch { |
74 |
| - state.0.cancel() |
75 |
| - throw error |
76 |
| - } |
77 |
| - } |
78 |
| - } |
79 |
| - |
80 |
| - func first(_ iterator1: Base1.AsyncIterator) -> Task<Partial, Never> { |
81 |
| - Task { |
82 |
| - var iter = iterator1 |
83 |
| - do { |
84 |
| - let value = try await iter.next() |
85 |
| - return .first(.success(value), iter) |
86 |
| - } catch { |
87 |
| - return .first(.failure(error), iter) |
88 |
| - } |
89 |
| - } |
90 |
| - } |
91 |
| - |
92 |
| - func second(_ iterator2: Base2.AsyncIterator) -> Task<Partial, Never> { |
93 |
| - Task { |
94 |
| - var iter = iterator2 |
95 |
| - do { |
96 |
| - let value = try await iter.next() |
97 |
| - return .second(.success(value), iter) |
98 |
| - } catch { |
99 |
| - return .second(.failure(error), iter) |
100 |
| - } |
101 |
| - } |
102 |
| - } |
103 |
| - |
104 |
| - /// Advances to the next element and returns it or `nil` if no next element exists. |
105 |
| - mutating func next() async rethrows -> Either? { |
106 |
| - if Task.isCancelled { |
107 |
| - state.0.cancel() |
108 |
| - state.1.cancel() |
109 |
| - return nil |
110 |
| - } |
111 |
| - switch state { |
112 |
| - case (.idle(let iterator1), .idle(let iterator2)): |
113 |
| - let task1 = first(iterator1) |
114 |
| - let task2 = second(iterator2) |
115 |
| - state = (.pending(task1), .pending(task2)) |
116 |
| - return try await apply(task1, task2) |
117 |
| - case (.idle(let iterator1), .pending(let task2)): |
118 |
| - let task1 = first(iterator1) |
119 |
| - state = (.pending(task1), .pending(task2)) |
120 |
| - return try await apply(task1, task2) |
121 |
| - case (.pending(let task1), .idle(let iterator2)): |
122 |
| - let task2 = second(iterator2) |
123 |
| - state = (.pending(task1), .pending(task2)) |
124 |
| - return try await apply(task1, task2) |
125 |
| - case (.idle(var iterator1), .terminal): |
126 |
| - do { |
127 |
| - if let value = try await iterator1.next() { |
128 |
| - state = (.idle(iterator1), .terminal) |
129 |
| - return .first(value) |
130 |
| - } else { |
131 |
| - state = (.terminal, .terminal) |
132 |
| - return nil |
133 |
| - } |
134 |
| - } catch { |
135 |
| - state = (.terminal, .terminal) |
136 |
| - throw error |
137 |
| - } |
138 |
| - case (.terminal, .idle(var iterator2)): |
139 |
| - do { |
140 |
| - if let value = try await iterator2.next() { |
141 |
| - state = (.terminal, .idle(iterator2)) |
142 |
| - return .second(value) |
143 |
| - } else { |
144 |
| - state = (.terminal, .terminal) |
145 |
| - return nil |
146 |
| - } |
147 |
| - } catch { |
148 |
| - state = (.terminal, .terminal) |
149 |
| - throw error |
150 |
| - } |
151 |
| - case (.terminal, .pending(let task2)): |
152 |
| - return try await apply(nil, task2) |
153 |
| - case (.pending(let task1), .pending(let task2)): |
154 |
| - return try await apply(task1, task2) |
155 |
| - case (.pending(let task1), .terminal): |
156 |
| - return try await apply(task1, nil) |
157 |
| - case (.terminal, .terminal): |
158 |
| - return nil |
159 |
| - } |
160 |
| - } |
161 |
| -} |
162 |
| - |
163 |
| -extension Merge2StateMachine.Either where Base1.Element == Base2.Element { |
164 |
| - var value : Base1.Element { |
165 |
| - switch self { |
166 |
| - case .first(let val): |
167 |
| - return val |
168 |
| - case .second(let val): |
169 |
| - return val |
170 |
| - } |
171 |
| - } |
| 13 | +public func merge<Base1: AsyncSequence, Base2: AsyncSequence>( |
| 14 | + _ base1: Base1, |
| 15 | + _ base2: Base2 |
| 16 | +) -> AsyncMerge2Sequence<Base1, Base2>{ |
| 17 | + AsyncMerge2Sequence(base1, base2) |
172 | 18 | }
|
173 | 19 |
|
174 | 20 | /// An asynchronous sequence of elements from two underlying asynchronous sequences
|
175 | 21 | ///
|
176 | 22 | /// In a `AsyncMerge2Sequence` instance, the *i*th element is the *i*th element
|
177 | 23 | /// resolved in sequential order out of the two underlying asynchronous sequences.
|
178 | 24 | /// Use the `merge(_:_:)` function to create an `AsyncMerge2Sequence`.
|
179 |
| -public struct AsyncMerge2Sequence<Base1: AsyncSequence, Base2: AsyncSequence>: AsyncSequence, Sendable |
180 |
| -where |
181 |
| - Base1.Element == Base2.Element, |
182 |
| - Base1: Sendable, Base2: Sendable, |
183 |
| - Base1.Element: Sendable, |
184 |
| - Base1.AsyncIterator: Sendable, Base2.AsyncIterator: Sendable { |
| 25 | +public struct AsyncMerge2Sequence<Base1: AsyncSequence, Base2: AsyncSequence>: AsyncSequence |
| 26 | +where Base1.Element == Base2.Element { |
185 | 27 | public typealias Element = Base1.Element
|
186 |
| - /// An iterator for `AsyncMerge2Sequence` |
187 |
| - public struct Iterator: AsyncIteratorProtocol, Sendable { |
188 |
| - var state: Merge2StateMachine<Base1, Base2> |
189 |
| - init(_ base1: Base1.AsyncIterator, _ base2: Base2.AsyncIterator) { |
190 |
| - state = Merge2StateMachine(base1, base2) |
191 |
| - } |
| 28 | + public typealias AsyncIterator = Iterator |
192 | 29 |
|
193 |
| - public mutating func next() async rethrows -> Element? { |
194 |
| - return try await state.next()?.value |
195 |
| - } |
196 |
| - } |
197 |
| - |
198 | 30 | let base1: Base1
|
199 | 31 | let base2: Base2
|
200 |
| - |
201 |
| - init(_ base1: Base1, _ base2: Base2) { |
| 32 | + |
| 33 | + public init(_ base1: Base1, _ base2: Base2) { |
202 | 34 | self.base1 = base1
|
203 | 35 | self.base2 = base2
|
204 | 36 | }
|
205 |
| - |
| 37 | + |
206 | 38 | public func makeAsyncIterator() -> Iterator {
|
207 |
| - return Iterator(base1.makeAsyncIterator(), base2.makeAsyncIterator()) |
| 39 | + Iterator( |
| 40 | + base1: self.base1, |
| 41 | + base2: self.base2 |
| 42 | + ) |
| 43 | + } |
| 44 | + |
| 45 | + public struct Iterator: AsyncIteratorProtocol { |
| 46 | + let mergeStateMachine: MergeStateMachine<Element> |
| 47 | + |
| 48 | + init(base1: Base1, base2: Base2) { |
| 49 | + self.mergeStateMachine = MergeStateMachine( |
| 50 | + base1, |
| 51 | + base2 |
| 52 | + ) |
| 53 | + } |
| 54 | + |
| 55 | + public mutating func next() async rethrows -> Element? { |
| 56 | + let mergedElement = await self.mergeStateMachine.next() |
| 57 | + switch mergedElement { |
| 58 | + case .element(let result): |
| 59 | + return try result._rethrowGet() |
| 60 | + case .termination: |
| 61 | + return nil |
| 62 | + } |
| 63 | + } |
208 | 64 | }
|
209 | 65 | }
|
| 66 | + |
| 67 | +extension AsyncMerge2Sequence: Sendable where Base1: Sendable, Base2: Sendable {} |
| 68 | +extension AsyncMerge2Sequence.Iterator: Sendable where Base1: Sendable, Base2: Sendable {} |
0 commit comments