mirror of
https://github.com/apple/swift-algorithms
synced 2026-11-22 04:10:39 +00:00
100 lines
3.4 KiB
Swift
100 lines
3.4 KiB
Swift
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This source file is part of the Swift Algorithms open source project
|
|
//
|
|
// Copyright (c) 2020 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See https://swift.org/LICENSE.txt for license information
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
import XCTest
|
|
|
|
@testable import Algorithms
|
|
|
|
final class RotateTests: XCTestCase {
|
|
/// Tests the example given in the `_reverse(subrange:until:)` documentation.
|
|
func testUnderscoreReverse() {
|
|
var input = [
|
|
"a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o",
|
|
"p",
|
|
]
|
|
let limit: Int = 4
|
|
let (lower, upper) = input._reverse(
|
|
subrange: input.startIndex..<input.endIndex,
|
|
until: input.startIndex.advanced(by: limit))
|
|
let expected = [
|
|
"p", "o", "n", "m", "e", "f", "g", "h", "i", "j", "k", "l", "d", "c", "b",
|
|
"a",
|
|
]
|
|
XCTAssertEqual(input, expected)
|
|
XCTAssertEqual(lower, input.startIndex.advanced(by: limit))
|
|
XCTAssertEqual(upper, input.endIndex.advanced(by: -limit))
|
|
}
|
|
|
|
/// Tests the example given in the `reverse(subrange:)` documentation.
|
|
func testReverse() {
|
|
var numbers = [10, 20, 30, 40, 50, 60, 70, 80]
|
|
numbers.reverse(subrange: 0..<4)
|
|
XCTAssertEqual(numbers, [40, 30, 20, 10, 50, 60, 70, 80])
|
|
}
|
|
|
|
/// Tests `rotate(subrange:toStartAt:)` with an empty subrange.
|
|
func testRotateEmptySubrange() {
|
|
var numbers = [10, 20, 30, 40, 50, 60, 70, 80]
|
|
let oldStart = numbers.rotate(subrange: 3..<3, toStartAt: 3)
|
|
// The order of elements are unchanged
|
|
XCTAssertEqual(numbers, [10, 20, 30, 40, 50, 60, 70, 80])
|
|
XCTAssertEqual(numbers[oldStart], 40)
|
|
}
|
|
|
|
/// Tests `rotate(subrange:toStartAt:)` with an empty collection.
|
|
func testRotateSubrangeOnEmptyCollection() {
|
|
var numbers: [Int] = []
|
|
let oldStart = numbers.rotate(subrange: 0..<0, toStartAt: 0)
|
|
XCTAssertEqual(numbers, [])
|
|
XCTAssertEqual(oldStart, numbers.startIndex)
|
|
}
|
|
|
|
/// Tests `rotate(subrange:toStartAt:)` with the full range of the collection.
|
|
func testRotateFullRange() {
|
|
var numbers = [10, 20, 30, 40, 50, 60, 70, 80]
|
|
let oldStart = numbers.rotate(subrange: 0..<8, toStartAt: 1)
|
|
XCTAssertEqual(numbers, [20, 30, 40, 50, 60, 70, 80, 10])
|
|
XCTAssertEqual(numbers[oldStart], 10)
|
|
}
|
|
|
|
/// Tests the example given in the `rotate(subrange:toStartAt:)`
|
|
/// documentation.
|
|
func testRotateSubrange() {
|
|
var numbers = [10, 20, 30, 40, 50, 60, 70, 80]
|
|
let oldStart = numbers.rotate(subrange: 0..<4, toStartAt: 2)
|
|
XCTAssertEqual(numbers, [30, 40, 10, 20, 50, 60, 70, 80])
|
|
XCTAssertEqual(numbers[oldStart], 10)
|
|
}
|
|
|
|
/// Tests the example given in the `rotate(toStartAt:)` documentation.
|
|
func testRotateExample() {
|
|
var numbers = [10, 20, 30, 40, 50, 60, 70, 80]
|
|
let oldStart = numbers.rotate(toStartAt: 3)
|
|
XCTAssertEqual(numbers, [40, 50, 60, 70, 80, 10, 20, 30])
|
|
XCTAssertEqual(numbers[oldStart], 10)
|
|
}
|
|
|
|
/// Tests `rotate(toStartAt:)` on collections of varying lengths, at
|
|
/// different starting points.
|
|
func testRotate() {
|
|
for length in 0...15 {
|
|
let a = Array(0..<length)
|
|
var b = a
|
|
for j in 0..<length {
|
|
let i = b.rotate(toStartAt: j)
|
|
expectEqualSequences(a[j...] + a[..<j], b)
|
|
b.rotate(toStartAt: i)
|
|
XCTAssertEqual(a, b)
|
|
}
|
|
}
|
|
}
|
|
}
|