void
tree_list( carmen_vascocore_quad_tree_t *tree , int *ct )
{
if ((tree->level)>0 ) {
if (tree->elem[0]->inuse)
tree_list( tree->elem[0], ct );
if (tree->elem[1]->inuse)
tree_list( tree->elem[1], ct );
if (tree->elem[2]->inuse)
tree_list( tree->elem[2], ct );
if (tree->elem[3]->inuse)
tree_list( tree->elem[3], ct );
} else {
(*ct)++;
}
}
void
tree_list( QUAD_TREE *tree , int *ct )
{
if ((tree->level)>0 ) {
if (tree->elem[0]->inuse)
tree_list( tree->elem[0], ct );
if (tree->elem[1]->inuse)
tree_list( tree->elem[1], ct );
if (tree->elem[2]->inuse)
tree_list( tree->elem[2], ct );
if (tree->elem[3]->inuse)
tree_list( tree->elem[3], ct );
} else {
// fprintf( stderr, "%d %d\n", tree->center.x, tree->center.y );
(*ct)++;
}
}
void tree_list(node* n, int* spaces, run_params* par) {
int i = 0;
for (i = 0; i < (*spaces); i++) pipe_write_s(par->out, " ");
if ((*spaces) != 0) pipe_write_s(par->out, "\\-");
pipe_write_s(par->out, n->name);
pipe_write_s(par->out, "\n");
(*spaces) += 2;
node** listDir = node_get_entries(n);
int max = node_get_entries_count(n);
for (i = 0; i < max; i++) {
tree_list(n->dirEntries[i], spaces, par);
}
(*spaces) -= 2;
}
void tree(run_params* par) {
node* n = par->start_node;
int spaces = 0;
tree_list(n, &spaces, par);
}
