-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbenchmark_test.go
130 lines (115 loc) · 4.31 KB
/
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
package kdbush_test
import (
"fmt"
"math/rand"
"testing"
"github.com/raditzlawliet/kdbush"
)
// Benchmark BuildIndex func
func BenchmarkBuildIndex(b *testing.B) {
var rng = rand.New(rand.NewSource(1))
var points = []struct {
Points []kdbush.Point
Total int
NodeSize int
}{
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 1000},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 10_000},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 100_000},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 1_000_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 1000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 10_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 100_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 1_000_000},
}
// Setup
for num := range points {
for i := 0; i < points[num].Total; i++ {
points[num].Points = append(points[num].Points, &kdbush.SimplePoint{rng.Float64()*24.0 + 24.0, rng.Float64()*24.0 + 24.0})
}
}
for _, v := range points {
b.Run(fmt.Sprintf("nodeSize_%d_total_%d", v.NodeSize, v.Total), func(b *testing.B) {
for i := 0; i < b.N; i++ {
kdbush.NewBush().
BuildIndex(v.Points, v.NodeSize)
}
})
}
}
// Benchmark Range func
func BenchmarkRange(b *testing.B) {
var rng = rand.New(rand.NewSource(1))
var points = []struct {
Points []kdbush.Point
Total int
KDBush *kdbush.KDBush
NodeSize int
}{
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 10},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 100},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 1_000},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 10_000},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 100_000},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 1_000_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 10},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 100},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 1_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 10_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 100_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 1_000_000},
}
// Setup
for num := range points {
for i := 0; i < points[num].Total; i++ {
points[num].Points = append(points[num].Points, &kdbush.SimplePoint{rng.Float64()*24.0 + 24.0, rng.Float64()*24.0 + 24.0})
}
points[num].KDBush = kdbush.NewBush().
BuildIndex(points[num].Points, points[num].NodeSize)
}
for _, v := range points {
b.Run(fmt.Sprintf("nodeSize_%d_total_%d", v.NodeSize, v.Total), func(b *testing.B) {
for i := 0; i < b.N; i++ {
v.KDBush.Range(10.0, 10, -10, -10)
}
})
}
}
// Benchmark Within func
func BenchmarkWithin(b *testing.B) {
var rng = rand.New(rand.NewSource(1))
var points = []struct {
Points []kdbush.Point
Total int
KDBush *kdbush.KDBush
NodeSize int
}{
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 10},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 100},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 1_000},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 10_000},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 100_000},
{Points: []kdbush.Point{}, NodeSize: kdbush.STANDARD_NODE_SIZE, Total: 1_000_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 10},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 100},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 1_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 10_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 100_000},
{Points: []kdbush.Point{}, NodeSize: 8, Total: 1_000_000},
}
// Setup
for num := range points {
for i := 0; i < points[num].Total; i++ {
points[num].Points = append(points[num].Points, &kdbush.SimplePoint{rng.Float64()*24.0 + 24.0, rng.Float64()*24.0 + 24.0})
}
points[num].KDBush = kdbush.NewBush().
BuildIndex(points[num].Points, points[num].NodeSize)
}
for _, v := range points {
b.Run(fmt.Sprintf("nodeSize_%d_total_%d", v.NodeSize, v.Total), func(b *testing.B) {
for i := 0; i < b.N; i++ {
v.KDBush.Within(10, 10, 10)
}
})
}
}