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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// #############################################################################
// # #
// # DO NOT EDIT THIS FILE; IT IS AUTOGENERATED. #
// # #
// #############################################################################
// In single module mode, we need these declarations to be internal,
// but in regular builds we want them to be public. Unfortunately
// the current best way to do this is to duplicate all definitions.
#if COLLECTIONS_SINGLE_MODULE
extension _UnsafeBitSet {
@frozen @usableFromInline
internal struct Index: Comparable, Hashable {
@usableFromInline
internal typealias _Word = _UnsafeBitSet._Word
@usableFromInline
internal var value: UInt
@inlinable
internal init(_ value: UInt) {
self.value = value
}
@inlinable
internal init(_ value: Int) {
self.value = UInt(value)
}
@inlinable
internal init(word: Int, bit: UInt) {
assert(word >= 0 && word <= Int.max / _Word.capacity)
assert(bit < _Word.capacity)
self.value = UInt(word &* _Word.capacity) &+ bit
}
}
}
extension _UnsafeBitSet.Index {
@inlinable
internal var word: Int {
// Note: We perform on UInts to get faster unsigned math (shifts).
Int(truncatingIfNeeded: value / UInt(bitPattern: _Word.capacity))
}
@inlinable
internal var bit: UInt {
// Note: We perform on UInts to get faster unsigned math (masking).
value % UInt(bitPattern: _Word.capacity)
}
@inlinable
internal var split: (word: Int, bit: UInt) {
(word, bit)
}
@inlinable
internal var endSplit: (word: Int, bit: UInt) {
let w = word
let b = bit
if w > 0, b == 0 { return (w &- 1, UInt(_Word.capacity)) }
return (w, b)
}
@inlinable
internal static func ==(left: Self, right: Self) -> Bool {
left.value == right.value
}
@inlinable
internal static func <(left: Self, right: Self) -> Bool {
left.value < right.value
}
@inlinable
internal func hash(into hasher: inout Hasher) {
hasher.combine(value)
}
@inlinable
internal func _successor() -> Self {
Self(value + 1)
}
@inlinable
internal func _predecessor() -> Self {
Self(value - 1)
}
}
#else // !COLLECTIONS_SINGLE_MODULE
extension _UnsafeBitSet {
@frozen
public struct Index: Comparable, Hashable {
@usableFromInline
internal typealias _Word = _UnsafeBitSet._Word
public var value: UInt
@inlinable
public init(_ value: UInt) {
self.value = value
}
@inlinable
public init(_ value: Int) {
self.value = UInt(value)
}
@inlinable
public init(word: Int, bit: UInt) {
assert(word >= 0 && word <= Int.max / _Word.capacity)
assert(bit < _Word.capacity)
self.value = UInt(word &* _Word.capacity) &+ bit
}
}
}
extension _UnsafeBitSet.Index {
@inlinable
public var word: Int {
// Note: We perform on UInts to get faster unsigned math (shifts).
Int(truncatingIfNeeded: value / UInt(bitPattern: _Word.capacity))
}
@inlinable
public var bit: UInt {
// Note: We perform on UInts to get faster unsigned math (masking).
value % UInt(bitPattern: _Word.capacity)
}
@inlinable
public var split: (word: Int, bit: UInt) {
(word, bit)
}
@inlinable
public var endSplit: (word: Int, bit: UInt) {
let w = word
let b = bit
if w > 0, b == 0 { return (w &- 1, UInt(_Word.capacity)) }
return (w, b)
}
@inlinable
public static func ==(left: Self, right: Self) -> Bool {
left.value == right.value
}
@inlinable
public static func <(left: Self, right: Self) -> Bool {
left.value < right.value
}
@inlinable
public func hash(into hasher: inout Hasher) {
hasher.combine(value)
}
@inlinable
internal func _successor() -> Self {
Self(value + 1)
}
@inlinable
internal func _predecessor() -> Self {
Self(value - 1)
}
}
#endif // COLLECTIONS_SINGLE_MODULE
|
