-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhash_bm_test.go
90 lines (82 loc) · 1.73 KB
/
hash_bm_test.go
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
package hashmap
import "testing"
var benckmarkEntries = []entry{
{key: 1, obj: "a"},
{key: 11, obj: "aa"},
{key: 111, obj: "aaa"},
{key: 1111, obj: "aaaa"},
{key: 11111, obj: "aaaaa"},
{key: 111111, obj: "aaaaaa"},
{key: 1111111, obj: "aaaaaaa"},
{key: 111111111, obj: "aaaaaaaa"},
{key: 1111111111, obj: "aaaaaaaaaa"},
{key: 2, obj: "ab"},
{key: 22, obj: "abb"},
{key: 222, obj: "abbb"},
{key: 2222, obj: "abbbb"},
{key: 22222, obj: "abbbbb"},
{key: 2222222, obj: "abbbbbb"},
{key: 222222222, obj: "abbbbbbbbb"},
}
func benchmarkHashMap(b *testing.B) *HashMap {
hm := New()
for _, e := range benckmarkEntries {
if err := hm.Put(e.key, e.obj); err != nil {
b.Error(err)
}
}
return hm
}
func BenchmarkPut(b *testing.B) {
for n := 0; n < b.N; n++ {
k := 1
hm := New()
for i := 0; i < tableSize; i++ {
if err := hm.Put(k, "yep"); err != nil {
b.Error(err)
}
k *= 3
}
}
}
func BenchmarkGet(b *testing.B) {
hm := benchmarkHashMap(b)
for n := 0; n < b.N; n++ {
for _, e := range benckmarkEntries {
if v, err := hm.Get(e.key); err == nil {
if v != e.obj {
b.Errorf("BenchmarkGet = %v, want %v", v, e.obj)
}
} else {
b.Error(err)
}
}
}
}
func BenchmarkBasePut(b *testing.B) {
for n := 0; n < b.N; n++ {
k := 1
hm := map[int]string{}
for i := 0; i < tableSize; i++ {
hm[k] = "yep"
k *= 3
}
}
}
func BenchmarkBaseGet(b *testing.B) {
hm := map[int]string{}
for _, e := range benckmarkEntries {
hm[e.key] = e.obj.(string)
}
for n := 0; n < b.N; n++ {
for _, e := range benckmarkEntries {
if v, ok := hm[e.key]; ok {
if v != e.obj {
b.Errorf("BenchmarkGet = %v, want %v", v, e.obj)
}
} else {
b.Errorf("not present: %d", e.key)
}
}
}
}