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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#[doc(hidden)]
#[macro_export]
macro_rules! generate_within_unsorted {
($comments:tt) => {
doc_comment! {
concat!$comments,
#[inline]
pub fn within_unsorted<D>(&self, query: &[A; K], dist: A) -> Vec<NearestNeighbour<A, T>>
where
D: DistanceMetric<A, K>,
{
let mut off = [A::zero(); K];
let mut matching_items = Vec::new();
unsafe {
self.within_unsorted_recurse::<D>(
query,
dist,
self.root_index,
0,
&mut matching_items,
&mut off,
A::zero(),
);
}
matching_items
}
#[allow(clippy::too_many_arguments)]
unsafe fn within_unsorted_recurse<D>(
&self,
query: &[A; K],
radius: A,
curr_node_idx: IDX,
split_dim: usize,
matching_items: &mut Vec<NearestNeighbour<A, T>>,
off: &mut [A; K],
rd: A,
) where
D: DistanceMetric<A, K>,
{
if is_stem_index(curr_node_idx) {
let node = self.stems.get_unchecked(curr_node_idx.az::<usize>());
let mut rd = rd;
let old_off = off[split_dim];
let new_off = query[split_dim].saturating_dist(node.split_val);
let [closer_node_idx, further_node_idx] =
if *query.get_unchecked(split_dim) < node.split_val {
[node.left, node.right]
} else {
[node.right, node.left]
};
let next_split_dim = (split_dim + 1).rem(K);
self.within_unsorted_recurse::<D>(
query,
radius,
closer_node_idx,
next_split_dim,
matching_items,
off,
rd,
);
rd = Axis::rd_update(rd, D::dist1(new_off, old_off));
if rd <= radius {
off[split_dim] = new_off;
self.within_unsorted_recurse::<D>(
query,
radius,
further_node_idx,
next_split_dim,
matching_items,
off,
rd,
);
off[split_dim] = old_off;
}
} else {
let leaf_node = self
.leaves
.get_unchecked((curr_node_idx - IDX::leaf_offset()).az::<usize>());
leaf_node
.content_points
.iter()
.enumerate()
.take(leaf_node.size.az::<usize>())
.for_each(|(idx, entry)| {
let distance = D::dist(query, entry);
if distance < radius {
matching_items.push(NearestNeighbour {
distance,
item: *leaf_node.content_items.get_unchecked(idx.az::<usize>()),
})
}
});
}
}
}
};
}