| 1 |
<?php |
| 2 |
/** |
| 3 |
* Context diff generator for PHP DiffLib. |
| 4 |
* |
| 5 |
* PHP version 5 |
| 6 |
* |
| 7 |
* Copyright (c) 2009 Chris Boulton <chris.boulton@interspire.com> |
| 8 |
* |
| 9 |
* All rights reserved. |
| 10 |
* |
| 11 |
* Redistribution and use in source and binary forms, with or without |
| 12 |
* modification, are permitted provided that the following conditions are met: |
| 13 |
* |
| 14 |
* - Redistributions of source code must retain the above copyright notice, |
| 15 |
* this list of conditions and the following disclaimer. |
| 16 |
* - Redistributions in binary form must reproduce the above copyright notice, |
| 17 |
* this list of conditions and the following disclaimer in the documentation |
| 18 |
* and/or other materials provided with the distribution. |
| 19 |
* - Neither the name of the Chris Boulton nor the names of its contributors |
| 20 |
* may be used to endorse or promote products derived from this software |
| 21 |
* without specific prior written permission. |
| 22 |
* |
| 23 |
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 24 |
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 25 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 26 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 27 |
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 28 |
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 29 |
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 30 |
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 31 |
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 32 |
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 33 |
* POSSIBILITY OF SUCH DAMAGE. |
| 34 |
* |
| 35 |
* @package DiffLib |
| 36 |
* @author Chris Boulton <chris.boulton@interspire.com> |
| 37 |
* @copyright (c) 2009 Chris Boulton |
| 38 |
* @license New BSD License http://www.opensource.org/licenses/bsd-license.php |
| 39 |
* @version 1.1 |
| 40 |
* @link http://github.com/chrisboulton/php-diff |
| 41 |
*/ |
| 42 |
|
| 43 |
require_once dirname(__FILE__).'/../Abstract.php'; |
| 44 |
|
| 45 |
class WPR_Diff_Renderer_Text_Context extends WPR_Diff_Renderer_Abstract |
| 46 |
{ |
| 47 |
/** |
| 48 |
* @var array Array of the different opcode tags and how they map to the context diff equivalent. |
| 49 |
*/ |
| 50 |
private $tagMap = array( |
| 51 |
'insert' => '+', |
| 52 |
'delete' => '-', |
| 53 |
'replace' => '!', |
| 54 |
'equal' => ' ' |
| 55 |
); |
| 56 |
|
| 57 |
/** |
| 58 |
* Render and return a context formatted (old school!) diff file. |
| 59 |
* |
| 60 |
* @return string The generated context diff. |
| 61 |
*/ |
| 62 |
public function render() |
| 63 |
{ |
| 64 |
$diff = ''; |
| 65 |
$opCodes = $this->diff->getGroupedOpcodes(); |
| 66 |
foreach($opCodes as $group) { |
| 67 |
$diff .= "***************\n"; |
| 68 |
$lastItem = count($group)-1; |
| 69 |
$i1 = $group[0][1]; |
| 70 |
$i2 = $group[$lastItem][2]; |
| 71 |
$j1 = $group[0][3]; |
| 72 |
$j2 = $group[$lastItem][4]; |
| 73 |
|
| 74 |
if($i2 - $i1 >= 2) { |
| 75 |
$diff .= '*** '.($group[0][1] + 1).','.$i2." ****\n"; |
| 76 |
} |
| 77 |
else { |
| 78 |
$diff .= '*** '.$i2." ****\n"; |
| 79 |
} |
| 80 |
|
| 81 |
if($j2 - $j1 >= 2) { |
| 82 |
$separator = '--- '.($j1 + 1).','.$j2." ----\n"; |
| 83 |
} |
| 84 |
else { |
| 85 |
$separator = '--- '.$j2." ----\n"; |
| 86 |
} |
| 87 |
|
| 88 |
$hasVisible = false; |
| 89 |
foreach($group as $code) { |
| 90 |
if($code[0] == 'replace' || $code[0] == 'delete') { |
| 91 |
$hasVisible = true; |
| 92 |
break; |
| 93 |
} |
| 94 |
} |
| 95 |
|
| 96 |
if($hasVisible) { |
| 97 |
foreach($group as $code) { |
| 98 |
list($tag, $i1, $i2, $j1, $j2) = $code; |
| 99 |
if($tag == 'insert') { |
| 100 |
continue; |
| 101 |
} |
| 102 |
$diff .= $this->tagMap[$tag].' '.implode("\n".$this->tagMap[$tag].' ', $this->diff->GetA($i1, $i2))."\n"; |
| 103 |
} |
| 104 |
} |
| 105 |
|
| 106 |
$hasVisible = false; |
| 107 |
foreach($group as $code) { |
| 108 |
if($code[0] == 'replace' || $code[0] == 'insert') { |
| 109 |
$hasVisible = true; |
| 110 |
break; |
| 111 |
} |
| 112 |
} |
| 113 |
|
| 114 |
$diff .= $separator; |
| 115 |
|
| 116 |
if($hasVisible) { |
| 117 |
foreach($group as $code) { |
| 118 |
list($tag, $i1, $i2, $j1, $j2) = $code; |
| 119 |
if($tag == 'delete') { |
| 120 |
continue; |
| 121 |
} |
| 122 |
$diff .= $this->tagMap[$tag].' '.implode("\n".$this->tagMap[$tag].' ', $this->diff->GetB($j1, $j2))."\n"; |
| 123 |
} |
| 124 |
} |
| 125 |
} |
| 126 |
return $diff; |
| 127 |
} |
| 128 |
} |