mirror of
https://github.com/apple/swift-collections
synced 2026-11-22 04:20:40 +00:00
101 lines
3.4 KiB
Swift
101 lines
3.4 KiB
Swift
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This source file is part of the Swift Collections open source project
|
|
//
|
|
// Copyright (c) 2021 - 2026 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
|
|
//
|
|
// SPDX-License-Identifier: Apache-2.0 WITH Swift-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#if !COLLECTIONS_SINGLE_MODULE
|
|
import InternalCollectionsUtilities
|
|
#endif
|
|
|
|
extension BitSet {
|
|
/// Replace this set with the elements contained in this set or the given
|
|
/// set, but not both.
|
|
///
|
|
/// var set: BitSet = [1, 2, 3, 4]
|
|
/// let other: BitSet = [0, 2, 4, 6]
|
|
/// set.formSymmetricDifference(other)
|
|
/// // set is now [0, 1, 3, 6]
|
|
///
|
|
/// - Parameter other: Another set.
|
|
///
|
|
/// - Complexity: O(*max*), where *max* is the largest item in either set.
|
|
public mutating func formSymmetricDifference(_ other: BitSet) {
|
|
_ensureCapacity(limit: other._capacity)
|
|
unsafe _updateThenShrink { target, shrink in
|
|
unsafe other._read { source in
|
|
unsafe target.combineSharedPrefix(
|
|
with: source, using: { $0.formSymmetricDifference($1) })
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Replace this set with the elements contained in this set or the given
|
|
/// set, but not both.
|
|
///
|
|
/// var set: BitSet = [1, 2, 3, 4]
|
|
/// let other: BitSet.Counted = [0, 2, 4, 6]
|
|
/// set.formSymmetricDifference(other)
|
|
/// // set is now [0, 1, 3, 6]
|
|
///
|
|
/// - Parameter other: Another set.
|
|
///
|
|
/// - Complexity: O(*max*), where *max* is the largest item in either set.
|
|
public mutating func formSymmetricDifference(_ other: BitSet.Counted) {
|
|
formSymmetricDifference(other._bits)
|
|
}
|
|
|
|
/// Replace this set with the elements contained in this set or the given
|
|
/// range of integers, but not both.
|
|
///
|
|
/// var set: BitSet = [1, 2, 3, 4]
|
|
/// set.formSymmetricDifference(3 ..< 7)
|
|
/// // set is now [1, 2, 5, 6]
|
|
///
|
|
/// - Parameter other: A range of nonnegative integers.
|
|
///
|
|
/// - Complexity: O(*max*), where *max* is the largest item in either input.
|
|
public mutating func formSymmetricDifference(_ other: Range<Int>) {
|
|
guard let other = other._toUInt() else {
|
|
preconditionFailure("Invalid range")
|
|
}
|
|
guard !other.isEmpty else { return }
|
|
_ensureCapacity(limit: other.upperBound)
|
|
unsafe _updateThenShrink { handle, shrink in
|
|
unsafe handle.formSymmetricDifference(other)
|
|
}
|
|
}
|
|
|
|
/// Replace this set with the elements contained in this set or the given
|
|
/// sequence, but not both.
|
|
///
|
|
/// var set: BitSet = [1, 2, 3, 4]
|
|
/// let other = [6, 4, 2, 0, 2, 0]
|
|
/// set.formSymmetricDifference(other)
|
|
/// // set is now [0, 1, 3, 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 formSymmetricDifference(
|
|
_ other: __owned some Sequence<Int>
|
|
) {
|
|
if let other = _specialize(other, for: Range<Int>.self) {
|
|
formSymmetricDifference(other)
|
|
return
|
|
}
|
|
// Note: BitSet & BitSet.Counted are handled in the BitSet initializer below
|
|
formSymmetricDifference(BitSet(other))
|
|
}
|
|
}
|