From 5f85a59d4be37d350bcf1ee62c25ac1f84d71770 Mon Sep 17 00:00:00 2001
From: Tavian Barnes <tavianator@tavianator.com>
Date: Mon, 6 Jul 2020 22:24:02 -0400
Subject: kd: Use a more traditional k-d tree implementation

The slight extra pruning possible in the previous implementation didn't
seem to be worth it.  The new, simpler implementation is also about 30%
faster in most of the benchmarks.

This gets rid of Coordinate{Proximity,Metric} as they're not necessary
any more (and the old ExactNeighbors impl was too restrictive anyway).
---
 src/exhaustive.rs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'src/exhaustive.rs')

diff --git a/src/exhaustive.rs b/src/exhaustive.rs
index 221641c..37af4c6 100644
--- a/src/exhaustive.rs
+++ b/src/exhaustive.rs
@@ -80,10 +80,10 @@ impl<K: Proximity<V>, V> ExactNeighbors<K, V> for ExhaustiveSearch<V> {}
 pub mod tests {
     use super::*;
 
-    use crate::tests::test_nearest_neighbors;
+    use crate::tests::test_exact_neighbors;
 
     #[test]
     fn test_exhaustive_index() {
-        test_nearest_neighbors(ExhaustiveSearch::from_iter);
+        test_exact_neighbors(ExhaustiveSearch::from_iter);
     }
 }
-- 
cgit v1.2.3