2 // PukiWiki - Yet another WikiWikiWeb clone.
5 // 2003-2016 PukiWiki Development Team
6 // 2001-2002 Originally written by yu-ji
7 // License: GPL v2 or (at your option) any later version
10 // Show more information when it conflicts
11 define('PKWK_DIFF_SHOW_CONFLICT_DETAIL', 1);
13 // Create diff-style data between arrays
14 function do_diff($strlines1, $strlines2)
16 $obj = new line_diff();
17 $str = $obj->str_compare($strlines1, $strlines2);
21 // Visualize diff-style-text to text-with-CSS
22 // '+Added' => '<span added>Added</span>'
23 // '-Removed' => '<span removed>Removed</span>'
24 // ' Nothing' => 'Nothing'
25 function diff_style_to_css($str = '')
27 // Cut diff markers ('+' or '-' or ' ')
28 $str = preg_replace('/^\-(.*)$/m', '<span class="diff_removed">$1</span>', $str);
29 $str = preg_replace('/^\+(.*)$/m', '<span class="diff_added" >$1</span>', $str);
30 return preg_replace('/^ (.*)$/m', '$1', $str);
33 // Merge helper (when it conflicts)
34 function do_update_diff($pagestr, $poststr, $original)
36 $obj = new line_diff();
38 $obj->set_str('left', $original, $pagestr);
40 $diff1 = $obj->toArray();
42 $obj->set_str('right', $original, $poststr);
44 $diff2 = $obj->toArray();
46 $arr = $obj->arr_compare('all', $diff1, $diff2);
48 if (PKWK_DIFF_SHOW_CONFLICT_DETAIL) {
49 global $do_update_diff_table;
52 <p>l : between backup data and stored page data.<br />
53 r : between backup data and your post data.</p>
54 <table class="style_table">
61 $tags = array('th', 'th', 'td');
62 foreach ($arr as $_obj) {
64 $params = array($_obj->get('left'), $_obj->get('right'), $_obj->text());
65 foreach ($params as $key => $text) {
66 $text = htmlsc(rtrim($text));
67 if (empty($text)) $text = ' ';
69 ' <' . $tags[$key] . ' class="style_' . $tags[$key] . '">' .
71 '</' . $tags[$key] . '>';
75 $table[] = '</table>';
77 $do_update_diff_table = implode("\n", $table) . "\n";
82 foreach ($arr as $_obj) {
83 if ($_obj->get('left') != '-' && $_obj->get('right') != '-') {
84 $body[] = $_obj->text();
88 return array(rtrim(implode('', $body)) . "\n", 1);
92 // References of this class:
93 // S. Wu, <A HREF="http://www.cs.arizona.edu/people/gene/vita.html">
94 // E. Myers,</A> U. Manber, and W. Miller,
95 // <A HREF="http://www.cs.arizona.edu/people/gene/PAPERS/np_diff.ps">
96 // "An O(NP) Sequence Comparison Algorithm,"</A>
97 // Information Processing Letters 35, 6 (1990), 317-323.
100 var $arr1, $arr2, $m, $n, $pos, $key, $plus, $minus, $equal, $reverse;
102 function line_diff($plus = '+', $minus = '-', $equal = ' ')
104 $this->__construct($plus, $minus, $equal);
106 function __construct($plus = '+', $minus = '-', $equal = ' ')
109 $this->minus = $minus;
110 $this->equal = $equal;
113 function arr_compare($key, $arr1, $arr2)
119 $arr = $this->toArray();
123 function set_str($key, $str1, $str2)
126 $this->arr1 = array();
127 $this->arr2 = array();
128 $str1 = str_replace("\r", '', $str1);
129 $str2 = str_replace("\r", '', $str2);
130 foreach (explode("\n", $str1) as $line) {
131 $this->arr1[] = new DiffLine($line);
133 foreach (explode("\n", $str2) as $line) {
134 $this->arr2[] = new DiffLine($line);
138 function str_compare($str1, $str2)
140 $this->set_str('diff', $str1, $str2);
144 foreach ($this->toArray() as $obj) {
145 $str .= $obj->get('diff') . $obj->text();
152 $this->m = count($this->arr1);
153 $this->n = count($this->arr2);
155 if ($this->m == 0 || $this->n == 0) { // No need to compare
156 $this->result = array(array('x'=>0, 'y'=>0));
161 array_unshift($this->arr1, new DiffLine(''));
163 array_unshift($this->arr2, new DiffLine(''));
166 $this->reverse = ($this->n < $this->m);
167 if ($this->reverse) {
169 $tmp = $this->m; $this->m = $this->n; $this->n = $tmp;
170 $tmp = $this->arr1; $this->arr1 = $this->arr2; $this->arr2 = $tmp;
174 $delta = $this->n - $this->m; // Must be >=0;
177 $this->path = array();
179 for ($p = -($this->m + 1); $p <= ($this->n + 1); $p++) {
181 $this->path[$p] = array();
184 for ($p = 0;; $p++) {
185 for ($k = -$p; $k <= $delta - 1; $k++) {
186 $fp[$k] = $this->snake($k, $fp[$k - 1], $fp[$k + 1]);
188 for ($k = $delta + $p; $k >= $delta + 1; $k--) {
189 $fp[$k] = $this->snake($k, $fp[$k - 1], $fp[$k + 1]);
191 $fp[$delta] = $this->snake($delta, $fp[$delta - 1], $fp[$delta + 1]);
192 if ($fp[$delta] >= $this->n) {
193 $this->pos = $this->path[$delta]; // 経路を決定
199 function snake($k, $y1, $y2)
208 $this->path[$k] = $this->path[$_k];// ここまでの経路をコピー
210 while ((($x + 1) < $this->m) && (($y + 1) < $this->n)
211 and $this->arr1[$x + 1]->compare($this->arr2[$y + 1]))
214 $this->path[$k][] = array('x'=>$x, 'y'=>$y); // 経路を追加
222 if ($this->reverse) { // 姑息な…
223 $_x = 'y'; $_y = 'x'; $_m = $this->n; $arr1 =& $this->arr2; $arr2 =& $this->arr1;
225 $_x = 'x'; $_y = 'y'; $_m = $this->m; $arr1 =& $this->arr1; $arr2 =& $this->arr2;
229 $this->add_count = $this->delete_count = 0;
230 $this->pos[] = array('x'=>$this->m, 'y'=>$this->n); // Sentinel
231 foreach ($this->pos as $pos) {
232 $this->delete_count += ($pos[$_x] - $x);
233 $this->add_count += ($pos[$_y] - $y);
235 while ($pos[$_x] > $x) {
236 $arr1[$x]->set($this->key, $this->minus);
237 $arr[] = $arr1[$x++];
240 while ($pos[$_y] > $y) {
241 $arr2[$y]->set($this->key, $this->plus);
242 $arr[] = $arr2[$y++];
246 $arr1[$x]->merge($arr2[$y]);
247 $arr1[$x]->set($this->key, $this->equal);
261 function DiffLine($text)
263 $this->__construct($text);
265 function __construct($text)
267 $this->text = $text . "\n";
268 $this->status = array();
271 function compare($obj)
273 return $this->text == $obj->text;
276 function set($key, $status)
278 $this->status[$key] = $status;
283 return isset($this->status[$key]) ? $this->status[$key] : '';
288 $this->status += $obj->status;