refactor!: ♻️ rename Query API to the RangeSearch API

I have renamed the `Query` API to the `RangeSearch` API. I made this change to make the APIs of my K-D Tree library consistent with those of existing ones written in Go.

BREAKING CHANGE: This commit renames the `Query` API to the `RangeSearch` API. Any code that uses the `Query` API will no longer work with future releases of this library created after this commit. Affected codebases must migrate to the `RangeSearch` API to be compatible with future releases of this library.

Author: rishitc

kdtree.go

@@ -99,9 +99,9 @@ func (t *KDTree[T]) NearestNeighbor(value T) (T, bool) {
 	return *res, true
 }
 
-func (t *KDTree[T]) Query(getRelativePosition RangeFunc[T]) []T {
+func (t *KDTree[T]) RangeSearch(getRelativePosition RangeFunc[T]) []T {
 	var res []T
-	query(getRelativePosition, t.dimensions, &res, t.root, 0)
+	rangeSearch(getRelativePosition, t.dimensions, &res, t.root, 0)
 	return res
 }
 
@@ -222,7 +222,7 @@ func (t *KDTree[T]) Balance() {
 	t.root = NewKDTreeWithValues(t.dimensions, t.Values()).root
 }
 
-func query[T Comparable[T]](getRelativePosition RangeFunc[T], d int, res *[]T, r *kdNode[T], cd int) {
+func rangeSearch[T Comparable[T]](getRelativePosition RangeFunc[T], d int, res *[]T, r *kdNode[T], cd int) {
 	if r == nil {
 		return
 	}
@@ -235,12 +235,12 @@ func query[T Comparable[T]](getRelativePosition RangeFunc[T], d int, res *[]T, r
 	ncd := (cd + 1) % d
 	switch relInCD := getRelativePosition(r.value, cd); relInCD {
 	case BeforeRange:
-		query(getRelativePosition, d, res, r.right, ncd)
+		rangeSearch(getRelativePosition, d, res, r.right, ncd)
 	case AfterRange:
-		query(getRelativePosition, d, res, r.left, ncd)
+		rangeSearch(getRelativePosition, d, res, r.left, ncd)
 	case InRange:
-		query(getRelativePosition, d, res, r.left, ncd)
-		query(getRelativePosition, d, res, r.right, ncd)
+		rangeSearch(getRelativePosition, d, res, r.left, ncd)
+		rangeSearch(getRelativePosition, d, res, r.right, ncd)
 	default:
 		panic(fmt.Sprintf("Invalid value returned: %v", relInCD))
 	}

tests/kdtree_2d_test.go

@@ -438,7 +438,7 @@ func Test2DFindMax2(t *testing.T) {
 	}
 }
 
-func Test2DTree_Query(t *testing.T) {
+func Test2DTree_RangeSearch(t *testing.T) {
 	const dimensions = 2
 	inputTensor2D := []types.Tensor2D{{1, 0}, {1, 8}, {2, 2}, {2, 10}, {3, 4}, {4, 1}, {5, 4}, {6, 8}, {7, 4}, {7, 7}, {8, 2}, {8, 5}, {9, 9}, {3, 6}, {4, 2}, {9, 2}, {6, 5}, {3, 8}, {6, 2}, {1, 3}, {3, 3}, {6, 4}, {9, 8}, {2, 1}, {2, 8}, {3, 1}, {7, 3}, {3, 9}, {4, 4}, {5, 3}, {9, 6}}
 	tests := []struct {
@@ -605,7 +605,7 @@ func Test2DTree_Query(t *testing.T) {
 	}
 	for _, test := range tests {
 		t.Run(test.name, func(t *testing.T) {
-			assert.Equal(t, test.expected, test.tree.Query(test.input))
+			assert.Equal(t, test.expected, test.tree.RangeSearch(test.input))
 		})
 	}
 }