Home
last modified time | relevance | path

Searched refs:indexToDelete (Results 1 – 7 of 7) sorted by relevance

/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
DBaseTree.js150 var j, i, child, indexToDelete, c, killed, numToInsert;
167 indexToDelete = startChildIndex+numNewChildren;
168 for (c=indexToDelete; c<=stopChildIndex; c++) {
170 killed = this.children.splice(indexToDelete, 1)[0];
/external/antlr/antlr-3.4/runtime/C/src/
Dantlr3basetree.c405 ANTLR3_UINT32 indexToDelete; in replaceChildren() local
417 indexToDelete = startChildIndex + numNewChildren; in replaceChildren()
419 for (j = indexToDelete; j <= (ANTLR3_INT32)stopChildIndex; j++) in replaceChildren()
421 parent->children->remove(parent->children, indexToDelete); in replaceChildren()
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DBaseTree.cs382 int indexToDelete = startChildIndex + numNewChildren; in ReplaceChildren()
383 for ( int c = indexToDelete; c <= stopChildIndex; c++ ) in ReplaceChildren()
386 Children.RemoveAt( indexToDelete ); in ReplaceChildren()
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DBaseTree.cs320 int indexToDelete = startChildIndex + numNewChildren; in ReplaceChildren()
321 for (int c = indexToDelete; c <= stopChildIndex; c++) { in ReplaceChildren()
323 children.RemoveAt(indexToDelete); in ReplaceChildren()
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
DBaseTree.java221 int indexToDelete = startChildIndex+numNewChildren; in replaceChildren() local
222 for (int c=indexToDelete; c<=stopChildIndex; c++) { in replaceChildren()
224 children.remove(indexToDelete); in replaceChildren()
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
DBaseTree.as194 var indexToDelete:int = startChildIndex+numNewChildren;
195 for (var c:int=indexToDelete; c<=stopChildIndex; c++) {
197 var killed:BaseTree = BaseTree(children.remove(indexToDelete));
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
DANTLRBaseTree.m292 int indexToDelete = startChildIndex+numNewChildren;
293 for (int c=indexToDelete; c<=stopChildIndex; c++) {
295 [children removeObjectAtIndex:indexToDelete];