Lines Matching refs:j
425 $j = 0;// walks b
432 while ($i < \count($a->returnStates) && $j < \count($b->returnStates)) {
434 $b_parent = $b->parents[$j];
436 if ($a->returnStates[$i] === $b->returnStates[$j]) {
461 $j++;// but also skip one in right side since we merge
462 } elseif ($a->returnStates[$i] < $b->returnStates[$j]) {
468 // b > a, copy b[j] to M
470 $mergedReturnStates[$k] = $b->returnStates[$j];
471 $j++;
485 for ($p = $j, $count = \count($b->returnStates); $p < $count; $p++) {
598 for ($j = 0; $j < $context->getLength(); $j++) {
599 $parents[$j] = $context->getParent($j);