31   for (unsigned i = 0, e = Matches[0]->first.size(); i != e; ++i) {  in FindFirstNonCommonLetter()
33     char Letter = Matches[0]->first[i];  in FindFirstNonCommonLetter()
36       if (Matches[str]->first[i] != Letter)  in FindFirstNonCommonLetter()
40   return Matches[0]->first.size();  in FindFirstNonCommonLetter()
56   if (CharNo == Matches[0]->first.size()) {  in EmitStringMatcherForChar()
64     OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n";  in EmitStringMatcherForChar()
69       OS << Indent << Split.first << "\n";  in EmitStringMatcherForChar()
79     MatchesByLetter[Matches[i]->first[CharNo]].push_back(Matches[i]);  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[Matches[i].first.size()].push_back(&Matches[i]);  in Emit()
148         << "case " << LI.first << ":\t // " << LI.second.size() << " string"  in Emit()