Files
swift-collections/Sources/BitCollections/BitSet/BitSet+Sorted Collection APIs.swift

52 lines
1.5 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 BitSet: _SortedCollection {
/// Returns the current set (already sorted).
///
/// - Complexity: O(1)
public func sorted() -> BitSet { self }
/// Returns the minimum element in this set.
///
/// Bit sets are sorted, so the minimum element is always at the first
/// position in the set.
///
/// - Returns: The bit set's minimum element. If the sequence has no
/// elements, returns `nil`.
///
/// - Complexity: O(1)
@warn_unqualified_access
public func min() -> Element? {
first
}
/// Returns the maximum element in this set.
///
/// Bit sets are sorted, so the maximum element is always at the last
/// position in the set.
///
/// - Returns: The bit set's maximum element. If the sequence has no
/// elements, returns `nil`.
///
/// - Complexity: O(1)
@warn_unqualified_access
public func max() -> Element? {
last
}
}