#define COUNTER_LIST \
CTR(commodities_loaded) \
CTR(trades_loaded) \
+ CTR(islands_arbitrage) \
+ CTR(ipairs_relevant) \
CTR(quantities_loaded) \
CTR(routes_considered) \
- CTR(routes_eliminated) \
+ CTR(routes_quickelim) \
+ CTR(routes_stratelim) \
CTR(routes_valued) \
+ CTR(newbests_strat_absolute) \
+ CTR(newbests_strat_perleague) \
CTR(subroute_tails_valued) \
CTR(subroutes_valued) \
CTR(subroutes_nonempty)
})
+typedef struct {
+ double value;
+ PotentialResult *pr;
+} HighScoreEntry;
+
+extern int nhighscores_absolute, nhighscores_perleague;
+extern HighScoreEntry *highscores_absolute;
+extern HighScoreEntry *highscores_perleague;
+
+
#define ONDEMAND(pointer_lvalue, calloc_size_count) \
((pointer_lvalue) ? : \
((pointer_lvalue) = mcalloc(sizeof(*(pointer_lvalue)) * calloc_size_count)))
+static inline int isle2arch(int isle) {
+ int arch= islandid2arch[isle];
+ assert(arch>=0);
+ return arch;
+}
+
+static inline int route2midarch(const int *ports, int nports) {
+ int archs[nports], last_arch=-1, narchs=0, i;
+ for (i=0; i<nports; i++) {
+ int arch= isle2arch(ports[i]);
+ if (arch==last_arch) continue;
+ archs[narchs++]= last_arch= arch;
+ }
+ return archs[narchs/2];
+}
+
+
#endif /*RSCOMMON_H*/