Lines Matching refs:Matches
29 StringMatcher::StringPair*> &Matches) {
30 assert(!Matches.empty());
31 for (unsigned i = 0, e = Matches[0]->first.size(); i != e; ++i) {
33 char Letter = Matches[0]->first[i];
35 for (unsigned str = 0, e = Matches.size(); str != e; ++str)
36 if (Matches[str]->first[i] != Letter)
40 return Matches[0]->first.size();
49 const std::vector<const StringPair *> &Matches, unsigned CharNo,
51 assert(!Matches.empty() && "Must have at least one string to match!");
56 if (CharNo == Matches[0]->first.size()) {
57 if (Matches.size() > 1 && !IgnoreDuplicates)
61 StringRef Code = Matches[0]->second;
64 OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n";
78 for (unsigned i = 0, e = Matches.size(); i != e; ++i)
79 MatchesByLetter[Matches[i]->first[CharNo]].push_back(Matches[i]);
85 unsigned FirstNonCommonLetter = FindFirstNonCommonLetter(Matches);
93 << Matches[0]->first[CharNo] << "')\n";
99 << ", \"" << Matches[0]->first.substr(CharNo, NumChars) << "\", "
104 return EmitStringMatcherForChar(Matches, FirstNonCommonLetter, IndentCount,
133 if (Matches.empty()) return;
138 for (unsigned i = 0, e = Matches.size(); i != e; ++i)
139 MatchesByLength[Matches[i].first.size()].push_back(&Matches[i]);