refactor: rename captree to capt

Author: claytonwramsey

Cargo.toml

@@ -1,3 +1,3 @@
 [workspace]
-members = ["captree", "bench", "morton_filter"]
+members = ["capt", "bench", "morton_filter"]
 resolver = "2"

bench/Cargo.toml

@@ -6,8 +6,8 @@ publish = false
 # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
 
 [dependencies]
-captree = { version = "0.1.0", path = "../captree", features = ["simd"] }
-morton_filter = { version = "0.1.0", path = "../morton_filter" }
+capt = { path = "../capt", features = ["simd"] }
+morton_filter = { path = "../morton_filter" }
 kiddo = { version = "5.2.2", features = ["simd"], default-features = false }
 rand = { version = "0.9.1", default-features = false }
 rand_chacha = { version = "0.9.0", default-features = false }

bench/src/bin/correctness.rs

@@ -3,7 +3,7 @@
 use std::simd::Simd;
 
 use bench::{dist, kdt::PkdTree, parse_pointcloud_csv, parse_trace_csv, trace_r_range};
-use captree::Capt;
+use capt::Capt;
 use kiddo::SquaredEuclidean;
 use rand::{seq::SliceRandom, Rng, SeedableRng};
 

bench/src/bin/perf_plots.rs

@@ -9,7 +9,7 @@ use bench::{
     forest::PkdForest, fuzz_pointcloud, kdt::PkdTree, parse_pointcloud_csv, parse_trace_csv,
     simd_trace_new, stopwatch, SimdTrace, Trace,
 };
-use captree::Capt;
+use capt::Capt;
 #[allow(unused_imports)]
 use kiddo::SquaredEuclidean;
 use morton_filter::morton_filter;

bench/src/kdt.rs

@@ -3,7 +3,7 @@ use std::{
     simd::{num::SimdInt, Simd, SupportedLaneCount},
 };
 
