32   for (unsigned i = 0, e = Matches[0]->first.size(); i != e; ++i) {  in FindFirstNonCommonLetter()
34     char Letter = Matches[0]->first[i];  in FindFirstNonCommonLetter()
37       if (Match->first[i] != Letter)  in FindFirstNonCommonLetter()
41   return Matches[0]->first.size();  in FindFirstNonCommonLetter()
57   if (CharNo == Matches[0]->first.size()) {  in EmitStringMatcherForChar()
65     OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n";  in EmitStringMatcherForChar()
70       OS << Indent << Split.first << "\n";  in EmitStringMatcherForChar()
80     MatchesByLetter[Match->first[CharNo]].push_back(Match);  in EmitStringMatcherForChar()
93       << Matches[0]->first[CharNo] << "')\n";  in EmitStringMatcherForChar()
99          << ", \"" << Matches[0]->first.substr(CharNo, NumChars) << "\", "  in EmitStringMatcherForChar()
115     OS << Indent << "case '" << LI.first << "':\t // " << LI.second.size()  in EmitStringMatcherForChar()
139     MatchesByLength[Match.first.size()].push_back(&Match);  in Emit()
148         << "case " << LI.first << ":\t // " << LI.second.size() << " string"  in Emit()