Struct kdtree::kdtree::KdTree

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

Methods

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

pub fn new(dims: usize) -> Self

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

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>

Trait Implementations

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

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

Formats the value using the given formatter.