@@ -383,7 +383,7 @@ discard block |
||
383 | 383 | // The difference is in the parent, so compare them. now THIS is tricky. |
384 | 384 | $distancePrev = $deletedNodes[0]->getParent()->getMatchRatio($prevResult->getLastCommonParent()); |
385 | 385 | $distanceNext = $deletedNodes[count($deletedNodes) - 1]->getParent() |
386 | - ->getMatchRatio($nextResult->getLastCommonParent()); |
|
386 | + ->getMatchRatio($nextResult->getLastCommonParent()); |
|
387 | 387 | |
388 | 388 | if ($distancePrev <= $distanceNext) { |
389 | 389 | // Insert after the previous node. |
@@ -409,7 +409,7 @@ discard block |
||
409 | 409 | // Inserting at the back. |
410 | 410 | if ($nextResult->isSplittingNeeded()) { |
411 | 411 | $splitOccurred = $nextLeaf->getParent() |
412 | - ->splitUntil($nextResult->getLastCommonParent(), $nextLeaf, false); |
|
412 | + ->splitUntil($nextResult->getLastCommonParent(), $nextLeaf, false); |
|
413 | 413 | |
414 | 414 | if ($splitOccurred) { |
415 | 415 | // The place where to insert is shifted one place to the right. |
@@ -62,8 +62,8 @@ |
||
62 | 62 | $max = min($length1, $length2); |
63 | 63 | |
64 | 64 | for ($forwardBound = 0; |
65 | - $forwardBound < $max && $this->isRangeEqual($forwardBound, $forwardBound); |
|
66 | - $forwardBound++) { |
|
65 | + $forwardBound < $max && $this->isRangeEqual($forwardBound, $forwardBound); |
|
66 | + $forwardBound++) { |
|
67 | 67 | $this->setLcs($forwardBound, $forwardBound); |
68 | 68 | } |
69 | 69 |