Struct KdTree

pub struct KdTree<A, const K: usize> { /* private fields */ }

Implementations

impl<A: Float + Zero + One, const K: usize> KdTree<A, K>

pub fn new() -> Self

pub fn with_per_node_capacity(capacity: usize) -> Result<Self, ErrorKind>

pub fn size(&self) -> usize

pub fn is_leaf(&self) -> bool

pub fn best_n_within<F>( &self, point: &[A; K], radius: A, max_qty: usize, distance: &F, ) -> Result<Vec<&[A; K]>, ErrorKind>

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

pub fn add(&mut self, point: &[A; K]) -> Result<(), ErrorKind>

Add an element to the tree. The first argument specifies the location in kd space at which the element is located. The second argument is the data associated with that point in space.

Examples

use kiddo::KdTree;

let mut tree: KdTree<f64, 3> = KdTree::new();

tree.add(&[1.0, 2.0, 5.0])?;
tree.add(&[1.1, 2.1, 5.1])?;

assert_eq!(tree.size(), 2);

Trait Implementations

impl<A: Clone, const K: usize> Clone for KdTree<A, K>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Debug, const K: usize> Debug for KdTree<A, K>

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

Formats the value using the given formatter.