/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
ITreeNodeStream.cs | 132 void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t);
|
BaseTree.cs | 264 public virtual void ReplaceChildren(int startChildIndex, int stopChildIndex, object t) { 265 if (startChildIndex < 0) 271 if (stopChildIndex < startChildIndex) 275 System.out.println("replaceChildren "+startChildIndex+", "+stopChildIndex+ 282 int replacingHowMany = stopChildIndex - startChildIndex + 1; 307 for (int i = startChildIndex; i <= stopChildIndex; i++) { 318 children[startChildIndex + j] = newChildren[j]; 320 int indexToDelete = startChildIndex + numNewChildren; 325 FreshenParentAndChildIndexes(startChildIndex); 330 children[startChildIndex + j] = newChildren[j] [all...] |
ITree.cs | 106 void ReplaceChildren(int startChildIndex, int stopChildIndex, object t);
|
CommonTreeAdaptor.cs | 212 public override void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t) { 214 ((ITree)parent).ReplaceChildren(startChildIndex, stopChildIndex, t);
|
CommonTreeNodeStream.cs | 190 public virtual void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t) { 192 TreeAdaptor.ReplaceChildren(parent, startChildIndex, stopChildIndex, t);
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
ITreeNodeStream.cs | 139 void ReplaceChildren( object parent, int startChildIndex, int stopChildIndex, object t );
|
BaseTree.cs | 313 public virtual void ReplaceChildren( int startChildIndex, int stopChildIndex, object t ) 315 if (startChildIndex < 0) 321 if (stopChildIndex < startChildIndex) 325 System.out.println("replaceChildren "+startChildIndex+", "+stopChildIndex+ 333 int replacingHowMany = stopChildIndex - startChildIndex + 1; 365 for ( int i = startChildIndex; i <= stopChildIndex; i++ ) 380 Children[startChildIndex + j] = newChildren[j]; 382 int indexToDelete = startChildIndex + numNewChildren; 388 FreshenParentAndChildIndexes( startChildIndex ); 396 Children[startChildIndex + j] = newChildren[j] [all...] |
ITree.cs | 111 void ReplaceChildren( int startChildIndex, int stopChildIndex, object t );
|
CommonTreeNodeStream.cs | 219 public virtual void ReplaceChildren( object parent, int startChildIndex, int stopChildIndex, object t ) 223 TreeAdaptor.ReplaceChildren( parent, startChildIndex, stopChildIndex, t );
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/Tree/ |
ITreeNodeStream`1.cs | 138 void ReplaceChildren(T parent, int startChildIndex, int stopChildIndex, T t);
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
BaseTree.java | 181 public void replaceChildren(int startChildIndex, int stopChildIndex, Object t) { 183 System.out.println("replaceChildren "+startChildIndex+", "+stopChildIndex+ 190 int replacingHowMany = stopChildIndex - startChildIndex + 1; 208 for (int i=startChildIndex; i<=stopChildIndex; i++) { 219 children.set(startChildIndex+j, newChildren.get(j)); 221 int indexToDelete = startChildIndex+numNewChildren; 226 freshenParentAndChildIndexes(startChildIndex); 231 children.set(startChildIndex+j, newChildren.get(j)); 235 children.add(startChildIndex+j, newChildren.get(j)); 237 freshenParentAndChildIndexes(startChildIndex); [all...] |
TreeNodeStream.java | 105 public void replaceChildren(Object parent, int startChildIndex, int stopChildIndex, Object t);
|
Tree.java | 91 public void replaceChildren(int startChildIndex, int stopChildIndex, Object t);
|
CommonTreeAdaptor.java | 163 public void replaceChildren(Object parent, int startChildIndex, int stopChildIndex, Object t) { 165 ((Tree)parent).replaceChildren(startChildIndex, stopChildIndex, t);
|
CommonTreeNodeStream.java | 144 public void replaceChildren(Object parent, int startChildIndex, int stopChildIndex, Object t) { 146 adaptor.replaceChildren(parent, startChildIndex, stopChildIndex, t);
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
BaseTree.js | 131 replaceChildren: function(startChildIndex, stopChildIndex, t) { 135 var replacingHowMany = stopChildIndex - startChildIndex + 1; 154 for (i=startChildIndex; i<=stopChildIndex; i++) { 165 this.children[startChildIndex+j] = newChildren[j]; 167 indexToDelete = startChildIndex+numNewChildren; 172 this.freshenParentAndChildIndexes(startChildIndex); 177 this.children[startChildIndex+j] = newChildren[j]; 181 this.children.splice(startChildIndex+j, 0, newChildren[j]); 183 this.freshenParentAndChildIndexes(startChildIndex);
|
CommonTreeAdaptor.js | 166 replaceChildren: function(parent, startChildIndex, stopChildIndex, t) { 168 parent.replaceChildren(startChildIndex, stopChildIndex, t);
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
TreeNodeStream.as | 98 function replaceChildren(parent:Object, startChildIndex:int, stopChildIndex:int, t:Object):void;
|
BaseTree.as | 159 public function replaceChildren(startChildIndex:int, stopChildIndex:int, t:Object):void { 163 var replacingHowMany:int = stopChildIndex - startChildIndex + 1; 181 for (var i:int=startChildIndex; i<=stopChildIndex; i++) { 192 children[startChildIndex+j] = newChildren[j]; 194 var indexToDelete:int = startChildIndex+numNewChildren; 199 freshenParentAndChildIndexesFrom(startChildIndex); 204 children[startChildIndex+j] = newChildren[j]; 208 children.splice(startChildIndex+j, 0, newChildren[j]); 210 freshenParentAndChildIndexesFrom(startChildIndex);
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRTreeNodeStream.h | 49 - (void) replaceChildren:(id)parent From:(NSInteger)startChildIndex To:(NSInteger)stopChildIndex With:(id) t;
|
ANTLRTree.h | 80 - (void) replaceChildrenFrom:(NSInteger)startChildIndex To:(NSInteger)stopChildIndex With:(id)t;
|
/external/antlr/antlr-3.4/runtime/C/src/ |
antlr3basetree.c | 46 static void replaceChildren (pANTLR3_BASE_TREE parent, ANTLR3_INT32 startChildIndex, ANTLR3_INT32 stopChildIndex, pANTLR3_BASE_TREE t); 339 replaceChildren (pANTLR3_BASE_TREE parent, ANTLR3_INT32 startChildIndex, ANTLR3_INT32 stopChildIndex, pANTLR3_BASE_TREE newTree) 381 replacingHowMany = stopChildIndex - startChildIndex + 1; 395 for (i = startChildIndex; i <= stopChildIndex; i++) 412 parent->children->set(parent->children, startChildIndex + j, newChildren->get(newChildren, j), NULL, ANTLR3_FALSE); 417 indexToDelete = startChildIndex + numNewChildren; 424 parent->freshenPACIndexes(parent, startChildIndex); 435 parent->children->set(parent->children, startChildIndex + j, newChildren->get(newChildren, j), NULL, ANTLR3_FALSE); 445 parent->freshenPACIndexes(parent, startChildIndex);
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
DebugTreeNodeStream.cs | 175 public virtual void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t) { 176 input.ReplaceChildren(parent, startChildIndex, stopChildIndex, t);
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
DebugTreeNodeStream.cs | 206 public virtual void ReplaceChildren( object parent, int startChildIndex, int stopChildIndex, object t ) 208 input.ReplaceChildren( parent, startChildIndex, stopChildIndex, t );
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
DebugTreeNodeStream.java | 148 public void replaceChildren(Object parent, int startChildIndex, int stopChildIndex, Object t) { 149 input.replaceChildren(parent, startChildIndex, stopChildIndex, t);
|