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
|
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2018 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
// This benchmark tests the performance of Dictionary<AnyHashable, Any> with
// small ASCII String keys. Untyped NSDictionary values get imported as this
// type, so it occurs relatively often in practice.
public let benchmarks = [
BenchmarkInfo(
name: "DictionaryOfAnyHashableStrings_insert",
runFunction: run_DictionaryOfAnyHashableStrings_insert,
tags: [.abstraction, .runtime, .cpubench],
setUpFunction: { keys = buildKeys(50) },
legacyFactor: 14
),
BenchmarkInfo(
name: "DictionaryOfAnyHashableStrings_lookup",
runFunction: run_DictionaryOfAnyHashableStrings_lookup,
tags: [.abstraction, .runtime, .cpubench],
setUpFunction: { keys = buildKeys(50); workload = buildWorkload() },
legacyFactor: 24
),
]
var keys: [String] = []
var workload: [AnyHashable: Any] = [:]
func buildKeys(_ size: Int) -> [String] {
var result: [String] = []
let keyPrefixes = ["font", "bgcolor", "fgcolor", "blink", "marquee"]
for key in keyPrefixes {
for i in 0 ..< size {
result.append(key + "\(i)")
}
}
return result
}
func buildWorkload() -> [AnyHashable: Any] {
precondition(keys.count > 0)
var result: [AnyHashable: Any] = [:]
var i = 0
for key in keys {
result[key] = i
i += 1
}
return result
}
@inline(never)
public func run_DictionaryOfAnyHashableStrings_insert(_ n: Int) {
precondition(keys.count > 0)
for _ in 1...n {
blackHole(buildWorkload())
}
}
@inline(never)
public func run_DictionaryOfAnyHashableStrings_lookup(_ n: Int) {
precondition(workload.count > 0)
precondition(keys.count > 0)
for _ in 1...n {
for i in 0 ..< keys.count {
let key = keys[i]
check((workload[key] as! Int) == i)
}
}
}
|
