-
Notifications
You must be signed in to change notification settings - Fork 10.5k
/
Copy path0022-rdar21625478.swift
429 lines (358 loc) · 11 KB
/
0022-rdar21625478.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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
// RUN: %target-swift-frontend %s -emit-silgen
import StdlibUnittest
public struct MyRange<Bound : ForwardIndex> {
var startIndex: Bound
var endIndex: Bound
}
public protocol ForwardIndex : Equatable {
associatedtype Distance : SignedNumeric
func successor() -> Self
}
public protocol MySequence {
associatedtype Iterator : IteratorProtocol
associatedtype SubSequence = Void
func makeIterator() -> Iterator
var underestimatedCount: Int { get }
func map<T>(
_ transform: (Iterator.Element) -> T
) -> [T]
func filter(
_ isIncluded: (Iterator.Element) -> Bool
) -> [Iterator.Element]
func _customContainsEquatableElement(
_ element: Iterator.Element
) -> Bool?
func _preprocessingPass<R>(
_ preprocess: (Self) -> R
) -> R?
func _copyToContiguousArray()
-> ContiguousArray<Iterator.Element>
func _copyContents(
initializing ptr: UnsafeMutablePointer<Iterator.Element>
) -> UnsafeMutablePointer<Iterator.Element>
}
extension MySequence {
var underestimatedCount: Int {
return 0
}
public func map<T>(
_ transform: (Iterator.Element) -> T
) -> [T] {
return []
}
public func filter(
_ isIncluded: (Iterator.Element) -> Bool
) -> [Iterator.Element] {
return []
}
public func _customContainsEquatableElement(
_ element: Iterator.Element
) -> Bool? {
return nil
}
public func _preprocessingPass<R>(
_ preprocess: (Self) -> R
) -> R? {
return nil
}
public func _copyToContiguousArray()
-> ContiguousArray<Iterator.Element> {
fatalError()
}
public func _copyContents(
initializing ptr: UnsafeMutablePointer<Iterator.Element>
) -> UnsafeMutablePointer<Iterator.Element> {
fatalError()
}
}
public protocol MyIndexable : MySequence {
associatedtype Index : ForwardIndex
var startIndex: Index { get }
var endIndex: Index { get }
associatedtype _Element
subscript(_: Index) -> _Element { get }
}
public protocol MyCollection : MyIndexable {
associatedtype Iterator : IteratorProtocol = IndexingIterator<Self>
associatedtype SubSequence : MySequence
subscript(_: Index) -> Iterator.Element { get }
subscript(_: MyRange<Index>) -> SubSequence { get }
var first: Iterator.Element? { get }
var isEmpty: Bool { get }
var count: Index.Distance { get }
func _customIndexOfEquatableElement(_ element: Iterator.Element) -> Index??
}
extension MyCollection {
public var isEmpty: Bool {
return startIndex == endIndex
}
public func _preprocessingPass<R>(
_ preprocess: (Self) -> R
) -> R? {
return preprocess(self)
}
public var count: Index.Distance { return 0 }
public func _customIndexOfEquatableElement(_ element: Iterator.Element) -> Index?? {
return nil
}
}
public struct IndexingIterator<I : MyIndexable> : IteratorProtocol {
public func next() -> I._Element? {
return nil
}
}
protocol Resettable : AnyObject {
func reset()
}
internal var _allResettables: [Resettable] = []
public class TypeIndexed<Value> : Resettable {
public init(_ value: Value) {
self.defaultValue = value
_allResettables.append(self)
}
public subscript(t: Any.Type) -> Value {
get {
return byType[ObjectIdentifier(t)] ?? defaultValue
}
set {
byType[ObjectIdentifier(t)] = newValue
}
}
public func reset() { byType = [:] }
internal var byType: [ObjectIdentifier:Value] = [:]
internal var defaultValue: Value
}
//===--- LoggingWrappers.swift --------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 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
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
public protocol Wrapper {
associatedtype Base
init(_: Base)
var base: Base {get set}
}
public protocol LoggingType : Wrapper {
associatedtype Log : AnyObject
}
extension LoggingType {
public var log: Log.Type {
return Log.self
}
public var selfType: Any.Type {
return type(of: self)
}
}
public class IteratorLog {
public static func dispatchTester<G : IteratorProtocol>(
_ g: G
) -> LoggingIterator<LoggingIterator<G>> {
return LoggingIterator(LoggingIterator(g))
}
public static var next = TypeIndexed(0)
}
public struct LoggingIterator<Base: IteratorProtocol>
: IteratorProtocol, LoggingType {
public typealias Log = IteratorLog
public init(_ base: Base) {
self.base = base
}
public mutating func next() -> Base.Element? {
Log.next[selfType] += 1
return base.next()
}
public var base: Base
}
public class SequenceLog {
public static func dispatchTester<S: MySequence>(
_ s: S
) -> LoggingSequence<LoggingSequence<S>> {
return LoggingSequence(LoggingSequence(s))
}
public static var iterator = TypeIndexed(0)
public static var underestimatedCount = TypeIndexed(0)
public static var map = TypeIndexed(0)
public static var filter = TypeIndexed(0)
public static var _customContainsEquatableElement = TypeIndexed(0)
public static var _preprocessingPass = TypeIndexed(0)
public static var _copyToContiguousArray = TypeIndexed(0)
public static var _copyContents = TypeIndexed(0)
}
public protocol LoggingSequenceType : MySequence, LoggingType {
associatedtype Base : MySequence
associatedtype Log : AnyObject = SequenceLog
associatedtype Iterator : IteratorProtocol = LoggingIterator<Base.Iterator>
}
extension LoggingSequenceType {
public var underestimatedCount: Int {
SequenceLog.underestimatedCount[selfType] += 1
return base.underestimatedCount
}
}
extension LoggingSequenceType
where Log == SequenceLog, Iterator == LoggingIterator<Base.Iterator> {
public func makeIterator() -> LoggingIterator<Base.Iterator> {
Log.iterator[selfType] += 1
return LoggingIterator(base.makeIterator())
}
public func map<T>(
_ transform: (Base.Iterator.Element) -> T
) -> [T] {
Log.map[selfType] += 1
return base.map(transform)
}
public func filter(
_ isIncluded: (Base.Iterator.Element) -> Bool
) -> [Base.Iterator.Element] {
Log.filter[selfType] += 1
return base.filter(isIncluded)
}
public func _customContainsEquatableElement(
_ element: Base.Iterator.Element
) -> Bool? {
Log._customContainsEquatableElement[selfType] += 1
return base._customContainsEquatableElement(element)
}
/// If `self` is multi-pass (i.e., a `Collection`), invoke
/// `preprocess` on `self` and return its result. Otherwise, return
/// `nil`.
public func _preprocessingPass<R>(
_ preprocess: (Self) -> R
) -> R? {
Log._preprocessingPass[selfType] += 1
return base._preprocessingPass { _ in preprocess(self) }
}
/// Create a native array buffer containing the elements of `self`,
/// in the same order.
public func _copyToContiguousArray()
-> ContiguousArray<Base.Iterator.Element> {
Log._copyToContiguousArray[selfType] += 1
return base._copyToContiguousArray()
}
/// Copy a Sequence into an array.
public func _copyContents(
initializing ptr: UnsafeMutablePointer<Base.Iterator.Element>
) -> UnsafeMutablePointer<Base.Iterator.Element> {
Log._copyContents[selfType] += 1
return base._copyContents(initializing: ptr)
}
}
public struct LoggingSequence<
Base_: MySequence
> : LoggingSequenceType, MySequence {
public typealias Log = SequenceLog
public typealias Base = Base_
public init(_ base: Base_) {
self.base = base
}
public var base: Base_
}
public class CollectionLog : SequenceLog {
public class func dispatchTester<C: MyCollection>(
_ c: C
) -> LoggingCollection<LoggingCollection<C>> {
return LoggingCollection(LoggingCollection(c))
}
static var startIndex = TypeIndexed(0)
static var endIndex = TypeIndexed(0)
static var subscriptIndex = TypeIndexed(0)
static var subscriptRange = TypeIndexed(0)
static var isEmpty = TypeIndexed(0)
static var count = TypeIndexed(0)
static var _customIndexOfEquatableElement = TypeIndexed(0)
static var first = TypeIndexed(0)
}
public protocol LoggingCollectionType : LoggingSequenceType, MyCollection {
associatedtype Base : MyCollection
associatedtype Index : ForwardIndex = Base.Index
}
extension LoggingCollectionType
where Index == Base.Index {
public var startIndex: Base.Index {
CollectionLog.startIndex[selfType] += 1
return base.startIndex
}
public var endIndex: Base.Index {
CollectionLog.endIndex[selfType] += 1
return base.endIndex
}
public subscript(position: Base.Index) -> Base.Iterator.Element {
CollectionLog.subscriptIndex[selfType] += 1
return base[position]
}
public subscript(_prext_bounds: MyRange<Base.Index>) -> Base.SubSequence {
CollectionLog.subscriptRange[selfType] += 1
return base[_prext_bounds]
}
public var isEmpty: Bool {
CollectionLog.isEmpty[selfType] += 1
return base.isEmpty
}
public var count: Base.Index.Distance {
CollectionLog.count[selfType] += 1
return base.count
}
public func _customIndexOfEquatableElement(_ element: Base.Iterator.Element) -> Base.Index?? {
CollectionLog._customIndexOfEquatableElement[selfType] += 1
return base._customIndexOfEquatableElement(element)
}
public var first: Base.Iterator.Element? {
CollectionLog.first[selfType] += 1
return base.first
}
}
public struct LoggingCollection<Base_ : MyCollection> : LoggingCollectionType {
public typealias Iterator = LoggingIterator<Base.Iterator>
public typealias Log = CollectionLog
public typealias Base = Base_
public typealias SubSequence = Base.SubSequence
public func makeIterator() -> Iterator {
return Iterator(base.makeIterator())
}
public init(_ base: Base_) {
self.base = base
}
public var base: Base_
}
public func expectCustomizable<
T : Wrapper
>(_: T, _ counters: TypeIndexed<Int>,
stackTrace: SourceLocStack? = nil,
file: String = #file, line: UInt = #line,
collectMoreInfo: (()->String)? = nil
)
where
T : LoggingType,
T.Base : Wrapper, T.Base : LoggingType,
T.Log == T.Base.Log {
expectNotEqual(
0, counters[T.self], collectMoreInfo?() ?? "",
stackTrace: stackTrace ?? SourceLocStack(), file: file, line: line)
expectEqual(
counters[T.self], counters[T.Base.self], collectMoreInfo?() ?? "",
stackTrace: stackTrace ?? SourceLocStack(), file: file, line: line)
}
public func expectNotCustomizable<
T : Wrapper
>(_: T, _ counters: TypeIndexed<Int>,
stackTrace: SourceLocStack? = nil,
file: String = #file, line: UInt = #line,
collectMoreInfo: (()->String)? = nil
)
where
T : LoggingType,
T.Base : Wrapper, T.Base : LoggingType,
T.Log == T.Base.Log {
expectNotEqual(
0, counters[T.self], collectMoreInfo?() ?? "",
stackTrace: stackTrace ?? SourceLocStack(), file: file, line: line)
expectEqual(
0, counters[T.Base.self], collectMoreInfo?() ?? "",
stackTrace: stackTrace ?? SourceLocStack(), file: file, line: line)
}