- }
- }
-
- 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");
- }
- }
+ for (fin=0; fin<granusz_fin[granui]; fin++) {
+ Bucket **buckets_fin= buckets_resultsix[fin];
+ if (!buckets_fin) continue;
+ tabdebugf("f%-3d",fin);
+ for (mid=0; mid<granusz_mid[granui]; mid++) {
+ Bucket *result= buckets_fin[mid];
+ if (!result) {
+ tabdebugf("| ");
+ } else {
+ tabdebugf("|%5d",(int)(result->prs[A].value[A]));
+ tabdebugf(" ");
+ tabdebugf("%4d",(int)(result->prs[P].value[P]));
+ }
+ }
+ tabdebugf("\n");
+ }
+ } /* i */
+
+ for (ap=0; ap<AP; ap++) {
+ int pos;
+ fprintf(output,"============== granui%d ap=%d ==============\n",
+ granui, ap);
+ for (pos=nhighscores[granui][ap]-1; pos>=0; pos--) {
+ HighScoreEntry *hs= &highscores[granui][ap][pos];
+ Bucket *bucket= hs->bucket;
+ if (!bucket) continue;
+ OnePotentialResult *pr= &bucket->prs[ap];
+ const int *const ports= pr->ports;
+ int nports;
+ for (nports=0; nports<MAX_ROUTELEN && ports[nports]>=0; nports++);
+ int finisle= ports[nports-1];
+ int finarch= isle2arch(finisle);
+ int midisle= ports[nports/2];
+ int midarch= route2midarch(ports,nports);
+ fprintf(output,
+ " @%2d %c#%2d | start%3d mid%d:%3d f%d:%3d"
+ " | %3dlg | %5d %5d %4d |",
+ pos, "ap"[ap], nhighscores[granui][ap] - pos,
+ ports[0], midarch,midisle, finarch,finisle, pr->length,
+ (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");
+ } /* pos */
+ } /* ap */
+ } /* granui */