80 for (
int i = 0; i <
k; i++) {
115 box_dist = (
ANNdist) ANN_SUM(box_dist,
116 ANN_DIFF(ANN_POW(box_diff), ANN_POW(cut_diff)));
130 box_dist = (
ANNdist) ANN_SUM(box_dist,
131 ANN_DIFF(ANN_POW(box_diff), ANN_POW(cut_diff)));
156 for (
int i = 0; i <
n_pts; i++) {
166 t = *(qq++) - *(pp++);
168 if( (dist = ANN_SUM(dist, ANN_POW(t))) >
ANNkdFRSqRad) {
173 if (d >= ANNkdFRDim &&
176 ANNkdFRPointMK->
insert(dist, bkt[i]);
PQKinfo ith_smallest_info(int i)
ANNmin_k * ANNkdFRPointMK
virtual void ann_FR_search(ANNdist)
int annkFRSearch(ANNpoint q, ANNdist sqRad, int k, ANNidxArray nn_idx=NULL, ANNdistArray dd=NULL, double eps=0.0)
const ANNbool ANN_ALLOW_SELF_MATCH
virtual void ann_FR_search(ANNdist)=0
virtual void ann_FR_search(ANNdist)
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)