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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
|
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE TypeFamilies #-}
module Main (main) where
import qualified Data.Vector.Storable as V
import qualified Data.Vector.Storable.Mutable as VM
import qualified Data.Vector.Mutable as BV
import Control.Monad.Primitive (PrimMonad(PrimState))
import qualified Data.HashTable.IO as H
import Criterion.Main (bench, bgroup, defaultMain, nfIO)
import Criterion (Benchmark)
import qualified Data.Vector.Hashtables.Internal as VH
vh :: Int -> IO (VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int)
vh n = do
ht <- VH.initialize n :: IO (VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int)
let go !i | i <= n = VH.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
return ht
fvh :: Int -> IO (VH.FrozenDictionary V.Vector Int V.Vector Int)
fvh n = do
h <- vh n
c <- VH.clone h
VH.unsafeFreeze c
bh :: Int -> IO (H.BasicHashTable Int Int)
bh n = do
ht <- H.newSized n :: IO (H.BasicHashTable Int Int)
let go !i | i <= n = H.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
return ht
fl :: Int -> [(Int, Int)]
fl n = mkPair <$> [0 .. n]
where
mkPair !x = (x, x)
vhfind :: Int -> VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int -> IO Int
vhfind n ht = do
let go !i !s | i <= n = do
x <- VH.findEntry ht i
go (i + 1) (s + x)
| otherwise = return s
go 0 0
fvhfind :: Int -> VH.FrozenDictionary V.Vector Int V.Vector Int -> IO Int
fvhfind n ht = return $ go 0 0 where
go !i !s | i <= n = go (i + 1) (s + VH.findElem ht i)
| otherwise = s
bhfind :: Int -> H.BasicHashTable Int Int -> IO Int
bhfind n ht = do
let go !i !s | i <= n = do
Just x <- H.lookup ht i
go (i + 1) (s + x)
| otherwise = return s
go 0 0
htb :: Int -> IO ()
htb n = do
ht <- H.newSized n :: IO (H.BasicHashTable Int Int)
let go !i | i <= n = H.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
vht :: Int -> IO ()
vht n = do
ht <- VH.initialize n :: IO (VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int)
let go !i | i <= n = VH.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
vhtd :: Int -> IO ()
vhtd n = do
ht <- VH.initialize n :: IO (VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int)
let go !i | i <= n = VH.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
let go1 !i | i <= n = VH.delete ht i >> go1 (i + 1)
| otherwise = return ()
go1 0
htbd :: Int -> IO ()
htbd n = do
ht <- H.newSized n :: IO (H.BasicHashTable Int Int)
let go !i | i <= n = H.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
let go1 !i | i <= n = H.delete ht i >> go1 (i + 1)
| otherwise = return ()
go1 0
vhtb :: Int -> IO ()
vhtb n = do
ht <- VH.initialize n :: IO (VH.Dictionary (PrimState IO) BV.MVector Int BV.MVector Int)
let go !i | i <= n = VH.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
vhtk :: Int -> IO ()
vhtk n = do
ht <- VH.initialize n :: IO (VH.Dictionary (PrimState IO) VM.MVector Int BV.MVector Int)
let go !i | i <= n = VH.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
htbg :: Int -> IO ()
htbg n = do
ht <- H.newSized 1 :: IO (H.BasicHashTable Int Int)
let go !i | i <= n = H.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
vhtg :: Int -> IO ()
vhtg n = do
ht <- VH.initialize 1 :: IO (VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int)
let go !i | i <= n = VH.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
vhtbg :: Int -> IO ()
vhtbg n = do
ht <- VH.initialize 1 :: IO (VH.Dictionary (PrimState IO) BV.MVector Int BV.MVector Int)
let go !i | i <= n = VH.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
vhtkg :: Int -> IO ()
vhtkg n = do
ht <- VH.initialize 1 :: IO (VH.Dictionary (PrimState IO) VM.MVector Int BV.MVector Int)
let go !i | i <= n = VH.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
mvb :: Int -> IO ()
mvb n = do
ht <- BV.new (n+1)
let go !i | i <= n = BV.write ht i i >> go (i + 1)
| otherwise = return ()
go 0
mv :: Int -> IO ()
mv n = do
ht <- VM.new (n+1)
let go !i | i <= n = VM.write ht i i >> go (i + 1)
| otherwise = return ()
go 0
bhfromList l = do
_bht <- H.fromList l :: IO (H.BasicHashTable Int Int)
return ()
vhfromList l = do
_ht <- VH.fromList l :: IO (VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int)
return ()
bhlookupIndex :: Int -> H.BasicHashTable Int Int -> IO Int
bhlookupIndex n ht = do
let go !i !s | i <= n = do
Just x <- H.lookupIndex ht i
go (i + 1) (s + fromIntegral x)
| otherwise = return s
go 0 0
vhlookupIndex :: Int -> VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int -> IO Int
vhlookupIndex n ht = do
let go !i !s | i <= n = do
Just x <- VH.lookupIndex ht i
go (i + 1) (s + x)
| otherwise = return s
go 0 0
bhtoList = H.toList
vhtoList = VH.toList
bgc :: Int -> IO Benchmark
bgc n = do
h <- vh n
h2 <- bh n
fh <- fvh n
let l = fl n
return $ bgroup (show n)
[ bgroup "insert"
[ bench "hashtables basic" $ nfIO (htb n)
, bench "vector-hashtables boxed" $ nfIO (vhtb n)
, bench "vector-hashtables unboxed keys" $ nfIO (vhtk n)
, bench "vector-hashtables" $ nfIO (vht n)
, bench "mutable vector boxed" $ nfIO (mvb n)
, bench "mutable vector" $ nfIO (mv n) ]
, bgroup "insert (resize)"
[ bench "hashtables basic" $ nfIO (htbg n)
, bench "vector-hashtables boxed" $ nfIO (vhtbg n)
, bench "vector-hashtables unboxed keys" $ nfIO (vhtkg n)
, bench "vector-hashtables" $ nfIO (vhtg n) ]
, bgroup "insert, delete"
[ bench "hashtables basic" $ nfIO (htbd n)
, bench "vector-hashtables" $ nfIO (vhtd n) ]
, bgroup "find"
[ bench "hashtables basic" $ nfIO (bhfind n h2)
, bench "vector-hashtables" $ nfIO (vhfind n h)
, bench "vector-hashtables (frozen)" $ nfIO (fvhfind n fh) ]
, bgroup "lookupIndex"
[ bench "hashtables basic" $ nfIO (bhlookupIndex n h2)
, bench "vector-hashtables" $ nfIO (vhlookupIndex n h) ]
, bgroup "fromList"
[ bench "hashtables basic" $ nfIO (bhfromList l)
, bench "vector-hashtables" $ nfIO (vhfromList l) ]
, bgroup "toList"
[ bench "hashtables basic" $ nfIO (bhtoList h2)
, bench "vector-hashtables" $ nfIO (vhtoList h) ]]
main :: IO ()
main = do
let inputs = [1000,10000,100000,1000000]
comparisonBench <- mapM bgc inputs
utilitiesBench <- mapM utilities inputs
defaultMain
[ bgroup "Comparison" comparisonBench
, bgroup "Utilities" utilitiesBench ]
-- ** Utilities benchmark
utilities n = do
-- utilities input data
hAt' <- vh n
hInsert <- vh n
hDelete <- vh n
hLookup <- vh n
hLookup' <- vh n
hLookupIndex <- vh n
hNull <- vh n
hLength <- vh n
hSize <- vh n
hMember <- vh n
hFindWithDefault <- vh n
hUpsert <- vh n
hAlter <- vh n
hAlterM <- vh n
hUnion1 <- vh n
hUnion2 <- vh n
hDifference1 <- vh n
hDifference2 <- vh n
hIntersection1 <- vh n
hIntersection2 <- vh n
hFromList <- VH.toList =<< vh n
hToList <- vh n
return $ bgroup (show n)
[ bench "at'" $ nfIO (bhuat' n hAt')
, bench "insert" $ nfIO (bhuinsert n hInsert)
, bench "delete" $ nfIO (bhudelete n hDelete)
, bench "lookup" $ nfIO (bhulookup n hLookup)
, bench "lookup'" $ nfIO (bhulookup' n hLookup')
, bench "lookupIndex" $ nfIO (bhulookupIndex n hLookupIndex)
, bench "null" $ nfIO (bhunull hNull)
, bench "length" $ nfIO (bhulength hLength)
, bench "size" $ nfIO (bhusize hSize)
, bench "member" $ nfIO (bhumember n hMember)
, bench "findWithDefault" $ nfIO (bhufindWithDefault n hFindWithDefault)
, bench "upsert" $ nfIO (bhuupsert n hUpsert)
, bench "alter" $ nfIO (bhualter n hAlter)
, bench "alterM" $ nfIO (bhualterM n hAlterM)
, bench "union" $ nfIO (bhuunion hUnion1 hUnion2)
, bench "difference" $ nfIO (bhudifference hDifference1 hDifference2)
, bench "intersection" $ nfIO (bhuintersection hIntersection1 hIntersection2)
, bench "fromList" $ nfIO (bhufromList hFromList)
, bench "toList" $ nfIO (VH.toList hToList) ]
bhuat' n ht = do
let go !i | i <= n = VH.at' ht i >> go (i + 1)
| otherwise = return ()
go 0
bhuinsert n ht = do
let go !i | i <= n = VH.insert ht i i >> go (i + 1)
| otherwise = return ()
go 0
bhudelete n ht = do
let go !i | i <= n = VH.delete ht i >> go (i + 1)
| otherwise = return ()
go 0
bhulookup n ht = do
let go !i | i <= n = VH.lookup ht i >> go (i + 1)
| otherwise = return ()
go 0
bhulookup' n ht = do
let go !i | i <= n = VH.lookup' ht i >> go (i + 1)
| otherwise = return ()
go 0
bhulookupIndex n ht = do
let go !i | i <= n = VH.lookupIndex ht i >> go (i + 1)
| otherwise = return ()
go 0
bhunull = VH.null
bhulength = VH.length
bhusize = VH.size
bhumember n ht = do
let go !i | i <= n = VH.member ht i >> go (i + 1)
| otherwise = return ()
go 0
bhufindWithDefault n ht = do
let go !i | i <= n = VH.findWithDefault ht 0 i >> go (i + 1)
| otherwise = return ()
go 0
bhuupsert n ht = do
let go !i | i <= n = VH.upsert ht (maybe minBound succ) i >> go (i + 1)
| otherwise = return ()
go 0
bhualter n ht = do
let go !i | i <= n = VH.alter ht (fmap succ) i >> go (i + 1)
| otherwise = return ()
go 0
bhualterM :: Int -> VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int -> IO ()
bhualterM n ht = do
let f = return . fmap succ
go !i | i <= n = VH.alterM ht f i >> go (i + 1)
| otherwise = return ()
go 0
bhuunion ht1 ht2 = VH.union ht1 ht2 >> return ()
bhudifference ht1 ht2 = VH.difference ht1 ht2 >> return ()
bhuintersection ht1 ht2 = VH.intersection ht1 ht2 >> return ()
bhufromList htlist = do
ht <- VH.fromList htlist :: IO (VH.Dictionary (PrimState IO) VM.MVector Int VM.MVector Int)
return ()
bhutoList ht = VH.toList ht >> return ()
|
