Allow 1D RTrees

rstar/CHANGELOG.md

@@ -4,6 +4,7 @@
 - Switched to unstable sort for envelopes and node reinsertion ([PR](https://github.com/georust/rstar/pull/160))
 - Use a more tame value for `AABB::new_empty` to avoid overflow panics applying selections on empty trees ([PR](https://github.com/georust/rstar/pull/162))
 - Avoid infinite recursion due to numerical instability when computing the number of clusters ([PR](https://github.com/georust/rstar/pull/166))
+- Allow 1D `RTree`s to be created ([PR](https://github.com/georust/rstar/pull/169))
 
 # 0.12.0
 

rstar/src/params.rs

@@ -1,5 +1,5 @@
 use crate::algorithm::rstar::RStarInsertionStrategy;
-use crate::{Envelope, Point, RTree, RTreeObject};
+use crate::{RTree, RTreeObject};
 
 /// Defines static parameters for an r-tree.
 ///
@@ -107,10 +107,4 @@ pub fn verify_parameters<T: RTreeObject, P: RTreeParams>() {
         "REINSERTION_COUNT too large. Must be smaller than {:?}",
         max_reinsertion_count
     );
-
-    let dimension = <T::Envelope as Envelope>::Point::DIMENSIONS;
-    assert!(
-        dimension > 1,
-        "Point dimension too small - must be at least 2"
-    );
 }

rstar/src/point.rs

@@ -409,7 +409,7 @@ mod tests {
 
     macro_rules! test_tuple_configuration {
         ($($index:expr),*) => {
-            let a = ($($index),*);
+            let a = ($($index),*,);
             $(assert_eq!(a.nth($index), $index));*
         }
     }
@@ -425,6 +425,7 @@ mod tests {
         assert_eq!(long_int.nth(8), 8);
 
         // Generate the code to test every nth function for every Tuple length
+        test_tuple_configuration!(0);
         test_tuple_configuration!(0, 1);
         test_tuple_configuration!(0, 1, 2);
         test_tuple_configuration!(0, 1, 2, 3);