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).

1 files changed, 4 insertions, 4 deletions

diff --git a/src/vp.rs b/src/vp.rs
index 85d3972..c44b323 100644
--- a/src/vp.rs
+++ b/src/vp.rs
@@ -532,16 +532,16 @@ where
 mod tests {
     use super::*;
 
-    use crate::tests::test_nearest_neighbors;
+    use crate::tests::test_exact_neighbors;
 
     #[test]
     fn test_vp_tree() {
-        test_nearest_neighbors(VpTree::from_iter);
+        test_exact_neighbors(VpTree::from_iter);
     }
 
     #[test]
     fn test_unbalanced_vp_tree() {
-        test_nearest_neighbors(|points| {
+        test_exact_neighbors(|points| {
             let mut tree = VpTree::new();
             for point in points {
                 tree.push(point);
@@ -552,6 +552,6 @@ mod tests {
 
     #[test]
     fn test_flat_vp_tree() {
-        test_nearest_neighbors(FlatVpTree::from_iter);
+        test_exact_neighbors(FlatVpTree::from_iter);
     }
 }