X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~yarrgweb/git?p=ypp-sc-tools.db-live.git;a=blobdiff_plain;f=yarrg%2Frsmain.c;h=c76e7da0b9e0132af407a77cc7b05b88b4c324e6;hp=bde48a171209664e18f2d77de80ba5ad4e3c5d9a;hb=85fced6311966d8533ce8186f4f98ff8b6303619;hpb=d0f65e91f071ebb0fbc6791ee168e2be5ba8e5ae

diff --git a/yarrg/rsmain.c b/yarrg/rsmain.c
index bde48a1..c76e7da 100644
--- a/yarrg/rsmain.c
+++ b/yarrg/rsmain.c
@@ -2,6 +2,8 @@
 
 #include "rscommon.h"
 
+#include <ctype.h>
+
 int o_quiet= 0;
 double max_mass=-1, max_volu=-1, max_capi=-1;
 double distance_loss_factor_per_league;
@@ -59,16 +61,33 @@ int main(int argc, const char **argv) {
     printf("route value is %g\n", val);
   } else if (!strcmp(arg,"search")) {
     MCALLOC(results, argc);
+
     max_dist= atoi(*argv++);
+    nhighscores_absolute= atoi(*argv++);
+    nhighscores_perleague= atoi(*argv++);
+    const char *final_isle_spec= *argv++;
+
+    MCALLOC(highscores_absolute, nhighscores_absolute);
+    MCALLOC(highscores_perleague, nhighscores_perleague);
+
     int resultsix= 0;
-    while ((arg= *argv++)) {
-      search(atoi(arg), &results[resultsix]);
+    while ((arg= argv[resultsix])) {
+      int init_isle= atoi(arg);
+      
+      int final_isle;
+      if (!strcmp(final_isle_spec,"circ")) final_isle= init_isle;
+      else if (!strcmp(final_isle_spec,"any")) final_isle= -1;
+      else final_isle= atoi(final_isle_spec);
+      assert(final_isle);
+
+      search(init_isle, final_isle, &results[resultsix]);
       resultsix++;
     }
 
     int i, midarch, finarch;
     for (i=0; i<resultsix; i++) {
-      fprintf(stderr,"================== start #%d ==================\n",i);
+      fprintf(stderr,"============== start #%d %s [PARTIAL] ==============\n",
+	      i, argv[i]);
       PotentialResult ***strat_resultsix= results[i];
       if (!strat_resultsix) continue;
       fprintf(stderr,"  ");
@@ -93,6 +112,30 @@ int main(int argc, const char **argv) {
 	fprintf(stderr,"\n");
       }
     }
+
+    int pos;
+#define OUT(absperl)							      \
+    fprintf(stderr,"\n================== " #absperl " ==================\n"); \
+    for (pos=0; pos<nhighscores_##absperl; pos++) {			      \
+      HighScoreEntry *hs= &highscores_##absperl[pos];			      \
+      PotentialResult *pr= hs->pr;					      \
+      if (!pr) continue;						      \
+      const int *const ports= pr->absperl##_ports;			      \
+      int nports;							      \
+      for (nports=0; nports<MAX_ROUTELEN && ports[nports]>=0; nports++);      \
+      int finisle= ports[nports-1]; int finarch= isle2arch(finisle);	      \
+      int midarch= route2midarch(ports,nports);				      \
+      fprintf(stderr,							      \
+	      " @%2d #%2d | start%3d mid%d f%d:%3d | %5d %5d %4d |",     \
+	      pos, nhighscores_##absperl - 1 - pos,			      \
+	      ports[0], midarch, finarch,finisle,		      \
+	      (int)hs->value, (int)pr->absolute, (int)pr->perleague);	      \
+      for (i=0; i<nports; i++) fprintf(stderr," %d",ports[i]);		      \
+      fprintf(stderr,"\n"); 						      \
+    }
+    OUT(absolute)
+    OUT(perleague)
+    
   } else {
     abort();
   }