diff options
| -rw-r--r-- | kd-forest.c | 8 | ||||
| -rw-r--r-- | kd-forest.h | 2 |
2 files changed, 5 insertions, 5 deletions
diff --git a/kd-forest.c b/kd-forest.c index f1e8f0b..be1b574 100644 --- a/kd-forest.c +++ b/kd-forest.c @@ -137,7 +137,7 @@ kd_build_tree(kd_node_t **buffers[KD_BUFSIZE], size_t size) } static double -kd_distance_sq(kd_node_t *a, kd_node_t *b) +kd_distance_sq(const kd_node_t *a, const kd_node_t *b) { double result = 0.0; for (int i = 0; i < KD_DIMEN; ++i) { @@ -148,7 +148,7 @@ kd_distance_sq(kd_node_t *a, kd_node_t *b) } static void -kd_find_nearest_recursive(kd_node_t *root, kd_node_t *target, kd_node_t **best, double *limit, unsigned int coord) +kd_find_nearest_recursive(kd_node_t *root, const kd_node_t *target, kd_node_t **best, double *limit, unsigned int coord) { double dist = target->coords[coord] - root->coords[coord]; double dist_sq = dist*dist; @@ -172,7 +172,7 @@ kd_find_nearest_recursive(kd_node_t *root, kd_node_t *target, kd_node_t **best, } static void -kd_find_nearest(kd_node_t *root, kd_node_t *target, kd_node_t **best, double *limit) +kd_find_nearest(kd_node_t *root, const kd_node_t *target, kd_node_t **best, double *limit) { kd_find_nearest_recursive(root, target, best, limit, 0); } @@ -275,7 +275,7 @@ kdf_remove(kd_forest_t *kdf, kd_node_t *node) } kd_node_t * -kdf_find_nearest(kd_forest_t *kdf, kd_node_t *target) +kdf_find_nearest(kd_forest_t *kdf, const kd_node_t *target) { double limit = INFINITY; kd_node_t *best = NULL; diff --git a/kd-forest.h b/kd-forest.h index 75d8666..4cf5750 100644 --- a/kd-forest.h +++ b/kd-forest.h @@ -51,6 +51,6 @@ void kdf_init(kd_forest_t *kdf); void kdf_destroy(kd_forest_t *kdf); void kdf_insert(kd_forest_t *kdf, kd_node_t *node); void kdf_remove(kd_forest_t *kdf, kd_node_t *node); -kd_node_t *kdf_find_nearest(kd_forest_t *kdf, kd_node_t *target); +kd_node_t *kdf_find_nearest(kd_forest_t *kdf, const kd_node_t *target); #endif // KD_FOREST_H |