File tree Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Original file line number Diff line number Diff line change 31
31
/// }
32
32
///
33
33
/// public func makeAsyncIterator() -> AsyncBufferedByteIterator {
34
- /// return BufferedAsyncByteIterator (capacity: 16384) { buffer in
34
+ /// return AsyncBufferedByteIterator (capacity: 16384) { buffer in
35
35
/// // This runs once every 16384 invocations of next()
36
36
/// return try await handle.read(into: buffer)
37
37
/// }
@@ -112,7 +112,7 @@ internal struct _AsyncBytesBuffer: @unchecked Sendable {
112
112
do {
113
113
// If two tasks have access to this iterator then the references on
114
114
// the storage will be non uniquely owned. This means that any reload
115
- // must happen into it's own fresh buffer. The consumption of those
115
+ // must happen into its own fresh buffer. The consumption of those
116
116
// bytes between two tasks are inherently defined as potential
117
117
// duplication by the nature of sending that buffer across the two
118
118
// tasks - this means that the brief period in which they may be
@@ -122,7 +122,7 @@ internal struct _AsyncBytesBuffer: @unchecked Sendable {
122
122
// should not be crash, but it definitely cannot be consistent.
123
123
//
124
124
// The unique ref check is here to prevent the potentials of a crashing
125
- // secnario .
125
+ // scenario .
126
126
if !isKnownUniquelyReferenced( & storage) {
127
127
// The count is not mutated across invocations so the access is safe.
128
128
let capacity = storage. buffer. count
You can’t perform that action at this time.
0 commit comments