117 ANNprBoxPQ->
extr_min(box_dist, (
void *&) np);
123 np->ann_pri_search(box_dist);
126 for (
int i = 0; i <
k; i++) {
150 new_dist = (
ANNdist) ANN_SUM(box_dist,
151 ANN_DIFF(ANN_POW(box_diff), ANN_POW(cut_diff)));
163 new_dist = (
ANNdist) ANN_SUM(box_dist,
164 ANN_DIFF(ANN_POW(box_diff), ANN_POW(cut_diff)));
190 min_dist = ANNprPointMK->
max_key();
192 for (
int i = 0; i <
n_pts; i++) {
202 t = *(qq++) - *(pp++);
204 if( (dist = ANN_SUM(dist, ANN_POW(t))) > min_dist) {
212 ANNprPointMK->
insert(dist, bkt[i]);
213 min_dist = ANNprPointMK->
max_key();
PQKinfo ith_smallest_info(int i)
virtual void ann_pri_search(ANNdist)
virtual void ann_pri_search(ANNdist)
const ANNbool ANN_ALLOW_SELF_MATCH
virtual void ann_pri_search(ANNdist)=0
void insert(PQKkey kv, PQKinfo inf)
PQKkey ith_smallest_key(int i)
ANNdist annBoxDistance(const ANNpoint q, const ANNpoint lo, const ANNpoint hi, int dim)
void insert(PQkey kv, PQinfo inf)
void annkPriSearch(ANNpoint q, int k, ANNidxArray nn_idx, ANNdistArray dd, double eps=0.0)
void extr_min(PQkey &kv, PQinfo &inf)