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
|
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Collections open source project
//
// Copyright (c) 2022 - 2024 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
//
//===----------------------------------------------------------------------===//
import XCTest
#if COLLECTIONS_SINGLE_MODULE
import Collections
#else
import _CollectionsTestSupport
import HashTreeCollections
#endif
class TreeDictionaryKeysTests: CollectionTestCase {
func test_BidirectionalCollection_fixtures() {
withEachFixture { fixture in
withLifetimeTracking { tracker in
let (d, ref) = tracker.shareableDictionary(for: fixture)
let k = ref.map { $0.key }
checkCollection(d.keys, expectedContents: k, by: ==)
_checkBidirectionalCollection_indexOffsetBy(
d.keys, expectedContents: k, by: ==)
}
}
}
func test_descriptions() {
let d: TreeDictionary = [
"a": 1,
"b": 2
]
if d.first!.key == "a" {
expectEqual(d.keys.description, #"["a", "b"]"#)
expectEqual(d.keys.debugDescription, #"["a", "b"]"#)
} else {
expectEqual(d.keys.description, #"["b", "a"]"#)
expectEqual(d.keys.debugDescription, #"["b", "a"]"#)
}
}
func test_contains() {
withEverySubset("a", of: testItems) { a in
let x = TreeDictionary<RawCollider, Int>(
uniqueKeysWithValues: a.lazy.map { ($0, 2 * $0.identity) })
let u = Set(a)
func checkSequence<S: Sequence>(
_ items: S,
_ value: S.Element
) -> Bool
where S.Element: Equatable {
items.contains(value)
}
withEvery("key", in: testItems) { key in
expectEqual(x.keys.contains(key), u.contains(key))
expectEqual(checkSequence(x.keys, key), u.contains(key))
}
}
}
func test_intersection_exhaustive() {
withEverySubset("a", of: testItems) { a in
let x = TreeDictionary<RawCollider, Int>(
uniqueKeysWithValues: a.lazy.map { ($0, 2 * $0.identity) })
let u = Set(a)
expectEqualSets(x.keys.intersection(x.keys), u)
withEverySubset("b", of: testItems) { b in
let y = TreeDictionary<RawCollider, Int>(
uniqueKeysWithValues: b.lazy.map { ($0, -$0.identity - 1) })
let v = Set(b)
let z = TreeSet(b)
let reference = u.intersection(v)
expectEqualSets(x.keys.intersection(y.keys), reference)
expectEqualSets(x.keys.intersection(z), reference)
}
}
}
func test_subtracting_exhaustive() {
withEverySubset("a", of: testItems) { a in
let x = TreeDictionary<RawCollider, Int>(
uniqueKeysWithValues: a.lazy.map { ($0, 2 * $0.identity) })
let u = Set(a)
expectEqualSets(x.keys.subtracting(x.keys), [])
withEverySubset("b", of: testItems) { b in
let y = TreeDictionary<RawCollider, Int>(
uniqueKeysWithValues: b.lazy.map { ($0, -$0.identity - 1) })
let v = Set(b)
let z = TreeSet(b)
let reference = u.subtracting(v)
expectEqualSets(x.keys.subtracting(y.keys), reference)
expectEqualSets(x.keys.subtracting(z), reference)
}
}
}
func test_isEqual_exhaustive() {
withEverySubset("a", of: testItems) { a in
let x = TreeDictionary<RawCollider, Int>(
uniqueKeysWithValues: a.lazy.map { ($0, 2 * $0.identity) })
let u = Set(a)
expectEqualSets(x.keys, u)
withEverySubset("b", of: testItems) { b in
let y = TreeDictionary<RawCollider, Int>(
uniqueKeysWithValues: b.lazy.map { ($0, -$0.identity - 1) })
let v = Set(b)
expectEqualSets(y.keys, v)
let reference = u == v
expectEqual(x.keys == y.keys, reference)
}
}
}
func test_Hashable() {
let strings: [[[String]]] = [
[
[]
],
[
["a"]
],
[
["b"]
],
[
["c"]
],
[
["d"]
],
[
["e"]
],
[
["f"], ["f"],
],
[
["g"], ["g"],
],
[
["h"], ["h"],
],
[
["i"], ["i"],
],
[
["j"], ["j"],
],
[
["a", "b"], ["b", "a"],
],
[
["a", "d"], ["d", "a"],
],
[
["a", "b", "c"], ["a", "c", "b"],
["b", "a", "c"], ["b", "c", "a"],
["c", "a", "b"], ["c", "b", "a"],
],
[
["a", "d", "e"], ["a", "e", "d"],
["d", "a", "e"], ["d", "e", "a"],
["e", "a", "d"], ["e", "d", "a"],
],
]
let keys = strings.map { $0.map { TreeDictionary(uniqueKeysWithValues: $0.map { ($0, Int.random(in: 1...100)) }).keys }}
checkHashable(equivalenceClasses: keys)
}
}
|
