@@ -21,18 +21,15 @@ public var DictionaryOfAnyHashableStrings = [
21
21
name: " DictionaryOfAnyHashableStrings_insert " ,
22
22
runFunction: run_DictionaryOfAnyHashableStrings_insert,
23
23
tags: [ . abstraction, . runtime, . cpubench] ,
24
- setUpFunction: {
25
- keys = buildKeys ( 500 )
26
- }
24
+ setUpFunction: { keys = buildKeys ( 50 ) } ,
25
+ legacyFactor: 14
27
26
) ,
28
27
BenchmarkInfo (
29
28
name: " DictionaryOfAnyHashableStrings_lookup " ,
30
29
runFunction: run_DictionaryOfAnyHashableStrings_lookup,
31
30
tags: [ . abstraction, . runtime, . cpubench] ,
32
- setUpFunction: {
33
- keys = buildKeys ( 500 )
34
- workload = buildWorkload ( )
35
- }
31
+ setUpFunction: { keys = buildKeys ( 50 ) ; workload = buildWorkload ( ) } ,
32
+ legacyFactor: 24
36
33
) ,
37
34
]
38
35
@@ -65,7 +62,7 @@ func buildWorkload() -> [AnyHashable: Any] {
65
62
@inline ( never)
66
63
public func run_DictionaryOfAnyHashableStrings_insert( _ n: Int ) {
67
64
precondition ( keys. count > 0 )
68
- for _ in 0 ... n {
65
+ for _ in 1 ... n {
69
66
blackHole ( buildWorkload ( ) )
70
67
}
71
68
}
@@ -74,7 +71,7 @@ public func run_DictionaryOfAnyHashableStrings_insert(_ n: Int) {
74
71
public func run_DictionaryOfAnyHashableStrings_lookup( _ n: Int ) {
75
72
precondition ( workload. count > 0 )
76
73
precondition ( keys. count > 0 )
77
- for _ in 0 ... n {
74
+ for _ in 1 ... n {
78
75
for i in 0 ..< keys. count {
79
76
let key = keys [ i]
80
77
CheckResults ( ( workload [ key] as! Int ) == i)
0 commit comments