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 (Matches[str]->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[Matches[i]->first[CharNo]].push_back(Matches[i]);  in EmitStringMatcherForChar()
94       << Matches[0]->first[CharNo] << "')\n";  in EmitStringMatcherForChar()
100          << ", \"" << Matches[0]->first.substr(CharNo, NumChars) << "\", "  in EmitStringMatcherForChar()
117     OS << Indent << "case '" << LI->first << "':\t // "  in EmitStringMatcherForChar()
140     MatchesByLength[Matches[i].first.size()].push_back(&Matches[i]);  in Emit()
149     OS.indent(Indent*2+2) << "case " << LI->first << ":\t // "  in Emit()