start = clock();
#endif
- QuadTree_get_repulsive_force(qt, force, x, ctrl->bh, p, KP, counts, flag);
-
- assert(!(*flag));
+ QuadTree_get_repulsive_force(qt, force, x, ctrl->bh, p, KP, counts);
#ifdef TIME
end = clock();
}
-void QuadTree_get_repulsive_force(QuadTree qt, double *force, double *x, double bh, double p, double KP, double *counts, int *flag){
+void QuadTree_get_repulsive_force(QuadTree qt, double *force, double *x, double bh, double p, double KP, double *counts){
/* get repulsice force by a more efficient algortihm: we consider two cells, if they are well separated, we
calculate the overall repulsive force on the cell level, if not well separated, we divide one of the cell.
If both cells are at the leaf level, we calcuaulate repulsicve force among individual nodes. Finally
for (i = 0; i < 4; i++) counts[i] = 0;
- *flag = 0;
-
for (i = 0; i < dim*n; i++) force[i] = 0;
QuadTree_repulsive_force_interact(qt, qt, x, force, bh, p, KP, counts);
void QuadTree_get_supernodes(QuadTree qt, double bh, double *point, int nodeid, int *nsuper,
int *nsupermax, double **center, double **supernode_wgts, double **distances, double *counts, int *flag);
-void QuadTree_get_repulsive_force(QuadTree qt, double *force, double *x, double bh, double p, double KP, double *counts, int *flag);
+void QuadTree_get_repulsive_force(QuadTree qt, double *force, double *x, double bh, double p, double KP, double *counts);
/* find the nearest point and put in ymin, index in imin and distance in min */
void QuadTree_get_nearest(QuadTree qt, double *x, double *ymin, int *imin, double *min);