kiddo 5.3.3

A high-performance, flexible, ergonomic k-d tree library. Ideal for geo- and astro- nearest-neighbour and k-nearest-neighbor queries
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

use kiddo::{Chebyshev, ImmutableKdTree, NearestNeighbour};

#[test]
fn immutable_nearest_one_uses_chebyshev_accumulation() {
    let points = [[0.0f64, 0.0], [10.0, 10.0]];
    let tree: ImmutableKdTree<f64, 2> = ImmutableKdTree::new_from_slice(&points);

    assert_eq!(
        tree.nearest_one::<Chebyshev>(&[9.0, 9.0]),
        NearestNeighbour {
            distance: 1.0,
            item: 1,
        }
    );
}

#[test]
fn immutable_approx_nearest_one_uses_chebyshev_accumulation() {
    let points = [[0.0f64, 0.0], [10.0, 10.0]];
    let tree: ImmutableKdTree<f64, 2> = ImmutableKdTree::new_from_slice(&points);

    assert_eq!(
        tree.approx_nearest_one::<Chebyshev>(&[9.0, 9.0]),
        NearestNeighbour {
            distance: 1.0,
            item: 1,
        }
    );
}