/
btree_benchmark_test.go
110 lines (95 loc) · 1.94 KB
/
btree_benchmark_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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
package btree_test
import (
"github.com/droxer/btree"
"math/rand"
"testing"
"time"
)
func init() {
seed := time.Now().Unix()
rand.Seed(seed)
}
func perm(n int) (out []item) {
for _, v := range rand.Perm(n) {
out = append(out, item(v))
}
return
}
func BenchmarkInsert1000(b *testing.B) {
benchmarkInsert(1000, b)
}
func BenchmarkInsert10000(b *testing.B) {
benchmarkInsert(10000, b)
}
func BenchmarkInsert100000(b *testing.B) {
benchmarkInsert(100000, b)
}
func BenchmarkGet1000(b *testing.B) {
benchmarkGet(1000, b)
}
func BenchmarkGet10000(b *testing.B) {
benchmarkGet(10000, b)
}
func BenchmarkGet100000(b *testing.B) {
benchmarkGet(100000, b)
}
func benchmarkInsert(size int, b *testing.B) {
b.StopTimer()
values := perm(size)
b.StartTimer()
i := 0
for i < b.N {
tr := btree.New(3)
for _, item := range values {
tr.Insert(item)
i++
if i >= b.N {
return
}
}
}
}
func benchmarkDelete(size int, b *testing.B) {
b.StopTimer()
insert := perm(size)
remove := perm(size)
b.StartTimer()
i := 0
for i < b.N {
b.StopTimer()
tr := btree.New(3)
for _, v := range insert {
tr.Insert(v)
}
b.StartTimer()
for _, v := range remove {
tr.Delete(v)
i++
if i >= b.N {
return
}
}
}
}
func benchmarkGet(size int, b *testing.B) {
b.StopTimer()
insert := perm(size)
remove := perm(size)
b.StartTimer()
i := 0
for i < b.N {
b.StopTimer()
tr := btree.New(3)
for _, v := range insert {
tr.Insert(v)
}
b.StartTimer()
for _, item := range remove {
tr.Get(item)
i++
if i >= b.N {
return
}
}
}
}