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
|
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Collections open source project
//
// Copyright (c) 2021 - 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 BitSet {
/// Removes the elements of the given bit set from this set.
///
/// var set: BitSet = [1, 2, 3, 4]
/// let other: BitSet = [0, 2, 4, 6]
/// set.subtract(other)
/// // set is now [1, 3]
///
/// - Parameter other: Another bit set.
///
/// - Complexity: O(*max*), where *max* is the largest item in either input.
public mutating func subtract(_ other: Self) {
_updateThenShrink { target, shrink in
other._read { source in
target.combineSharedPrefix(
with: source,
using: { $0.subtract($1) }
)
}
}
}
/// Removes the elements of the given bit set from this set.
///
/// var set: BitSet = [1, 2, 3, 4]
/// let other: BitSet.Counted = [0, 2, 4, 6]
/// set.subtract(other)
/// // set is now [1, 3]
///
/// - Parameter other: Another bit set.
///
/// - Complexity: O(*max*), where *max* is the largest item in either input.
public mutating func subtract(_ other: BitSet.Counted) {
subtract(other._bits)
}
/// Removes the elements of the given range of integers from this set.
///
/// var set: BitSet = [1, 2, 3, 4]
/// set.subtract(-10 ..< 3)
/// // set is now [3, 4]
///
/// - Parameter other: A range of arbitrary integers.
///
/// - Returns: A new set.
///
/// - Complexity: O(*max*), where *max* is the largest item in self.
public mutating func subtract(_ other: Range<Int>) {
_subtract(other._clampedToUInt())
}
@usableFromInline
internal mutating func _subtract(_ other: Range<UInt>) {
guard !other.isEmpty else { return }
_updateThenShrink { handle, shrink in
handle.subtract(other)
}
}
/// Removes the elements of the given sequence of integers from this set.
///
/// var set: BitSet = [1, 2, 3, 4]
/// let other = [6, 4, 2, 0, -2, -4]
/// set.subtract(other)
/// // set is now [1, 3]
///
/// - Parameter other: A sequence of arbitrary integers.
///
/// - Complexity: O(*max*) + *k*, where *max* is the largest item in `self`,
/// and *k* is the complexity of iterating over all elements in `other`.
@inlinable
public mutating func subtract(_ other: some Sequence<Int>) {
if let other = _specialize(other, for: BitSet.self) {
self.subtract(other)
return
}
if let other = _specialize(other, for: BitSet.Counted.self) {
self.subtract(other)
return
}
if let other = _specialize(other, for: Range<Int>.self) {
self.subtract(other)
return
}
var it = other.makeIterator()
_subtract {
while let value = it.next() {
if let value = UInt(exactly: value) {
return value
}
}
return nil
}
}
@usableFromInline
internal mutating func _subtract(_ next: () -> UInt?) {
_updateThenShrink { handle, shrink in
while let value = next() {
handle.remove(value)
}
}
}
}
|
