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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57

use kiddo::{KdTree, SquaredEuclidean};

#[test]
fn add_accepts_more_than_one_bucket_of_points_sharing_an_axis_coordinate() {
    let mut tree: KdTree<f64, 2> = KdTree::new();

    for item in 0..33u64 {
        tree.add(&[5.0, item as f64], item);
    }

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

    for item in 0..33u64 {
        let nearest = tree.nearest_one::<SquaredEuclidean>(&[5.0, item as f64]);
        assert_eq!(nearest.distance, 0.0);
        assert_eq!(nearest.item, item);
    }

    for item in 0..33u64 {
        assert_eq!(tree.remove(&[5.0, item as f64], item), 1);
    }
    assert_eq!(tree.size(), 0);
}

#[test]
fn add_can_advance_past_constant_axes_in_either_direction() {
    type SmallTree = kiddo::float::kdtree::KdTree<f64, u64, 2, 4, u32>;

    let mut above: SmallTree = SmallTree::new();
    for item in 0..4 {
        above.add(&[5.0, 5.0], item);
    }
    above.add(&[5.0, 6.0], 4);

    let mut below: SmallTree = SmallTree::new();
    for item in 0..4 {
        below.add(&[5.0, 5.0], item);
    }
    below.add(&[5.0, 4.0], 4);

    assert_eq!(above.nearest_one::<SquaredEuclidean>(&[5.0, 6.0]).item, 4);
    assert_eq!(below.nearest_one::<SquaredEuclidean>(&[5.0, 4.0]).item, 4);
}

#[test]
#[should_panic(
    expected = "Cannot insert another item at [5.0, 5.0]: this leaf already contains 4 items at \
                exactly the same point."
)]
fn add_rejects_only_an_unsplittable_bucket_of_identical_points() {
    type SmallTree = kiddo::float::kdtree::KdTree<f64, u64, 2, 4, u32>;

    let mut tree: SmallTree = SmallTree::new();
    for item in 0..5 {
        tree.add(&[5.0, 5.0], item);
    }
}