void process_point(){
/* debug_printf("process_point_s"); */
// Get the next point at the top of the queue (with smaller x coordinate)
point_t p = top_point();
pop_point();
front_insert(p);
/* debug_printf("process_point_end"); */
}
void free_data(DATA *d) {
int i;
assert(d);
if (DEBUG_FORCE) /* let atexit(qtree_print) do it's job... */
return;
if (d->P_base) { /* segmented: */
efree(d->P_base);
if (d->n_X && d->X_base)
efree(d->X_base);
} else { /* non-segmented */
if (d->list) /* CW at all MV on output both P_base and d_list are 0 */
for (i = d->n_list - 1; i >= 0; i--)
pop_point(d, i);
}
if (d->sel != NULL && d->sel != d->list)
efree(d->sel);
if (d->list)
efree(d->list);
if (d->colX)
efree(d->colX);
if (d->qtree_root != NULL)
qtree_free(d->qtree_root);
if (d->lm)
free_lm(d->lm);
if (d->glm)
free_glm(d->glm);
if (d->grid)
free_data_gridmap(d->grid);
if (d->point_ids)
for (i = d->n_list - 1; i >= 0; i--)
efree(d->point_ids[i]);
efree(d);
return;
}
