Struct KdTree

pub struct KdTree<A, T: PartialEq, U: AsRef<[A]> + PartialEq> { /* private fields */ }

Implementations

impl<A: Float + Zero + One, T: PartialEq, U: AsRef<[A]> + PartialEq> KdTree<A, T, U>

pub fn new(dims: usize) -> Self

Create a new KD tree, specifying the dimension size of each point

pub fn with_capacity(dimensions: usize, capacity: usize) -> Self

Create a new KD tree, specifying the dimension size of each point and the capacity of leaf nodes

pub fn size(&self) -> usize

pub fn nearest<F>( &self, point: &[A], num: usize, distance: &F, ) -> Result<Vec<(A, &T)>, ErrorKind>

where F: Fn(&[A], &[A]) -> A,

pub fn within<F>( &self, point: &[A], radius: A, distance: &F, ) -> Result<Vec<(A, &T)>, ErrorKind>

where F: Fn(&[A], &[A]) -> A,

pub fn iter_nearest<'a, 'b, F>( &'b self, point: &'a [A], distance: &'a F, ) -> Result<NearestIter<'a, 'b, A, T, U, F>, ErrorKind>

where F: Fn(&[A], &[A]) -> A,

pub fn iter_nearest_mut<'a, 'b, F>( &'b mut self, point: &'a [A], distance: &'a F, ) -> Result<NearestIterMut<'a, 'b, A, T, U, F>, ErrorKind>

where F: Fn(&[A], &[A]) -> A,

pub fn add(&mut self, point: U, data: T) -> Result<(), ErrorKind>

pub fn remove(&mut self, point: &U, data: &T) -> Result<usize, ErrorKind>

Trait Implementations

impl<A: Clone, T: Clone + PartialEq, U: Clone + AsRef<[A]> + PartialEq> Clone for KdTree<A, T, U>

fn clone(&self) -> KdTree<A, T, U>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug, T: Debug + PartialEq, U: Debug + AsRef<[A]> + PartialEq> Debug for KdTree<A, T, U>

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

Formats the value using the given formatter.