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
|
//===----------------------------------------------------------------------===//
//
// 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 {
/// Adds the elements of the given set to this set.
///
/// var set: BitSet = [1, 2, 3, 4]
/// let other: BitSet = [0, 2, 4, 6]
/// set.formUnion(other)
/// // `set` is now `[0, 1, 2, 3, 4, 6]`
///
/// - Parameter other: The set of elements to insert.
///
/// - Complexity: O(*max*), where *max* is the largest item in either input.
public mutating func formUnion(_ other: Self) {
_ensureCapacity(limit: other._capacity)
_update { target in
other._read { source in
target.combineSharedPrefix(with: source) { $0.formUnion($1) }
}
}
}
/// Adds the elements of the given set to this set.
///
/// var set: BitSet = [1, 2, 3, 4]
/// let other: BitSet.Counted = [0, 2, 4, 6]
/// set.formUnion(other)
/// // `set` is now `[0, 1, 2, 3, 4, 6]`
///
/// - Parameter other: The set of elements to insert.
///
/// - Complexity: O(*max*), where *max* is the largest item in either input.
public mutating func formUnion(_ other: BitSet.Counted) {
formUnion(other._bits)
}
/// Adds the elements of the given range of integers to this set.
///
/// var set: BitSet = [1, 2, 3, 4]
/// set.formUnion(3 ..< 7)
/// // `set` is now `[1, 2, 3, 4, 5, 6]`
///
/// - Parameter other: A range of nonnegative integers.
///
/// - Complexity: O(*max*), where *max* is the largest item in either input.
public mutating func formUnion(_ other: Range<Int>) {
guard let other = other._toUInt() else {
preconditionFailure("Invalid range")
}
guard !other.isEmpty else { return }
_ensureCapacity(limit: other.upperBound)
_update { handle in
handle.formUnion(other)
}
}
/// Adds the elements of the given sequence to this set.
///
/// var set: BitSet = [1, 2, 3, 4]
/// let other = [6, 4, 2, 0, 2, 0]
/// set.formUnion(other)
/// // `set` is now `[0, 1, 2, 3, 4, 6]`
///
/// - Parameter other: A sequence of nonnegative integers.
///
/// - Complexity: O(*max*) + *k*, where *max* is the largest item in either
/// input, and *k* is the complexity of iterating over all elements in
/// `other`.
@inlinable
public mutating func formUnion(_ other: __owned some Sequence<Int>) {
if let other = _specialize(other, for: BitSet.self) {
formUnion(other)
return
}
if let other = _specialize(other, for: BitSet.Counted.self) {
formUnion(other)
return
}
if let other = _specialize(other, for: Range<Int>.self) {
formUnion(other)
return
}
for value in other {
self.insert(value)
}
}
}
|
