78       ScoreScale(PatN ? float{1} / (PerfectBonus * PatN) : 0), WordN(0) {  in FuzzyMatcher()
98   auto Best = std::max(Scores[PatN][WordN][Miss].Score,  in match()
99                        Scores[PatN][WordN][Match].Score);  in match()
106   if (WordN == PatN)  in match()
182   WordN = std::min<int>(MaxWord, NewWord.size());  in init()
183   if (PatN > WordN)  in init()
185   std::copy(NewWord.begin(), NewWord.begin() + WordN, Word);  in init()
188   for (int I = 0; I < WordN; ++I)  in init()
193     if (W == WordN)  in init()
202   WordTypeSet = calculateRoles(llvm::StringRef(Word, WordN),  in init()
203                                llvm::makeMutableArrayRef(WordRole, WordN));  in init()
217   for (int W = 0; W < WordN; ++W) {  in buildGraph()
223     for (int W = P; W < WordN; ++W) {  in buildGraph()
310   OS << "=== Match \"" << llvm::StringRef(Word, WordN) << "\" against ["  in dumpLast()
314     return Result = llvm::StringRef(Word, WordN);  in dumpLast()
316   if (WordN == 0) {  in dumpLast()
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()
339   for (int W = WordN - 1, P = PatN - 1; W >= 0; --W) {  in dumpLast()
348   for (int I = 0; I < WordN; ++I) {  in dumpLast()
355   if (A[WordN - 1] == Match)  in dumpLast()
358   for (char C : llvm::StringRef(Word, WordN))  in dumpLast()
361   for (int I = 0, J = 0; I < WordN; I++)  in dumpLast()
364   for (int I = 0; I < WordN; I++)  in dumpLast()
369   OS << "\n'" << llvm::StringRef(Word, WordN) << "'\n ";  in dumpLast()
370   for (int I = 0; I < WordN; ++I)  in dumpLast()
379   for (char C : llvm::StringRef(Word, WordN))  in dumpLast()
382   OS << "-+----" << std::string(WordN * 4, '-') << "\n";  in dumpLast()
386       for (int J = 0; J <= WordN; ++J) {  in dumpLast()