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
|
package set
import (
"fmt"
"testing"
"github.com/snonux/algorithms/ds"
)
const factor int = 10
const minLength int = 1
const maxLength int = 10000
// Store results here to avoid compiler optimizations
var benchResult int
func TestElementary(t *testing.T) {
s := NewElementary()
for i := minLength; i <= maxLength; i *= factor {
test(s, i, t)
}
}
func TestBST(t *testing.T) {
s := NewBST()
for i := minLength; i <= maxLength; i *= factor {
test(s, i, t)
}
}
func test(s Set, l int, t *testing.T) {
cb := func(t *testing.T) {
list := ds.NewRandomArrayList(l, -1)
for i, a := range list {
t.Log("Inserting", a, i, s)
s.Set(a, i)
}
for i, a := range list {
val, err := s.Get(a)
if err != nil {
t.Errorf("Element %v: %v", val, err)
}
if val != i {
t.Errorf("Element is %v but expected %v", val, i)
}
}
}
t.Run(fmt.Sprintf("%d", l), cb)
}
func BenchmarkElementary(t *testing.B) {
s := NewElementary()
for i := minLength; i <= maxLength; i *= factor {
benchmark(s, i, t)
}
}
func BenchmarkBST(t *testing.B) {
s := NewBST()
for i := minLength; i <= maxLength; i *= factor {
benchmark(s, i, t)
}
}
func benchmark(s Set, l int, b *testing.B) {
list := ds.NewRandomArrayList(l, -1)
b.Run(fmt.Sprintf("random(%d)", l), func(b *testing.B) {
b.ResetTimer()
for i, a := range list {
s.Set(a, i)
}
for _, a := range list {
benchResult, _ = s.Get(a)
}
})
}
|
