103         llvm::ArrayRef<const ForestNode *> Children;  in dumpRecursive()  local
105           return ChildIndex + 1 == Children.size()  in dumpRecursive()
107                      : Children[ChildIndex + 1]->startTokenIndex();  in dumpRecursive()
110           Children = P->alternatives();  in dumpRecursive()
112           Children = P->elements();  in dumpRecursive()
121             if (Children.size() == 1 && !SharedNode) {  in dumpRecursive()
122               assert(Children[0]->startTokenIndex() == P->startTokenIndex() &&  in dumpRecursive()
124               return Dump(Children[0], End,  in dumpRecursive()
152             Children = {}; // Don't walk the children again.  in dumpRecursive()
161         for (size_t I = 0; I < Children.size(); ++I) {  in dumpRecursive()
162           if (I == Children.size() - 1) {  in dumpRecursive()
169           Dump(Children[I], P->kind() == Sequence ? EndOfElement(I) : End,  in dumpRecursive()