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
|
//===----------------------------------------------------------------------===//
//
// 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 new set with the elements that are either in this set or in
/// `other`, but not in both.
///
/// var a: TreeSet = [1, 2, 3, 4]
/// let b: TreeSet = [0, 2, 4, 6]
/// let c = a.symmetricDifference(b)
/// // `c` is some permutation of `[0, 1, 3, 6]`
///
/// - Parameter other: An arbitrary set of elements.
///
/// - Complexity: Expected complexity is O(`self.count` + `other.count`) in
/// the worst case, if `Element` properly implements hashing.
/// However, the implementation is careful to make the best use of
/// hash tree structure to minimize work when possible, e.g. by linking
/// parts of the input trees directly into the result.
@inlinable
public func symmetricDifference(_ other: __owned Self) -> Self {
let branch = _root.symmetricDifference(.top, other._root)
guard let branch = branch else { return self }
let root = branch.finalize(.top)
root._fullInvariantCheck()
return TreeSet(_new: root)
}
/// Returns a new set with the elements that are either in this set or in
/// `other`, but not in both.
///
/// var a: TreeSet = [1, 2, 3, 4]
/// let b: TreeDictionary = [0: "a", 2: "b", 4: "c", 6: "d"]
/// let c = a.symmetricDifference(b.keys)
/// // `c` is some permutation of `[0, 1, 3, 6]`
///
/// - Parameter other: An arbitrary set of elements.
///
/// - Complexity: Expected complexity is O(`self.count` + `other.count`) in
/// the worst case, if `Element` properly implements hashing.
/// However, the implementation is careful to make the best use of
/// hash tree structure to minimize work when possible, e.g. by linking
/// parts of the input trees directly into the result.
@inlinable
public func symmetricDifference<Value>(
_ other: __owned TreeDictionary<Element, Value>.Keys
) -> Self {
let branch = _root.symmetricDifference(.top, other._base._root)
guard let branch = branch else { return self }
let root = branch.finalize(.top)
root._fullInvariantCheck()
return TreeSet(_new: root)
}
/// Returns a new set with the elements that are either in this set or in
/// the given sequence, but not in both.
///
/// var a: TreeSet = [1, 2, 3, 4]
/// let b = [0, 2, 4, 6, 6, 2]
/// let c = a.symmetricDifference(b)
/// // `c` is some permutation of `[0, 1, 3, 6]`
///
/// In case the sequence contains duplicate elements, only the first instance
/// matters -- the second and subsequent instances are ignored by this method.
///
/// - Parameter other: A finite sequence of elements, possibly containing
/// duplicates.
///
/// - Complexity: Expected complexity is O(`self.count` + `other.count`) in
/// the worst case, if `Element` properly implements hashing.
/// However, the implementation is careful to make the best use of
/// hash tree structure to minimize work when possible, e.g. by linking
/// parts of the input trees directly into the result.
@inlinable
public func symmetricDifference(
_ other: __owned some Sequence<Element>
) -> Self {
if let other = _specialize(other, for: Self.self) {
return symmetricDifference(other)
}
if other is _UniqueCollection {
// Fast path: we can do a simple in-place loop.
var root = self._root
for item in other {
let hash = _Hash(item)
var state = root.prepareValueUpdate(item, hash)
if state.found {
state.value = nil
} else {
state.value = ()
}
root.finalizeValueUpdate(state)
}
return Self(_new: root)
}
// If `other` may contain duplicates, we need to be more
// careful (and slower).
let other = TreeSet(other)
return self.symmetricDifference(other)
}
}
|
