pub struct AdvancedKDTree { /* private fields */ }Expand description
Advanced-optimized KD-Tree with advanced performance features
Implementations§
Source§impl AdvancedKDTree
impl AdvancedKDTree
Sourcepub fn new(
points: &ArrayView2<'_, f64>,
config: KDTreeConfig,
) -> SpatialResult<Self>
pub fn new( points: &ArrayView2<'_, f64>, config: KDTreeConfig, ) -> SpatialResult<Self>
Create a new advanced-optimized KD-Tree
Sourcepub fn knn_search_advanced(
&self,
query: &ArrayView1<'_, f64>,
k: usize,
) -> SpatialResult<(Vec<usize>, Vec<f64>)>
pub fn knn_search_advanced( &self, query: &ArrayView1<'_, f64>, k: usize, ) -> SpatialResult<(Vec<usize>, Vec<f64>)>
Optimized k-nearest neighbors search with vectorization
Sourcepub fn batch_knn_search(
&self,
queries: &ArrayView2<'_, f64>,
k: usize,
) -> SpatialResult<(Array2<usize>, Array2<f64>)>
pub fn batch_knn_search( &self, queries: &ArrayView2<'_, f64>, k: usize, ) -> SpatialResult<(Array2<usize>, Array2<f64>)>
Batch k-nearest neighbors search for multiple queries
Sourcepub fn range_search(
&self,
query: &ArrayView1<'_, f64>,
radius: f64,
) -> SpatialResult<Vec<(usize, f64)>>
pub fn range_search( &self, query: &ArrayView1<'_, f64>, radius: f64, ) -> SpatialResult<Vec<(usize, f64)>>
Range search within radius
Sourcepub fn statistics(&self) -> &TreeStatistics
pub fn statistics(&self) -> &TreeStatistics
Get tree statistics
Sourcepub fn config(&self) -> &KDTreeConfig
pub fn config(&self) -> &KDTreeConfig
Get tree configuration
Auto Trait Implementations§
impl Freeze for AdvancedKDTree
impl RefUnwindSafe for AdvancedKDTree
impl Send for AdvancedKDTree
impl Sync for AdvancedKDTree
impl Unpin for AdvancedKDTree
impl UnwindSafe for AdvancedKDTree
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> 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.