+
+ for (ap=0; ap<AP; ap++) {
+ int pos;
+ fprintf(output,"\n================== ap=%d ==================\n", ap);
+ for (pos=0; pos<nhighscores[ap]; pos++) {
+ HighScoreEntry *hs= &highscores[ap][pos];
+ PotentialResult *pr= hs->pr;
+ if (!pr) continue;
+ const int *const ports= pr->ports[ap];
+ 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(output,
+ " @%2d #%2d | start%3d mid%d f%d:%3d | %5d %5d %4d |", \
+ pos, nhighscores[ap] - 1 - pos,
+ ports[0], midarch, finarch,finisle, \
+ (int)hs->value, (int)pr->value[A], (int)pr->value[P]);
+ for (i=0; i<nports; i++) fprintf(output," %d",ports[i]);
+ fprintf(output,"\n");
+ }
+ }
+ fprintf(output,"\n");
+