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
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
#if !COLLECTIONS_SINGLE_MODULE
import InternalCollectionsUtilities
#endif
extension _HashNode {
@inlinable @inline(__always)
internal static func _emptyNode() -> _HashNode {
_HashNode(storage: _emptySingleton, count: 0)
}
@inlinable
internal static func _collisionNode(
_ hash: _Hash,
_ item1: __owned Element,
_ item2: __owned Element
) -> _HashNode {
let node = _HashNode.allocateCollision(count: 2, hash) { items in
items.initializeElement(at: 1, to: item1)
items.initializeElement(at: 0, to: item2)
}.node
node._invariantCheck()
return node
}
@inlinable
internal static func _collisionNode(
_ hash: _Hash,
_ item1: __owned Element,
_ inserter2: (UnsafeMutablePointer<Element>) -> Void
) -> _HashNode {
let node = _HashNode.allocateCollision(count: 2, hash) { items in
items.initializeElement(at: 1, to: item1)
inserter2(items.baseAddress.unsafelyUnwrapped)
}.node
node._invariantCheck()
return node
}
@inlinable
internal static func _regularNode(
_ item: __owned Element,
_ bucket: _Bucket
) -> _HashNode {
let r = _HashNode.allocate(
itemMap: _Bitmap(bucket),
childMap: .empty,
count: 1
) { children, items in
assert(items.count == 1 && children.count == 0)
items.initializeElement(at: 0, to: item)
}
r.node._invariantCheck()
return r.node
}
@inlinable
internal static func _regularNode(
_ item1: __owned Element,
_ bucket1: _Bucket,
_ item2: __owned Element,
_ bucket2: _Bucket
) -> _HashNode {
_regularNode(
item1, bucket1,
{ $0.initialize(to: item2) }, bucket2).node
}
@inlinable
internal static func _regularNode(
_ item1: __owned Element,
_ bucket1: _Bucket,
_ inserter2: (UnsafeMutablePointer<Element>) -> Void,
_ bucket2: _Bucket
) -> (node: _HashNode, slot1: _HashSlot, slot2: _HashSlot) {
assert(bucket1 != bucket2)
let r = _HashNode.allocate(
itemMap: _Bitmap(bucket1, bucket2),
childMap: .empty,
count: 2
) { children, items -> (_HashSlot, _HashSlot) in
assert(items.count == 2 && children.count == 0)
let i1 = bucket1 < bucket2 ? 1 : 0
let i2 = 1 &- i1
items.initializeElement(at: i1, to: item1)
inserter2(items.baseAddress.unsafelyUnwrapped + i2)
return (_HashSlot(i2), _HashSlot(i1)) // Note: swapped
}
r.node._invariantCheck()
return (r.node, r.result.0, r.result.1)
}
@inlinable
internal static func _regularNode(
_ child: __owned _HashNode,
_ bucket: _Bucket
) -> _HashNode {
let r = _HashNode.allocate(
itemMap: .empty,
childMap: _Bitmap(bucket),
count: child.count
) { children, items in
assert(items.count == 0 && children.count == 1)
children.initializeElement(at: 0, to: child)
}
r.node._invariantCheck()
return r.node
}
@inlinable
internal static func _regularNode(
_ item: __owned Element,
_ itemBucket: _Bucket,
_ child: __owned _HashNode,
_ childBucket: _Bucket
) -> _HashNode {
_regularNode(
{ $0.initialize(to: item) }, itemBucket,
child, childBucket)
}
@inlinable
internal static func _regularNode(
_ inserter: (UnsafeMutablePointer<Element>) -> Void,
_ itemBucket: _Bucket,
_ child: __owned _HashNode,
_ childBucket: _Bucket
) -> _HashNode {
assert(itemBucket != childBucket)
let r = _HashNode.allocate(
itemMap: _Bitmap(itemBucket),
childMap: _Bitmap(childBucket),
count: child.count &+ 1
) { children, items in
assert(items.count == 1 && children.count == 1)
inserter(items.baseAddress.unsafelyUnwrapped)
children.initializeElement(at: 0, to: child)
}
r.node._invariantCheck()
return r.node
}
@inlinable
internal static func _regularNode(
_ child1: __owned _HashNode,
_ child1Bucket: _Bucket,
_ child2: __owned _HashNode,
_ child2Bucket: _Bucket
) -> _HashNode {
assert(child1Bucket != child2Bucket)
let r = _HashNode.allocate(
itemMap: .empty,
childMap: _Bitmap(child1Bucket, child2Bucket),
count: child1.count &+ child2.count
) { children, items in
assert(items.count == 0 && children.count == 2)
children.initializeElement(at: 0, to: child1)
children.initializeElement(at: 1, to: child2)
}
r.node._invariantCheck()
return r.node
}
}
extension _HashNode {
@inlinable
internal static func build(
level: _HashLevel,
item1: __owned Element,
_ hash1: _Hash,
item2 inserter2: (UnsafeMutablePointer<Element>) -> Void,
_ hash2: _Hash
) -> (top: _HashNode, leaf: _UnmanagedHashNode, slot1: _HashSlot, slot2: _HashSlot) {
assert(hash1.isEqual(to: hash2, upTo: level.ascend()))
if hash1 == hash2 {
let top = _collisionNode(hash1, item1, inserter2)
return (top, top.unmanaged, _HashSlot(0), _HashSlot(1))
}
let r = _build(
level: level, item1: item1, hash1, item2: inserter2, hash2)
return (r.top, r.leaf, r.slot1, r.slot2)
}
@inlinable
internal static func _build(
level: _HashLevel,
item1: __owned Element,
_ hash1: _Hash,
item2 inserter2: (UnsafeMutablePointer<Element>) -> Void,
_ hash2: _Hash
) -> (top: _HashNode, leaf: _UnmanagedHashNode, slot1: _HashSlot, slot2: _HashSlot) {
assert(hash1 != hash2)
let b1 = hash1[level]
let b2 = hash2[level]
guard b1 == b2 else {
let r = _regularNode(item1, b1, inserter2, b2)
return (r.node, r.node.unmanaged, r.slot1, r.slot2)
}
let r = _build(
level: level.descend(),
item1: item1, hash1,
item2: inserter2, hash2)
return (_regularNode(r.top, b1), r.leaf, r.slot1, r.slot2)
}
@inlinable
internal static func build(
level: _HashLevel,
item1 inserter1: (UnsafeMutablePointer<Element>) -> Void,
_ hash1: _Hash,
child2: __owned _HashNode,
_ hash2: _Hash
) -> (top: _HashNode, leaf: _UnmanagedHashNode, slot1: _HashSlot, slot2: _HashSlot) {
assert(child2.isCollisionNode)
assert(hash1 != hash2)
let b1 = hash1[level]
let b2 = hash2[level]
if b1 == b2 {
let node = build(
level: level.descend(),
item1: inserter1, hash1,
child2: child2, hash2)
return (_regularNode(node.top, b1), node.leaf, node.slot1, node.slot2)
}
let node = _regularNode(inserter1, hash1[level], child2, hash2[level])
return (node, node.unmanaged, .zero, .zero)
}
@inlinable
internal static func build(
level: _HashLevel,
child1: __owned _HashNode,
_ hash1: _Hash,
child2: __owned _HashNode,
_ hash2: _Hash
) -> _HashNode {
assert(child1.isCollisionNode)
assert(child2.isCollisionNode)
assert(hash1 != hash2)
let b1 = hash1[level]
let b2 = hash2[level]
guard b1 == b2 else {
return _regularNode(child1, b1, child2, b2)
}
let node = build(
level: level.descend(),
child1: child1, hash1,
child2: child2, hash2)
return _regularNode(node, b1)
}
}
|
