@@ -824,11 +824,6 @@ public struct Data : Equatable, Hashable, RandomAccessCollection, MutableCollect
824
824
static func canStore( count: Int ) -> Bool {
825
825
return count < HalfInt . max
826
826
}
827
-
828
- @inlinable // This is @inlinable as trivially computable.
829
- static func canStore( range: Range < Int > ) -> Bool {
830
- return range. lowerBound < HalfInt . max && range. upperBound < HalfInt . max
831
- }
832
827
833
828
@inlinable // This is @inlinable as a convenience initializer.
834
829
init ( _ buffer: UnsafeRawBufferPointer ) {
@@ -1132,12 +1127,6 @@ public struct Data : Equatable, Hashable, RandomAccessCollection, MutableCollect
1132
1127
self . storage = storage
1133
1128
self . slice = RangeReference ( 0 ..< count)
1134
1129
}
1135
-
1136
- @inlinable // This is @inlinable as a trivial initializer.
1137
- init ( _ storage: __DataStorage , range: Range < Int > ) {
1138
- self . storage = storage
1139
- self . slice = RangeReference ( range)
1140
- }
1141
1130
1142
1131
@inlinable // This is @inlinable as trivially computable (and inlining may help avoid retain-release traffic).
1143
1132
mutating func ensureUniqueReference( ) {
@@ -1380,19 +1369,6 @@ public struct Data : Equatable, Hashable, RandomAccessCollection, MutableCollect
1380
1369
self = . large( LargeSlice ( storage, count: count) )
1381
1370
}
1382
1371
}
1383
-
1384
- @inlinable
1385
- init ( _ storage: __DataStorage , range: Range < Int > ) {
1386
- if range. count == 0 {
1387
- self = . empty
1388
- } else if range. startIndex == 0 {
1389
- self . init ( storage, count: range. count)
1390
- } else if InlineSlice . canStore ( range: range) {
1391
- self = . slice( InlineSlice ( storage, range: range) )
1392
- } else {
1393
- self = . large( LargeSlice ( storage, range: range) )
1394
- }
1395
- }
1396
1372
1397
1373
@usableFromInline // This is not @inlinable as it is a non-trivial, non-generic function.
1398
1374
mutating func reserveCapacity( _ minimumCapacity: Int ) {
0 commit comments