Searched refs:newTree (Results 1 - 25 of 30) sorted by relevance

12

/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3commontree.c97 factory->newTree = newPoolTree;
215 pANTLR3_BASE_TREE newTree; local
217 newTree = factory->newTree(factory);
219 if (newTree == NULL)
226 ((pANTLR3_COMMON_TREE)(newTree->super))->token = tree->token;
227 newTree->u = tree->baseTree.u; // Copy any user pointer
229 return newTree;
235 pANTLR3_BASE_TREE newTree; local
237 newTree
355 pANTLR3_COMMON_TREE newTree; local
[all...]
H A Dantlr3basetree.c259 pANTLR3_BASE_TREE newTree; local
263 newTree = tree->dupNode (tree);
279 newTree->addChild(newTree, newNode);
284 return newTree;
339 replaceChildren (pANTLR3_BASE_TREE parent, ANTLR3_INT32 startChildIndex, ANTLR3_INT32 stopChildIndex, pANTLR3_BASE_TREE newTree) argument
361 if (newTree->isNilNode(newTree))
363 newChildren = newTree->children;
374 newChildren->add(newChildren, (void *)newTree, NUL
[all...]
H A Dantlr3basetreeadaptor.c469 pANTLR3_BASE_TREE newTree; local
479 newTree = t->dupNode(t);
483 adaptor->setChildIndex (adaptor, newTree, t->getChildIndex(t));
484 adaptor->setParent (adaptor, newTree, parent);
491 adaptor->addChild (adaptor, newTree, newSubTree);
493 return newTree;
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DBaseTreeAdaptor.cs95 object newTree = DupNode(t);
97 SetChildIndex(newTree, GetChildIndex(t)); // same index in new tree
98 SetParent(newTree, parent);
103 AddChild(newTree, newSubTree);
105 return newTree;
H A DBaseTree.cs284 ITree newTree = (ITree)t;
287 if (newTree.IsNil) {
288 BaseTree baseTree = newTree as BaseTree;
293 int n = newTree.ChildCount;
295 newChildren.Add(newTree.GetChild(i));
299 newChildren.Add(newTree);
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DBaseTreeAdaptor.js42 var newTree = this.dupNode(t);
44 this.setChildIndex(newTree, this.getChildIndex(t)); // same index in new tree
45 this.setParent(newTree, parent);
51 this.addChild(newTree, newSubTree);
53 return newTree;
H A DBaseTree.js137 var newTree = t;
140 if ( newTree.isNil() ) {
141 newChildren = newTree.children;
145 newChildren.push(newTree);
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3commontree.h151 pANTLR3_BASE_TREE (*newTree) (struct ANTLR3_ARBORETUM_struct * factory); member in struct:ANTLR3_ARBORETUM_struct
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DTreeRewriter.cs135 protected virtual void ReportTransformation(object oldTree, object newTree) argument
138 ITree @new = newTree as ITree;
H A DBaseTree.cs335 ITree newTree = (ITree)t;
338 if ( newTree.IsNil )
340 BaseTree baseTree = newTree as BaseTree;
348 int n = newTree.ChildCount;
350 newChildren.Add( newTree.GetChild( i ) );
356 newChildren.Add( newTree );
H A DBaseTreeAdaptor.cs126 object newTree = DupNode( t );
128 SetChildIndex( newTree, GetChildIndex( t ) ); // same index in new tree
129 SetParent( newTree, parent );
135 AddChild( newTree, newSubTree );
137 return newTree;
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DBaseTreeAdaptor.java85 Object newTree = dupNode(t);
87 setChildIndex(newTree, getChildIndex(t)); // same index in new tree
88 setParent(newTree, parent);
93 addChild(newTree, newSubTree);
95 return newTree;
H A DTreeRewriter.java102 public void reportTransformation(Object oldTree, Object newTree) { argument
104 ((Tree)newTree).toStringTree());
H A DBaseTree.java192 BaseTree newTree = (BaseTree)t;
195 if ( newTree.isNil() ) {
196 newChildren = newTree.children;
200 newChildren.add(newTree);
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRTreeRewriter.h66 - (void)reportTransformation:(id<ANTLRTree>)oldTree Tree:(id<ANTLRTree>)newTree;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRTreeRewriter.h66 - (void)reportTransformation:(id<ANTLRTree>)oldTree Tree:(id<ANTLRTree>)newTree;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRTreeRewriter.h66 - (void)reportTransformation:(id<ANTLRTree>)oldTree Tree:(id<ANTLRTree>)newTree;
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRBaseTree.h35 + (id<ANTLRBaseTree>) newTree; variable
36 + (id<ANTLRBaseTree>) newTree:(id<ANTLRBaseTree>)node;
110 + (id<ANTLRBaseTree>) newTree; variable
111 + (id<ANTLRBaseTree>) newTree:(id<ANTLRBaseTree>)node;
H A DANTLRCommonTree.h40 + (ANTLRCommonTree *) newTree; variable
H A DANTLRTreeRewriter.h68 - (void)reportTransformation:(ANTLRCommonTree *)oldTree Tree:(ANTLRCommonTree *)newTree;
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DBaseTree.as165 var newTree:BaseTree = BaseTree(t);
168 if ( newTree.isNil ) {
169 newChildren = newTree.children;
173 newChildren.push(newTree);
H A DBaseTreeAdaptor.as56 var newTree:Object = dupNode(t);
58 setChildIndex(newTree, getChildIndex(t)); // same index in new tree
59 setParent(newTree, parent);
64 addChild(newTree, newSubTree);
66 return newTree;
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Dtree.py793 def replaceChildren(self, startChildIndex, stopChildIndex, newTree):
809 if newTree.isNil():
810 newChildren = newTree.children
813 newChildren = [newTree]
1003 newTree = self.dupNode(t)
1008 self.setChildIndex(newTree, self.getChildIndex(t))
1010 self.setParent(newTree, parent)
1015 self.addChild(newTree, newSubTree)
1017 return newTree
/external/fonttools/Lib/fontTools/ttLib/tables/
H A DotBase.py331 newTree = 1
333 newTree = 0
339 if newTree:
/external/fonttools/Tools/fontTools/ttLib/tables/
H A DotBase.py331 newTree = 1
333 newTree = 0
339 if newTree:

Completed in 1527 milliseconds

12