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
|
//===----------------------------------------------------------------------===//
//
// 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 {
/// Returns a new bit set with the elements that are common to both this set
/// and the given set.
///
/// let a: BitSet = [1, 2, 3, 4]
/// let b: BitSet = [6, 4, 2, 0]
/// let c = a.intersection(b)
/// // c is now [2, 4]
///
/// - Parameter other: A bit set.
///
/// - Complexity: O(*max*), where *max* is the largest item in either set.
public func intersection(_ other: Self) -> Self {
self._read { first in
other._read { second in
Self(
_combining: (first, second),
includingTail: false,
using: { $0.intersection($1) })
}
}
}
/// Returns a new bit set with the elements that are common to both this set
/// and the given set.
///
/// let a: BitSet = [1, 2, 3, 4]
/// let b: BitSet.Counted = [6, 4, 2, 0]
/// let c = a.intersection(b)
/// // c is now [2, 4]
///
/// - Parameter other: A bit set.
///
/// - Complexity: O(*max*), where *max* is the largest item in either set.
public func intersection(_ other: BitSet.Counted) -> Self {
self.intersection(other._bits)
}
/// Returns a new bit set with the elements that are common to both this set
/// and the given range of integers.
///
/// let a: BitSet = [1, 2, 3, 4]
/// let c = a.intersection(-10 ..< 3)
/// // c is now [3, 4]
///
/// - Parameter other: A range of 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`.
public func intersection(_ other: Range<Int>) -> Self {
var result = self
result.formIntersection(other)
return result
}
/// Returns a new bit set with the elements that are common to both this set
/// and the given sequence.
///
/// let a: BitSet = [1, 2, 3, 4]
/// let b = [6, 4, 2, 0]
/// let c = a.intersection(b)
/// // c is now [2, 4]
///
/// - Parameter other: A sequence of integer values.
///
/// - 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 func intersection(_ other: __owned some Sequence<Int>) -> Self {
if let other = _specialize(other, for: Range<Int>.self) {
return intersection(other)
}
// Note: BitSet & BitSet.Counted are handled in the BitSet initializer below
return intersection(BitSet(_validMembersOf: other))
}
}
|
