Home
last modified time | relevance | path

Searched refs:replacingHowMany (Results 1 – 10 of 10) sorted by relevance

/external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/
DBaseTree.js135 var replacingHowMany = stopChildIndex - startChildIndex + 1;
149 var delta = replacingHowMany - replacingWithHowMany;
176 for (j=0; j<replacingHowMany; j++) {
179 numToInsert = replacingWithHowMany-replacingHowMany;
180 for (j=replacingHowMany; j<replacingWithHowMany; j++) {
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DBaseTree.cs282 int replacingHowMany = stopChildIndex - startChildIndex + 1; in ReplaceChildren()
303 int delta = replacingHowMany - replacingWithHowMany; in ReplaceChildren()
329 for (int j = 0; j < replacingHowMany; j++) { in ReplaceChildren()
332 int numToInsert = replacingWithHowMany - replacingHowMany; in ReplaceChildren()
333 for (int j = replacingHowMany; j < replacingWithHowMany; j++) { in ReplaceChildren()
/external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DBaseTree.cs357 int replacingHowMany = stopChildIndex - startChildIndex + 1; in ReplaceChildren()
384 int delta = replacingHowMany - replacingWithHowMany; in ReplaceChildren()
418 for ( int j = 0; j < replacingHowMany; j++ ) in ReplaceChildren()
422 int numToInsert = replacingWithHowMany - replacingHowMany; in ReplaceChildren()
423 for ( int j = replacingHowMany; j < replacingWithHowMany; j++ ) in ReplaceChildren()
/external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/
DBaseTree.java203 int replacingHowMany = stopChildIndex - startChildIndex + 1; in replaceChildren() local
217 int delta = replacingHowMany - replacingWithHowMany; in replaceChildren()
243 for (int j=0; j<replacingHowMany; j++) { in replaceChildren()
246 int numToInsert = replacingWithHowMany-replacingHowMany; in replaceChildren()
247 for (int j=replacingHowMany; j<replacingWithHowMany; j++) { in replaceChildren()
/external/antlr/runtime/C/src/
Dantlr3basetree.c345 ANTLR3_INT32 replacingHowMany; // How many nodes will go away in replaceChildren() local
385 replacingHowMany = stopChildIndex - startChildIndex + 1; in replaceChildren()
387 delta = replacingHowMany - replacingWithHowMany; in replaceChildren()
437 for (j = 0; j < replacingHowMany; j++) in replaceChildren()
442 numToInsert = replacingWithHowMany - replacingHowMany; in replaceChildren()
444 for (j = replacingHowMany; j < replacingWithHowMany; j++) in replaceChildren()
/external/antlr/runtime/Cpp/include/
Dantlr3commontree.inl173 ANTLR_INT32 replacingHowMany; // How many nodes will go away local
205 replacingHowMany = stopChildIndex - startChildIndex + 1;
207 delta = replacingHowMany - replacingWithHowMany;
260 for (j = 0; j < replacingHowMany; j++)
265 numToInsert = replacingWithHowMany - replacingHowMany;
267 for (j = replacingHowMany; j < replacingWithHowMany; j++)
/external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/tree/
DBaseTree.as163 var replacingHowMany:int = stopChildIndex - startChildIndex + 1;
177 var delta:int = replacingHowMany - replacingWithHowMany;
202 // fill in as many children as we can (replacingHowMany) w/o moving data
203 for (j=0; j<replacingHowMany; j++) {
206 var numToInsert:int = replacingWithHowMany-replacingHowMany;
207 for (j=replacingHowMany; j<replacingWithHowMany; j++) {
/external/antlr/runtime/ObjC/Framework/
DBaseTree.m266 int replacingHowMany = stopChildIndex - startChildIndex + 1;
280 int delta = replacingHowMany - replacingWithHowMany;
305 // fill in as many children as we can (replacingHowMany) w/o moving data
306 for (int j=0; j<replacingHowMany; j++) {
309 // int numToInsert = replacingWithHowMany-replacingHowMany;
310 for (int j=replacingHowMany; j<replacingWithHowMany; j++) {
/external/antlr/runtime/Python3/antlr3/
Dtree.py801 replacingHowMany = stopChildIndex - startChildIndex + 1
811 delta = replacingHowMany - replacingWithHowMany
/external/antlr/runtime/Python/antlr3/
Dtree.py806 replacingHowMany = stopChildIndex - startChildIndex + 1
816 delta = replacingHowMany - replacingWithHowMany