Searched refs:startChildIndex (Results 1 - 25 of 73) sorted by relevance

123

/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DITreeNodeStream.cs132 void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t); argument
H A DBaseTree.cs264 public virtual void ReplaceChildren(int startChildIndex, int stopChildIndex, object t) { argument
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
[all...]
H A DITree.cs106 void ReplaceChildren(int startChildIndex, int stopChildIndex, object t); argument
H A DCommonTreeAdaptor.cs212 public override void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t) { argument
214 ((ITree)parent).ReplaceChildren(startChildIndex, stopChildIndex, t);
H A DCommonTreeNodeStream.cs190 public virtual void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t) { argument
192 TreeAdaptor.ReplaceChildren(parent, startChildIndex, stopChildIndex, t);
H A DITreeAdaptor.cs322 void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t); argument
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DITreeNodeStream.cs139 void ReplaceChildren( object parent, int startChildIndex, int stopChildIndex, object t ); argument
H A DBaseTree.cs313 public virtual void ReplaceChildren( int startChildIndex, int stopChildIndex, object t ) argument
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
[all...]
H A DITree.cs111 void ReplaceChildren( int startChildIndex, int stopChildIndex, object t ); argument
H A DCommonTreeNodeStream.cs219 public virtual void ReplaceChildren( object parent, int startChildIndex, int stopChildIndex, object t ) argument
223 TreeAdaptor.ReplaceChildren( parent, startChildIndex, stopChildIndex, t );
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/Tree/
H A DITreeNodeStream`1.cs138 void ReplaceChildren(T parent, int startChildIndex, int stopChildIndex, T t); argument
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DBaseTree.java181 public void replaceChildren(int startChildIndex, int stopChildIndex, Object t) { argument
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...]
H A DTreeNodeStream.java105 public void replaceChildren(Object parent, int startChildIndex, int stopChildIndex, Object t); argument
H A DTree.java91 public void replaceChildren(int startChildIndex, int stopChildIndex, Object t); argument
H A DCommonTreeAdaptor.java163 public void replaceChildren(Object parent, int startChildIndex, int stopChildIndex, Object t) { argument
165 ((Tree)parent).replaceChildren(startChildIndex, stopChildIndex, t);
H A DCommonTreeNodeStream.java144 public void replaceChildren(Object parent, int startChildIndex, int stopChildIndex, Object t) { argument
146 adaptor.replaceChildren(parent, startChildIndex, stopChildIndex, t);
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DBaseTree.js131 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);
H A DCommonTreeAdaptor.js166 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/
H A DTreeNodeStream.as98 function replaceChildren(parent:Object, startChildIndex:int, stopChildIndex:int, t:Object):void;
H A DBaseTree.as159 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/
H A DANTLRTreeNodeStream.h49 - (void) replaceChildren:(id)parent From:(NSInteger)startChildIndex To:(NSInteger)stopChildIndex With:(id) t;
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3basetree.c46 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) argument
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/
H A DDebugTreeNodeStream.cs175 public virtual void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t) { argument
176 input.ReplaceChildren(parent, startChildIndex, stopChildIndex, t);
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
H A DDebugTreeNodeStream.cs206 public virtual void ReplaceChildren( object parent, int startChildIndex, int stopChildIndex, object t ) argument
208 input.ReplaceChildren( parent, startChildIndex, stopChildIndex, t );
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/
H A DDebugTreeNodeStream.java148 public void replaceChildren(Object parent, int startChildIndex, int stopChildIndex, Object t) { argument
149 input.replaceChildren(parent, startChildIndex, stopChildIndex, t);

Completed in 571 milliseconds

123