/external/antlr/runtime/C/src/ |
antlr3commontree.c | 97 factory->newTree = newPoolTree; 234 pANTLR3_BASE_TREE newTree; 236 newTree = factory->newTree(factory); 238 if (newTree == NULL) 245 ((pANTLR3_COMMON_TREE)(newTree->super))->token = tree->token; 246 newTree->u = tree->baseTree.u; // Copy any user pointer 248 return newTree; 254 pANTLR3_BASE_TREE newTree; 256 newTree = factory->newTree(factory) [all...] |
antlr3basetree.c | 263 pANTLR3_BASE_TREE newTree; 267 newTree = (pANTLR3_BASE_TREE)tree->dupNode (tree); 283 newTree->addChild(newTree, newNode); 288 return newTree; 343 replaceChildren (pANTLR3_BASE_TREE parent, ANTLR3_INT32 startChildIndex, ANTLR3_INT32 stopChildIndex, pANTLR3_BASE_TREE newTree) 365 if (newTree->isNilNode(newTree)) 367 newChildren = newTree->children; 378 newChildren->add(newChildren, (void *)newTree, NULL) [all...] |
antlr3basetreeadaptor.c | 469 pANTLR3_BASE_TREE newTree; 479 newTree = (pANTLR3_BASE_TREE)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/runtime/JavaScript/src/org/antlr/runtime/tree/ |
BaseTreeAdaptor.js | 42 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;
|
BaseTree.js | 137 var newTree = t; 140 if ( newTree.isNil() ) { 141 newChildren = newTree.children; 145 newChildren.push(newTree);
|
/external/antlr/runtime/C/include/ |
antlr3commontree.h | 151 pANTLR3_BASE_TREE (*newTree) (struct ANTLR3_ARBORETUM_struct * factory);
|
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
BaseTreeAdaptor.cs | 95 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;
|
BaseTree.cs | 284 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/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
BaseTreeAdaptor.java | 89 Object newTree = dupNode(t); 91 setChildIndex(newTree, getChildIndex(t)); // same index in new tree 92 setParent(newTree, parent); 97 addChild(newTree, newSubTree); 99 return newTree;
|
TreeRewriter.java | 104 public void reportTransformation(Object oldTree, Object newTree) { 106 ((Tree)newTree).toStringTree());
|
BaseTree.java | 205 BaseTree newTree = (BaseTree)t; 208 if ( newTree.isNil() ) { 209 newChildren = newTree.children; 213 newChildren.add(newTree);
|
/external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
BaseTree.cs | 359 ITree newTree = (ITree)t; 362 if ( newTree.IsNil ) 364 BaseTree baseTree = newTree as BaseTree; 372 int n = newTree.ChildCount; 374 newChildren.Add( newTree.GetChild( i ) ); 380 newChildren.Add( newTree );
|
TreeRewriter.cs | 135 protected virtual void ReportTransformation(object oldTree, object newTree) 138 ITree @new = newTree as ITree;
|
BaseTreeAdaptor.cs | 126 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/runtime/ObjC/Framework/ |
BaseTree.h | 35 + (id<BaseTree>) newTree; 36 + (id<BaseTree>) newTree:(id<BaseTree>)node; 110 + (id<BaseTree>) newTree; 111 + (id<BaseTree>) newTree:(id<BaseTree>)node;
|
CommonTree.h | 40 + (CommonTree *) newTree;
|
TreeRewriter.h | 68 - (void)reportTransformation:(CommonTree *)oldTree Tree:(CommonTree *)newTree;
|
/external/protobuf/java/core/src/main/java/com/google/protobuf/ |
RopeByteString.java | 631 ByteString newTree = prefixesStack.pop(); 635 newTree = new RopeByteString(left, newTree); 639 newTree = new RopeByteString(newTree, byteString); 643 depthBin = getDepthBinForLength(newTree.size()); 647 newTree = new RopeByteString(left, newTree); 652 prefixesStack.push(newTree);
|
/external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
BaseTree.as | 165 var newTree:BaseTree = BaseTree(t); 168 if ( newTree.isNil ) { 169 newChildren = newTree.children; 173 newChildren.push(newTree);
|
BaseTreeAdaptor.as | 56 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/runtime/Python/antlr3/ |
tree.py | 793 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 [all...] |
/external/antlr/runtime/Python3/antlr3/ |
tree.py | 789 def replaceChildren(self, startChildIndex, stopChildIndex, newTree): 804 if newTree.isNil(): 805 newChildren = newTree.children 808 newChildren = [newTree] 996 newTree = self.dupNode(t) 1001 self.setChildIndex(newTree, self.getChildIndex(t)) 1003 self.setParent(newTree, parent) 1008 self.addChild(newTree, newSubTree) 1010 return newTree [all...] |
/build/soong/bpfix/bpfix/ |
bpfix.go | 175 newTree, err := parse(f.tree.Name, bytes.NewReader(buf)) 179 f.tree = newTree 622 newTree, err := parse(f.tree.Name, newBuf) 627 f.tree = newTree
|
/external/icu/tools/srcgen/currysrc/libs/ |
org.eclipse.core.resources_3.13.0.v20180512-1138.jar | |
/external/kotlinc/lib/ |
kotlin-reflect.jar | |