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
|
//===----------------------------------------------------------------------===//
//
// 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 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
}
}
|
