Skip to content

Commit 7c1b9d5

Browse files
committed
refactory NewBkdTree parameters
1 parent 3f4f9ca commit 7c1b9d5

File tree

3 files changed

+12
-13
lines changed

3 files changed

+12
-13
lines changed

bench_test.go

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -6,13 +6,13 @@ import (
66

77
func BenchmarkBkdInsert(b *testing.B) {
88
t0mCap := 1000
9-
numDims := 2
10-
bytesPerDim := 4
119
leafCap := 50
1210
intraCap := 4
11+
numDims := 2
12+
bytesPerDim := 4
1313
dir := "/tmp"
1414
prefix := "bkd"
15-
bkd, err := NewBkdTree(t0mCap, numDims, bytesPerDim, leafCap, intraCap, dir, prefix)
15+
bkd, err := NewBkdTree(t0mCap, leafCap, intraCap, numDims, bytesPerDim, dir, prefix)
1616
if err != nil {
1717
b.Fatalf("%+v", err)
1818
}

bkdtree.go

Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -139,10 +139,9 @@ func (n *KdTreeExtIntraNode) Write(w io.Writer) (err error) {
139139
}
140140

141141
//NewBkdTree creates a BKDTree. This is used for construct a BkdTree from scratch. Existing files, if any, will be removed.
142-
func NewBkdTree(t0mCap, numDims, bytesPerDim, leafCap, intraCap int, dir, prefix string) (bkd *BkdTree, err error) {
143-
if t0mCap <= 0 || numDims <= 0 ||
144-
(bytesPerDim != 1 && bytesPerDim != 2 && bytesPerDim != 4 && bytesPerDim != 8) ||
145-
leafCap <= 0 || leafCap >= int(^uint16(0)) || intraCap <= 2 || intraCap >= int(^uint16(0)) {
142+
func NewBkdTree(t0mCap, leafCap, intraCap, numDims, bytesPerDim int, dir, prefix string) (bkd *BkdTree, err error) {
143+
if t0mCap <= 0 || leafCap <= 0 || leafCap >= int(^uint16(0)) || intraCap <= 2 ||
144+
numDims <= 0 || (bytesPerDim != 1 && bytesPerDim != 2 && bytesPerDim != 4 && bytesPerDim != 8) {
146145
err = errors.Errorf("invalid parameter")
147146
return
148147
}

bkdtree_test.go

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -66,13 +66,13 @@ func TestBkdInsert(t *testing.T) {
6666
t0mCap := 1000
6767
treesCap := 5
6868
bkdCap := t0mCap<<uint(treesCap) - 1
69-
numDims := 2
70-
bytesPerDim := 4
7169
leafCap := 50
7270
intraCap := 4
71+
numDims := 2
72+
bytesPerDim := 4
7373
dir := "/tmp"
7474
prefix := "bkd"
75-
bkd, err := NewBkdTree(t0mCap, numDims, bytesPerDim, leafCap, intraCap, dir, prefix)
75+
bkd, err := NewBkdTree(t0mCap, leafCap, intraCap, numDims, bytesPerDim, dir, prefix)
7676
if err != nil {
7777
t.Fatalf("%+v", err)
7878
}
@@ -110,13 +110,13 @@ func prepareBkdTree(maxVal uint64) (bkd *BkdTree, points []Point, err error) {
110110
t0mCap := 1000
111111
treesCap := 5
112112
bkdCap := t0mCap<<uint(treesCap) - 1
113-
numDims := 2
114-
bytesPerDim := 4
115113
leafCap := 50
116114
intraCap := 4
115+
numDims := 2
116+
bytesPerDim := 4
117117
dir := "/tmp"
118118
prefix := "bkd"
119-
bkd, err = NewBkdTree(t0mCap, numDims, bytesPerDim, leafCap, intraCap, dir, prefix)
119+
bkd, err = NewBkdTree(t0mCap, leafCap, intraCap, numDims, bytesPerDim, dir, prefix)
120120
if err != nil {
121121
return
122122
}

0 commit comments

Comments
 (0)