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
|
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2019 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See http://swift.org/LICENSE.txt for license information
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
#if !DARWIN_COMPATIBILITY_TESTS
struct IntSortable {
var value: Int
}
struct StringSortable {
var value: String
}
struct PlayerRecordSortable: Hashable {
var name: String
var victories: Int
var tiebreakerPoints: Int
}
class TestNSSortDescriptor: XCTestCase {
// Conceptually, requires a < firstCopyOfB, firstCopyOfB == secondCopyOfB, firstCopyOfB !== secondCopyOfB (if reference types)
private func assertObjectsPass<Root, Value: Comparable>(_ a: Root, _ firstCopyOfB: Root, _ secondCopyOfB: Root, keyPath: KeyPath<Root, Value>) {
do {
let sort = NSSortDescriptor(keyPath: keyPath, ascending: true)
XCTAssertEqual(sort.compare(a, to: firstCopyOfB), .orderedAscending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: a), .orderedDescending)
XCTAssertEqual(sort.compare(a, to: secondCopyOfB), .orderedAscending)
XCTAssertEqual(sort.compare(secondCopyOfB, to: a), .orderedDescending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: secondCopyOfB), .orderedSame)
XCTAssertEqual(sort.compare(secondCopyOfB, to: firstCopyOfB), .orderedSame)
}
do {
let sort = NSSortDescriptor(keyPath: keyPath, ascending: false)
XCTAssertEqual(sort.compare(a, to: firstCopyOfB), .orderedDescending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: a), .orderedAscending)
XCTAssertEqual(sort.compare(a, to: secondCopyOfB), .orderedDescending)
XCTAssertEqual(sort.compare(secondCopyOfB, to: a), .orderedAscending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: secondCopyOfB), .orderedSame)
XCTAssertEqual(sort.compare(secondCopyOfB, to: firstCopyOfB), .orderedSame)
}
}
func assertObjectsPass<Root, BridgedRoot, BaseType, Value: Comparable>(_ a: Root, _ firstCopyOfB: Root, _ secondCopyOfB: Root, _ bridgedA: BridgedRoot, _ firstCopyOfBridgedB: BridgedRoot, _ secondCopyOfBridgedB: BridgedRoot, keyPath: KeyPath<BaseType, Value>) {
do {
let sort = NSSortDescriptor(keyPath: keyPath, ascending: true)
XCTAssertEqual(sort.compare(bridgedA, to: firstCopyOfB), .orderedAscending)
XCTAssertEqual(sort.compare(a, to: firstCopyOfBridgedB), .orderedAscending)
XCTAssertEqual(sort.compare(firstCopyOfBridgedB, to: a), .orderedDescending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: bridgedA), .orderedDescending)
XCTAssertEqual(sort.compare(bridgedA, to: secondCopyOfB), .orderedAscending)
XCTAssertEqual(sort.compare(a, to: secondCopyOfBridgedB), .orderedAscending)
XCTAssertEqual(sort.compare(secondCopyOfBridgedB, to: a), .orderedDescending)
XCTAssertEqual(sort.compare(secondCopyOfB, to: bridgedA), .orderedDescending)
XCTAssertEqual(sort.compare(firstCopyOfBridgedB, to: secondCopyOfB), .orderedSame)
XCTAssertEqual(sort.compare(firstCopyOfB, to: secondCopyOfBridgedB), .orderedSame)
XCTAssertEqual(sort.compare(secondCopyOfBridgedB, to: firstCopyOfB), .orderedSame)
XCTAssertEqual(sort.compare(secondCopyOfB, to: firstCopyOfBridgedB), .orderedSame)
}
do {
let sort = NSSortDescriptor(keyPath: keyPath, ascending: false)
XCTAssertEqual(sort.compare(bridgedA, to: firstCopyOfB), .orderedDescending)
XCTAssertEqual(sort.compare(a, to: firstCopyOfBridgedB), .orderedDescending)
XCTAssertEqual(sort.compare(firstCopyOfBridgedB, to: a), .orderedAscending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: bridgedA), .orderedAscending)
XCTAssertEqual(sort.compare(bridgedA, to: secondCopyOfB), .orderedDescending)
XCTAssertEqual(sort.compare(a, to: secondCopyOfBridgedB), .orderedDescending)
XCTAssertEqual(sort.compare(secondCopyOfBridgedB, to: a), .orderedAscending)
XCTAssertEqual(sort.compare(secondCopyOfB, to: bridgedA), .orderedAscending)
XCTAssertEqual(sort.compare(firstCopyOfBridgedB, to: secondCopyOfB), .orderedSame)
XCTAssertEqual(sort.compare(firstCopyOfB, to: secondCopyOfBridgedB), .orderedSame)
XCTAssertEqual(sort.compare(secondCopyOfBridgedB, to: firstCopyOfB), .orderedSame)
XCTAssertEqual(sort.compare(secondCopyOfB, to: firstCopyOfBridgedB), .orderedSame)
}
}
private func assertObjectsPass<Root, Value>(_ a: Root, _ firstCopyOfB: Root, _ secondCopyOfB: Root, keyPath: KeyPath<Root, Value>, comparator: @escaping Comparator) {
do {
let sort = NSSortDescriptor(keyPath: keyPath, ascending: true, comparator: comparator)
XCTAssertEqual(sort.compare(a, to: firstCopyOfB), .orderedAscending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: a), .orderedDescending)
XCTAssertEqual(sort.compare(a, to: secondCopyOfB), .orderedAscending)
XCTAssertEqual(sort.compare(secondCopyOfB, to: a), .orderedDescending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: secondCopyOfB), .orderedSame)
XCTAssertEqual(sort.compare(secondCopyOfB, to: firstCopyOfB), .orderedSame)
}
do {
let sort = NSSortDescriptor(keyPath: keyPath, ascending: false, comparator: comparator)
XCTAssertEqual(sort.compare(a, to: firstCopyOfB), .orderedDescending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: a), .orderedAscending)
XCTAssertEqual(sort.compare(a, to: secondCopyOfB), .orderedDescending)
XCTAssertEqual(sort.compare(secondCopyOfB, to: a), .orderedAscending)
XCTAssertEqual(sort.compare(firstCopyOfB, to: secondCopyOfB), .orderedSame)
XCTAssertEqual(sort.compare(secondCopyOfB, to: firstCopyOfB), .orderedSame)
}
}
func testComparable() {
let a = IntSortable(value: 42)
let b = IntSortable(value: 108)
let bAgain = IntSortable(value: 108)
assertObjectsPass(a, b, bAgain, keyPath: \IntSortable.value)
}
func testBuiltinComparableObject() {
let a = NSString(string: "A")
let b = NSString(string: "B")
let bAgain = NSString(string: "B")
assertObjectsPass(a, b, bAgain, keyPath: \NSString.self)
}
func testBuiltinComparableBridgeable() {
let a = NSString(string: "A")
let b = NSString(string: "B")
let bAgain = NSString(string: "B")
let aString = "A"
let bString = "B"
let bStringAgain = "B"
assertObjectsPass(a, b, bAgain, aString, bString, bStringAgain, keyPath: \NSString.self)
assertObjectsPass(a, b, bAgain, aString, bString, bStringAgain, keyPath: \String.self)
}
func testComparatorSorting() {
let canonicalOrder = [ "Velma", "Daphne", "Scooby" ]
let a = StringSortable(value: "Velma")
let b = StringSortable(value: "Daphne")
let bAgain = StringSortable(value: "Daphne")
assertObjectsPass(a, b, bAgain, keyPath: \StringSortable.value) { (lhs, rhs) -> ComparisonResult in
let lhsIndex = canonicalOrder.firstIndex(of: lhs as! String)!
let rhsIndex = canonicalOrder.firstIndex(of: rhs as! String)!
if lhsIndex < rhsIndex {
return .orderedAscending
} else if lhsIndex > rhsIndex {
return .orderedDescending
} else {
return .orderedSame
}
}
}
private let runOnlySinglePermutation = false // Useful for debugging. Always keep set to false when committing.
func permute<T>(_ array: [T]) -> [[T]] {
guard !runOnlySinglePermutation else {
return [array]
}
guard !array.isEmpty else { return [[]] }
var rest = array
let head = rest.popLast()!
let subpermutations = permute(rest)
var result: [[T]] = []
for permutation in subpermutations {
for i in 0 ..< array.count {
var edited = permutation
edited.insert(head, at: i)
result.append(edited)
}
}
return result
}
func testSortingContainers() {
let a = PlayerRecordSortable(name: "A", victories: 3, tiebreakerPoints: 0)
let b = PlayerRecordSortable(name: "B", victories: 1, tiebreakerPoints: 10)
let c = PlayerRecordSortable(name: "C", victories: 1, tiebreakerPoints: 10)
let d = PlayerRecordSortable(name: "D", victories: 1, tiebreakerPoints: 15)
func check(_ result: [Any]) {
let actualResult = result as! [PlayerRecordSortable]
XCTAssertEqual(actualResult[0].name, "A")
XCTAssertEqual(actualResult[1].name, "D")
if actualResult[2].name == "B" {
XCTAssertEqual(actualResult[2].name, "B")
XCTAssertEqual(actualResult[3].name, "C")
} else {
XCTAssertEqual(actualResult[2].name, "C")
XCTAssertEqual(actualResult[3].name, "B")
}
}
let descriptors = [
NSSortDescriptor(keyPath: \PlayerRecordSortable.victories, ascending: false),
NSSortDescriptor(keyPath: \PlayerRecordSortable.tiebreakerPoints, ascending: false),
]
let permutations = permute([a, b, c, d])
for permutation in permutations {
check(NSArray(array: permutation).sortedArray(using: descriptors))
let mutable = NSMutableArray(array: permutation)
mutable.sort(using: descriptors)
check(mutable as! [PlayerRecordSortable])
let set = NSSet(array: permutation)
check(set.sortedArray(using: descriptors))
let orderedSet = NSOrderedSet(array: permutation)
check(orderedSet.sortedArray(using: descriptors))
let mutableOrderedSet = orderedSet.mutableCopy() as! NSMutableOrderedSet
mutableOrderedSet.sort(using: descriptors)
check(mutableOrderedSet.array)
}
}
}
#endif
|
