Struct rust_3d::KdTree
[−]
[src]
pub struct KdTree<P> where
P: Is3D, { /* fields omitted */ }
KdTree https://en.wikipedia.org/wiki/K-d_tree
Trait Implementations
impl<P: Debug> Debug for KdTree<P> where
P: Is3D,
[src]
P: Is3D,
fn fmt(&self, __arg_0: &mut Formatter) -> Result
[src]
Formats the value using the given formatter. Read more
impl<P: Default> Default for KdTree<P> where
P: Is3D,
[src]
P: Is3D,
impl<P: Clone> Clone for KdTree<P> where
P: Is3D,
[src]
P: Is3D,
fn clone(&self) -> KdTree<P>
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<P: PartialEq> PartialEq for KdTree<P> where
P: Is3D,
[src]
P: Is3D,
fn eq(&self, __arg_0: &KdTree<P>) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, __arg_0: &KdTree<P>) -> bool
[src]
This method tests for !=
.
impl<P: Eq> Eq for KdTree<P> where
P: Is3D,
[src]
P: Is3D,
impl<P: PartialOrd> PartialOrd for KdTree<P> where
P: Is3D,
[src]
P: Is3D,
fn partial_cmp(&self, __arg_0: &KdTree<P>) -> Option<Ordering>
[src]
This method returns an ordering between self
and other
values if one exists. Read more
fn lt(&self, __arg_0: &KdTree<P>) -> bool
[src]
This method tests less than (for self
and other
) and is used by the <
operator. Read more
fn le(&self, __arg_0: &KdTree<P>) -> bool
[src]
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
fn gt(&self, __arg_0: &KdTree<P>) -> bool
[src]
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
fn ge(&self, __arg_0: &KdTree<P>) -> bool
[src]
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
impl<P: Ord> Ord for KdTree<P> where
P: Is3D,
[src]
P: Is3D,
fn cmp(&self, __arg_0: &KdTree<P>) -> Ordering
[src]
This method returns an Ordering
between self
and other
. Read more
fn max(self, other: Self) -> Self
1.21.0[src]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.21.0[src]
Compares and returns the minimum of two values. Read more
impl<P: Hash> Hash for KdTree<P> where
P: Is3D,
[src]
P: Is3D,
fn hash<__HP: Hasher>(&self, __arg_0: &mut __HP)
[src]
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<P> IsTree3D<P> for KdTree<P> where
P: Is3D + Clone,
[src]
P: Is3D + Clone,
fn size(&self) -> usize
[src]
Should return the number of elements within the tree
fn to_pointcloud(&self) -> PointCloud3D<P>
[src]
Should return all positions within the tree as point cloud
fn build(&mut self, pc: PointCloud3D<P>) -> Result<()>
[src]
Should create a new tree from a given point cloud
impl<PSearch, PFind> IsKNearestSearchable<PSearch, PFind> for KdTree<PFind> where
PSearch: Is3D,
PFind: Is3D + Clone,
[src]
PSearch: Is3D,
PFind: Is3D + Clone,
fn knearest(&self, search: &PSearch, n: usize) -> Vec<PFind>
[src]
Should return the k nearest neighbours to search
fn nearest(&self, search: &PSearch) -> Result<PFind>
[src]
Should return the nearest neighbour to search, if there is any
impl<P> IsSphereSearchable<P> for KdTree<P> where
P: Is3D + Clone,
[src]
P: Is3D + Clone,
impl<P> IsBox3DSearchable<P> for KdTree<P> where
P: Is3D + Clone,
[src]
P: Is3D + Clone,