Struct kdt::KdTree

pub struct KdTree<T: PartialOrd + PartialEq + Clone, const DIM: usize> { /* fields omitted */ }

Implementations

impl<T: PartialOrd + PartialEq + Clone + Debug, const DIM: usize> KdTree<T, DIM>

pub fn dim() -> usize

pub fn from_slice(points: &mut [Point<T, DIM>]) -> Self

pub fn contains(&self, point: &Point<T, DIM>) -> bool

pub fn insert(&mut self, point: Point<T, DIM>) -> bool

Insert a point into the tree.

Inserting elements one by one is likely to cause the tree to become inbalanced. Prefer from_slice to construct the tree.

impl<T: PartialOrd + PartialEq + Clone + Float + Debug, const DIM: usize> KdTree<T, DIM>

pub fn k_nearest_neighbors(
    &self,
    query: &Point<T, DIM>,
    k: usize
) -> Vec<(T, &Point<T, DIM>)>

Trait Implementations

impl<T: Debug + PartialOrd + PartialEq + Clone, const DIM: usize> Debug for KdTree<T, DIM>

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Default + PartialOrd + PartialEq + Clone, const DIM: usize> Default for KdTree<T, DIM>

pub fn default() -> KdTree<T, DIM>

Returns the "default value" for a type.