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
|
//===----------------------------------------------------------------------===//
//
// 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 has no members in
/// common with the given set.
///
/// let a: TreeSet = [1, 2, 3, 4]
/// let b: TreeSet = [5, 6]
/// a.isDisjoint(with: b) // true
///
/// - Parameter other: Another set.
///
/// - Returns: `true` if `self` has no elements in common with `other`;
/// otherwise, `false`.
///
/// - Complexity: Expected to be O(min(`self.count`, `other.count`)) on
/// average, if `Element` implements high-quality hashing.
@inlinable
public func isDisjoint(with other: Self) -> Bool {
self._root.isDisjoint(.top, with: other._root)
}
/// Returns a Boolean value that indicates whether the set has no members in
/// common with the given set.
///
/// let a: TreeSet = [1, 2, 3, 4]
/// let b: TreeSet = [5, 6]
/// a.isDisjoint(with: b) // true
///
/// - Parameter other: The keys view of a persistent dictionary.
///
/// - Returns: `true` if `self` has no elements in common with `other`;
/// otherwise, `false`.
///
/// - Complexity: Expected to be O(min(`self.count`, `other.count`)) on
/// average, if `Element` implements high-quality hashing.
@inlinable
public func isDisjoint<Value>(
with other: TreeDictionary<Element, Value>.Keys
) -> Bool {
self._root.isDisjoint(.top, with: other._base._root)
}
/// Returns a Boolean value that indicates whether the set has no members in
/// common with the given set.
///
/// let a: TreeSet = [1, 2, 3, 4]
/// let b: TreeSet = [5, 6]
/// a.isDisjoint(with: b) // true
///
/// - Parameter other: A finite sequence of elements, some of which may
/// appear more than once.
///
/// - Returns: `true` if `self` has no elements in common with `other`;
/// otherwise, `false`.
///
/// - Complexity: In the worst case, this makes O(*n*) calls to
/// `self.contains`, where *n* is the length of the sequence.
@inlinable
public func isDisjoint(with other: some Sequence<Element>) -> Bool {
guard !self.isEmpty else { return true }
if let other = _specialize(other, for: Self.self) {
return isDisjoint(with: other)
}
return other.allSatisfy { !self.contains($0) }
}
}
|
