Lines Matching defs:Matches
935 // Check the new pack matches any previous value.
1222 /// means no matches, "success" found a single item, and the
1243 // successful matches. Visited contains the set of nodes we have already
1245 // visit. Matches contains a list of matches that have yet to be
1252 Matches;
1280 // If this was a successful deduction, add it to the list of matches,
1283 Matches.insert({NextT, DeducedCopy});
1288 // At this point, 'Matches' contains a list of seemingly valid bases, however
1290 // of one of the matches might be disqualified for being a base of another
1292 // simplify the disqualifications. That is, if A & B are both matches, and B
1294 if (Matches.size() > 1) {
1296 for (const auto &Match : Matches)
1301 while (Matches.size() > 1 && !ToVisit.empty()) {
1303 Matches.erase(NextT);
1306 // disqualifications for multiple matches.
1311 if (Matches.empty())
1313 if (Matches.size() > 1)
1316 std::swap(Matches.front().second, Deduced);
3072 // A partial specialization matches a given actual template
3124 // A partial specialization matches a given actual template
3403 /// template matches the actual argument type per C++ [temp.deduct.call]p4.
4370 // that the deduced function type matches the requested type.
4377 // so we can check that the exception specification matches.
Indexes created Tue Jun 23 00:25:03 UTC 2026