Files
swift-mirror/benchmark/single-source/SortLettersInPlace.swift
Pavol Vaskovic 7c951410f4 [Gardening] Remove extra Foundation imports
Remove the import of Foundation where it is not necessary for testing the ObjC interop.
2019-06-28 16:42:27 +02:00

49 lines
1.6 KiB
Swift

//===--- SortLettersInPlace.swift -----------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 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
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
// This test checks performance and correctness of Swift sortInPlace on an
// array of letters.
import TestsUtils
public let SortLettersInPlace = BenchmarkInfo(
name: "SortLettersInPlace",
runFunction: run_SortLettersInPlace,
tags: [.validation, .api, .algorithm, .String])
class Letter {
let value: String
init(_ value: String) {
self.value = value
}
}
@inline(never)
public func run_SortLettersInPlace(_ N: Int) {
for _ in 1...100*N {
var letters = [
Letter("k"), Letter("a"), Letter("x"), Letter("i"), Letter("f"), Letter("l"),
Letter("o"), Letter("w"), Letter("h"), Letter("p"), Letter("b"), Letter("u"),
Letter("n"), Letter("c"), Letter("j"), Letter("t"), Letter("y"), Letter("s"),
Letter("d"), Letter("v"), Letter("r"), Letter("e"), Letter("q"), Letter("m"),
Letter("z"), Letter("g")
]
// Sort the letters in place.
letters.sort {
return $0.value < $1.value
}
// Check whether letters are sorted.
CheckResults(letters[0].value <= letters[letters.count/2].value)
}
}