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
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// TODO: `Equatable` needs more test coverage, apart from hash-collision smoke test
extension _HashNode {
@inlinable
internal func isEqualSet<Value2>(
to other: _HashNode<Key, Value2>,
by areEquivalent: (Value, Value2) -> Bool
) -> Bool {
if self.raw.storage === other.raw.storage { return true }
guard self.count == other.count else { return false }
if self.isCollisionNode {
guard other.isCollisionNode else { return false }
return self.read { lhs in
other.read { rhs in
guard lhs.collisionHash == rhs.collisionHash else { return false }
let l = lhs.reverseItems
let r = rhs.reverseItems
assert(l.count == r.count) // Already checked above
for i in l.indices {
let found = r.contains {
l[i].key == $0.key && areEquivalent(l[i].value, $0.value)
}
guard found else { return false }
}
return true
}
}
}
guard !other.isCollisionNode else { return false }
return self.read { l in
other.read { r in
guard l.itemMap == r.itemMap else { return false }
guard l.childMap == r.childMap else { return false }
guard l.reverseItems.elementsEqual(
r.reverseItems,
by: { $0.key == $1.key && areEquivalent($0.value, $1.value) })
else { return false }
let lc = l.children
let rc = r.children
return lc.elementsEqual(
rc,
by: { $0.isEqualSet(to: $1, by: areEquivalent) })
}
}
}
}
|
