pub struct KDTree<P: PointTrait> { /* private fields */ }Implementations§
Source§impl<P: PointTrait> KDTree<P>
impl<P: PointTrait> KDTree<P>
pub fn insert(&mut self, pos: P) -> Result<(), KrakelError>
pub fn nearest(&self, pos: &P) -> Option<P>
pub fn range_query<Q: PointTrait<PScalar = P::PScalar>>( &self, pos: &Q, radius: P::PScalar, ) -> Vec<P>
pub fn closure_range_query<Q: PointTrait<PScalar = P::PScalar>, F>( &self, pos: &Q, radius: P::PScalar, process: F, )
Trait Implementations§
Source§impl<P: PointTrait> Debug for KDTree<P>
impl<P: PointTrait> Debug for KDTree<P>
Auto Trait Implementations§
impl<P> Freeze for KDTree<P>where
P: Freeze,
impl<P> RefUnwindSafe for KDTree<P>where
P: RefUnwindSafe,
impl<P> Send for KDTree<P>where
P: Send,
impl<P> Sync for KDTree<P>where
P: Sync,
impl<P> Unpin for KDTree<P>where
P: Unpin,
impl<P> UnwindSafe for KDTree<P>where
P: 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<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.