pub struct GenericKDTree<T: SpatialScalar, P: SpatialPoint<T>> { /* private fields */ }Expand description
Generic KD-Tree implementation with memory optimizations
This KD-Tree can work with any type that implements SpatialPoint, allowing for flexible point representations and numeric types. It includes memory optimizations for large datasets.
Implementations§
Source§impl<T: SpatialScalar, P: SpatialPoint<T> + Clone> GenericKDTree<T, P>
impl<T: SpatialScalar, P: SpatialPoint<T> + Clone> GenericKDTree<T, P>
Sourcepub fn new(points: &[P]) -> SpatialResult<Self>
pub fn new(points: &[P]) -> SpatialResult<Self>
Create a new KD-Tree from a collection of points
Sourcepub fn k_nearest_neighbors(
&self,
query: &P,
k: usize,
metric: &dyn DistanceMetric<T, P>,
) -> SpatialResult<Vec<(usize, T)>>
pub fn k_nearest_neighbors( &self, query: &P, k: usize, metric: &dyn DistanceMetric<T, P>, ) -> SpatialResult<Vec<(usize, T)>>
Find the k nearest neighbors to a query point
Sourcepub fn radius_search(
&self,
query: &P,
radius: T,
metric: &dyn DistanceMetric<T, P>,
) -> SpatialResult<Vec<(usize, T)>>
pub fn radius_search( &self, query: &P, radius: T, metric: &dyn DistanceMetric<T, P>, ) -> SpatialResult<Vec<(usize, T)>>
Find all points within a given radius of the query point
Trait Implementations§
Source§impl<T: Clone + SpatialScalar, P: Clone + SpatialPoint<T>> Clone for GenericKDTree<T, P>
impl<T: Clone + SpatialScalar, P: Clone + SpatialPoint<T>> Clone for GenericKDTree<T, P>
Source§fn clone(&self) -> GenericKDTree<T, P>
fn clone(&self) -> GenericKDTree<T, P>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<T: Debug + SpatialScalar, P: Debug + SpatialPoint<T>> Debug for GenericKDTree<T, P>
impl<T: Debug + SpatialScalar, P: Debug + SpatialPoint<T>> Debug for GenericKDTree<T, P>
Auto Trait Implementations§
impl<T, P> Freeze for GenericKDTree<T, P>
impl<T, P> RefUnwindSafe for GenericKDTree<T, P>where
P: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, P> Send for GenericKDTree<T, P>where
P: Send,
impl<T, P> Sync for GenericKDTree<T, P>where
P: Sync,
impl<T, P> Unpin for GenericKDTree<T, P>where
P: Unpin,
impl<T, P> UnwindSafe for GenericKDTree<T, P>where
P: UnwindSafe,
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.