/
tree_benchmark_test.go
68 lines (55 loc) · 1.05 KB
/
tree_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
package bptree
import (
"fmt"
"testing"
)
func BenchmarkInsert(b *testing.B) {
t := NewTree()
// insert b.N times
for n := 0; n < b.N; n++ {
key := n
value := []byte(fmt.Sprintf("test%d", n))
err := t.Insert(key, value)
if err != nil {
fmt.Printf("error: %s\n\n", err)
}
}
}
func BenchmarkInsertFind(b *testing.B) {
t := NewTree()
// insert b.N times
for n := 0; n < b.N; n++ {
key := n
value := []byte(fmt.Sprintf("test%d", n))
err := t.Insert(key, value)
if err != nil {
fmt.Printf("error: %s\n\n", err)
}
}
// find one by one
for n := 0; n < b.N; n++ {
_, err = t.Find(n, false)
if err != nil {
fmt.Printf("error: %s\n\n", err)
}
}
}
func BenchmarkInsertDelete(b *testing.B) {
t := NewTree()
// insert b.N times
for n := 0; n < b.N; n++ {
key := n
value := []byte(fmt.Sprintf("test%d", n))
err := t.Insert(key, value)
if err != nil {
fmt.Printf("error: %s\n\n", err)
}
}
// delete them
for n := 0; n < b.N; n++ {
err = t.Delete(n)
if err != nil {
fmt.Printf("error: %s\n\n", err)
}
}
}