mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
[stdlib] Obsolete various compatibility shims in 5.0 (#19008)
* Obsolete ModifierSlice typealiases in 5.0 * Obsolete *Indexable in 5.0 * Obsolete IteratorOverOne/EmptyIterator in 5.0 * Obsolete lazy typealiases in 5.0 * Drop .characters from tests * Obsolete old literal protocols in 5.0 * Obsolete Range conversion helpers in 5.0 * Obsolete IndexDistance helpers in 5.0 * Obsolete Unsafe compat helpers in 5.0 * Obsolete flatMap compatibility helper in 5.0 * Obsolete withMutableCharacters in 5.0 * Obsolete customPlaygroundQuickLook in 5.0 * Deprecate Zip2Sequence streams in 5.0 * Replace * with swift on lotsa stuff * Back off obsoleting playground conformances for now
This commit is contained in:
Ben Cohen
GitHub
@@ -13,136 +13,136 @@
|
||||
// This file contains only support for types deprecated from previous versions
|
||||
// of Swift
|
||||
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "BidirectionalCollection", message: "it will be removed in Swift 5.0. Please use 'BidirectionalCollection' instead")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "BidirectionalCollection")
|
||||
public typealias BidirectionalIndexable = BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Collection", message: "it will be removed in Swift 5.0. Please use 'Collection' instead")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "Collection")
|
||||
public typealias IndexableBase = Collection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Collection", message: "it will be removed in Swift 5.0. Please use 'Collection' instead")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "Collection")
|
||||
public typealias Indexable = Collection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "MutableCollection", message: "it will be removed in Swift 5.0. Please use 'MutableCollection' instead")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "MutableCollection")
|
||||
public typealias MutableIndexable = MutableCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "RandomAccessCollection", message: "it will be removed in Swift 5.0. Please use 'RandomAccessCollection' instead")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "RandomAccessCollection")
|
||||
public typealias RandomAccessIndexable = RandomAccessCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "RangeReplaceableIndexable", message: "it will be removed in Swift 5.0. Please use 'RangeReplaceableCollection' instead")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "RangeReplaceableIndexable")
|
||||
public typealias RangeReplaceableIndexable = RangeReplaceableCollection
|
||||
@available(*, deprecated: 4.2, renamed: "EnumeratedSequence.Iterator")
|
||||
@available(swift, deprecated: 4.2, renamed: "EnumeratedSequence.Iterator")
|
||||
public typealias EnumeratedIterator<T: Sequence> = EnumeratedSequence<T>.Iterator
|
||||
@available(*,deprecated: 4.2/*, obsoleted: 5.0*/, renamed: "CollectionOfOne.Iterator")
|
||||
@available(swift,deprecated: 4.2, obsoleted: 5.0, renamed: "CollectionOfOne.Iterator")
|
||||
public typealias IteratorOverOne<T> = CollectionOfOne<T>.Iterator
|
||||
@available(*, deprecated: 4.2/*, obsoleted: 5.0*/, renamed: "EmptyCollection.Iterator")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "EmptyCollection.Iterator")
|
||||
public typealias EmptyIterator<T> = EmptyCollection<T>.Iterator
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyFilterSequence.Iterator")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyFilterSequence.Iterator")
|
||||
public typealias LazyFilterIterator<T: Sequence> = LazyFilterSequence<T>.Iterator
|
||||
@available(swift, deprecated: 3.1/*, obsoleted: 5.0*/, message: "Use Base.Index")
|
||||
@available(swift, deprecated: 3.1, obsoleted: 5.0, message: "Use Base.Index")
|
||||
public typealias LazyFilterIndex<Base: Collection> = Base.Index
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyDropWhileSequence.Iterator")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyDropWhileSequence.Iterator")
|
||||
public typealias LazyDropWhileIterator<T> = LazyDropWhileSequence<T>.Iterator where T: Sequence
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyDropWhileCollection.Index")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyDropWhileCollection.Index")
|
||||
public typealias LazyDropWhileIndex<T> = LazyDropWhileCollection<T>.Index where T: Collection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyDropWhileCollection")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyDropWhileCollection")
|
||||
public typealias LazyDropWhileBidirectionalCollection<T> = LazyDropWhileCollection<T> where T: BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyFilterCollection")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyFilterCollection")
|
||||
public typealias LazyFilterBidirectionalCollection<T> = LazyFilterCollection<T> where T : BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyMapSequence.Iterator")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyMapSequence.Iterator")
|
||||
public typealias LazyMapIterator<T, E> = LazyMapSequence<T, E>.Iterator where T: Sequence
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyMapCollection")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyMapCollection")
|
||||
public typealias LazyMapBidirectionalCollection<T, E> = LazyMapCollection<T, E> where T : BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyMapCollection")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyMapCollection")
|
||||
public typealias LazyMapRandomAccessCollection<T, E> = LazyMapCollection<T, E> where T : RandomAccessCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyCollection")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyCollection")
|
||||
public typealias LazyBidirectionalCollection<T> = LazyCollection<T> where T : BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyCollection")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyCollection")
|
||||
public typealias LazyRandomAccessCollection<T> = LazyCollection<T> where T : RandomAccessCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "FlattenCollection.Index")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "FlattenCollection.Index")
|
||||
public typealias FlattenCollectionIndex<T> = FlattenCollection<T>.Index where T : Collection, T.Element : Collection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "FlattenCollection.Index")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "FlattenCollection.Index")
|
||||
public typealias FlattenBidirectionalCollectionIndex<T> = FlattenCollection<T>.Index where T : BidirectionalCollection, T.Element : BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "FlattenCollection")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "FlattenCollection")
|
||||
public typealias FlattenBidirectionalCollection<T> = FlattenCollection<T> where T : BidirectionalCollection, T.Element : BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "JoinedSequence.Iterator")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "JoinedSequence.Iterator")
|
||||
public typealias JoinedIterator<T: Sequence> = JoinedSequence<T>.Iterator where T.Element: Sequence
|
||||
@available(*, deprecated: 4.2/*, obsoleted: 5.0*/, renamed: "Zip2Sequence.Iterator")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "Zip2Sequence.Iterator")
|
||||
public typealias Zip2Iterator<T, U> = Zip2Sequence<T, U>.Iterator where T: Sequence, U: Sequence
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyDropWhileSequence.Iterator")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyDropWhileSequence.Iterator")
|
||||
public typealias LazyPrefixWhileIterator<T> = LazyPrefixWhileSequence<T>.Iterator where T: Sequence
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyDropWhileCollection.Index")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyDropWhileCollection.Index")
|
||||
public typealias LazyPrefixWhileIndex<T> = LazyPrefixWhileCollection<T>.Index where T: Collection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "LazyPrefixWhileCollection")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "LazyPrefixWhileCollection")
|
||||
public typealias LazyPrefixWhileBidirectionalCollection<T> = LazyPrefixWhileCollection<T> where T: BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ReversedCollection")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "ReversedCollection")
|
||||
public typealias ReversedRandomAccessCollection<T: RandomAccessCollection> = ReversedCollection<T>
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ReversedCollection.Index")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "ReversedCollection.Index")
|
||||
public typealias ReversedIndex<T: BidirectionalCollection> = ReversedCollection<T>
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias BidirectionalSlice<T> = Slice<T> where T : BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias RandomAccessSlice<T> = Slice<T> where T : RandomAccessCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias RangeReplaceableSlice<T> = Slice<T> where T : RangeReplaceableCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias RangeReplaceableBidirectionalSlice<T> = Slice<T> where T : RangeReplaceableCollection & BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias RangeReplaceableRandomAccessSlice<T> = Slice<T> where T : RangeReplaceableCollection & RandomAccessCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias MutableSlice<T> = Slice<T> where T : MutableCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias MutableBidirectionalSlice<T> = Slice<T> where T : MutableCollection & BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias MutableRandomAccessSlice<T> = Slice<T> where T : MutableCollection & RandomAccessCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias MutableRangeReplaceableSlice<T> = Slice<T> where T : MutableCollection & RangeReplaceableCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias MutableRangeReplaceableBidirectionalSlice<T> = Slice<T> where T : MutableCollection & RangeReplaceableCollection & BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Slice")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "Slice")
|
||||
public typealias MutableRangeReplaceableRandomAccessSlice<T> = Slice<T> where T : MutableCollection & RangeReplaceableCollection & RandomAccessCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "DefaultIndices")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "DefaultIndices")
|
||||
public typealias DefaultBidirectionalIndices<T> = DefaultIndices<T> where T : BidirectionalCollection
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "DefaultIndices")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, renamed: "DefaultIndices")
|
||||
public typealias DefaultRandomAccessIndices<T> = DefaultIndices<T> where T : RandomAccessCollection
|
||||
|
||||
// Deprecated by SE-0115.
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ExpressibleByNilLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "ExpressibleByNilLiteral")
|
||||
public typealias NilLiteralConvertible = ExpressibleByNilLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByBuiltinIntegerLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByBuiltinIntegerLiteral")
|
||||
public typealias _BuiltinIntegerLiteralConvertible = _ExpressibleByBuiltinIntegerLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ExpressibleByIntegerLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "ExpressibleByIntegerLiteral")
|
||||
public typealias IntegerLiteralConvertible = ExpressibleByIntegerLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByBuiltinFloatLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByBuiltinFloatLiteral")
|
||||
public typealias _BuiltinFloatLiteralConvertible = _ExpressibleByBuiltinFloatLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ExpressibleByFloatLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "ExpressibleByFloatLiteral")
|
||||
public typealias FloatLiteralConvertible = ExpressibleByFloatLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByBuiltinBooleanLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByBuiltinBooleanLiteral")
|
||||
public typealias _BuiltinBooleanLiteralConvertible = _ExpressibleByBuiltinBooleanLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ExpressibleByBooleanLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "ExpressibleByBooleanLiteral")
|
||||
public typealias BooleanLiteralConvertible = ExpressibleByBooleanLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByBuiltinUnicodeScalarLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByBuiltinUnicodeScalarLiteral")
|
||||
public typealias _BuiltinUnicodeScalarLiteralConvertible = _ExpressibleByBuiltinUnicodeScalarLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ExpressibleByUnicodeScalarLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "ExpressibleByUnicodeScalarLiteral")
|
||||
public typealias UnicodeScalarLiteralConvertible = ExpressibleByUnicodeScalarLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByBuiltinExtendedGraphemeClusterLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByBuiltinExtendedGraphemeClusterLiteral")
|
||||
public typealias _BuiltinExtendedGraphemeClusterLiteralConvertible = _ExpressibleByBuiltinExtendedGraphemeClusterLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ExpressibleByExtendedGraphemeClusterLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "ExpressibleByExtendedGraphemeClusterLiteral")
|
||||
public typealias ExtendedGraphemeClusterLiteralConvertible = ExpressibleByExtendedGraphemeClusterLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByBuiltinStringLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByBuiltinStringLiteral")
|
||||
public typealias _BuiltinStringLiteralConvertible = _ExpressibleByBuiltinStringLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByBuiltinUTF16StringLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByBuiltinUTF16StringLiteral")
|
||||
public typealias _BuiltinUTF16StringLiteralConvertible = _ExpressibleByBuiltinUTF16StringLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ExpressibleByStringLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "ExpressibleByStringLiteral")
|
||||
public typealias StringLiteralConvertible = ExpressibleByStringLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ExpressibleByArrayLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "ExpressibleByArrayLiteral")
|
||||
public typealias ArrayLiteralConvertible = ExpressibleByArrayLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "ExpressibleByDictionaryLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "ExpressibleByDictionaryLiteral")
|
||||
public typealias DictionaryLiteralConvertible = ExpressibleByDictionaryLiteral
|
||||
@available(*, deprecated, message: "it will be replaced or redesigned in Swift 4.0. Instead of conforming to 'StringInterpolationConvertible', consider adding an 'init(_:String)'")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, message: "it will be replaced or redesigned in Swift 4.0. Instead of conforming to 'StringInterpolationConvertible', consider adding an 'init(_:String)'")
|
||||
public typealias StringInterpolationConvertible = ExpressibleByStringInterpolation
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByColorLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByColorLiteral")
|
||||
public typealias _ColorLiteralConvertible = _ExpressibleByColorLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByImageLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByImageLiteral")
|
||||
public typealias _ImageLiteralConvertible = _ExpressibleByImageLiteral
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "_ExpressibleByFileReferenceLiteral")
|
||||
@available(swift, deprecated: 3.0, obsoleted: 5.0, renamed: "_ExpressibleByFileReferenceLiteral")
|
||||
public typealias _FileReferenceLiteralConvertible = _ExpressibleByFileReferenceLiteral
|
||||
|
||||
@available(*, deprecated, obsoleted: 5.0, renamed: "ClosedRange.Index")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "ClosedRange.Index")
|
||||
public typealias ClosedRangeIndex<T> = ClosedRange<T>.Index where T: Strideable, T.Stride: SignedInteger
|
||||
|
||||
/// An optional type that allows implicit member access.
|
||||
@@ -307,7 +307,7 @@ extension Range where Bound: Strideable, Bound.Stride : SignedInteger {
|
||||
/// Now that Range is conditionally a collection when Bound: Strideable,
|
||||
/// CountableRange is no longer needed. This is a deprecated initializer
|
||||
/// for any remaining uses of Range(countableRange).
|
||||
@available(*, deprecated: 4.2/*, obsoleted: 5.0*/, message: "CountableRange is now a Range. No need to convert any more.")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, message: "CountableRange is now a Range. No need to convert any more.")
|
||||
public init(_ other: Range<Bound>) {
|
||||
self = other
|
||||
}
|
||||
@@ -317,7 +317,7 @@ extension ClosedRange where Bound: Strideable, Bound.Stride : SignedInteger {
|
||||
/// Now that Range is conditionally a collection when Bound: Strideable,
|
||||
/// CountableRange is no longer needed. This is a deprecated initializer
|
||||
/// for any remaining uses of Range(countableRange).
|
||||
@available(*, deprecated: 4.2/*, obsoleted: 5.0*/, message: "CountableClosedRange is now a ClosedRange. No need to convert any more.")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, message: "CountableClosedRange is now a ClosedRange. No need to convert any more.")
|
||||
public init(_ other: ClosedRange<Bound>) {
|
||||
self = other
|
||||
}
|
||||
@@ -393,7 +393,7 @@ extension LazyCollectionProtocol {
|
||||
/// collection as its argument and returns an optional value.
|
||||
///
|
||||
/// - Complexity: O(1)
|
||||
@available(swift, deprecated: 4.1/*, obsoleted: 5.0*/, renamed: "compactMap(_:)",
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "compactMap(_:)",
|
||||
message: "Please use compactMap(_:) for the case where closure returns an optional value")
|
||||
public func flatMap<ElementOfResult>(
|
||||
_ transform: @escaping (Elements.Element) -> ElementOfResult?
|
||||
@@ -435,7 +435,7 @@ extension String {
|
||||
/// Previous versions of Swift provided this view since String
|
||||
/// itself was not a collection. String is now a collection of
|
||||
/// characters, so this type is now just an alias for String.
|
||||
@available(swift, deprecated: 3.2/*, obsoleted: 5.0*/, message: "Please mutate the String directly")
|
||||
@available(swift, deprecated: 3.2, obsoleted: 5.0, message: "Please mutate the String directly")
|
||||
public mutating func withMutableCharacters<R>(
|
||||
_ body: (inout String) -> R
|
||||
) -> R {
|
||||
@@ -478,7 +478,7 @@ extension TextOutputStreamable {
|
||||
|
||||
|
||||
extension String.UnicodeScalarView : _CustomPlaygroundQuickLookable {
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "UnicodeScalarView.customPlaygroundQuickLook will be removed in Swift 5.0")
|
||||
@available(swift, deprecated: 4.2/*, obsoleted: 5.0*/, message: "UnicodeScalarView.customPlaygroundQuickLook will be removed in Swift 5.0")
|
||||
public var customPlaygroundQuickLook: _PlaygroundQuickLook {
|
||||
return .text(description)
|
||||
}
|
||||
@@ -661,14 +661,14 @@ extension String.UnicodeScalarView {
|
||||
}
|
||||
|
||||
extension String.UTF16View : _CustomPlaygroundQuickLookable {
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "UTF16View.customPlaygroundQuickLook will be removed in Swift 5.0")
|
||||
@available(swift, deprecated: 4.2/*, obsoleted: 5.0*/, message: "UTF16View.customPlaygroundQuickLook will be removed in Swift 5.0")
|
||||
public var customPlaygroundQuickLook: _PlaygroundQuickLook {
|
||||
return .text(description)
|
||||
}
|
||||
}
|
||||
|
||||
extension String.UTF8View : _CustomPlaygroundQuickLookable {
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "UTF8View.customPlaygroundQuickLook will be removed in Swift 5.0")
|
||||
@available(swift, deprecated: 4.2/*, obsoleted: 5.0*/, message: "UTF8View.customPlaygroundQuickLook will be removed in Swift 5.0")
|
||||
public var customPlaygroundQuickLook: _PlaygroundQuickLook {
|
||||
return .text(description)
|
||||
}
|
||||
@@ -708,7 +708,7 @@ extension Substring {
|
||||
/// Previous versions of Swift provided this view since String
|
||||
/// itself was not a collection. String is now a collection of
|
||||
/// characters, so this type is now just an alias for String.
|
||||
@available(swift, deprecated: 3.2/*, obsoleted: 5.0*/, message: "Please mutate the Substring directly")
|
||||
@available(swift, deprecated: 3.2, obsoleted: 5.0, message: "Please mutate the Substring directly")
|
||||
public mutating func withMutableCharacters<R>(
|
||||
_ body: (inout Substring) -> R
|
||||
) -> R {
|
||||
@@ -729,7 +729,7 @@ extension Substring {
|
||||
}
|
||||
|
||||
extension Substring : _CustomPlaygroundQuickLookable {
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "Substring.customPlaygroundQuickLook will be removed in Swift 5.0")
|
||||
@available(swift, deprecated: 4.2/*, obsoleted: 5.0*/, message: "Substring.customPlaygroundQuickLook will be removed in Swift 5.0")
|
||||
public var customPlaygroundQuickLook: _PlaygroundQuickLook {
|
||||
return String(self).customPlaygroundQuickLook
|
||||
}
|
||||
@@ -745,23 +745,23 @@ extension Collection {
|
||||
@available(swift, deprecated: 3.2, obsoleted: 5.0, renamed: "Element")
|
||||
public typealias _Element = Element
|
||||
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "all index distances are now of type Int")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, message: "all index distances are now of type Int")
|
||||
public func index<T: BinaryInteger>(_ i: Index, offsetBy n: T) -> Index {
|
||||
return index(i, offsetBy: Int(n))
|
||||
}
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "all index distances are now of type Int")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, message: "all index distances are now of type Int")
|
||||
public func formIndex<T: BinaryInteger>(_ i: inout Index, offsetBy n: T) {
|
||||
return formIndex(&i, offsetBy: Int(n))
|
||||
}
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "all index distances are now of type Int")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, message: "all index distances are now of type Int")
|
||||
public func index<T: BinaryInteger>(_ i: Index, offsetBy n: T, limitedBy limit: Index) -> Index? {
|
||||
return index(i, offsetBy: Int(n), limitedBy: limit)
|
||||
}
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "all index distances are now of type Int")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, message: "all index distances are now of type Int")
|
||||
public func formIndex<T: BinaryInteger>(_ i: inout Index, offsetBy n: T, limitedBy limit: Index) -> Bool {
|
||||
return formIndex(&i, offsetBy: Int(n), limitedBy: limit)
|
||||
}
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "all index distances are now of type Int")
|
||||
@available(swift, deprecated: 4.0, obsoleted: 5.0, message: "all index distances are now of type Int")
|
||||
public func distance<T: BinaryInteger>(from start: Index, to end: Index) -> T {
|
||||
return numericCast(distance(from: start, to: end) as Int)
|
||||
}
|
||||
@@ -769,18 +769,18 @@ extension Collection {
|
||||
|
||||
|
||||
extension UnsafeMutablePointer {
|
||||
@available(swift, deprecated: 4.1/*, obsoleted: 5.0*/, renamed: "initialize(repeating:count:)")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "initialize(repeating:count:)")
|
||||
public func initialize(to newValue: Pointee, count: Int = 1) {
|
||||
initialize(repeating: newValue, count: count)
|
||||
}
|
||||
|
||||
@available(swift, deprecated: 4.1/*, obsoleted: 5.0*/, message: "the default argument to deinitialize(count:) has been removed, please specify the count explicitly")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, message: "the default argument to deinitialize(count:) has been removed, please specify the count explicitly")
|
||||
@discardableResult
|
||||
public func deinitialize() -> UnsafeMutableRawPointer {
|
||||
return deinitialize(count: 1)
|
||||
}
|
||||
|
||||
@available(swift, deprecated: 4.1/*, obsoleted: 5.0*/, message: "Swift currently only supports freeing entire heap blocks, use deallocate() instead")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, message: "Swift currently only supports freeing entire heap blocks, use deallocate() instead")
|
||||
public func deallocate(capacity _: Int) {
|
||||
self.deallocate()
|
||||
}
|
||||
@@ -796,7 +796,7 @@ extension UnsafeMutablePointer {
|
||||
/// - Parameter source: A collection of elements of the pointer's `Pointee`
|
||||
/// type.
|
||||
// This is fundamentally unsafe since collections can underreport their count.
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "it will be removed in Swift 5.0. Please use 'UnsafeMutableBufferPointer.initialize(from:)' instead")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, message: "it will be removed in Swift 5.0. Please use 'UnsafeMutableBufferPointer.initialize(from:)' instead")
|
||||
public func initialize<C : Collection>(from source: C)
|
||||
where C.Element == Pointee {
|
||||
let buf = UnsafeMutableBufferPointer(start: self, count: numericCast(source.count))
|
||||
@@ -862,7 +862,7 @@ extension UnsafeRawPointer : _CustomPlaygroundQuickLookable {
|
||||
: "UnsafeRawPointer(0x\(_uint64ToString(ptrValue, radix:16, uppercase:true)))"
|
||||
}
|
||||
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "UnsafeRawPointer.customPlaygroundQuickLook will be removed in a future Swift version")
|
||||
@available(swift, deprecated: 4.2/*, obsoleted: 5.0*/, message: "UnsafeRawPointer.customPlaygroundQuickLook will be removed in a future Swift version")
|
||||
public var customPlaygroundQuickLook: _PlaygroundQuickLook {
|
||||
return .text(summary)
|
||||
}
|
||||
@@ -877,7 +877,7 @@ extension UnsafeMutableRawPointer : _CustomPlaygroundQuickLookable {
|
||||
: "UnsafeMutableRawPointer(0x\(_uint64ToString(ptrValue, radix:16, uppercase:true)))"
|
||||
}
|
||||
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "UnsafeMutableRawPointer.customPlaygroundQuickLook will be removed in a future Swift version")
|
||||
@available(swift, deprecated: 4.2/*, obsoleted: 5.0*/, message: "UnsafeMutableRawPointer.customPlaygroundQuickLook will be removed in a future Swift version")
|
||||
public var customPlaygroundQuickLook: _PlaygroundQuickLook {
|
||||
return .text(summary)
|
||||
}
|
||||
@@ -891,7 +891,7 @@ extension UnsafePointer: _CustomPlaygroundQuickLookable {
|
||||
: "UnsafePointer(0x\(_uint64ToString(ptrValue, radix:16, uppercase:true)))"
|
||||
}
|
||||
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "UnsafePointer.customPlaygroundQuickLook will be removed in a future Swift version")
|
||||
@available(swift, deprecated: 4.2/*, obsoleted: 5.0*/, message: "UnsafePointer.customPlaygroundQuickLook will be removed in a future Swift version")
|
||||
public var customPlaygroundQuickLook: PlaygroundQuickLook {
|
||||
return .text(summary)
|
||||
}
|
||||
@@ -905,28 +905,28 @@ extension UnsafeMutablePointer: _CustomPlaygroundQuickLookable {
|
||||
: "UnsafeMutablePointer(0x\(_uint64ToString(ptrValue, radix:16, uppercase:true)))"
|
||||
}
|
||||
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "UnsafeMutablePointer.customPlaygroundQuickLook will be removed in a future Swift version")
|
||||
@available(swift, deprecated: 4.2/*, obsoleted: 5.0*/, message: "UnsafeMutablePointer.customPlaygroundQuickLook will be removed in a future Swift version")
|
||||
public var customPlaygroundQuickLook: PlaygroundQuickLook {
|
||||
return .text(summary)
|
||||
}
|
||||
}
|
||||
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "UnsafeBufferPointer.Iterator")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "UnsafeBufferPointer.Iterator")
|
||||
public typealias UnsafeBufferPointerIterator<T> = UnsafeBufferPointer<T>.Iterator
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "UnsafeRawBufferPointer.Iterator")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "UnsafeRawBufferPointer.Iterator")
|
||||
public typealias UnsafeRawBufferPointerIterator<T> = UnsafeBufferPointer<T>.Iterator
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "UnsafeRawBufferPointer.Iterator")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "UnsafeRawBufferPointer.Iterator")
|
||||
public typealias UnsafeMutableRawBufferPointerIterator<T> = UnsafeBufferPointer<T>.Iterator
|
||||
|
||||
extension UnsafeMutableRawPointer {
|
||||
@available(swift, deprecated: 4.1/*, obsoleted: 5.0*/, renamed: "allocate(byteCount:alignment:)")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "allocate(byteCount:alignment:)")
|
||||
public static func allocate(
|
||||
bytes size: Int, alignedTo alignment: Int
|
||||
) -> UnsafeMutableRawPointer {
|
||||
return UnsafeMutableRawPointer.allocate(byteCount: size, alignment: alignment)
|
||||
}
|
||||
|
||||
@available(swift, deprecated: 4.1/*, obsoleted: 5.0*/, renamed: "deallocate()", message: "Swift currently only supports freeing entire heap blocks, use deallocate() instead")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "deallocate()", message: "Swift currently only supports freeing entire heap blocks, use deallocate() instead")
|
||||
public func deallocate(bytes _: Int, alignedTo _: Int) {
|
||||
self.deallocate()
|
||||
}
|
||||
@@ -936,7 +936,7 @@ extension UnsafeMutableRawPointer {
|
||||
copyMemory(from: source, byteCount: count)
|
||||
}
|
||||
|
||||
@available(swift, deprecated: 4.1/*, obsoleted: 5.0*/, renamed: "initializeMemory(as:repeating:count:)")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "initializeMemory(as:repeating:count:)")
|
||||
@discardableResult
|
||||
public func initializeMemory<T>(
|
||||
as type: T.Type, at offset: Int = 0, count: Int = 1, to repeatedValue: T
|
||||
@@ -945,7 +945,7 @@ extension UnsafeMutableRawPointer {
|
||||
as: type, repeating: repeatedValue, count: count)
|
||||
}
|
||||
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "it will be removed in Swift 5.0. Please use 'UnsafeMutableRawBufferPointer.initialize(from:)' instead")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, message: "it will be removed in Swift 5.0. Please use 'UnsafeMutableRawBufferPointer.initialize(from:)' instead")
|
||||
@discardableResult
|
||||
public func initializeMemory<C : Collection>(
|
||||
as type: C.Element.Type, from source: C
|
||||
@@ -962,13 +962,13 @@ extension UnsafeMutableRawPointer {
|
||||
}
|
||||
|
||||
extension UnsafeMutableRawBufferPointer {
|
||||
@available(swift, deprecated: 4.1/*, obsoleted: 5.0*/, renamed: "allocate(byteCount:alignment:)")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "allocate(byteCount:alignment:)")
|
||||
public static func allocate(count: Int) -> UnsafeMutableRawBufferPointer {
|
||||
return UnsafeMutableRawBufferPointer.allocate(
|
||||
byteCount: count, alignment: MemoryLayout<UInt>.alignment)
|
||||
}
|
||||
|
||||
@available(swift, deprecated: 4.1/*, obsoleted: 5.0*/, renamed: "copyMemory(from:)")
|
||||
@available(swift, deprecated: 4.1, obsoleted: 5.0, renamed: "copyMemory(from:)")
|
||||
public func copyBytes(from source: UnsafeRawBufferPointer) {
|
||||
copyMemory(from: source)
|
||||
}
|
||||
@@ -1051,9 +1051,9 @@ extension Optional where Wrapped == String.Index {
|
||||
}
|
||||
|
||||
extension Zip2Sequence {
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Sequence1.Iterator")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "Sequence1.Iterator")
|
||||
public typealias Stream1 = Sequence1.Iterator
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, renamed: "Sequence2.Iterator")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, renamed: "Sequence2.Iterator")
|
||||
public typealias Stream2 = Sequence2.Iterator
|
||||
}
|
||||
|
||||
@@ -1078,7 +1078,7 @@ extension Zip2Sequence {
|
||||
/// // With Swift 4.0 and Swift 3.2 and earlier, use PlaygroundQuickLook
|
||||
/// // and the CustomPlaygroundQuickLookable protocol.
|
||||
/// #endif
|
||||
@available(*, deprecated, message: "PlaygroundQuickLook will be removed in a future Swift version. For customizing how types are presented in playgrounds, use CustomPlaygroundDisplayConvertible instead.")
|
||||
@available(swift, deprecated: 4.2, message: "PlaygroundQuickLook will be removed in a future Swift version. For customizing how types are presented in playgrounds, use CustomPlaygroundDisplayConvertible instead.")
|
||||
public typealias PlaygroundQuickLook = _PlaygroundQuickLook
|
||||
|
||||
@_frozen // rdar://problem/38719739 - needed by LLDB
|
||||
@@ -1191,12 +1191,12 @@ extension _PlaygroundQuickLook {
|
||||
///
|
||||
/// - Parameter subject: The instance to represent with the resulting Quick
|
||||
/// Look.
|
||||
@available(*, deprecated, message: "PlaygroundQuickLook will be removed in a future Swift version.")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, message: "PlaygroundQuickLook will be removed in a future Swift version.")
|
||||
public init(reflecting subject: Any) {
|
||||
if let customized = subject as? CustomPlaygroundQuickLookable {
|
||||
if let customized = subject as? _CustomPlaygroundQuickLookable {
|
||||
self = customized.customPlaygroundQuickLook
|
||||
}
|
||||
else if let customized = subject as? _DefaultCustomPlaygroundQuickLookable {
|
||||
else if let customized = subject as? __DefaultCustomPlaygroundQuickLookable {
|
||||
self = customized._defaultCustomPlaygroundQuickLook
|
||||
}
|
||||
else {
|
||||
@@ -1229,9 +1229,10 @@ extension _PlaygroundQuickLook {
|
||||
/// // conform to CustomPlaygroundQuickLookable.
|
||||
/// extension MyType: CustomPlaygroundQuickLookable { /*...*/ }
|
||||
/// #endif
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "CustomPlaygroundQuickLookable will be removed in a future Swift version. For customizing how types are presented in playgrounds, use CustomPlaygroundDisplayConvertible instead.")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, message: "CustomPlaygroundQuickLookable will be removed in a future Swift version. For customizing how types are presented in playgrounds, use CustomPlaygroundDisplayConvertible instead.")
|
||||
public typealias CustomPlaygroundQuickLookable = _CustomPlaygroundQuickLookable
|
||||
|
||||
//@available(swift, obsoleted: 5.0)
|
||||
public protocol _CustomPlaygroundQuickLookable {
|
||||
/// A custom playground Quick Look for this instance.
|
||||
///
|
||||
@@ -1243,9 +1244,10 @@ public protocol _CustomPlaygroundQuickLookable {
|
||||
// Double-underscored real version allows us to keep using this in AppKit while
|
||||
// warning for non-SDK use. This is probably overkill but it doesn't cost
|
||||
// anything.
|
||||
@available(*, deprecated/*, obsoleted: 5.0*/, message: "_DefaultCustomPlaygroundQuickLookable will be removed in a future Swift version. For customizing how types are presented in playgrounds, use CustomPlaygroundDisplayConvertible instead.")
|
||||
@available(swift, deprecated: 4.2, obsoleted: 5.0, message: "_DefaultCustomPlaygroundQuickLookable will be removed in a future Swift version. For customizing how types are presented in playgrounds, use CustomPlaygroundDisplayConvertible instead.")
|
||||
public typealias _DefaultCustomPlaygroundQuickLookable = __DefaultCustomPlaygroundQuickLookable
|
||||
|
||||
// @available(swift, obsoleted: 5.0)
|
||||
public protocol __DefaultCustomPlaygroundQuickLookable {
|
||||
var _defaultCustomPlaygroundQuickLook: _PlaygroundQuickLook { get }
|
||||
}
|
||||
|
||||
@@ -32,7 +32,7 @@ func checkAssociatedTypes() {
|
||||
expectRandomAccessCollectionAssociatedTypes(
|
||||
collectionType: Subject.self,
|
||||
iteratorType: IndexingIterator<Subject>.self,
|
||||
subSequenceType: RandomAccessSlice<Subject>.self,
|
||||
subSequenceType: Slice<Subject>.self,
|
||||
indexType: Int.self,
|
||||
indicesType: CountableRange<Int>.self)
|
||||
}
|
||||
|
||||
@@ -18,7 +18,7 @@ Tests.test("DefaultReturnType") {
|
||||
Tests.test("ExplicitTypeContext") {
|
||||
expectEqualSequence(["hello", "world"],
|
||||
["hello", "world"].flatMap { $0 } as [String])
|
||||
expectEqualSequence("helloworld".characters,
|
||||
expectEqualSequence("helloworld",
|
||||
["hello", "world"].flatMap { $0 } as [Character])
|
||||
}
|
||||
|
||||
|
||||
@@ -102,14 +102,14 @@ SubstringTests.test("Filter") {
|
||||
|
||||
SubstringTests.test("CharacterView") {
|
||||
let s = "abcdefg"
|
||||
var t = s.characters.dropFirst(2)
|
||||
var t = s.dropFirst(2)
|
||||
var u = t.dropFirst(2)
|
||||
|
||||
checkMatch(s.characters, t, t.startIndex)
|
||||
checkMatch(s.characters, t, t.index(after: t.startIndex))
|
||||
checkMatch(s.characters, t, t.index(before: t.endIndex))
|
||||
checkMatch(s, t, t.startIndex)
|
||||
checkMatch(s, t, t.index(after: t.startIndex))
|
||||
checkMatch(s, t, t.index(before: t.endIndex))
|
||||
|
||||
checkMatch(s.characters, t, u.startIndex)
|
||||
checkMatch(s, t, u.startIndex)
|
||||
checkMatch(t, u, u.startIndex)
|
||||
checkMatch(t, u, u.index(after: u.startIndex))
|
||||
checkMatch(t, u, u.index(before: u.endIndex))
|
||||
|
||||
@@ -1,5 +1,5 @@
|
||||
// RUN: not %target-swift-frontend %s -typecheck
|
||||
|
||||
var str = "Hello"
|
||||
String(str.characters.subscript(
|
||||
str.characters.startIndex..<str.characters.endIndex))
|
||||
String(str.subscript(
|
||||
str.startIndex..<str.endIndex))
|
||||
|
||||
@@ -13,7 +13,7 @@ let constante : String = "Hello World"
|
||||
|
||||
let constante2 = "Hello World"
|
||||
|
||||
let caractere : Character = Array(constante.characters)[0]
|
||||
let caractere : Character = Array(constante)[0]
|
||||
|
||||
let caractere2 : Character = "A"
|
||||
|
||||
|
||||
@@ -5,7 +5,7 @@
|
||||
import Foundation
|
||||
|
||||
extension MutableCollection {
|
||||
typealias SubSequence = MutableRangeReplaceableRandomAccessSlice<Data>
|
||||
typealias SubSequence = Slice<Data>
|
||||
}
|
||||
|
||||
print(type(of: Data.self.SubSequence.self))
|
||||
|
||||
@@ -6,5 +6,5 @@
|
||||
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
||||
|
||||
// RUN: not %target-swift-frontend %s -emit-ir
|
||||
Indexable
|
||||
Collection
|
||||
& ManagedBuffer
|
||||
|
||||
@@ -48,7 +48,7 @@ func sortResultIgnored<
|
||||
array.sorted { $0 < $1 } // expected-warning {{result of call to 'sorted(by:)' is unused}}
|
||||
}
|
||||
|
||||
// expected-warning@+2 {{'Indexable' is deprecated: it will be removed in Swift 5.0. Please use 'Collection' instead}}
|
||||
// expected-warning@+2 {{'Indexable' is deprecated: renamed to 'Collection'}}
|
||||
// expected-note@+1 {{use 'Collection' instead}}
|
||||
struct GoodIndexable : Indexable {
|
||||
func index(after i: Int) -> Int { return i + 1 }
|
||||
@@ -60,7 +60,7 @@ struct GoodIndexable : Indexable {
|
||||
}
|
||||
|
||||
|
||||
// expected-warning@+2 {{'Indexable' is deprecated: it will be removed in Swift 5.0. Please use 'Collection' instead}}
|
||||
// expected-warning@+2 {{'Indexable' is deprecated: renamed to 'Collection'}}
|
||||
// expected-note@+1 {{use 'Collection' instead}}
|
||||
struct AnotherGoodIndexable1 : Indexable {
|
||||
func index(after i: Int) -> Int { return i + 1 }
|
||||
@@ -70,7 +70,7 @@ struct AnotherGoodIndexable1 : Indexable {
|
||||
subscript(pos: Int) -> Int { return 0 }
|
||||
}
|
||||
|
||||
// expected-warning@+3 {{'Indexable' is deprecated: it will be removed in Swift 5.0. Please use 'Collection' instead}}
|
||||
// expected-warning@+3 {{'Indexable' is deprecated: renamed to 'Collection'}}
|
||||
// expected-error@+2 {{type 'BadIndexable2' does not conform to protocol 'Collection'}}
|
||||
// expected-note@+1 {{use 'Collection' instead}}
|
||||
struct BadIndexable2 : Indexable {
|
||||
@@ -82,7 +82,7 @@ struct BadIndexable2 : Indexable {
|
||||
// Missing index(after:) -> Int
|
||||
}
|
||||
|
||||
// expected-warning@+2 {{'BidirectionalIndexable' is deprecated: it will be removed in Swift 5.0. Please use 'BidirectionalCollection' instead}}
|
||||
// expected-warning@+2 {{'BidirectionalIndexable' is deprecated: renamed to 'BidirectionalCollection'}}
|
||||
// expected-note@+1 {{use 'BidirectionalCollection' instead}}
|
||||
struct GoodBidirectionalIndexable1 : BidirectionalIndexable {
|
||||
var startIndex: Int { return 0 }
|
||||
@@ -96,7 +96,7 @@ struct GoodBidirectionalIndexable1 : BidirectionalIndexable {
|
||||
|
||||
// We'd like to see: {{type 'BadBidirectionalIndexable' does not conform to protocol 'BidirectionalIndexable'}}
|
||||
// But the compiler doesn't generate that error.
|
||||
// expected-warning@+2 {{'BidirectionalIndexable' is deprecated: it will be removed in Swift 5.0. Please use 'BidirectionalCollection' instead}}
|
||||
// expected-warning@+2 {{'BidirectionalIndexable' is deprecated: renamed to 'BidirectionalCollection'}}
|
||||
// expected-note@+1 {{use 'BidirectionalCollection' instead}}
|
||||
struct BadBidirectionalIndexable : BidirectionalIndexable {
|
||||
var startIndex: Int { return 0 }
|
||||
|
||||
@@ -160,7 +160,7 @@ CoreAudioTestSuite.test("UnsafeMutableAudioBufferListPointer/AssociatedTypes") {
|
||||
expectRandomAccessCollectionAssociatedTypes(
|
||||
collectionType: Subject.self,
|
||||
iteratorType: IndexingIterator<Subject>.self,
|
||||
subSequenceType: MutableRandomAccessSlice<Subject>.self,
|
||||
subSequenceType: Slice<Subject>.self,
|
||||
indexType: Int.self,
|
||||
indicesType: CountableRange<Int>.self)
|
||||
}
|
||||
|
||||
@@ -63,9 +63,7 @@ LazyTestSuite.test("Repeated")
|
||||
expectEqual(42, c.repeatedValue.value)
|
||||
|
||||
let expected = (0..<count).map { _ in OpaqueValue(42) }
|
||||
checkRandomAccessCollection(
|
||||
expected, c)
|
||||
{ $0.value == $1.value }
|
||||
checkRandomAccessCollection(expected, c) { $0.value == $1.value }
|
||||
}
|
||||
|
||||
// FIXME: trap tests.
|
||||
@@ -75,6 +73,8 @@ LazyTestSuite.test("Repeated")
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// Check that the generic parameter is called 'Element'.
|
||||
// FIXME: this should be extension CollectionOfOne.Iterator, but this needs
|
||||
// a fix to the compiler.
|
||||
extension IteratorOverOne where Element : TestProtocol1 {
|
||||
var _elementIsTestProtocol1: Bool {
|
||||
fatalError("not implemented")
|
||||
@@ -84,12 +84,12 @@ extension IteratorOverOne where Element : TestProtocol1 {
|
||||
LazyTestSuite.test("IteratorOverOne") {
|
||||
checkIterator(
|
||||
[] as Array<OpaqueValue<Int>>,
|
||||
IteratorOverOne(_elements: nil as Optional<OpaqueValue<Int>>))
|
||||
CollectionOfOne.Iterator(_elements: nil as Optional<OpaqueValue<Int>>))
|
||||
{ $0.value == $1.value }
|
||||
|
||||
checkIterator(
|
||||
[ OpaqueValue(42) ] as Array<OpaqueValue<Int>>,
|
||||
IteratorOverOne(_elements: OpaqueValue(42)))
|
||||
CollectionOfOne.Iterator(_elements: OpaqueValue(42)))
|
||||
{ $0.value == $1.value }
|
||||
}
|
||||
|
||||
@@ -124,21 +124,20 @@ LazyTestSuite.test("CollectionOfOne/AssociatedTypes") {
|
||||
indicesType: Range<Int>.self)
|
||||
}
|
||||
|
||||
% for (name, operation, indices) in [
|
||||
% ('index(after:)', '_ = c.index(after: i)', '-2, -1, 1, 2'),
|
||||
% ('index(before:)', '_ = c.index(before: i)', '-1, 0, 2'),
|
||||
% ('subscript(Index)/Get', '_ = c[i]', '-2, -1, 1, 2'),
|
||||
% ('subscript(Index)/Set', 'c[i] = OpaqueValue(42)', '-2, -1, 1, 2'),
|
||||
% ]:
|
||||
LazyTestSuite.test("CollectionOfOne/${name}")
|
||||
.forEach(in: [${indices}]) {
|
||||
i in
|
||||
|
||||
var c = CollectionOfOne<OpaqueValue<Int>>(OpaqueValue(42))
|
||||
expectCrashLater()
|
||||
${operation}
|
||||
let collectionOfOneIndexTests: [(String,(inout CollectionOfOne<OpaqueValue<Int>>,Int)->Void,[Int])] = [
|
||||
("index(after:)", { _ = $0.index(after: $1) }, [-2, -1, 1, 2]),
|
||||
("index(before:)", { _ = $0.index(before: $1) }, [-1, 0, 2]),
|
||||
("subscript(Index)/Get", { _ = $0[$1] }, [-2, -1, 1, 2]),
|
||||
("subscript(Index)/Set", { $0[$1] = OpaqueValue(42) }, [-2, -1, 1, 2]),
|
||||
]
|
||||
for (name,operation,indices) in collectionOfOneIndexTests {
|
||||
LazyTestSuite.test("CollectionOfOne/\(name)")
|
||||
.forEach(in: indices) { i in
|
||||
var c = CollectionOfOne<OpaqueValue<Int>>(OpaqueValue(42))
|
||||
expectCrashLater()
|
||||
operation(&c,i)
|
||||
}
|
||||
}
|
||||
% end
|
||||
|
||||
LazyTestSuite.test("CollectionOfOne/index(after:), index(before:)") {
|
||||
let c = CollectionOfOne<OpaqueValue<Int>>(OpaqueValue(42))
|
||||
@@ -153,21 +152,21 @@ LazyTestSuite.test("CollectionOfOne/subscript(Index)/Get/Set/NoTrap") {
|
||||
expectEqualSequence([OpaqueValue(4242)], c) { $0.value == $1.value }
|
||||
}
|
||||
|
||||
% for (name, operation) in [
|
||||
% ('subscript(Range<Index>)/Get', '_ = c[r]'),
|
||||
% ('subscript(Range<Index>)/Set', 'c[r] = slice'),
|
||||
% ]:
|
||||
LazyTestSuite.test("CollectionOfOne/${name}/Trap")
|
||||
.forEach(in: [
|
||||
-1 ..< -1, -1..<0, -1..<1, 1..<2, 2..<2,
|
||||
] as [Range<Int>]) {
|
||||
r in
|
||||
let collectionOfOneInvalidRanges = [-1 ..< -1, -1..<0, -1..<1, 1..<2, 2..<2]
|
||||
LazyTestSuite.test("CollectionOfOne/subscript(Range<Index>)/Get/Trap")
|
||||
.forEach(in: collectionOfOneInvalidRanges) { r in
|
||||
let c = CollectionOfOne<OpaqueValue<Int>>(OpaqueValue(42))
|
||||
expectCrashLater()
|
||||
_ = c[r]
|
||||
}
|
||||
|
||||
LazyTestSuite.test("CollectionOfOne/subscript(Range<Index>)/Set/Trap")
|
||||
.forEach(in: collectionOfOneInvalidRanges) { r in
|
||||
var c = CollectionOfOne<OpaqueValue<Int>>(OpaqueValue(42))
|
||||
let slice = r.count == 0 ? c[0..<0] : c[0..<1]
|
||||
expectCrashLater()
|
||||
${operation}
|
||||
c[r] = slice
|
||||
}
|
||||
% end
|
||||
|
||||
LazyTestSuite.test("CollectionOfOne/subscript(Range<Index>)/Set/DifferentLength/Trap")
|
||||
.forEach(in: [ 0..<0, 0..<1, 1..<1 ] as [Range<Int>]) {
|
||||
@@ -241,27 +240,26 @@ LazyTestSuite.test("EmptyCollection/AssociatedTypes") {
|
||||
typealias Subject = EmptyCollection<OpaqueValue<Int>>
|
||||
expectRandomAccessCollectionAssociatedTypes(
|
||||
collectionType: Subject.self,
|
||||
iteratorType: EmptyIterator<OpaqueValue<Int>>.self,
|
||||
iteratorType: EmptyCollection<OpaqueValue<Int>>.Iterator.self,
|
||||
subSequenceType: Subject.self,
|
||||
indexType: Int.self,
|
||||
indicesType: Range<Int>.self)
|
||||
}
|
||||
|
||||
% for (name, operation) in [
|
||||
% ('index(after:)', '_ = c.index(after: i)'),
|
||||
% ('index(before:)', '_ = c.index(before: i)'),
|
||||
% ('subscript(Index)/Get', '_ = c[i]'),
|
||||
% ('subscript(Index)/Set', 'c[i] = OpaqueValue(42)'),
|
||||
% ]:
|
||||
LazyTestSuite.test("EmptyCollection/${name}")
|
||||
.forEach(in: [-1, 0, 1]) {
|
||||
i in
|
||||
|
||||
var c = EmptyCollection<OpaqueValue<Int>>()
|
||||
expectCrashLater()
|
||||
${operation}
|
||||
let emptyCollectionIndexTests: [(String,(inout EmptyCollection<OpaqueValue<Int>>,Int)->Void)] = [
|
||||
("index(after:)", { _ = $0.index(after: $1) }),
|
||||
("index(before:)", { _ = $0.index(before: $1) }),
|
||||
("subscript(Index)/Get", { _ = $0[$1] }),
|
||||
("subscript(Index)/Set", { $0[$1] = OpaqueValue(42) }),
|
||||
]
|
||||
for (name,operation) in emptyCollectionIndexTests {
|
||||
LazyTestSuite.test("EmptyCollection/\(name)")
|
||||
.forEach(in: [-1, 0, 1]) { i in
|
||||
var c = EmptyCollection<OpaqueValue<Int>>()
|
||||
expectCrashLater()
|
||||
operation(&c,i)
|
||||
}
|
||||
}
|
||||
% end
|
||||
|
||||
% for (name, operation) in [
|
||||
% ('subscript(Range<Index>)/Get', '_ = c[r]'),
|
||||
@@ -376,7 +374,7 @@ extension EmptyIterator where Element : TestProtocol1 {
|
||||
LazyTestSuite.test("EmptyIterator") {
|
||||
checkIterator(
|
||||
[] as Array<OpaqueValue<Int>>,
|
||||
EmptyIterator<OpaqueValue<Int>>())
|
||||
EmptyCollection<OpaqueValue<Int>>.Iterator())
|
||||
{ $0.value == $1.value }
|
||||
}
|
||||
|
||||
@@ -1291,7 +1289,7 @@ do {
|
||||
}
|
||||
|
||||
struct TryFlattenIndex<C: Collection> where C.Element: Collection {
|
||||
typealias FlattenedIndex = FlattenCollectionIndex<C>
|
||||
typealias FlattenedIndex = FlattenCollection<C>.Index
|
||||
}
|
||||
|
||||
|
||||
|
||||
@@ -69,7 +69,7 @@ SliceTests.test("${Collection}.Slice/AssociatedTypes") {
|
||||
func checkStaticTypealiases2<
|
||||
Base : MutableCollection
|
||||
>(_: Base) {
|
||||
expectEqualType(Base.Index.self, MutableSlice<Base>.Index.self)
|
||||
expectEqualType(Base.Index.self, Slice<Base>.Index.self)
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@@ -17,7 +17,6 @@ class TestParameters(object):
|
||||
prefix = []
|
||||
suffix = []
|
||||
base = ''
|
||||
base_slice = ''
|
||||
traversal = ''
|
||||
mutable = False
|
||||
range_replaceable = False
|
||||
@@ -46,7 +45,7 @@ def all_tests():
|
||||
('WithPrefixAndSuffix', '[-9999, -9998, -9997, -9996, -9995]',
|
||||
'[-9994, -9993, -9992]')
|
||||
]:
|
||||
test.name = test.base_slice + '_Of_' + test.base + '_' + name + '.swift'
|
||||
test.name = 'Slice_Of_' + test.base + '_' + name + '.swift'
|
||||
test.prefix = prefix
|
||||
test.suffix
|
||||
yield test
|
||||
@@ -94,7 +93,7 @@ let prefix: [Int] = ${test.prefix}
|
||||
let suffix: [Int] = ${test.suffix}
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> ${test.base_slice}<${test.base}<OpaqueValue<Int>>> {
|
||||
-> Slice<${test.base}<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -105,13 +104,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return ${test.base_slice}(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> ${test.base_slice}<${test.base}<MinimalEquatableValue>> {
|
||||
-> Slice<${test.base}<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -122,13 +119,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return ${test.base_slice}(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> ${test.base_slice}<${test.base}<MinimalComparableValue>> {
|
||||
-> Slice<${test.base}<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -139,9 +134,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return ${test.base_slice}(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
|
||||
@@ -1,129 +0,0 @@
|
||||
// -*- swift -*-
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// Automatically Generated From validation-test/stdlib/Slice/Inputs/Template.swift.gyb
|
||||
// Do Not Edit Directly!
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// RUN: %target-run-simple-swift
|
||||
// REQUIRES: executable_test
|
||||
|
||||
// FIXME: the test is too slow when the standard library is not optimized.
|
||||
// REQUIRES: optimized_stdlib
|
||||
|
||||
import StdlibUnittest
|
||||
import StdlibCollectionUnittest
|
||||
|
||||
var SliceTests = TestSuite("Collection")
|
||||
|
||||
let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableSlice<MinimalMutableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
let base = MinimalMutableCollection(elements: baseElements)
|
||||
let startIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count))
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableSlice<MinimalMutableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
let base = MinimalMutableCollection(elements: baseElements)
|
||||
let startIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count))
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableSlice<MinimalMutableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
let base = MinimalMutableCollection(elements: baseElements)
|
||||
let startIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count))
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
resiliencyChecks.creatingOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableSlice_Of_MinimalMutableCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
makeCollectionOfEquatable: makeCollectionOfEquatable,
|
||||
wrapValueIntoEquatable: identityEq,
|
||||
extractValueFromEquatable: identityEq,
|
||||
makeCollectionOfComparable: makeCollectionOfComparable,
|
||||
wrapValueIntoComparable: identityComp,
|
||||
extractValueFromComparable: identityComp,
|
||||
resiliencyChecks: resiliencyChecks,
|
||||
outOfBoundsIndexOffset: 6
|
||||
, withUnsafeMutableBufferPointerIsSupported: false,
|
||||
isFixedLengthCollection: true
|
||||
)
|
||||
|
||||
// rdar://problem/35760754
|
||||
|
||||
func f<C : MutableCollection>(
|
||||
_ elements: inout C
|
||||
) { }
|
||||
|
||||
var CrashTests = TestSuite("MutableSliceCrash")
|
||||
|
||||
extension TestSuite {
|
||||
public func addMyMutableCollectionTests<C : MutableCollection>(
|
||||
_ testNamePrefix: String = "",
|
||||
maker: @escaping ([C.Element]) -> C
|
||||
) {
|
||||
|
||||
// this runs just fine
|
||||
self.test("\(testNamePrefix).Direct") {
|
||||
var c = makeCollection(elements: [])
|
||||
f(&c[c.startIndex..<c.endIndex])
|
||||
}
|
||||
|
||||
// this used to crash, even though the only difference is it's calling
|
||||
// makeCollection via the argument to the original function
|
||||
self.test("\(testNamePrefix).Indirect") {
|
||||
var c = maker([])
|
||||
f(&c[c.startIndex..<c.endIndex])
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
CrashTests.addMyMutableCollectionTests(
|
||||
"Crasher",
|
||||
maker: makeCollection
|
||||
)
|
||||
|
||||
runAllTests()
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addBidirectionalCollectionTests(
|
||||
"BidirectionalSlice_Of_DefaultedBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addBidirectionalCollectionTests(
|
||||
"BidirectionalSlice_Of_DefaultedBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addBidirectionalCollectionTests(
|
||||
"BidirectionalSlice_Of_DefaultedBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> BidirectionalSlice<DefaultedBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addBidirectionalCollectionTests(
|
||||
"BidirectionalSlice_Of_DefaultedBidirectionalCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedBidirectionalCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -31,9 +31,7 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
@@ -48,9 +46,7 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
|
||||
@@ -31,9 +31,7 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
@@ -48,9 +46,7 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
|
||||
@@ -31,9 +31,7 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
@@ -48,9 +46,7 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
|
||||
@@ -31,9 +31,7 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
@@ -48,9 +46,7 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableBidirectionalSlice_Of_DefaultedMutableBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedMutableBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableBidirectionalSlice_Of_DefaultedMutableBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedMutableBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableBidirectionalSlice_Of_DefaultedMutableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableBidirectionalSlice<DefaultedMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableBidirectionalSlice_Of_DefaultedMutableBidirectionalCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableBidirectionalCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableSlice<DefaultedMutableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableSlice<DefaultedMutableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableSlice<DefaultedMutableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableSlice_Of_DefaultedMutableCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedMutableCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableSlice<DefaultedMutableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableSlice<DefaultedMutableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableSlice<DefaultedMutableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableSlice_Of_DefaultedMutableCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedMutableCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableSlice<DefaultedMutableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableSlice<DefaultedMutableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableSlice<DefaultedMutableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableSlice_Of_DefaultedMutableCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableSlice<DefaultedMutableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableSlice<DefaultedMutableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableSlice<DefaultedMutableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableSlice_Of_DefaultedMutableCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRandomAccessSlice_Of_DefaultedMutableRandomAccessCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedMutableRandomAccessCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRandomAccessSlice_Of_DefaultedMutableRandomAccessCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedMutableRandomAccessCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRandomAccessSlice_Of_DefaultedMutableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRandomAccessSlice<DefaultedMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRandomAccessSlice_Of_DefaultedMutableRandomAccessCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRandomAccessCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"MutableRangeReplaceableSlice_Of_DefaultedMutableRangeReplaceableCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableRangeReplaceableSlice_Of_DefaultedMutableRangeReplaceableCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"MutableRangeReplaceableSlice_Of_DefaultedMutableRangeReplaceableCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableRangeReplaceableSlice_Of_DefaultedMutableRangeReplaceableCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"MutableRangeReplaceableSlice_Of_DefaultedMutableRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableRangeReplaceableSlice_Of_DefaultedMutableRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableSlice<DefaultedMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"MutableRangeReplaceableSlice_Of_DefaultedMutableRangeReplaceableCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableRangeReplaceableSlice_Of_DefaultedMutableRangeReplaceableCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedMutableRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRandomAccessCollectionTests(
|
||||
"RandomAccessSlice_Of_DefaultedRandomAccessCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedRandomAccessCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRandomAccessCollectionTests(
|
||||
"RandomAccessSlice_Of_DefaultedRandomAccessCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedRandomAccessCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRandomAccessCollectionTests(
|
||||
"RandomAccessSlice_Of_DefaultedRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RandomAccessSlice<DefaultedRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRandomAccessCollectionTests(
|
||||
"RandomAccessSlice_Of_DefaultedRandomAccessCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedRandomAccessCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"RangeReplaceableBidirectionalSlice_Of_DefaultedRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"RangeReplaceableBidirectionalSlice_Of_DefaultedRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"RangeReplaceableBidirectionalSlice_Of_DefaultedRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<DefaultedRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"RangeReplaceableBidirectionalSlice_Of_DefaultedRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"RangeReplaceableSlice_Of_DefaultedRangeReplaceableCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"RangeReplaceableSlice_Of_DefaultedRangeReplaceableCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"RangeReplaceableSlice_Of_DefaultedRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableSlice<DefaultedRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"RangeReplaceableSlice_Of_DefaultedRangeReplaceableCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"RangeReplaceableRandomAccessSlice_Of_DefaultedRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"RangeReplaceableRandomAccessSlice_Of_DefaultedRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"RangeReplaceableRandomAccessSlice_Of_DefaultedRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableRandomAccessSlice<DefaultedRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<DefaultedRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"RangeReplaceableRandomAccessSlice_Of_DefaultedRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
"Slice_Of_DefaultedRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addBidirectionalCollectionTests(
|
||||
"BidirectionalSlice_Of_MinimalBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addBidirectionalCollectionTests(
|
||||
"BidirectionalSlice_Of_MinimalBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addBidirectionalCollectionTests(
|
||||
"BidirectionalSlice_Of_MinimalBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> BidirectionalSlice<MinimalBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return BidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addBidirectionalCollectionTests(
|
||||
"BidirectionalSlice_Of_MinimalBidirectionalCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalBidirectionalCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -31,9 +31,7 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
@@ -48,9 +46,7 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
|
||||
@@ -31,9 +31,7 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
@@ -48,9 +46,7 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
|
||||
@@ -31,9 +31,7 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
@@ -48,9 +46,7 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
|
||||
@@ -31,9 +31,7 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
@@ -48,9 +46,7 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableBidirectionalSlice_Of_MinimalMutableBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalMutableBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableBidirectionalSlice_Of_MinimalMutableBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalMutableBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableBidirectionalSlice_Of_MinimalMutableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableBidirectionalSlice<MinimalMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableBidirectionalSlice_Of_MinimalMutableBidirectionalCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableBidirectionalCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableSlice<MinimalMutableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableSlice<MinimalMutableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableSlice<MinimalMutableCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableSlice_Of_MinimalMutableCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableSlice<MinimalMutableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableSlice<MinimalMutableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableSlice<MinimalMutableCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableSlice_Of_MinimalMutableCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalMutableCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableSlice<MinimalMutableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableSlice<MinimalMutableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableSlice<MinimalMutableCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableSlice_Of_MinimalMutableCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -0,0 +1,89 @@
|
||||
// -*- swift -*-
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// Automatically Generated From validation-test/stdlib/Slice/Inputs/Template.swift.gyb
|
||||
// Do Not Edit Directly!
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// RUN: %target-run-simple-swift
|
||||
// REQUIRES: executable_test
|
||||
|
||||
// FIXME: the test is too slow when the standard library is not optimized.
|
||||
// REQUIRES: optimized_stdlib
|
||||
|
||||
import StdlibUnittest
|
||||
import StdlibCollectionUnittest
|
||||
|
||||
var SliceTests = TestSuite("Collection")
|
||||
|
||||
let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> Slice<MinimalMutableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
let base = MinimalMutableCollection(elements: baseElements)
|
||||
let startIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count))
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> Slice<MinimalMutableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
let base = MinimalMutableCollection(elements: baseElements)
|
||||
let startIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count))
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> Slice<MinimalMutableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
let base = MinimalMutableCollection(elements: baseElements)
|
||||
let startIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count))
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
resiliencyChecks.creatingOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"Slice_Of_MinimalMutableCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
makeCollectionOfEquatable: makeCollectionOfEquatable,
|
||||
wrapValueIntoEquatable: identityEq,
|
||||
extractValueFromEquatable: identityEq,
|
||||
makeCollectionOfComparable: makeCollectionOfComparable,
|
||||
wrapValueIntoComparable: identityComp,
|
||||
extractValueFromComparable: identityComp,
|
||||
resiliencyChecks: resiliencyChecks,
|
||||
outOfBoundsIndexOffset: 6
|
||||
, withUnsafeMutableBufferPointerIsSupported: false,
|
||||
isFixedLengthCollection: true
|
||||
)
|
||||
|
||||
runAllTests()
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRandomAccessSlice_Of_MinimalMutableRandomAccessCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalMutableRandomAccessCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRandomAccessSlice_Of_MinimalMutableRandomAccessCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalMutableRandomAccessCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRandomAccessSlice_Of_MinimalMutableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRandomAccessSlice<MinimalMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRandomAccessSlice_Of_MinimalMutableRandomAccessCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRandomAccessCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableBidirectionalSlice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableBidirectionalCollectionTests(
|
||||
"MutableRangeReplaceableBidirectionalSlice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableBidirectionalCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"MutableRangeReplaceableSlice_Of_MinimalMutableRangeReplaceableCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableRangeReplaceableSlice_Of_MinimalMutableRangeReplaceableCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"MutableRangeReplaceableSlice_Of_MinimalMutableRangeReplaceableCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableRangeReplaceableSlice_Of_MinimalMutableRangeReplaceableCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"MutableRangeReplaceableSlice_Of_MinimalMutableRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableRangeReplaceableSlice_Of_MinimalMutableRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableSlice<MinimalMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableSliceTests(
|
||||
"MutableRangeReplaceableSlice_Of_MinimalMutableRangeReplaceableCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableCollectionTests(
|
||||
"MutableRangeReplaceableSlice_Of_MinimalMutableRangeReplaceableCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> MutableRangeReplaceableRandomAccessSlice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalMutableRangeReplaceableRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return MutableRangeReplaceableRandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -87,7 +81,7 @@ SliceTests.addRangeReplaceableRandomAccessSliceTests(
|
||||
outOfBoundsIndexOffset: 6
|
||||
)
|
||||
SliceTests.addMutableRandomAccessCollectionTests(
|
||||
"MutableRangeReplaceableRandomAccessSlice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalMutableRangeReplaceableRandomAccessCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRandomAccessCollectionTests(
|
||||
"RandomAccessSlice_Of_MinimalRandomAccessCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalRandomAccessCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRandomAccessCollectionTests(
|
||||
"RandomAccessSlice_Of_MinimalRandomAccessCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalRandomAccessCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997, -9996, -9995]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRandomAccessCollectionTests(
|
||||
"RandomAccessSlice_Of_MinimalRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
"Slice_Of_MinimalRandomAccessCollection_WithPrefixAndSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalRandomAccessCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalRandomAccessCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RandomAccessSlice<MinimalRandomAccessCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalRandomAccessCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RandomAccessSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRandomAccessCollectionTests(
|
||||
"RandomAccessSlice_Of_MinimalRandomAccessCollection_WithSuffix.swift.",
|
||||
"Slice_Of_MinimalRandomAccessCollection_WithSuffix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = []
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableBidirectionalSlice<MinimalRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<MinimalRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<MinimalRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"RangeReplaceableBidirectionalSlice_Of_MinimalRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
"Slice_Of_MinimalRangeReplaceableBidirectionalCollection_FullWidth.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
@@ -20,7 +20,7 @@ let prefix: [Int] = [-9999, -9998, -9997]
|
||||
let suffix: [Int] = []
|
||||
|
||||
func makeCollection(elements: [OpaqueValue<Int>])
|
||||
-> RangeReplaceableBidirectionalSlice<MinimalRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
-> Slice<MinimalRangeReplaceableBidirectionalCollection<OpaqueValue<Int>>> {
|
||||
var baseElements = prefix.map(OpaqueValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(OpaqueValue.init))
|
||||
@@ -31,13 +31,11 @@ func makeCollection(elements: [OpaqueValue<Int>])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<MinimalRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
-> Slice<MinimalRangeReplaceableBidirectionalCollection<MinimalEquatableValue>> {
|
||||
var baseElements = prefix.map(MinimalEquatableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalEquatableValue.init))
|
||||
@@ -48,13 +46,11 @@ func makeCollectionOfEquatable(elements: [MinimalEquatableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
-> RangeReplaceableBidirectionalSlice<MinimalRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
-> Slice<MinimalRangeReplaceableBidirectionalCollection<MinimalComparableValue>> {
|
||||
var baseElements = prefix.map(MinimalComparableValue.init)
|
||||
baseElements.append(contentsOf: elements)
|
||||
baseElements.append(contentsOf: suffix.map(MinimalComparableValue.init))
|
||||
@@ -65,9 +61,7 @@ func makeCollectionOfComparable(elements: [MinimalComparableValue])
|
||||
let endIndex = base.index(
|
||||
base.startIndex,
|
||||
offsetBy: numericCast(prefix.count + elements.count))
|
||||
return RangeReplaceableBidirectionalSlice(
|
||||
base: base,
|
||||
bounds: startIndex..<endIndex)
|
||||
return Slice(base: base, bounds: startIndex..<endIndex)
|
||||
}
|
||||
|
||||
var resiliencyChecks = CollectionMisuseResiliencyChecks.all
|
||||
@@ -76,7 +70,7 @@ resiliencyChecks.subscriptOnOutOfBoundsIndicesBehavior = .trap
|
||||
resiliencyChecks.subscriptRangeOnOutOfBoundsRangesBehavior = .trap
|
||||
|
||||
SliceTests.addRangeReplaceableBidirectionalSliceTests(
|
||||
"RangeReplaceableBidirectionalSlice_Of_MinimalRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
"Slice_Of_MinimalRangeReplaceableBidirectionalCollection_WithPrefix.swift.",
|
||||
makeCollection: makeCollection,
|
||||
wrapValue: identity,
|
||||
extractValue: identity,
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user