mirror of
https://github.com/apple/swift-collections
synced 2026-11-22 04:20:40 +00:00
74 lines
2.7 KiB
Swift
74 lines
2.7 KiB
Swift
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This source file is part of the Swift Collections open source project
|
|
//
|
|
// Copyright (c) 2022 - 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 TreeSet: _UniqueCollection {}
|
|
|
|
extension TreeSet {
|
|
/// Removes the element at the given valid index.
|
|
///
|
|
/// Calling this method invalidates all existing indices of the collection.
|
|
///
|
|
/// - Parameter position: The index of the member to remove. `position` must
|
|
/// be a valid index of the set, and it must not be equal to the set's
|
|
/// end index.
|
|
/// - Returns: The element that was removed from the set.
|
|
/// - Complexity: O(log(`count`)) if set storage might be shared; O(1)
|
|
/// otherwise.
|
|
@discardableResult
|
|
public mutating func remove(at position: Index) -> Element {
|
|
precondition(_isValid(position))
|
|
_invalidateIndices()
|
|
let r = unsafe _root.remove(.top, at: position._path)
|
|
precondition(r.remainder == nil)
|
|
return r.removed.key
|
|
}
|
|
|
|
/// Replace the member at the given index with a new value that compares equal
|
|
/// to it.
|
|
///
|
|
/// This is useful when equal elements can be distinguished by identity
|
|
/// comparison or some other means. Updating a member through this method
|
|
/// does not require any hashing operations.
|
|
///
|
|
/// Calling this method invalidates all existing indices of the collection.
|
|
///
|
|
/// - Parameters:
|
|
/// - member: The new value that should replace the original element.
|
|
/// `item` must compare equal to the original value.
|
|
/// - index: The index of the element to be replaced.
|
|
///
|
|
/// - Returns: The original element that was replaced.
|
|
///
|
|
/// - Complexity: O(log(`count`)) if set storage might be shared; O(1)
|
|
/// otherwise.
|
|
public mutating func update(_ member: Element, at index: Index) -> Element {
|
|
defer { _fixLifetime(self) }
|
|
precondition(_isValid(index), "Invalid index")
|
|
precondition(unsafe index._path.isOnItem, "Cannot get element at endIndex")
|
|
_invalidateIndices()
|
|
return unsafe _UnsafeHandle.update(index._path.node) {
|
|
let p = unsafe $0.itemPtr(at: index._path.currentItemSlot)
|
|
var old = member
|
|
precondition(
|
|
unsafe member == p.pointee.key,
|
|
"The replacement item must compare equal to the original")
|
|
unsafe swap(&p.pointee.key, &old)
|
|
return old
|
|
}
|
|
}
|
|
}
|