diff options
| author | Tavian Barnes <tavianator@tavianator.com> | 2020-07-06 22:24:02 -0400 |
|---|---|---|
| committer | Tavian Barnes <tavianator@tavianator.com> | 2020-07-06 22:33:10 -0400 |
| commit | 5f85a59d4be37d350bcf1ee62c25ac1f84d71770 (patch) | |
| tree | 8fc7ea8e59226c5e677d7b9aef39b0b2be5f28b7 /src/exhaustive.rs | |
| parent | ed4d7b7143f1a8a9602698ca3e60e18bbb4dd226 (diff) | |
| download | acap-5f85a59d4be37d350bcf1ee62c25ac1f84d71770.tar.xz | |
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).
Diffstat (limited to 'src/exhaustive.rs')
| -rw-r--r-- | src/exhaustive.rs | 4 |
1 files changed, 2 insertions, 2 deletions
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); } } |