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
|
//===----------------------------------------------------------------------===//
//
// 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 OrderedSet {
/// Returns a Boolean value indicating whether two set values contain the
/// same elements, but not necessarily in the same order.
///
/// - Note: This member implements different behavior than the `==(_:_:)`
/// operator -- the latter implements an ordered comparison, matching
/// the stricter concept of equality expected of an ordered collection
/// type.
///
/// - Complexity: O(`min(left.count, right.count)`), as long as`Element`
/// properly implements hashing.
public func isEqualSet(to other: Self) -> Bool {
self.unordered == other.unordered
}
/// Returns a Boolean value indicating whether two set values contain the
/// same elements, but not necessarily in the same order.
///
/// - Complexity: O(`min(left.count, right.count)`), as long as`Element`
/// properly implements hashing.
public func isEqualSet(to other: UnorderedView) -> Bool {
self.unordered == other
}
/// Returns a Boolean value indicating whether an ordered set contains the
/// same values as a given sequence, but not necessarily in the same
/// order.
///
/// Duplicate items in `other` do not prevent it from comparing equal to
/// `self`.
///
/// - Complexity: O(*n*), where *n* is the number of items in
/// `other`, as long as`Element` properly implements hashing.
public func isEqualSet(to other: some Sequence<Element>) -> Bool {
if let other = _specialize(other, for: Self.self) {
return isEqualSet(to: other)
}
if self.isEmpty {
return other.allSatisfy { _ in false }
}
if other is _UniqueCollection {
// We don't need to create a temporary set.
guard other.underestimatedCount <= self.count else { return false }
var seen = 0
for item in other {
guard self.contains(item) else { return false }
seen &+= 1
}
precondition(
seen <= self.count,
// Otherwise other.underestimatedCount != other.count
"Invalid Collection '\(type(of: other))' (bad underestimatedCount)")
return seen == self.count
}
return _UnsafeBitSet.withTemporaryBitSet(capacity: count) { seen in
var c = 0
for item in other {
guard let index = _find(item).index else { return false }
if seen.insert(index) {
c &+= 1
}
}
return c == count
}
}
}
|
