-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmain.swift
190 lines (177 loc) · 5.46 KB
/
main.swift
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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
//
// main.swift
// PD4PerfTool
//
// Created by Henry on 2019/05/22.
// Copyright © 2019 Eonil. All rights reserved.
//
import Foundation
import GameKit
let averageCount = 10
let outerLoopCount = 1_00
let innerLoopCount = 1_000
///
/// returns list of nanoseconds for each outer iteration.
///
func run(_ single_op: (Int) -> Void) -> [Double] {
var data = [Double]()
for i in 0..<outerLoopCount {
let startTime = DispatchTime.now()
for j in 0..<innerLoopCount {
let k = i * innerLoopCount + j
single_op(k)
}
let endTime = DispatchTime.now()
let timeDelta = Int(endTime.uptimeNanoseconds - startTime.uptimeNanoseconds)
let timeDeltaSingleOp = Double(timeDelta) / Double(innerLoopCount)
data.append(timeDeltaSingleOp)
if (i+1) % (outerLoopCount/10) == 0 {
let d = timeDelta / innerLoopCount
print(" \(i+1)k: \(d.metricPrefixedNanoSeconds())")
}
if timeDelta > 50_000_000 {
print(" iteration takes over 50ms. and too slow. cancel test.")
return data
}
}
return data
}
func clearCache() {
do {
// Clear cache.
var a = [UInt32](repeating: 0, count: 1024 * 1024 * 128)
for i in 0..<a.count {
a[i] = arc4random()
}
var b = 0 as UInt32
for i in 0..<a.count {
b += a[i]
}
print(b)
}
}
var db = DB(iterationCount: averageCount)
protocol AAPerfMeasuringProtocol {
associatedtype Key
associatedtype Value
init()
var count: Int { get }
subscript(key: Key) -> Value? { get set }
}
extension Dictionary: AAPerfMeasuringProtocol {}
extension Map: AAPerfMeasuringProtocol {}
extension HAMT: AAPerfMeasuringProtocol {}
struct CRUDNames {
var get: DB.Name
var insert: DB.Name
var update: DB.Name
var remove: DB.Name
}
func runCRUDPackage<T>(_: T.Type, _ ns: CRUDNames) where T: AAPerfMeasuringProtocol, T.Key == Int, T.Value == Int {
for i in 0..<averageCount {
do {
let n = ns.get
print("[\(i)] \(n)")
print("--------------------------------------------")
let m = outerLoopCount * innerLoopCount
let ks = Array(0..<m).shuffled()
var pd = T()
for i in 0..<m {
pd[i] = i
}
precondition(pd.count == m)
var pd1 = pd
let ss = run { i in
let k = ks[i]
let v = pd[k]!
pd1 = pd
precondition(v == k)
precondition(pd1.count == pd.count)
}
precondition(pd.count == m)
precondition(pd1.count == pd.count)
db.push(name: n, samples: ss)
print("--------------------------------------------")
}
do {
let n = ns.insert
print("[\(i)] \(n)")
print("--------------------------------------------")
let m = outerLoopCount * innerLoopCount
let ks = Array(0..<m).shuffled()
var pd = T()
var pd1 = pd // Keep one copy to test persistency.
let ss = run { i in
let k = ks[i]
pd[k] = i
pd1 = pd
}
precondition(pd.count == pd1.count)
db.push(name: n, samples: ss)
print("--------------------------------------------")
}
do {
let n = ns.update
print("[\(i)] \(n)")
print("--------------------------------------------")
let m = outerLoopCount * innerLoopCount
let ks = Array(0..<m).shuffled()
var pd = T()
for i in 0..<m {
pd[i] = i
}
precondition(pd.count == m)
var pd1 = pd
let ss = run { i in
let k = ks[i]
pd[k] = i
pd1 = pd
precondition(pd1.count == pd.count)
}
precondition(pd.count == m)
precondition(pd1.count == pd.count)
db.push(name: n, samples: ss)
print("--------------------------------------------")
}
do {
let n = ns.remove
print("[\(i)] \(n)")
print("--------------------------------------------")
let m = outerLoopCount * innerLoopCount
var ks = Array(0..<m).shuffled()
var pd = T()
for i in 0..<m {
pd[i] = i
}
precondition(pd.count == m)
var pd1 = pd
let ss = run { i in
let k = ks.removeLast()
pd[k] = nil
pd1 = pd
precondition(pd.count == ks.count)
precondition(pd1.count == pd.count)
}
precondition(pd.count == ks.count)
precondition(pd1.count == pd.count)
db.push(name: n, samples: ss)
print("--------------------------------------------")
}
}
}
runCRUDPackage(Dictionary<Int,Int>.self, CRUDNames(
get: .stdGet,
insert: .stdInsert,
update: .stdUpdate,
remove: .stdRemove))
runCRUDPackage(Map<Int,Int>.self, CRUDNames(
get: .btreeGet,
insert: .btreeInsert,
update: .btreeUpdate,
remove: .btreeRemove))
runCRUDPackage(HAMT<Int,Int>.self, CRUDNames(
get: .pd5Get,
insert: .pd5Insert,
update: .pd5Update,
remove: .pd5Remove))
db.print()