82   Scores[0][0][Miss] = {0, Miss};
83   Scores[0][0][Match] = {AwfulScore, Miss};
87         Scores[P][W][A] = {AwfulScore, Miss};
98   auto Best = std::max(Scores[PatN][WordN][Miss].Score,  in match()
99                        Scores[PatN][WordN][Match].Score);  in match()
218     Scores[0][W + 1][Miss] = {Scores[0][W][Miss].Score - skipPenalty(W, Miss),  in buildGraph()
220     Scores[0][W + 1][Match] = {AwfulScore, Miss};  in buildGraph()
224       auto &Score = Scores[P + 1][W + 1], &PreMiss = Scores[P + 1][W];  in buildGraph()
236       auto &PreMatch = Scores[P][W];  in buildGraph()
323   } else if (isAwful(std::max(Scores[PatN][WordN][Match].Score,  in dumpLast()
324                               Scores[PatN][WordN][Miss].Score))) {  in dumpLast()
334       (Scores[PatN][WordN][Match].Score > Scores[PatN][WordN][Miss].Score)  in dumpLast()
341     const auto &Cell = Scores[P + 1][W + 1][Last];  in dumpLast()
344     const auto &Prev = Scores[P + 1][W][Cell.Prev];  in dumpLast()
387         if (!isAwful(Scores[I][J][A].Score))  in dumpLast()
388           OS << llvm::format("%3d%c", Scores[I][J][A].Score,  in dumpLast()
389                              Scores[I][J][A].Prev == Match ? '*' : ' ');  in dumpLast()