Lines Matching refs:InnerMatchers

25                       ArrayRef<DynTypedMatcher> InnerMatchers);
30 ArrayRef<DynTypedMatcher> InnerMatchers);
35 ArrayRef<DynTypedMatcher> InnerMatchers);
40 ArrayRef<DynTypedMatcher> InnerMatchers);
55 BoundNodesTreeBuilder *Builder, ArrayRef<DynTypedMatcher> InnerMatchers);
60 VariadicMatcher(std::vector<DynTypedMatcher> InnerMatchers)
61 : InnerMatchers(std::move(InnerMatchers)) {}
66 return Func(DynNode, Finder, Builder, InnerMatchers);
70 std::vector<DynTypedMatcher> InnerMatchers;
113 std::vector<DynTypedMatcher> InnerMatchers) {
114 assert(InnerMatchers.size() > 0 && "Array must not be empty.");
115 assert(std::all_of(InnerMatchers.begin(), InnerMatchers.end(),
116 [&InnerMatchers](const DynTypedMatcher &M) {
117 return InnerMatchers[0].SupportedKind.isSame(M.SupportedKind);
121 auto SupportedKind = InnerMatchers[0].SupportedKind;
134 for (auto &IM : InnerMatchers) {
140 new VariadicMatcher<AllOfVariadicOperator>(std::move(InnerMatchers)));
145 new VariadicMatcher<AnyOfVariadicOperator>(std::move(InnerMatchers)));
150 new VariadicMatcher<EachOfVariadicOperator>(std::move(InnerMatchers)));
157 new VariadicMatcher<NotUnaryOperator>(std::move(InnerMatchers)));
233 ArrayRef<DynTypedMatcher> InnerMatchers) {
234 if (InnerMatchers.size() != 1)
248 return !InnerMatchers[0].matches(DynNode, Finder, &Discard);
254 ArrayRef<DynTypedMatcher> InnerMatchers) {
258 for (const DynTypedMatcher &InnerMatcher : InnerMatchers) {
268 ArrayRef<DynTypedMatcher> InnerMatchers) {
271 for (const DynTypedMatcher &InnerMatcher : InnerMatchers) {
285 ArrayRef<DynTypedMatcher> InnerMatchers) {
286 for (const DynTypedMatcher &InnerMatcher : InnerMatchers) {