mirror of
https://github.com/apple/swift.git
synced 2025-12-21 12:14:44 +01:00
5fe2a0232e
... as well as new test collection types: `MinimalRandomAccessCollectionWithStrideableIndex` and `DefaultedRandonAccessCollectionWithStrideableIndex`, to test default implementation of `index(...)` family of functions provided by the standard library for the random access collections with strideable indices.
112 lines
3.4 KiB
Plaintext
112 lines
3.4 KiB
Plaintext
|
|
//===--- Index.swift.gyb - tests for Index types and operations -----------===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2016 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See http://swift.org/LICENSE.txt for license information
|
|
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
// -*- swift -*-
|
|
// RUN: rm -rf %t ; mkdir -p %t
|
|
// RUN: %S/../../utils/gyb %s -o %t/Index.swift
|
|
// RUN: %S/../../utils/line-directive %t/Index.swift -- %target-build-swift %t/Index.swift -o %t/a.out
|
|
// RUN: %S/../../utils/line-directive %t/Index.swift -- %target-run %t/a.out
|
|
// REQUIRES: executable_test
|
|
|
|
import StdlibUnittest
|
|
import StdlibCollectionUnittest
|
|
|
|
|
|
var Index = TestSuite("Index")
|
|
|
|
% from gyb_stdlib_support import collectionForTraversal
|
|
|
|
% # RandomAccess does not add any new behaviors to Bidirectional
|
|
% # so we are left with just 2 traversals for the following tests
|
|
% for Traversal in ['Forward', 'Bidirectional']:
|
|
% TraversalCollection = collectionForTraversal(Traversal)
|
|
|
|
Index.test("${TraversalCollection}/distance(to:)/dispatch") {
|
|
let c = ${TraversalCollection}Log.dispatchTester(Array(0..<10))
|
|
_ = c.distance(from: 0, to: 10)
|
|
expectCustomizable(c, c.log.distance)
|
|
}
|
|
|
|
Index.test("${TraversalCollection}/index(_:offsetBy:)/dispatch") {
|
|
let c = ${TraversalCollection}Log.dispatchTester(Array(0..<10))
|
|
_ = c.index(c.startIndex, offsetBy: 10)
|
|
expectCustomizable(c, c.log.advance)
|
|
}
|
|
|
|
Index.test("${TraversalCollection}/index(_:offsetBy:limitedBy:)/dispatch") {
|
|
let c = ${TraversalCollection}Log.dispatchTester(Array(0..<10))
|
|
_ = c.index(c.startIndex, offsetBy: 10, limitedBy: 5)
|
|
expectCustomizable(c, c.log.advanceLimit)
|
|
}
|
|
|
|
% end
|
|
|
|
// Check that a random access collection doesn't call into O(n) predecessor
|
|
// calls when it has a more efficient implementation.
|
|
|
|
% for IsStrideable in [False, True]:
|
|
% Collection = 'DefaultedRandomAccessCollection'
|
|
% Collection += 'WithStrideableIndex' if IsStrideable else ''
|
|
|
|
Index.test(
|
|
"${Collection}/index(_:offsetBy:)/"
|
|
+ "avoidsSuccessorAndPredecessor/dispatch"
|
|
) {
|
|
for test in indexStepsFromTests.filter(
|
|
{$0.limit == nil && $0.distance >= 0}
|
|
) {
|
|
let c = ${Collection}(Array(0..<10))
|
|
|
|
let i = c.nthIndex(test.startOffset)
|
|
let result = c.index(i, offsetBy: test.distance)
|
|
|
|
% if IsStrideable:
|
|
expectTrue(i.timesAdvancedCalled.value <= 1)
|
|
if i.timesAdvancedCalled.value == 0 {
|
|
expectEqual(1, i.timesDistanceCalled.value)
|
|
}
|
|
% else:
|
|
expectEqual(0, c.timesSuccessorCalled.value)
|
|
expectEqual(0, c.timesPredecessorCalled.value)
|
|
% end
|
|
}
|
|
}
|
|
|
|
Index.test(
|
|
"${Collection}/index(_:offsetBy:limitedBy:)/"
|
|
+ "avoidsSuccessorAndPredecessor/dispatch"
|
|
) {
|
|
for test in indexStepsFromTests.filter(
|
|
{$0.limit != nil}
|
|
) {
|
|
let c = ${Collection}(Array(0..<10))
|
|
|
|
let i = c.nthIndex(test.startOffset)
|
|
let limit = c.nthIndex(test.limit.unsafelyUnwrapped)
|
|
_ = c.index(i, offsetBy: test.distance, limitedBy: limit)
|
|
|
|
% if IsStrideable:
|
|
expectTrue(i.timesAdvancedCalled.value <= 1)
|
|
if i.timesAdvancedCalled.value == 0 {
|
|
expectEqual(1, i.timesDistanceCalled.value)
|
|
}
|
|
% else:
|
|
expectEqual(0, c.timesSuccessorCalled.value)
|
|
expectEqual(0, c.timesPredecessorCalled.value)
|
|
% end
|
|
}
|
|
}
|
|
|
|
% end
|
|
|
|
runAllTests()
|