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
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// `OrderedSet` does not directly conform to `SetAlgebra` because its definition
// of equality conflicts with `SetAlgebra` requirements. However, it still
// implements most `SetAlgebra` requirements (except `insert`, which is replaced
// by `append`).
//
// `OrderedSet` also provides an `unordered` view that explicitly conforms to
// `SetAlgebra`. That view implements `Equatable` by ignoring element order,
// so it can satisfy `SetAlgebra` requirements.
extension OrderedSet {
/// Removes the elements of this set that aren't also in the given one.
///
/// var set: OrderedSet = [1, 2, 3, 4]
/// let other: OrderedSet = [6, 4, 2, 0]
/// set.formIntersection(other)
/// // set is now [2, 4]
///
/// The result will only contain instances that were originally in `self`.
/// (This matters if equal members can be distinguished by comparing their
/// identities, or by some other means.)
///
/// - Parameter other: A set of elements.
///
/// - Complexity: Expected to be O(`self.count`) on average, if `Element`
/// implements high-quality hashing.
@inlinable
public mutating func formIntersection(_ other: Self) {
self = self.intersection(other)
}
// Generalizations
/// Removes the elements of this set that aren't also in the given one.
///
/// var set: OrderedSet = [1, 2, 3, 4]
/// let other: OrderedSet = [6, 4, 2, 0]
/// set.formIntersection(other)
/// // set is now [2, 4]
///
/// The result will only contain instances that were originally in `self`.
/// (This matters if equal members can be distinguished by comparing their
/// identities, or by some other means.)
///
/// - Parameter other: A set of elements.
///
/// - Complexity: Expected to be O(`self.count`) on average, if `Element`
/// implements high-quality hashing.
@inlinable
@inline(__always)
public mutating func formIntersection(_ other: UnorderedView) {
formIntersection(other._base)
}
/// Removes the elements of this set that aren't also in the given sequence.
///
/// var set: OrderedSet = [1, 2, 3, 4]
/// set.formIntersection([6, 4, 2, 0] as Array)
/// // set is now [2, 4]
///
/// The result will only contain instances that were originally in `self`.
/// (This matters if equal members can be distinguished by comparing their
/// identities, or by some other means.)
///
/// - Parameter other: A finite sequence of elements.
///
/// - Complexity: Expected to be O(*n*) on average where *n* is the number of
/// elements in `other`, if `Element` implements high-quality hashing.
@inlinable
public mutating func formIntersection(
_ other: some Sequence<Element>
) {
self = self.intersection(other)
}
}
|
