Edit File by line

<?php

[0] Fix | Delete

/**

[1] Fix | Delete

* Sequence matcher for Diff

[2] Fix | Delete

[3] Fix | Delete

* PHP version 5

[4] Fix | Delete

[5] Fix | Delete

[6] Fix | Delete

[7] Fix | Delete

[8] Fix | Delete

[9] Fix | Delete

* Redistribution and use in source and binary forms, with or without

[10] Fix | Delete

* modification, are permitted provided that the following conditions are met:

[11] Fix | Delete

[12] Fix | Delete

* - Redistributions of source code must retain the above copyright notice,

[13] Fix | Delete

* this list of conditions and the following disclaimer.

[14] Fix | Delete

* - Redistributions in binary form must reproduce the above copyright notice,

[15] Fix | Delete

* this list of conditions and the following disclaimer in the documentation

[16] Fix | Delete

* and/or other materials provided with the distribution.

[17] Fix | Delete

* - Neither the name of the Chris Boulton nor the names of its contributors

[18] Fix | Delete

* may be used to endorse or promote products derived from this software

[19] Fix | Delete

* without specific prior written permission.

[20] Fix | Delete

[21] Fix | Delete

* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"

[22] Fix | Delete

* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

[23] Fix | Delete

* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

[24] Fix | Delete

* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE

[25] Fix | Delete

* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR

[26] Fix | Delete

* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF

[27] Fix | Delete

* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS

[28] Fix | Delete

* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN

[29] Fix | Delete

* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)

[30] Fix | Delete

* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE

[31] Fix | Delete

* POSSIBILITY OF SUCH DAMAGE.

[32] Fix | Delete

[33] Fix | Delete

* @package Diff

[34] Fix | Delete

* @author Chris Boulton <chris.boulton@interspire.com>

[35] Fix | Delete

[36] Fix | Delete

* @license New BSD License http://www.opensource.org/licenses/bsd-license.php

[37] Fix | Delete

* @version 1.1

[38] Fix | Delete

* @link http://github.com/chrisboulton/php-diff

[39] Fix | Delete

[40] Fix | Delete

[41] Fix | Delete

class Diff_SequenceMatcher

[42] Fix | Delete

{

[43] Fix | Delete

/**

[44] Fix | Delete

* @var string|array Either a string or an array containing a callback function to determine if a line is "junk" or not.

[45] Fix | Delete

[46] Fix | Delete

private $junkCallback = null;

[47] Fix | Delete

[48] Fix | Delete

/**

[49] Fix | Delete

* @var array The first sequence to compare against.

[50] Fix | Delete

[51] Fix | Delete

private $a = null;

[52] Fix | Delete

[53] Fix | Delete

/**

[54] Fix | Delete

* @var array The second sequence.

[55] Fix | Delete

[56] Fix | Delete

private $b = null;

[57] Fix | Delete

[58] Fix | Delete

/**

[59] Fix | Delete

* @var array Array of characters that are considered junk from the second sequence. Characters are the array key.

[60] Fix | Delete

[61] Fix | Delete

private $junkDict = array();

[62] Fix | Delete

[63] Fix | Delete

/**

[64] Fix | Delete

* @var array Array of indices that do not contain junk elements.

[65] Fix | Delete

[66] Fix | Delete

private $b2j = array();

[67] Fix | Delete

[68] Fix | Delete

private $options = array();

[69] Fix | Delete

[70] Fix | Delete

private $defaultOptions = array(

[71] Fix | Delete

'ignoreNewLines' => false,

[72] Fix | Delete

'ignoreWhitespace' => false,

[73] Fix | Delete

'ignoreCase' => false

[74] Fix | Delete

);

[75] Fix | Delete

[76] Fix | Delete

private $matchingBlocks = null;

[77] Fix | Delete

private $opCodes = null;

[78] Fix | Delete

private $fullBCount = null;

[79] Fix | Delete

[80] Fix | Delete

/**

[81] Fix | Delete

* The constructor. With the sequences being passed, they'll be set for the

[82] Fix | Delete

* sequence matcher and it will perform a basic cleanup & calculate junk

[83] Fix | Delete

* elements.

[84] Fix | Delete

[85] Fix | Delete

* @param string|array $a A string or array containing the lines to compare against.

[86] Fix | Delete

* @param string|array $b A string or array containing the lines to compare.

[87] Fix | Delete

* @param string|array $junkCallback Either an array or string that references a callback function (if there is one) to determine 'junk' characters.

[88] Fix | Delete

[89] Fix | Delete

public function __construct($a, $b, $junkCallback=null, $options=array())

[90] Fix | Delete

{

[91] Fix | Delete

$this->a = null;

[92] Fix | Delete

$this->b = null;

[93] Fix | Delete

$this->junkCallback = $junkCallback;

[94] Fix | Delete

$this->setOptions($options);

[95] Fix | Delete

$this->setSequences($a, $b);

[96] Fix | Delete

}

[97] Fix | Delete

[98] Fix | Delete

public function setOptions($options)

[99] Fix | Delete

{

[100] Fix | Delete

$this->options = array_merge($this->defaultOptions, $options);

[101] Fix | Delete

}

[102] Fix | Delete

[103] Fix | Delete

/**

[104] Fix | Delete

* Set the first and second sequences to use with the sequence matcher.

[105] Fix | Delete

[106] Fix | Delete

* @param string|array $a A string or array containing the lines to compare against.

[107] Fix | Delete

* @param string|array $b A string or array containing the lines to compare.

[108] Fix | Delete

[109] Fix | Delete

public function setSequences($a, $b)

[110] Fix | Delete

{

[111] Fix | Delete

$this->setSeq1($a);

[112] Fix | Delete

$this->setSeq2($b);

[113] Fix | Delete

}

[114] Fix | Delete

[115] Fix | Delete

/**

[116] Fix | Delete

* Set the first sequence ($a) and reset any internal caches to indicate that

[117] Fix | Delete

* when calling the calculation methods, we need to recalculate them.

[118] Fix | Delete

[119] Fix | Delete

* @param string|array $a The sequence to set as the first sequence.

[120] Fix | Delete

[121] Fix | Delete

public function setSeq1($a)

[122] Fix | Delete

{

[123] Fix | Delete

if(!is_array($a)) {

[124] Fix | Delete

$a = str_split($a);

[125] Fix | Delete

}

[126] Fix | Delete

if($a == $this->a) {

[127] Fix | Delete

return;

[128] Fix | Delete

}

[129] Fix | Delete

[130] Fix | Delete

$this->a= $a;

[131] Fix | Delete

$this->matchingBlocks = null;

[132] Fix | Delete

$this->opCodes = null;

[133] Fix | Delete

}

[134] Fix | Delete

[135] Fix | Delete

/**

[136] Fix | Delete

* Set the second sequence ($b) and reset any internal caches to indicate that

[137] Fix | Delete

* when calling the calculation methods, we need to recalculate them.

[138] Fix | Delete

[139] Fix | Delete

* @param string|array $b The sequence to set as the second sequence.

[140] Fix | Delete

[141] Fix | Delete

public function setSeq2($b)

[142] Fix | Delete

{

[143] Fix | Delete

if(!is_array($b)) {

[144] Fix | Delete

$b = str_split($b);

[145] Fix | Delete

}

[146] Fix | Delete

if($b == $this->b) {

[147] Fix | Delete

return;

[148] Fix | Delete

}

[149] Fix | Delete

[150] Fix | Delete

$this->b = $b;

[151] Fix | Delete

$this->matchingBlocks = null;

[152] Fix | Delete

$this->opCodes = null;

[153] Fix | Delete

$this->fullBCount = null;

[154] Fix | Delete

$this->chainB();

[155] Fix | Delete

}

[156] Fix | Delete

[157] Fix | Delete

/**

[158] Fix | Delete

* Generate the internal arrays containing the list of junk and non-junk

[159] Fix | Delete

* characters for the second ($b) sequence.

[160] Fix | Delete

[161] Fix | Delete

private function chainB()

[162] Fix | Delete

{

[163] Fix | Delete

$length = count ($this->b);

[164] Fix | Delete

$this->b2j = array();

[165] Fix | Delete

$popularDict = array();

[166] Fix | Delete

[167] Fix | Delete

for($i = 0; $i < $length; ++$i) {

[168] Fix | Delete

$char = $this->b[$i];

[169] Fix | Delete

if(isset($this->b2j[$char])) {

[170] Fix | Delete

if($length >= 200 && count($this->b2j[$char]) * 100 > $length) {

[171] Fix | Delete

$popularDict[$char] = 1;

[172] Fix | Delete

unset($this->b2j[$char]);

[173] Fix | Delete

}

[174] Fix | Delete

else {

[175] Fix | Delete

$this->b2j[$char][] = $i;

[176] Fix | Delete

}

[177] Fix | Delete

}

[178] Fix | Delete

else {

[179] Fix | Delete

$this->b2j[$char] = array(

[180] Fix | Delete

[181] Fix | Delete

);

[182] Fix | Delete

}

[183] Fix | Delete

}

[184] Fix | Delete

[185] Fix | Delete

// Remove leftovers

[186] Fix | Delete

foreach(array_keys($popularDict) as $char) {

[187] Fix | Delete

unset($this->b2j[$char]);

[188] Fix | Delete

}

[189] Fix | Delete

[190] Fix | Delete

$this->junkDict = array();

[191] Fix | Delete

if(is_callable($this->junkCallback)) {

[192] Fix | Delete

foreach(array_keys($popularDict) as $char) {

[193] Fix | Delete

if(call_user_func($this->junkCallback, $char)) {

[194] Fix | Delete

$this->junkDict[$char] = 1;

[195] Fix | Delete

unset($popularDict[$char]);

[196] Fix | Delete

}

[197] Fix | Delete

}

[198] Fix | Delete

[199] Fix | Delete

foreach(array_keys($this->b2j) as $char) {

[200] Fix | Delete

if(call_user_func($this->junkCallback, $char)) {

[201] Fix | Delete

$this->junkDict[$char] = 1;

[202] Fix | Delete

unset($this->b2j[$char]);

[203] Fix | Delete

}

[204] Fix | Delete

}

[205] Fix | Delete

}

[206] Fix | Delete

}

[207] Fix | Delete

[208] Fix | Delete

/**

[209] Fix | Delete

* Checks if a particular character is in the junk dictionary

[210] Fix | Delete

* for the list of junk characters.

[211] Fix | Delete

[212] Fix | Delete

* @return boolean $b True if the character is considered junk. False if not.

[213] Fix | Delete

[214] Fix | Delete

private function isBJunk($b)

[215] Fix | Delete

{

[216] Fix | Delete

if(isset($this->juncDict[$b])) {

[217] Fix | Delete

return true;

[218] Fix | Delete

}

[219] Fix | Delete

[220] Fix | Delete

return false;

[221] Fix | Delete

}

[222] Fix | Delete

[223] Fix | Delete

/**

[224] Fix | Delete

* Find the longest matching block in the two sequences, as defined by the

[225] Fix | Delete

* lower and upper constraints for each sequence. (for the first sequence,

[226] Fix | Delete

* $alo - $ahi and for the second sequence, $blo - $bhi)

[227] Fix | Delete

[228] Fix | Delete

* Essentially, of all of the maximal matching blocks, return the one that

[229] Fix | Delete

* startest earliest in $a, and all of those maximal matching blocks that

[230] Fix | Delete

* start earliest in $a, return the one that starts earliest in $b.

[231] Fix | Delete

[232] Fix | Delete

* If the junk callback is defined, do the above but with the restriction

[233] Fix | Delete

* that the junk element appears in the block. Extend it as far as possible

[234] Fix | Delete

* by matching only junk elements in both $a and $b.

[235] Fix | Delete

[236] Fix | Delete

* @param int $alo The lower constraint for the first sequence.

[237] Fix | Delete

* @param int $ahi The upper constraint for the first sequence.

[238] Fix | Delete

* @param int $blo The lower constraint for the second sequence.

[239] Fix | Delete

* @param int $bhi The upper constraint for the second sequence.

[240] Fix | Delete

* @return array Array containing the longest match that includes the starting position in $a, start in $b and the length/size.

[241] Fix | Delete

[242] Fix | Delete

public function findLongestMatch($alo, $ahi, $blo, $bhi)

[243] Fix | Delete

{

[244] Fix | Delete

$a = $this->a;

[245] Fix | Delete

$b = $this->b;

[246] Fix | Delete

[247] Fix | Delete

$bestI = $alo;

[248] Fix | Delete

$bestJ = $blo;

[249] Fix | Delete

$bestSize = 0;

[250] Fix | Delete

[251] Fix | Delete

$j2Len = array();

[252] Fix | Delete

$nothing = array();

[253] Fix | Delete

[254] Fix | Delete

for($i = $alo; $i < $ahi; ++$i) {

[255] Fix | Delete

$newJ2Len = array();

[256] Fix | Delete

$jDict = $this->arrayGetDefault($this->b2j, $a[$i], $nothing);

[257] Fix | Delete

foreach($jDict as $jKey => $j) {

[258] Fix | Delete

if($j < $blo) {

[259] Fix | Delete

continue;

[260] Fix | Delete

}

[261] Fix | Delete

else if($j >= $bhi) {

[262] Fix | Delete

break;

[263] Fix | Delete

}

[264] Fix | Delete

[265] Fix | Delete

$k = $this->arrayGetDefault($j2Len, $j -1, 0) + 1;

[266] Fix | Delete

$newJ2Len[$j] = $k;

[267] Fix | Delete

if($k > $bestSize) {

[268] Fix | Delete

$bestI = $i - $k + 1;

[269] Fix | Delete

$bestJ = $j - $k + 1;

[270] Fix | Delete

$bestSize = $k;

[271] Fix | Delete

}

[272] Fix | Delete

}

[273] Fix | Delete

[274] Fix | Delete

$j2Len = $newJ2Len;

[275] Fix | Delete

}

[276] Fix | Delete

[277] Fix | Delete

while($bestI > $alo && $bestJ > $blo && !$this->isBJunk($b[$bestJ - 1]) &&

[278] Fix | Delete

!$this->linesAreDifferent($bestI - 1, $bestJ - 1)) {

[279] Fix | Delete

--$bestI;

[280] Fix | Delete

--$bestJ;

[281] Fix | Delete

++$bestSize;

[282] Fix | Delete

}

[283] Fix | Delete

[284] Fix | Delete

while($bestI + $bestSize < $ahi && ($bestJ + $bestSize) < $bhi &&

[285] Fix | Delete

!$this->isBJunk($b[$bestJ + $bestSize]) && !$this->linesAreDifferent($bestI + $bestSize, $bestJ + $bestSize)) {

[286] Fix | Delete

++$bestSize;

[287] Fix | Delete

}

[288] Fix | Delete

[289] Fix | Delete

while($bestI > $alo && $bestJ > $blo && $this->isBJunk($b[$bestJ - 1]) &&

[290] Fix | Delete

!$this->isLineDifferent($bestI - 1, $bestJ - 1)) {

[291] Fix | Delete

--$bestI;

[292] Fix | Delete

--$bestJ;

[293] Fix | Delete

++$bestSize;

[294] Fix | Delete

}

[295] Fix | Delete

[296] Fix | Delete

while($bestI + $bestSize < $ahi && $bestJ + $bestSize < $bhi &&

[297] Fix | Delete

$this->isBJunk($b[$bestJ + $bestSize]) && !$this->linesAreDifferent($bestI + $bestSize, $bestJ + $bestSize)) {

[298] Fix | Delete

++$bestSize;

[299] Fix | Delete

}

[300] Fix | Delete

[301] Fix | Delete

return array(

[302] Fix | Delete

$bestI,

[303] Fix | Delete

$bestJ,

[304] Fix | Delete

$bestSize

[305] Fix | Delete

);

[306] Fix | Delete

}

[307] Fix | Delete

[308] Fix | Delete

/**

[309] Fix | Delete

* Check if the two lines at the given indexes are different or not.

[310] Fix | Delete

[311] Fix | Delete

* @param int $aIndex Line number to check against in a.

[312] Fix | Delete

* @param int $bIndex Line number to check against in b.

[313] Fix | Delete

* @return boolean True if the lines are different and false if not.

[314] Fix | Delete

[315] Fix | Delete

public function linesAreDifferent($aIndex, $bIndex)

[316] Fix | Delete

{

[317] Fix | Delete

$lineA = $this->a[$aIndex];

[318] Fix | Delete

$lineB = $this->b[$bIndex];

[319] Fix | Delete

[320] Fix | Delete

if($this->options['ignoreWhitespace']) {

[321] Fix | Delete

$replace = array("\t", ' ');

[322] Fix | Delete

$lineA = str_replace($replace, '', $lineA);

[323] Fix | Delete

$lineB = str_replace($replace, '', $lineB);

[324] Fix | Delete

}

[325] Fix | Delete

[326] Fix | Delete

if($this->options['ignoreCase']) {

[327] Fix | Delete

$lineA = strtolower($lineA);

[328] Fix | Delete

$lineB = strtolower($lineB);

[329] Fix | Delete

}

[330] Fix | Delete

[331] Fix | Delete

if($lineA != $lineB) {

[332] Fix | Delete

return true;

[333] Fix | Delete

}

[334] Fix | Delete

[335] Fix | Delete

return false;

[336] Fix | Delete

}

[337] Fix | Delete

[338] Fix | Delete

/**

[339] Fix | Delete

* Return a nested set of arrays for all of the matching sub-sequences

[340] Fix | Delete

* in the strings $a and $b.

[341] Fix | Delete

[342] Fix | Delete

* Each block contains the lower constraint of the block in $a, the lower

[343] Fix | Delete

* constraint of the block in $b and finally the number of lines that the

[344] Fix | Delete

* block continues for.

[345] Fix | Delete

[346] Fix | Delete

* @return array Nested array of the matching blocks, as described by the function.

[347] Fix | Delete

[348] Fix | Delete

public function getMatchingBlocks()

[349] Fix | Delete

{

[350] Fix | Delete

if(!empty($this->matchingBlocks)) {

[351] Fix | Delete

return $this->matchingBlocks;

[352] Fix | Delete

}

[353] Fix | Delete

[354] Fix | Delete

$aLength = count($this->a);

[355] Fix | Delete

$bLength = count($this->b);

[356] Fix | Delete

[357] Fix | Delete

$queue = array(

[358] Fix | Delete

array(

[359] Fix | Delete

[360] Fix | Delete

$aLength,

[361] Fix | Delete

[362] Fix | Delete

$bLength

[363] Fix | Delete

)

[364] Fix | Delete

);

[365] Fix | Delete

[366] Fix | Delete

$matchingBlocks = array();

[367] Fix | Delete

while(!empty($queue)) {

[368] Fix | Delete

list($alo, $ahi, $blo, $bhi) = array_pop($queue);

[369] Fix | Delete

$x = $this->findLongestMatch($alo, $ahi, $blo, $bhi);

[370] Fix | Delete

list($i, $j, $k) = $x;

[371] Fix | Delete

if($k) {

[372] Fix | Delete

$matchingBlocks[] = $x;

[373] Fix | Delete

if($alo < $i && $blo < $j) {

[374] Fix | Delete

$queue[] = array(

[375] Fix | Delete

$alo,

[376] Fix | Delete

$i,

[377] Fix | Delete

$blo,

[378] Fix | Delete

[379] Fix | Delete

);

[380] Fix | Delete

}

[381] Fix | Delete

[382] Fix | Delete

if($i + $k < $ahi && $j + $k < $bhi) {

[383] Fix | Delete

$queue[] = array(

[384] Fix | Delete

$i + $k,

[385] Fix | Delete

$ahi,

[386] Fix | Delete

$j + $k,

[387] Fix | Delete

$bhi

[388] Fix | Delete

);

[389] Fix | Delete

}

[390] Fix | Delete

}

[391] Fix | Delete

}

[392] Fix | Delete

[393] Fix | Delete

usort($matchingBlocks, array($this, 'tupleSort'));

[394] Fix | Delete

[395] Fix | Delete

$i1 = 0;

[396] Fix | Delete

$j1 = 0;

[397] Fix | Delete

$k1 = 0;

[398] Fix | Delete

$nonAdjacent = array();

[399] Fix | Delete

foreach($matchingBlocks as $block) {

[400] Fix | Delete

list($i2, $j2, $k2) = $block;

[401] Fix | Delete

if($i1 + $k1 == $i2 && $j1 + $k1 == $j2) {

[402] Fix | Delete

$k1 += $k2;

[403] Fix | Delete

}

[404] Fix | Delete

else {

[405] Fix | Delete

if($k1) {

[406] Fix | Delete

$nonAdjacent[] = array(

[407] Fix | Delete

$i1,

[408] Fix | Delete

$j1,

[409] Fix | Delete

$k1

[410] Fix | Delete

);

[411] Fix | Delete

}

[412] Fix | Delete

[413] Fix | Delete

$i1 = $i2;

[414] Fix | Delete

$j1 = $j2;

[415] Fix | Delete

$k1 = $k2;

[416] Fix | Delete

}

[417] Fix | Delete

}

[418] Fix | Delete

[419] Fix | Delete

if($k1) {

[420] Fix | Delete

$nonAdjacent[] = array(

[421] Fix | Delete

$i1,

[422] Fix | Delete

$j1,

[423] Fix | Delete

$k1

[424] Fix | Delete

);

[425] Fix | Delete

}

[426] Fix | Delete

[427] Fix | Delete

$nonAdjacent[] = array(

[428] Fix | Delete

$aLength,

[429] Fix | Delete

$bLength,

[430] Fix | Delete

[431] Fix | Delete

);

[432] Fix | Delete

[433] Fix | Delete

$this->matchingBlocks = $nonAdjacent;

[434] Fix | Delete

return $this->matchingBlocks;

[435] Fix | Delete

}

[436] Fix | Delete

[437] Fix | Delete

/**

[438] Fix | Delete

* Return a list of all of the opcodes for the differences between the

[439] Fix | Delete

* two strings.

[440] Fix | Delete

[441] Fix | Delete

* The nested array returned contains an array describing the opcode

[442] Fix | Delete

* which includes:

[443] Fix | Delete

* 0 - The type of tag (as described below) for the opcode.

[444] Fix | Delete

* 1 - The beginning line in the first sequence.

[445] Fix | Delete

* 2 - The end line in the first sequence.

[446] Fix | Delete

* 3 - The beginning line in the second sequence.

[447] Fix | Delete

* 4 - The end line in the second sequence.

[448] Fix | Delete

[449] Fix | Delete

* The different types of tags include:

[450] Fix | Delete

* replace - The string from $i1 to $i2 in $a should be replaced by

[451] Fix | Delete

* the string in $b from $j1 to $j2.

[452] Fix | Delete

* delete - The string in $a from $i1 to $j2 should be deleted.

[453] Fix | Delete

* insert - The string in $b from $j1 to $j2 should be inserted at

[454] Fix | Delete

* $i1 in $a.

[455] Fix | Delete

* equal - The two strings with the specified ranges are equal.

[456] Fix | Delete

[457] Fix | Delete

* @return array Array of the opcodes describing the differences between the strings.

[458] Fix | Delete

[459] Fix | Delete

public function getOpCodes()

[460] Fix | Delete

{

[461] Fix | Delete

if(!empty($this->opCodes)) {

[462] Fix | Delete

return $this->opCodes;

[463] Fix | Delete

}

[464] Fix | Delete

[465] Fix | Delete

$i = 0;

[466] Fix | Delete

$j = 0;

[467] Fix | Delete

$this->opCodes = array();

[468] Fix | Delete

[469] Fix | Delete

$blocks = $this->getMatchingBlocks();

[470] Fix | Delete

foreach($blocks as $block) {

[471] Fix | Delete

list($ai, $bj, $size) = $block;

[472] Fix | Delete

$tag = '';

[473] Fix | Delete

if($i < $ai && $j < $bj) {

[474] Fix | Delete

$tag = 'replace';

[475] Fix | Delete

}

[476] Fix | Delete

else if($i < $ai) {

[477] Fix | Delete

$tag = 'delete';

[478] Fix | Delete

}

[479] Fix | Delete

else if($j < $bj) {

[480] Fix | Delete

$tag = 'insert';

[481] Fix | Delete

}

[482] Fix | Delete

[483] Fix | Delete

if($tag) {

[484] Fix | Delete

$this->opCodes[] = array(

[485] Fix | Delete

$tag,

[486] Fix | Delete

$i,

[487] Fix | Delete

$ai,

[488] Fix | Delete

$j,

[489] Fix | Delete

$bj

[490] Fix | Delete

);

[491] Fix | Delete

}

[492] Fix | Delete

[493] Fix | Delete

$i = $ai + $size;

[494] Fix | Delete

$j = $bj + $size;

[495] Fix | Delete

[496] Fix | Delete

if($size) {

[497] Fix | Delete

$this->opCodes[] = array(

[498] Fix | Delete

'equal',

[499] Fix | Delete