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
|
//===----------------------------------------------------------------------===//
//
// 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 TreeSet {
/// Returns a Boolean value that indicates whether the set is a strict
/// superset of the given set.
///
/// Set *A* is a strict superset of another set *B* if every member of *B* is
/// also a member of *A* and *A* contains at least one element that is *not*
/// a member of *B*. (Ignoring the order the elements appear in the sets.)
///
/// let a: TreeSet = [1, 2, 3, 4]
/// let b: TreeSet = [4, 2, 1]
/// a.isStrictSuperset(of: b.unordered) // true
///
/// - Parameter other: Another set.
///
/// - Returns: `true` if `self` is a strict superset of `other`; otherwise,
/// `false`.
///
/// - Complexity: Expected to be O(`other.count`) on average, if `Element`
/// implements high-quality hashing. The implementation is careful to make
/// the best use of hash tree structure to minimize work when possible,
/// e.g. by skipping over parts of the input trees.
@inlinable
public func isStrictSuperset(of other: Self) -> Bool {
guard self.count > other.count else { return false }
return other._root.isSubset(.top, of: self._root)
}
/// Returns a Boolean value that indicates whether the set is a strict
/// superset of the given set.
///
/// Set *A* is a strict subset of another set *B* if every member of *A* is
/// also a member of *B* and *B* contains at least one element that is not a
/// member of *A*. (Ignoring the order the elements appear in the sets.)
///
/// let a: TreeSet = [1, 2, 3, 4]
/// let b: TreeSet = [4, 2, 1]
/// a.isStrictSuperset(of: b.unordered) // true
///
/// - Parameter other: The keys view of a persistent dictionary.
///
/// - Returns: `true` if `self` is a strict subset of `other`; otherwise,
/// `false`.
///
/// - Complexity: Expected to be O(`other.count`) on average, if `Element`
/// implements high-quality hashing. The implementation is careful to make
/// the best use of hash tree structure to minimize work when possible,
/// e.g. by skipping over parts of the input trees.
@inlinable
public func isStrictSuperset<Value>(
of other: TreeDictionary<Element, Value>.Keys
) -> Bool {
guard self.count > other.count else { return false }
return other._base._root.isSubset(.top, of: self._root)
}
/// Returns a Boolean value that indicates whether the set is a strict
/// superset of the given set.
///
/// Set *A* is a strict subset of another set *B* if every member of *A* is
/// also a member of *B* and *B* contains at least one element that is not a
/// member of *A*. (Ignoring the order the elements appear in the sets.)
///
/// let a: TreeSet = [1, 2, 3, 4]
/// let b: TreeSet = [4, 2, 1]
/// a.isStrictSuperset(of: b.unordered) // true
///
/// - Parameter other: A sequence of elements, some of whose elements may
/// appear more than once. (Duplicate items are ignored.)
///
/// - Returns: `true` if `self` is a strict subset of `other`; otherwise,
/// `false`.
///
/// - Complexity: In the worst case, this makes O(*n*) calls to
/// `self.contains` (where *n* is the number of elements in `other`),
/// and it constructs a temporary persistent set containing every
/// element of the sequence.
@inlinable
public func isStrictSuperset(of other: some Sequence<Element>) -> Bool {
if let other = _specialize(other, for: Self.self) {
return isStrictSuperset(of: other)
}
var it = self.makeIterator()
guard let first = it.next() else { return false }
if let match = other._customContainsEquatableElement(first) {
// Fast path: the sequence has fast containment checks.
guard other.allSatisfy({ self.contains($0) }) else { return false }
guard match else { return true }
while let item = it.next() {
guard other.contains(item) else { return true }
}
return false
}
// FIXME: Would making this a BitSet of seen positions be better?
var seen: _Node = ._emptyNode()
for item in other {
let hash = _Hash(item)
guard self._root.containsKey(.top, item, hash) else { return false }
if
seen.insert(.top, (item, ()), hash).inserted,
seen.count == self.count
{
return false
}
}
assert(seen.count < self.count)
return true
}
}
|
