1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
//===--- StringEdits.swift ------------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2021 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
//
//===----------------------------------------------------------------------===//
import TestsUtils
#if canImport(Glibc)
import Glibc
#elseif canImport(Musl)
import Musl
#elseif os(Windows)
import MSVCRT
#else
import Darwin
#endif
public let benchmarks = [
BenchmarkInfo(
name: "StringEdits",
runFunction: run_StringEdits,
tags: [.validation, .api, .String],
legacyFactor: 100),
]
let editWords: [String] = [
"woodshed",
"lakism",
"gastroperiodynia",
]
let alphabet = "abcdefghijklmnopqrstuvwxyz"
/// All edits that are one edit away from `word`
func edits(_ word: String) -> Set<String> {
let splits = word.indices.map {
(String(word[..<$0]), String(word[$0...]))
}
var result: Array<String> = []
for (left, right) in splits {
// drop a character
result.append(left + right.dropFirst())
// transpose two characters
if let fst = right.first {
let drop1 = right.dropFirst()
if let snd = drop1.first {
result.append(left + [snd,fst] + drop1.dropFirst())
}
}
// replace each character with another
for letter in alphabet {
result.append(left + [letter] + right.dropFirst())
}
// insert rogue characters
for letter in alphabet {
result.append(left + [letter] + right)
}
}
// have to map back to strings right at the end
return Set(result)
}
@inline(never)
public func run_StringEdits(_ n: Int) {
for _ in 1...n {
for word in editWords {
_ = edits(word)
}
}
}
|
