Merge pull request #86 from Abirdcfly/main

fix minor unreachable code
spatial-go · Sep 20, 2023 · d5fc326 · d5fc326 · pipipizhuqaq · Sep 20, 2023
2 parents 8a7e867 + 6c97362
commit d5fc326
Show file tree

Hide file tree

Showing 5 changed files with 6 additions and 6 deletions.
diff --git a/algorithm/overlay/sweepline/sweep_line_index_test.go b/algorithm/overlay/sweepline/sweep_line_index_test.go
@@ -1,4 +1,4 @@
-//Package sweepline Contains struct which implement a sweepline algorithm for scanning geometric data structures.
+// Package sweepline Contains struct which implement a sweepline algorithm for scanning geometric data structures.
 package sweepline
 
 import (
@@ -16,8 +16,8 @@ func TestMain(m *testing.M) {
 	fmt.Println("test start")
 	buildTree()
 	code := m.Run()
-	os.Exit(code)
 	fmt.Println("test end")
+	os.Exit(code)
 }
 func buildTree() *Index {
 	var ms matrix.LineMatrix = matrix.LineMatrix{{1, 1}, {1.5, 1}, {2, 1}, {2, 2}, {2, 3}, {3, 3}}

diff --git a/index/hprtree/hpr_tree_test.go b/index/hprtree/hpr_tree_test.go
@@ -18,8 +18,8 @@ func TestMain(m *testing.M) {
 	fmt.Println("test start")
 	buildTree()
 	code := m.Run()
-	os.Exit(code)
 	fmt.Println("test end")
+	os.Exit(code)
 }
 func buildTree() *HPRTree {
 	indexTree = NewHPRTree()

diff --git a/index/intervalrtree/sorted_packed_interval_rtree_test.go b/index/intervalrtree/sorted_packed_interval_rtree_test.go
@@ -19,8 +19,8 @@ func TestMain(m *testing.M) {
 	fmt.Println("test start")
 	buildTree()
 	code := m.Run()
-	os.Exit(code)
 	fmt.Println("test end")
+	os.Exit(code)
 }
 func buildTree() *SortedPackedIntervalRTree {
 	indexTree = &SortedPackedIntervalRTree{}

diff --git a/index/kdtree/kd_tree_test.go b/index/kdtree/kd_tree_test.go
@@ -151,8 +151,8 @@ func TestMain(m *testing.M) {
 	fmt.Println("test start")
 	buildTree()
 	code := m.Run()
-	os.Exit(code)
 	fmt.Println("test end")
+	os.Exit(code)
 }
 
 func buildTree() *KdTree {

diff --git a/index/quadtree/quadtree_test.go b/index/quadtree/quadtree_test.go
@@ -22,8 +22,8 @@ func TestMain(m *testing.M) {
 	}
 	fmt.Println("test start")
 	code := m.Run()
-	os.Exit(code)
 	fmt.Println("test end")
+	os.Exit(code)
 }
 func TestQuadtree_Insert(t *testing.T) {
 	line := matrix.LineMatrix{{5, 5}, {10, 8}}