1708     Trees.push_back(ParseTreePattern(RawPat->getElement(i), ""));  in TreePattern()
1714   Trees.push_back(ParseTreePattern(Pat, ""));  in TreePattern()
1720   Trees.push_back(Pat);  in TreePattern()
1729   for (unsigned i = 0, e = Trees.size(); i != e; ++i)  in ComputeNamedNodes()
1730     ComputeNamedNodes(Trees[i]);  in ComputeNamedNodes()
1923     for (unsigned i = 0, e = Trees.size(); i != e; ++i) {  in InferAllTypes()
1924       MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);  in InferAllTypes()
1925       MadeChange |= SimplifyTree(Trees[i]);  in InferAllTypes()
1950           if (Nodes[i] == Trees[0] && Nodes[i]->isLeaf()) {  in InferAllTypes()
1981   for (unsigned i = 0, e = Trees.size(); i != e; ++i)  in InferAllTypes()
1982     HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();  in InferAllTypes()
1996   if (Trees.size() > 1)  in print()
1998   for (unsigned i = 0, e = Trees.size(); i != e; ++i) {  in print()
2000     Trees[i]->print(OS);  in print()
2004   if (Trees.size() > 1)  in print()