CONVERT_OBJS= convert.o ocr.o pages.o structure.o rgbimage.o resolve.o
COMMON_OBJS= common.o
-ROUTESEARCH_OBJS= rsvalue.o rsmain.o rssql.o
+ROUTESEARCH_OBJS= rsvalue.o rsmain.o rssql.o rssearch.o
yarrg: $(CONVERT_OBJS) $(COMMON_OBJS) -lnetpbm -lXtst -lX11 -lpcre -lm
$(CC) $(CFLAGS) $(LDFLAGS) -o $@ $^ $(LDLIBS)
DF(sql2) \
DF(value) \
DF(lp)
+
#define debug stdout
+#define DEBUG_DEV "/dev/stdout"
#include "common.h"
extern sqlite3 *db;
-void setup(void);
+void setup_sql(void);
double value_route(int nislands, const int *islands);
void setup_value(void);
-void setup_commods(void);
+void setup_search(void);
+void search(int start_isle);
extern double max_mass, max_volu, max_capi;
extern double distance_loss_factor_per_league;
+extern int max_dist;
#define LOSS_FACTOR_PER_DELAY_SLOT (1-1e-8)
+extern int islandtablesz;
+
+
#endif /*RSCOMMON_H*/
int o_quiet= 0;
double max_mass=-1, max_volu=-1, max_capi=-1;
double distance_loss_factor_per_league;
+int max_dist= -1;
int main(int argc, const char **argv) {
- int ia[argc], ni=0;
+ const char *arg;
debug_flags= ~( dbg_sql2 );
- setup();
+
+ setup_sql();
+ setup_value();
+ setup_search();
max_mass= atof(*++argv);
max_volu= atof(*++argv);
if (!loss_per_league) loss_per_league= 1e-7;
distance_loss_factor_per_league= 1.0 - loss_per_league;
- const char *arg;
- while ((arg= *++argv)) {
- ia[ni++]= atoi(arg);
+ arg= *++argv;
+ if (!strcmp(arg,"specific")) {
+ int ia[argc], ni=0;
+ while ((arg= *++argv))
+ ia[ni++]= atoi(arg);
+
+ double val= value_route(ni, ia);
+ printf("route value is %g\n", val);
+ } else if (!strcmp(arg,"search")) {
+ max_dist= atoi(*++argv);
+ while ((arg= *++argv))
+ search(atoi(arg));
+ } else {
+ abort();
}
- double val= value_route(ni, ia);
- printf("route value is %g\n", val);
return 0;
}
--- /dev/null
+/**/
+
+#include "rscommon.h"
+
+typedef struct Neighbour {
+ struct Neighbour *next;
+ int islandid;
+ int dist;
+} Neighbour;
+
+static Neighbour **neighbours; /* neighbours[islandid]->islandid etc. */
+static sqlite3_stmt *ss_neigh;
+
+static int ports[MAX_ROUTELEN];
+
+static Neighbour *get_neighbours(int isle) {
+ Neighbour **np= &neighbours[isle];
+ Neighbour *head= *np;
+ if (head) return head;
+
+ SQL_BIND(ss_neigh, 1, isle);
+ while (SQL_STEP(ss_neigh)) {
+ Neighbour *add= mmalloc(sizeof(*add));
+ add->islandid= sqlite3_column_int(ss_neigh, 0);
+ add->dist= sqlite3_column_int(ss_neigh, 1);
+ add->next= head;
+ head= add;
+ }
+ SQL_MUST( sqlite3_reset(ss_neigh) );
+
+ *np= head;
+ return head;
+}
+
+static double bestsofar;
+
+static void process_route(int nports) {
+ double value= value_route(nports, ports);
+ if (value < bestsofar) return;
+
+ fprintf(stderr,"value %20f route", value);
+ int i;
+ for (i=0; i<nports; i++)
+ fprintf(stderr," %d",ports[i]);
+ putc('\n',stderr);
+
+ bestsofar= value;
+}
+
+static void recurse(int last_isle,
+ int nports, /* excluding last_isle */
+ int totaldist /* including last_isle */) {
+ ports[nports++]= last_isle;
+ process_route(nports);
+ if (nports >= MAX_ROUTELEN) return;
+
+ Neighbour *add;
+ for (add= get_neighbours(last_isle); add; add=add->next) {
+ int newdist= totaldist + add->dist;
+ if (newdist > max_dist) continue;
+
+ recurse(add->islandid, nports, newdist);
+ }
+}
+
+void search(int start_isle) {
+ recurse(start_isle,0,0);
+}
+
+void setup_search(void) {
+ neighbours= mcalloc(sizeof(*neighbours) * islandtablesz);
+
+ SQL_PREPARE(ss_neigh,
+ "SELECT biid, dist FROM routes WHERE aiid=?");
+}
sqlite3 *db;
sqlite3_stmt *ss_ipair;
+int islandtablesz;
+
DEBUG_DEFINE_DEBUGF(sql);
static int busy_handler(void *u, int previous) {
return 1;
}
-void setup(void) {
+void setup_sql(void) {
sqlite3_stmt *sst;
SQL_MUST( sqlite3_open("OCEAN-Midnight.db", &db) );
assert( !SQL_STEP(sst) );
sqlite3_finalize(sst);
- setup_value();
+ islandtablesz= 1 + sql_single_int("SELECT max(islandid) FROM islands");
+ debugf("SQL islandtablesz=%d\n",islandtablesz);
}
int sql_single_int(const char *stmt) {
TradesBlock *trades;
} IslandPair;
-int nislands;
IslandPair ***ipairs; /* ipairs[sislandid][dislandid] */
typedef struct IslandTradeEnd {
int leg, startrow;
if (max_thing < 0 || !legs) return -1;
startrow= lpx_add_rows(lp, legs);
- for (leg=0; leg<nislands-1; leg++) {
+ for (leg=0; leg<legs; leg++) {
int row= leg+startrow;
lpx_set_row_bnds(lp, row, LPX_UP, 0, max_thing);
if (DEBUGP(value)) {
static IslandPair *ipair_get(int si, int di) {
IslandPair *ip, **ipa;
- assert(si < nislands);
- assert(di < nislands);
+ assert(si < islandtablesz);
+ assert(di < islandtablesz);
if (!(ipa= ipairs[si])) {
- ipa= ipairs[si]= mcalloc(sizeof(*ipa) * nislands);
+ ipa= ipairs[si]= mcalloc(sizeof(*ipa) * islandtablesz);
}
if ((ip= ipa[di]))
return ip;
double unit_profit= (t->dst_price - t->src_price) * loss_factor;
debugf(" unit profit %f\n", unit_profit);
-assert(unit_profit < 1e6);
lpx_set_col_bnds(lp, col, LPX_LO, 0, 0);
lpx_set_obj_coef(lp, col, unit_profit);
next_s:;
} /* for (s) */
- if (DEBUGP(lp))
- lpx_write_cpxlp(lp, (char*)"/dev/stdout");
+ double profit= 0;
- int ipr= lpx_interior(lp);
- assert(ipr==LPX_E_OK);
+ if (lpx_get_num_cols(lp)) {
+ if (DEBUGP(lp))
+ lpx_write_cpxlp(lp, (char*)DEBUG_DEV);
- if (DEBUGP(lp))
- lpx_print_ips(lp, (char*)"/dev/stdout");
+ int ipr= lpx_interior(lp);
+ assert(ipr==LPX_E_OK);
- assert(lpx_ipt_status(lp) == LPX_T_OPT);
- double profit= lpx_ipt_obj_val(lp);
+ if (DEBUGP(lp))
+ lpx_print_ips(lp, (char*)DEBUG_DEV);
+
+ assert(lpx_ipt_status(lp) == LPX_T_OPT);
+ profit= lpx_ipt_obj_val(lp);
+ }
lpx_delete_prob(lp);
lp= 0;
sqlite3_stmt *sst;
int i;
- nislands= sql_single_int("SELECT max(islandid) FROM islands") + 1;
- debugf("VALUE nislands=%d\n",nislands);
-
commodstablesz= sql_single_int("SELECT max(commodid) FROM commods") + 1;
commodstable= mmalloc(sizeof(*commodstable)*commodstablesz);
for (i=0; i<commodstablesz; i++)
BS(sell)
#undef BS
- ipairs= mcalloc(sizeof(*ipairs) * nislands);
+ ipairs= mcalloc(sizeof(*ipairs) * islandtablesz);
}