Struct kdtree::kdtree::KdTree
[−]
[src]
pub struct KdTree<T, U: AsRef<[f64]>> { /* fields omitted */ }
Methods
impl<T, U: AsRef<[f64]>> KdTree<T, U>
[src]
fn new(dims: usize) -> Self
[src]
fn new_with_capacity(dimensions: usize, capacity: usize) -> Self
[src]
fn size(&self) -> usize
[src]
fn nearest<F>(
&self,
point: &[f64],
num: usize,
distance: &F
) -> Result<Vec<(f64, &T)>, ErrorKind> where
F: Fn(&[f64], &[f64]) -> f64,
[src]
&self,
point: &[f64],
num: usize,
distance: &F
) -> Result<Vec<(f64, &T)>, ErrorKind> where
F: Fn(&[f64], &[f64]) -> f64,
fn within<F>(
&self,
point: &[f64],
ridius: f64,
distance: &F
) -> Result<Vec<(f64, &T)>, ErrorKind> where
F: Fn(&[f64], &[f64]) -> f64,
[src]
&self,
point: &[f64],
ridius: f64,
distance: &F
) -> Result<Vec<(f64, &T)>, ErrorKind> where
F: Fn(&[f64], &[f64]) -> f64,
fn iter_nearest<'a, 'b, F>(
&'b self,
point: &'a [f64],
distance: &'a F
) -> Result<NearestIter<'a, 'b, T, U, F>, ErrorKind> where
F: Fn(&[f64], &[f64]) -> f64,
[src]
&'b self,
point: &'a [f64],
distance: &'a F
) -> Result<NearestIter<'a, 'b, T, U, F>, ErrorKind> where
F: Fn(&[f64], &[f64]) -> f64,