Struct rust_3d::KdTree

pub struct KdTree<P> where
    P: Is3D,  { /* fields omitted */ }

KdTree https://en.wikipedia.org/wiki/K-d_tree

Trait Implementations

impl<P: Clone> Clone for KdTree<P> where
    P: Is3D, 

fn clone(&self) -> KdTree<P>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<P: Debug> Debug for KdTree<P> where
    P: Is3D, 

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<P: Default> Default for KdTree<P> where
    P: Is3D, 

fn default() -> KdTree<P>

Returns the "default value" for a type.

impl<P: Eq> Eq for KdTree<P> where
    P: Is3D, 

impl<P: Hash> Hash for KdTree<P> where
    P: Is3D, 

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<P> IsBox3DSearchable<P> for KdTree<P> where
    P: Is3D + Clone, 

fn in_box(&self, box_3d: &Box3D, result: &mut Vec<P>)

Should return all elements within a box

impl<PSearch, PFind> IsKNearestSearchable<PSearch, PFind> for KdTree<PFind> where
    PSearch: Is3D,
    PFind: Is3D + Clone, 

fn knearest(&self, search: &PSearch, n: usize, result: &mut Vec<PFind>)

Should return the k nearest neighbours to search

fn nearest(&self, search: &PSearch) -> Result<PFind>

Should return the nearest neighbour to search, if there is any

impl<P> IsSphereSearchable<P> for KdTree<P> where
    P: Is3D + Clone, 

fn in_sphere(&self, sphere: &Sphere, result: &mut Vec<P>)

Should return all elements within a sphere

impl<P> IsTree3D<P> for KdTree<P> where
    P: Is3D + Clone, 

fn size(&self) -> usize

Should return the number of elements within the tree

fn to_pointcloud(&self) -> PointCloud3D<P>

Should return all positions within the tree as point cloud

fn build(&mut self, pc: PointCloud3D<P>) -> Result<()>

Should create a new tree from a given point cloud

impl<P: Ord> Ord for KdTree<P> where
    P: Is3D, 

fn cmp(&self, other: &KdTree<P>) -> Ordering

This method returns an [Ordering] between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<P: PartialEq> PartialEq<KdTree<P>> for KdTree<P> where
    P: Is3D, 

fn eq(&self, other: &KdTree<P>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &KdTree<P>) -> bool

This method tests for !=.

impl<P: PartialOrd> PartialOrd<KdTree<P>> for KdTree<P> where
    P: Is3D, 

fn partial_cmp(&self, other: &KdTree<P>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &KdTree<P>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &KdTree<P>) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &KdTree<P>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &KdTree<P>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<P> StructuralEq for KdTree<P> where
    P: Is3D, 

impl<P> StructuralPartialEq for KdTree<P> where
    P: Is3D,