MetzNet
/
dfhack
3
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

stub out reachability check for now 

it's more complicated than we thought
develop
Myk Taylor 2023-03-02 04:59:41 -08:00
parent 926bc8b7d4
commit 4f3cdeaf05
No known key found for this signature in database
GPG Key ID: 8A39CA0FA0C16E78
1 changed files with 12 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
plugins/buildingplan/buildingplan_cycle.cpp
Unescape Escape View File

@ -152,8 +152,19 @@ static df::building * popInvalidTasks(color_ostream &out, Bucket &task_queue,
return NULL; return NULL;
} }
// This is tricky. we want to choose an item that can be brought to the job site, but that's not
// necessarily the same as job->pos. it could be many tiles off in any direction (e.g. for bridges), or
// up or down (e.g. for stairs).
static bool isAccessibleFrom(df::item *item, df::job *job) { static bool isAccessibleFrom(df::item *item, df::job *job) {
return Maps::canWalkBetween(Items::getPosition(item), job->pos); // stub this out for now until we have a good algorithm.
// df::coord item_pos = Items::getPosition(item);
// const df::coord &job_pos = job->pos;
// return Maps::canWalkBetween(item_pos, job_pos) ||
// Maps::canWalkBetween(item_pos, df::coord{job_pos.x-1, job_pos.y, job_pos.z}) ||
// Maps::canWalkBetween(item_pos, df::coord{job_pos.x+1, job_pos.y, job_pos.z}) ||
// Maps::canWalkBetween(item_pos, df::coord{job_pos.x, job_pos.y-1, job_pos.z}) ||
// Maps::canWalkBetween(item_pos, df::coord{job_pos.x, job_pos.y+1, job_pos.z});
return true;
} }
static void doVector(color_ostream &out, df::job_item_vector_id vector_id, static void doVector(color_ostream &out, df::job_item_vector_id vector_id,