Searched refs:newRootTree (Results 1 – 9 of 9) sorted by relevance
100 var newRootTree = newRoot,106 if ( newRootTree.isNil() ) {107 var nc = newRootTree.getChildCount();109 newRootTree = newRootTree.getChild(0);118 newRootTree.addChild(oldRootTree);119 return newRootTree;
620 becomeRoot (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE newRootTree, pANTLR3_BASE_TREE old… in becomeRoot() argument628 if (newRootTree == NULL) in becomeRoot()638 return newRootTree; in becomeRoot()643 if (newRootTree->isNilNode(newRootTree)) in becomeRoot()645 if (newRootTree->getChildCount(newRootTree) > 1) in becomeRoot()650 return newRootTree; in becomeRoot()656 saveRoot = newRootTree; in becomeRoot()657 newRootTree = (pANTLR3_BASE_TREE)newRootTree->getChild(newRootTree, 0); in becomeRoot()668 newRootTree->addChild(newRootTree, oldRootTree); in becomeRoot()687 return newRootTree; in becomeRoot()[all …]
155 ITree newRootTree = (ITree)newRoot; in BecomeRoot()161 if (newRootTree.IsNil) { in BecomeRoot()162 int nc = newRootTree.ChildCount; in BecomeRoot()164 newRootTree = (ITree)newRootTree.GetChild(0); in BecomeRoot()173 newRootTree.AddChild(oldRootTree); in BecomeRoot()174 return newRootTree; in BecomeRoot()
145 Tree newRootTree = (Tree)newRoot; in becomeRoot() local151 if ( newRootTree.isNil() ) { in becomeRoot()152 int nc = newRootTree.getChildCount(); in becomeRoot()153 if ( nc==1 ) newRootTree = newRootTree.getChild(0); in becomeRoot()162 newRootTree.addChild(oldRootTree); in becomeRoot()163 return newRootTree; in becomeRoot()
190 ITree newRootTree = (ITree)newRoot; in BecomeRoot()197 if ( newRootTree.IsNil ) in BecomeRoot()199 int nc = newRootTree.ChildCount; in BecomeRoot()201 newRootTree = (ITree)newRootTree.GetChild( 0 ); in BecomeRoot()211 newRootTree.AddChild( oldRootTree ); in BecomeRoot()212 return newRootTree; in BecomeRoot()
98 …s>::TreeType* CommonTreeAdaptor<ImplTraits>::becomeRoot( TreeType* newRootTree, TreeType* oldR… argument106 if (newRootTree == NULL)116 return newRootTree;121 if (newRootTree->isNilNode())123 if (newRootTree->getChildCount() > 1)128 return newRootTree;134 saveRoot = newRootTree;135 newRootTree = newRootTree->getChild(0);146 newRootTree->addChild(oldRootTree);165 return newRootTree;[all …]
145 TreeType* becomeRoot( TreeType* newRootTree, TreeType* oldRootTree );
114 var newRootTree:Tree = Tree(newRoot);120 if ( newRootTree.isNil ) {121 var nc:int = newRootTree.childCount;122 if ( nc==1 ) newRootTree = Tree(newRootTree.getChild(0));131 newRootTree.addChild(oldRootTree);132 return newRootTree;
178 id newRootTree = (id)newRoot;181 if ( [newRootTree isNil] ) {182 NSInteger nc = [newRootTree getChildCount];183 if ( nc == 1 ) newRootTree = [(id)newRootTree getChild:0];192 [newRootTree addChild:oldRootTree];193 return newRootTree;