- Notifications
You must be signed in to change notification settings - Fork 162
/
Copy pathAsyncThrowingInclusiveReductionsSequence.swift
112 lines (99 loc) · 3.73 KB
/
AsyncThrowingInclusiveReductionsSequence.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Async Algorithms open source project
//
// Copyright (c) 2022 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
//
//===----------------------------------------------------------------------===//
@available(AsyncAlgorithms 1.0,*)
extensionAsyncSequence{
/// Returns an asynchronous sequence containing the accumulated results of combining the
/// elements of the asynchronous sequence using the given error-throwing closure.
///
/// This can be seen as applying the reduce function to each element and
/// providing the initial value followed by these results as an asynchronous sequence.
///
/// ```
/// let runningTotal = [1, 2, 3, 4].async.reductions(+)
/// print(await Array(runningTotal))
///
/// // prints [1, 3, 6, 10]
/// ```
///
/// - Parameter transform: A closure that combines the previously reduced
/// result and the next element in the receiving sequence. If the closure
/// throws an error, the sequence throws.
/// - Returns: An asynchronous sequence of the reduced elements.
@available(AsyncAlgorithms 1.0,*)
@inlinable
publicfunc reductions(
_ transform:@Sendable@escaping(Element, Element)asyncthrows->Element
)->AsyncThrowingInclusiveReductionsSequence<Self>{
AsyncThrowingInclusiveReductionsSequence(self, transform: transform)
}
}
/// An asynchronous sequence containing the accumulated results of combining the
/// elements of the asynchronous sequence using a given error-throwing closure.
@available(AsyncAlgorithms 1.0,*)
@frozen
publicstructAsyncThrowingInclusiveReductionsSequence<Base:AsyncSequence>{
@usableFromInline
letbase:Base
@usableFromInline
lettransform:@Sendable(Base.Element,Base.Element)asyncthrows->Base.Element
@inlinable
init(_ base:Base, transform:@Sendable@escaping(Base.Element,Base.Element)asyncthrows->Base.Element){
self.base = base
self.transform = transform
}
}
@available(AsyncAlgorithms 1.0,*)
extensionAsyncThrowingInclusiveReductionsSequence:AsyncSequence{
publictypealiasElement=Base.Element
/// The iterator for an `AsyncThrowingInclusiveReductionsSequence` instance.
@available(AsyncAlgorithms 1.0,*)
@frozen
publicstructIterator:AsyncIteratorProtocol{
@usableFromInline
internalvariterator:Base.AsyncIterator?
@usableFromInline
internalvarelement:Base.Element?
@usableFromInline
internallettransform:@Sendable(Base.Element,Base.Element)asyncthrows->Base.Element
@inlinable
init(
_ iterator:Base.AsyncIterator,
transform:@Sendable@escaping(Base.Element,Base.Element)asyncthrows->Base.Element
){
self.iterator = iterator
self.transform = transform
}
@inlinable
publicmutatingfunc next()asyncthrows->Base.Element?{
guardlet previous = element else{
element =tryawait iterator?.next()
return element
}
guardlet next =tryawait iterator?.next()else{returnnil}
do{
element =tryawaittransform(previous, next)
}catch{
iterator =nil
throw error
}
return element
}
}
@available(AsyncAlgorithms 1.0,*)
@inlinable
publicfunc makeAsyncIterator()->Iterator{
Iterator(base.makeAsyncIterator(), transform: transform)
}
}
@available(AsyncAlgorithms 1.0,*)
extensionAsyncThrowingInclusiveReductionsSequence:Sendablewhere Base:Sendable{}
@available(*, unavailable)
extensionAsyncThrowingInclusiveReductionsSequence.Iterator:Sendable{}