-use captree::{Aabb, Axis, AxisSimd};
+use capt::{Aabb, Axis, AxisSimd};
 
 use std::simd::{
     cmp::{SimdPartialEq, SimdPartialOrd},

bench/src/lib.rs

@@ -8,7 +8,7 @@ use std::{
     time::{Duration, Instant},
 };
 
-use captree::Axis;
+use capt::Axis;
 use rand::{Rng, SeedableRng};
 use rand_chacha::ChaCha20Rng;
 

captree/Cargo.toml capt/Cargo.tomlcaptree/Cargo.toml renamed to capt/Cargo.toml

@@ -1,9 +1,9 @@
 [package]
-name = "captree"
+name = "capt"
 version = "0.1.0"
 edition = "2021"
 description = "SIMD-accelerated nearest-neighbors for point cloud collision checking"
-repository = "https://github.com/KavrakiLab/captree-rs"
+repository = "https://github.com/KavrakiLab/capt"
 license = "PolyForm-Noncommercial-1.0.0"
 readme = "../README.md"
 keywords = [

captree/src/lib.rs capt/src/lib.rscaptree/src/lib.rs renamed to capt/src/lib.rs

@@ -31,7 +31,7 @@
 //! maximum radius used for querying.
 //!
 //! ```rust
-//! use captree::Capt;
+//! use capt::Capt;
 //!
 //! // list of points in cloud
 //! let points = [[0.0, 1.1], [0.2, 3.1]];
@@ -46,7 +46,7 @@
 //! the radius range.
 //!
 //! ```rust
-//! # use captree::Capt;
+//! # use capt::Capt;
 //! # let points = [[0.0, 1.1], [0.2, 3.1]];
 //! # let capt = Capt::<2>::new(&points, (0.05, 2.0));
 //! let center = [0.0, 0.0]; // center of sphere
@@ -143,15 +143,15 @@ use elain::{Align, Alignment};
 /// #    }
 /// }
 ///
-/// impl captree::Axis for HyperInt {
+/// impl capt::Axis for HyperInt {
 ///     const ZERO: Self = Self::Real(0);
 ///     const INFINITY: Self = Self::PlusInf;
 ///     const NEG_INFINITY: Self = Self::MinusInf;
-///     
+///
 ///     fn is_finite(self) -> bool {
 ///         matches!(self, Self::Real(_))
 ///     }
-///     
+///
 ///     fn in_between(self, rhs: Self) -> Self {
 ///         match (self, rhs) {
 ///             (Self::PlusInf, Self::MinusInf) | (Self::MinusInf, Self::PlusInf) => Self::Real(0),
@@ -363,7 +363,7 @@ where
 /// let points = [[0.0, 0.1], [0.4, -0.2], [-0.2, -0.1]];
 ///
 /// // query radii must be between 0.0 and 0.2
-/// let t = captree::Capt::<2>::new(&points, (0.0, 0.2));
+/// let t = capt::Capt::<2>::new(&points, (0.0, 0.2));
 ///
 /// assert!(!t.collides(&[0.0, 0.3], 0.1));
 /// assert!(t.collides(&[0.0, 0.2], 0.15));
@@ -437,7 +437,7 @@ where
     /// ```
     /// let points = [[0.0]];
     ///
-    /// let capt = captree::Capt::<1>::new(&points, (0.0, f32::INFINITY));
+    /// let capt = capt::Capt::<1>::new(&points, (0.0, f32::INFINITY));
     ///
     /// assert!(capt.collides(&[1.0], 1.5));
     /// assert!(!capt.collides(&[1.0], 0.5));
@@ -449,7 +449,7 @@ where
     /// let points = [[0.0]; 256];
     ///
     /// // note that we are using `u8` as our index type
-    /// let capt = captree::Capt::<1, 8, f32, u8>::new(&points, (0.0, f32::INFINITY));
+    /// let capt = capt::Capt::<1, 8, f32, u8>::new(&points, (0.0, f32::INFINITY));
     /// ```
     pub fn new(points: &[[A; K]], r_range: (A, A)) -> Self {
         Self::try_new(points, r_range)
@@ -475,7 +475,7 @@ where
     /// ```
     /// let points = [[0.0]];
     ///
-    /// let capt = captree::Capt::<1>::try_new(&points, (0.0, f32::INFINITY)).unwrap();
+    /// let capt = capt::Capt::<1>::try_new(&points, (0.0, f32::INFINITY)).unwrap();
     /// ```
     ///
     /// In failure, we get an `Err`.
@@ -484,7 +484,7 @@ where
     /// let points = [[0.0]; 256];
     ///
     /// // note that we are using `u8` as our index type
-    /// let opt = captree::Capt::<1, 8, f32, u8>::try_new(&points, (0.0, f32::INFINITY));
+    /// let opt = capt::Capt::<1, 8, f32, u8>::try_new(&points, (0.0, f32::INFINITY));
     ///
     /// assert!(opt.is_err());
     /// ```
@@ -697,7 +697,7 @@ where
     ///
     /// ```
     /// let points = [[0.0; 3], [1.0; 3], [0.1, 0.5, 1.0]];
-    /// let capt = captree::Capt::<3>::new(&points, (0.0, 1.0));
+    /// let capt = capt::Capt::<3>::new(&points, (0.0, 1.0));
     ///
     /// assert!(capt.collides(&[1.1; 3], 0.2));
     /// assert!(!capt.collides(&[2.0; 3], 1.0));
@@ -793,7 +793,7 @@ where
     /// ];
     /// let radii = Simd::splat(0.05);
     ///
-    /// let tree = captree::Capt::<2, 4, f32, u32>::new(&points, (0.0, 0.1));
+    /// let tree = capt::Capt::<2, 4, f32, u32>::new(&points, (0.0, 0.1));
     ///
     /// println!("{tree:?}");
     ///