-
-
Notifications
You must be signed in to change notification settings - Fork 55
/
InternalNode.java
48 lines (42 loc) · 1.59 KB
/
InternalNode.java
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
package net.citizensnpcs.api.util.prtree;
import java.util.List;
import java.util.PriorityQueue;
class InternalNode<T> extends NodeBase<Node<T>, T> {
public InternalNode(Object[] data) {
super(data);
}
@Override
public MBR computeMBR(MBRConverter<T> converter) {
MBR ret = null;
for (int i = 0, s = size(); i < s; i++)
ret = getUnion(ret, get(i).getMBR(converter));
return ret;
}
public void expand(MBR mbr, MBRConverter<T> converter, List<T> found, List<Node<T>> nodesToExpand) {
for (int i = 0, s = size(); i < s; i++) {
Node<T> n = get(i);
if (mbr.intersects(n.getMBR(converter)))
nodesToExpand.add(n);
}
}
public void find(MBR mbr, MBRConverter<T> converter, List<T> result) {
for (int i = 0, s = size(); i < s; i++) {
Node<T> n = get(i);
if (mbr.intersects(n.getMBR(converter)))
n.find(mbr, converter, result);
}
}
public void nnExpand(DistanceCalculator<T> dc, NodeFilter<T> filter, List<DistanceResult<T>> drs, int maxHits,
PriorityQueue<Node<T>> queue, MinDistComparator<T, Node<T>> mdc) {
int s = size();
for (int i = 0; i < s; i++) {
Node<T> n = get(i);
MBR mbr = n.getMBR(mdc.converter);
double minDist = MinDist.get(mbr, mdc.p);
int t = drs.size();
// drs is sorted so we can check only the last entry
if (t < maxHits || minDist <= drs.get(t - 1).getDistance())
queue.add(n);
}
}
}