bool TCOD_path_walk(TCOD_path_t p, int *x, int *y, bool recalculate_when_needed) {
int newx,newy;
float can_walk;
int d;
TCOD_path_data_t *path=(TCOD_path_data_t *)p;
TCOD_IFNOT(p != NULL) return false;
if ( TCOD_path_is_empty(path) ) return false;
d=(int)(uintptr)TCOD_list_pop(path->path);
newx=path->ox + dirx[d];
newy=path->oy + diry[d];
/* check if the path is still valid */
can_walk = TCOD_path_walk_cost(path,path->ox,path->oy,newx,newy);
if ( can_walk == 0.0f ) {
if (! recalculate_when_needed ) return false; /* don't walk */
/* calculate a new path */
if (! TCOD_path_compute(path, path->ox,path->oy, path->dx,path->dy) ) return false ; /* cannot find a new path */
return TCOD_path_walk(p,x,y,true); /* walk along the new path */
}
if ( x ) *x=newx;
if ( y ) *y=newy;
path->ox=newx;
path->oy=newy;
return true;
}
bool TCODPath::isEmpty() const {
return TCOD_path_is_empty(data) != 0;
}
