2011-10-13 18:15:19 -06:00
|
|
|
// Wide-area traffic designation utility.
|
|
|
|
// Flood-fill from cursor or fill entire map.
|
|
|
|
|
2011-11-03 02:04:05 -06:00
|
|
|
#include <ctype.h> //For toupper().
|
|
|
|
#include <algorithm> //for min().
|
2011-10-13 18:15:19 -06:00
|
|
|
#include <map>
|
|
|
|
#include <vector>
|
|
|
|
#include <dfhack/Core.h>
|
|
|
|
#include <dfhack/Console.h>
|
|
|
|
#include <dfhack/Export.h>
|
|
|
|
#include <dfhack/PluginManager.h>
|
|
|
|
#include <dfhack/modules/Maps.h>
|
|
|
|
#include <dfhack/extra/MapExtras.h>
|
|
|
|
#include <dfhack/modules/Gui.h>
|
|
|
|
using std::stack;
|
|
|
|
using MapExtras::MapCache;
|
|
|
|
using namespace DFHack;
|
|
|
|
|
2011-11-03 02:04:05 -06:00
|
|
|
//Function pointer type for whole-map tile checks.
|
2011-11-17 20:31:56 -07:00
|
|
|
typedef void (*checkTile)(DFHack::DFCoord, MapExtras::MapCache *);
|
2011-11-03 02:04:05 -06:00
|
|
|
|
|
|
|
//Forward Declarations for Commands
|
2011-10-13 18:15:19 -06:00
|
|
|
DFhackCExport command_result filltraffic(DFHack::Core * c, std::vector<std::string> & params);
|
2011-11-03 02:04:05 -06:00
|
|
|
DFhackCExport command_result alltraffic(DFHack::Core * c, std::vector<std::string> & params);
|
|
|
|
|
|
|
|
//Forward Declarations for Utility Functions
|
2011-11-17 20:31:56 -07:00
|
|
|
DFhackCExport command_result setAllMatching(DFHack::Core * c, checkTile checkProc,
|
2011-11-03 02:04:05 -06:00
|
|
|
DFHack::DFCoord minCoord = DFHack::DFCoord(0, 0, 0),
|
|
|
|
DFHack::DFCoord maxCoord = DFHack::DFCoord(0xFFFF, 0xFFFF, 0xFFFFFFFF));
|
|
|
|
|
2011-11-17 20:31:56 -07:00
|
|
|
void allHigh(DFHack::DFCoord coord, MapExtras::MapCache * map);
|
|
|
|
void allNormal(DFHack::DFCoord coord, MapExtras::MapCache * map);
|
|
|
|
void allLow(DFHack::DFCoord coord, MapExtras::MapCache * map);
|
|
|
|
void allRestricted(DFHack::DFCoord coord, MapExtras::MapCache * map);
|
2011-10-13 18:15:19 -06:00
|
|
|
|
|
|
|
DFhackCExport const char * plugin_name ( void )
|
|
|
|
{
|
|
|
|
return "filltraffic";
|
|
|
|
}
|
|
|
|
|
|
|
|
DFhackCExport command_result plugin_init ( Core * c, std::vector <PluginCommand> &commands)
|
|
|
|
{
|
|
|
|
commands.clear();
|
|
|
|
commands.push_back(PluginCommand("filltraffic","Flood-fill with selected traffic designation from cursor",filltraffic));
|
2011-11-03 02:04:05 -06:00
|
|
|
commands.push_back(PluginCommand("alltraffic","Set traffic for the entire map",alltraffic));
|
|
|
|
|
2011-10-13 18:15:19 -06:00
|
|
|
return CR_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
DFhackCExport command_result plugin_shutdown ( Core * c )
|
|
|
|
{
|
|
|
|
return CR_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
DFhackCExport command_result filltraffic(DFHack::Core * c, std::vector<std::string> & params)
|
|
|
|
{
|
|
|
|
//Maximum map size.
|
|
|
|
uint32_t x_max,y_max,z_max;
|
|
|
|
//Source and target traffic types.
|
|
|
|
e_traffic source = traffic_normal;
|
|
|
|
e_traffic target = traffic_normal;
|
|
|
|
//Option flags
|
|
|
|
bool updown = false;
|
|
|
|
bool checkpit = true;
|
|
|
|
bool checkbuilding = true;
|
|
|
|
|
|
|
|
//Loop through parameters
|
|
|
|
for(int i = 0; i < params.size();i++)
|
|
|
|
{
|
|
|
|
if(params[i] == "help" || params[i] == "?")
|
|
|
|
{
|
|
|
|
c->con.print("Flood-fill selected traffic type from the cursor.\n"
|
2011-10-23 14:23:54 -06:00
|
|
|
"Traffic Type Codes:\n"
|
|
|
|
"\tH: High Traffic\n"
|
|
|
|
"\tN: Normal Traffic\n"
|
|
|
|
"\tL: Low Traffic\n"
|
|
|
|
"\tR: Restricted Traffic\n"
|
|
|
|
"Other Options:\n"
|
2011-11-04 19:05:43 -06:00
|
|
|
"\tX: Fill across z-levels.\n"
|
2011-10-23 14:23:54 -06:00
|
|
|
"\tB: Include buildings and stockpiles.\n"
|
|
|
|
"\tP: Include empty space.\n"
|
|
|
|
"Example:\n"
|
|
|
|
"'filltraffic H' - When used in a room with doors,\n"
|
|
|
|
" it will set traffic to HIGH in just that room."
|
2011-10-13 18:15:19 -06:00
|
|
|
);
|
|
|
|
return CR_OK;
|
|
|
|
}
|
|
|
|
|
2011-10-23 14:23:54 -06:00
|
|
|
switch (toupper(params[i][0]))
|
|
|
|
{
|
|
|
|
case 'H':
|
|
|
|
target = traffic_high; break;
|
|
|
|
case 'N':
|
|
|
|
target = traffic_normal; break;
|
|
|
|
case 'L':
|
|
|
|
target = traffic_low; break;
|
|
|
|
case 'R':
|
|
|
|
target = traffic_restricted; break;
|
|
|
|
case 'X':
|
|
|
|
updown = true; break;
|
|
|
|
case 'B':
|
|
|
|
checkbuilding = false; break;
|
|
|
|
case 'P':
|
|
|
|
checkpit = false; break;
|
|
|
|
}
|
2011-10-13 18:15:19 -06:00
|
|
|
}
|
|
|
|
|
2011-10-23 14:23:54 -06:00
|
|
|
//Initialization.
|
|
|
|
c->Suspend();
|
2011-10-13 18:15:19 -06:00
|
|
|
|
2011-10-23 14:23:54 -06:00
|
|
|
DFHack::Maps * Maps = c->getMaps();
|
2011-10-13 18:15:19 -06:00
|
|
|
DFHack::Gui * Gui = c->getGui();
|
|
|
|
// init the map
|
|
|
|
if(!Maps->Start())
|
|
|
|
{
|
|
|
|
c->con.printerr("Can't init map. Make sure you have a map loaded in DF.\n");
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
int32_t cx, cy, cz;
|
|
|
|
Maps->getSize(x_max,y_max,z_max);
|
|
|
|
uint32_t tx_max = x_max * 16;
|
|
|
|
uint32_t ty_max = y_max * 16;
|
|
|
|
Gui->getCursorCoords(cx,cy,cz);
|
|
|
|
while(cx == -30000)
|
|
|
|
{
|
|
|
|
c->con.printerr("Cursor is not active.\n");
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
|
|
|
}
|
|
|
|
|
2011-10-23 14:23:54 -06:00
|
|
|
DFHack::DFCoord xy ((uint32_t)cx,(uint32_t)cy,cz);
|
|
|
|
MapExtras::MapCache * MCache = new MapExtras::MapCache(Maps);
|
2011-10-13 18:15:19 -06:00
|
|
|
|
2011-10-23 14:23:54 -06:00
|
|
|
DFHack::t_designation des = MCache->designationAt(xy);
|
|
|
|
int16_t tt = MCache->tiletypeAt(xy);
|
|
|
|
DFHack::t_occupancy oc;
|
2011-10-13 18:15:19 -06:00
|
|
|
|
2011-10-23 14:23:54 -06:00
|
|
|
if (checkbuilding)
|
|
|
|
oc = MCache->occupancyAt(xy);
|
|
|
|
|
|
|
|
source = des.bits.traffic;
|
2011-10-13 18:15:19 -06:00
|
|
|
if(source == target)
|
|
|
|
{
|
|
|
|
c->con.printerr("This tile is already set to the target traffic type.\n");
|
|
|
|
delete MCache;
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
|
|
|
}
|
|
|
|
|
2011-10-23 14:23:54 -06:00
|
|
|
if(DFHack::isWallTerrain(tt))
|
|
|
|
{
|
|
|
|
c->con.printerr("This tile is a wall. Please select a passable tile.\n");
|
2011-10-13 18:15:19 -06:00
|
|
|
delete MCache;
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
2011-10-23 14:23:54 -06:00
|
|
|
}
|
2011-10-13 18:15:19 -06:00
|
|
|
|
|
|
|
if(checkpit && DFHack::isOpenTerrain(tt))
|
|
|
|
{
|
|
|
|
c->con.printerr("This tile is a hole. Please select a passable tile.\n");
|
|
|
|
delete MCache;
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(checkbuilding && oc.bits.building)
|
|
|
|
{
|
|
|
|
c->con.printerr("This tile contains a building. Please select an empty tile.\n");
|
|
|
|
delete MCache;
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
c->con.print("%d/%d/%d ... FILLING!\n", cx,cy,cz);
|
|
|
|
|
|
|
|
//Naive four-way or six-way flood fill with possible tiles on a stack.
|
|
|
|
stack <DFHack::DFCoord> flood;
|
|
|
|
flood.push(xy);
|
|
|
|
|
|
|
|
while(!flood.empty())
|
|
|
|
{
|
|
|
|
xy = flood.top();
|
|
|
|
flood.pop();
|
|
|
|
|
|
|
|
des = MCache->designationAt(xy);
|
|
|
|
if (des.bits.traffic != source) continue;
|
|
|
|
|
|
|
|
tt = MCache->tiletypeAt(xy);
|
|
|
|
|
|
|
|
if(DFHack::isWallTerrain(tt)) continue;
|
|
|
|
if(checkpit && DFHack::isOpenTerrain(tt)) continue;
|
|
|
|
|
|
|
|
if (checkbuilding)
|
|
|
|
{
|
|
|
|
oc = MCache->occupancyAt(xy);
|
|
|
|
if(oc.bits.building) continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
//This tile is ready. Set its traffic level and add surrounding tiles.
|
|
|
|
if (MCache->testCoord(xy))
|
|
|
|
{
|
|
|
|
des.bits.traffic = target;
|
|
|
|
MCache->setDesignationAt(xy,des);
|
|
|
|
|
|
|
|
if (xy.x > 0)
|
|
|
|
{
|
|
|
|
flood.push(DFHack::DFCoord(xy.x - 1, xy.y, xy.z));
|
|
|
|
}
|
|
|
|
if (xy.x < tx_max - 1)
|
|
|
|
{
|
|
|
|
flood.push(DFHack::DFCoord(xy.x + 1, xy.y, xy.z));
|
|
|
|
}
|
|
|
|
if (xy.y > 0)
|
|
|
|
{
|
|
|
|
flood.push(DFHack::DFCoord(xy.x, xy.y - 1, xy.z));
|
|
|
|
}
|
|
|
|
if (xy.y < ty_max - 1)
|
|
|
|
{
|
|
|
|
flood.push(DFHack::DFCoord(xy.x, xy.y + 1, xy.z));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (updown)
|
|
|
|
{
|
|
|
|
if (xy.z > 0 && DFHack::LowPassable(tt))
|
|
|
|
{
|
|
|
|
flood.push(DFHack::DFCoord(xy.x, xy.y, xy.z - 1));
|
|
|
|
}
|
|
|
|
if (xy.z < z_max && DFHack::HighPassable(tt))
|
|
|
|
{
|
|
|
|
flood.push(DFHack::DFCoord(xy.x, xy.y, xy.z + 1));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
MCache->WriteAll();
|
|
|
|
c->Resume();
|
|
|
|
return CR_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
enum e_checktype {no_check, check_equal, check_nequal};
|
|
|
|
|
2011-11-03 02:04:05 -06:00
|
|
|
DFhackCExport command_result alltraffic(DFHack::Core * c, std::vector<std::string> & params)
|
2011-10-13 18:15:19 -06:00
|
|
|
{
|
2011-11-17 20:31:56 -07:00
|
|
|
void (*proc)(DFHack::DFCoord, MapExtras::MapCache *) = allNormal;
|
|
|
|
|
2011-10-13 18:15:19 -06:00
|
|
|
//Loop through parameters
|
|
|
|
for(int i = 0; i < params.size();i++)
|
|
|
|
{
|
|
|
|
if(params[i] == "help" || params[i] == "?")
|
|
|
|
{
|
|
|
|
c->con.print("Set traffic types for all tiles on the map.\n"
|
|
|
|
"Traffic Type Codes:\n"
|
|
|
|
" H: High Traffic\n"
|
|
|
|
" N: Normal Traffic\n"
|
|
|
|
" L: Low Traffic\n"
|
|
|
|
" R: Restricted Traffic\n"
|
|
|
|
);
|
|
|
|
return CR_OK;
|
|
|
|
}
|
|
|
|
|
2011-11-17 20:31:56 -07:00
|
|
|
//Pick traffic type. Possibly set bounding rectangle later.
|
2011-10-13 18:15:19 -06:00
|
|
|
switch (toupper(params[i][0]))
|
|
|
|
{
|
|
|
|
case 'H':
|
2011-11-17 20:31:56 -07:00
|
|
|
proc = allHigh; break;
|
2011-10-13 18:15:19 -06:00
|
|
|
case 'N':
|
2011-11-17 20:31:56 -07:00
|
|
|
proc = allNormal; break;
|
2011-10-13 18:15:19 -06:00
|
|
|
case 'L':
|
2011-11-17 20:31:56 -07:00
|
|
|
proc = allLow; break;
|
2011-10-13 18:15:19 -06:00
|
|
|
case 'R':
|
2011-11-17 20:31:56 -07:00
|
|
|
proc = allRestricted; break;
|
2011-10-13 18:15:19 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-11-17 20:31:56 -07:00
|
|
|
return setAllMatching(c, proc);
|
2011-11-03 02:04:05 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
//Helper function for writing new functions that check every tile on the map.
|
|
|
|
//newTraffic is the traffic designation to set.
|
|
|
|
//check takes a coordinate and the map cache as arguments, and returns true if the criteria is met.
|
|
|
|
//minCoord and maxCoord can be used to specify a bounding cube.
|
2011-11-17 20:31:56 -07:00
|
|
|
DFhackCExport command_result setAllMatching(DFHack::Core * c, checkTile checkProc,
|
2011-11-03 02:04:05 -06:00
|
|
|
DFHack::DFCoord minCoord, DFHack::DFCoord maxCoord)
|
|
|
|
{
|
|
|
|
//Initialization.
|
|
|
|
c->Suspend();
|
|
|
|
|
|
|
|
DFHack::Maps * Maps = c->getMaps();
|
|
|
|
DFHack::Gui * Gui = c->getGui();
|
|
|
|
// init the map
|
|
|
|
if(!Maps->Start())
|
|
|
|
{
|
|
|
|
c->con.printerr("Can't init map. Make sure you have a map loaded in DF.\n");
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
//Maximum map size.
|
|
|
|
uint32_t x_max,y_max,z_max;
|
|
|
|
Maps->getSize(x_max,y_max,z_max);
|
|
|
|
uint32_t tx_max = x_max * 16;
|
|
|
|
uint32_t ty_max = y_max * 16;
|
|
|
|
|
|
|
|
//Ensure maximum coordinate is within map. Truncate to map edge.
|
|
|
|
maxCoord.x = std::min((uint32_t) maxCoord.x, tx_max);
|
|
|
|
maxCoord.y = std::min((uint32_t) maxCoord.y, ty_max);
|
|
|
|
maxCoord.z = std::min(maxCoord.z, z_max);
|
|
|
|
|
|
|
|
//Check minimum co-ordinates against maximum map size
|
|
|
|
if (minCoord.x > maxCoord.x)
|
|
|
|
{
|
|
|
|
c->con.printerr("Minimum x coordinate is greater than maximum x coordinate.\n");
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
|
|
|
}
|
|
|
|
if (minCoord.y > maxCoord.y)
|
|
|
|
{
|
|
|
|
c->con.printerr("Minimum y coordinate is greater than maximum y coordinate.\n");
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
|
|
|
}
|
|
|
|
if (minCoord.z > maxCoord.y)
|
|
|
|
{
|
|
|
|
c->con.printerr("Minimum z coordinate is greater than maximum z coordinate.\n");
|
|
|
|
c->Resume();
|
|
|
|
return CR_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
MapExtras::MapCache * MCache = new MapExtras::MapCache(Maps);
|
|
|
|
|
|
|
|
c->con.print("Setting traffic...\n");
|
|
|
|
|
|
|
|
//Loop through every single tile
|
|
|
|
for(uint32_t x = minCoord.x; x <= maxCoord.x; x++)
|
|
|
|
{
|
|
|
|
for(uint32_t y = minCoord.y; y <= maxCoord.y; y++)
|
|
|
|
{
|
|
|
|
for(uint32_t z = minCoord.z; z <= maxCoord.z; z++)
|
|
|
|
{
|
|
|
|
DFHack::DFCoord tile = DFHack::DFCoord(x, y, z);
|
2011-11-17 20:31:56 -07:00
|
|
|
checkProc(tile, MCache);
|
2011-11-03 02:04:05 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
MCache->WriteAll();
|
|
|
|
c->con.print("Complete!\n");
|
|
|
|
c->Resume();
|
|
|
|
return CR_OK;
|
|
|
|
}
|
|
|
|
|
2011-11-17 20:31:56 -07:00
|
|
|
//Unconditionally set map to target traffic type
|
|
|
|
void allHigh(DFHack::DFCoord coord, MapExtras::MapCache * map)
|
2011-11-03 02:04:05 -06:00
|
|
|
{
|
2011-11-17 20:31:56 -07:00
|
|
|
DFHack::t_designation des = map->designationAt(coord);
|
|
|
|
des.bits.traffic = traffic_high;
|
|
|
|
map->setDesignationAt(coord, des);
|
2011-11-03 02:04:05 -06:00
|
|
|
}
|
2011-11-17 20:31:56 -07:00
|
|
|
void allNormal(DFHack::DFCoord coord, MapExtras::MapCache * map)
|
|
|
|
{
|
|
|
|
DFHack::t_designation des = map->designationAt(coord);
|
|
|
|
des.bits.traffic = traffic_normal;
|
|
|
|
map->setDesignationAt(coord, des);
|
|
|
|
}
|
|
|
|
void allLow(DFHack::DFCoord coord, MapExtras::MapCache * map)
|
|
|
|
{
|
|
|
|
DFHack::t_designation des = map->designationAt(coord);
|
|
|
|
des.bits.traffic = traffic_low;
|
|
|
|
map->setDesignationAt(coord, des);
|
|
|
|
}
|
|
|
|
void allRestricted(DFHack::DFCoord coord, MapExtras::MapCache * map)
|
2011-11-03 02:04:05 -06:00
|
|
|
{
|
2011-11-17 20:31:56 -07:00
|
|
|
DFHack::t_designation des = map->designationAt(coord);
|
|
|
|
des.bits.traffic = traffic_restricted;
|
|
|
|
map->setDesignationAt(coord, des);
|
2011-10-13 18:15:19 -06:00
|
|
|
}
|