/
tree_test.go
105 lines (85 loc) · 1.7 KB
/
tree_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
package binarytree_test
import (
"github.com/droxer/binarytree"
"math/rand"
"testing"
"time"
)
func init() {
seed := time.Now().Unix()
rand.Seed(seed)
}
func perm(n int) (out []int) {
for _, v := range rand.Perm(n) {
out = append(out, v)
}
return
}
func TestInsertAndSearch(t *testing.T) {
bt := binarytree.New()
bt.Insert(10)
bt.Insert(7)
bt.Insert(1)
bt.Insert(13)
bt.Insert(16)
if !bt.Get(7) {
t.Fatalf("should found 10")
}
if bt.Get(11) {
t.Fatalf("should not found 11")
}
}
func BenchmarkInsert10000(b *testing.B) {
benchmarkInsert(10000, b)
}
func BenchmarkInsert1000(b *testing.B) {
benchmarkInsert(1000, b)
}
func BenchmarkGet10000(b *testing.B) {
benchmarkGet(10000, b)
}
func BenchmarkGet1000(b *testing.B) {
benchmarkGet(1000, b)
}
func benchmarkInsert(size int, b *testing.B) {
b.StopTimer()
values := perm(size)
b.StartTimer()
i := 0
for i < b.N {
bt := binarytree.New()
for _, v := range values {
bt.Insert(v)
i++
if i >= b.N {
return
}
}
}
}
func benchmarkGet(size int, b *testing.B) {
b.StopTimer()
insert := perm(size)
get := perm(size)
b.StartTimer()
i := 0
for i < b.N {
b.StopTimer()
bt := binarytree.New()
for _, v := range insert {
bt.Insert(v)
i++
if i >= b.N {
return
}
}
b.StartTimer()
for _, v := range get {
bt.Get(v)
i++
if i >= b.N {
return
}
}
}
}