1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
|
<?php
/**
* webtrees: online genealogy
* Copyright (C) 2015 webtrees development team
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
namespace Fisharebest\Webtrees\Module\BatchUpdate;
use Fisharebest\Webtrees\Auth;
use Fisharebest\Webtrees\Filter;
use Fisharebest\Webtrees\GedcomRecord;
use Fisharebest\Webtrees\I18N;
use Fisharebest\Webtrees\Module\BatchUpdateModule;
/**
* Class BatchUpdateBasePlugin
*
* Each plugin should extend this class, and implement these two functions:
*
* bool doesRecordNeedUpdate($xref, $gedrec)
* string updateRecord($xref, $gedrec)
*/
class BatchUpdateBasePlugin {
/** @var bool User option; update change record */
public $chan = false;
/**
* Default is to operate on INDI records
*
* @return string[]
*/
public function getRecordTypesToUpdate() {
return array('INDI');
}
/**
* Default option is just the "don't update CHAN record"
*/
public function getOptions() {
$this->chan = Filter::getBool('chan');
}
/**
* Default option is just the "don't update CHAN record"
*
* @return string
*/
public function getOptionsForm() {
return
'<tr><th>' . I18N::translate('Do not update the “last change” record') . '</th>' .
'<td><select name="chan" onchange="this.form.submit();">' .
'<option value="0" ' . ($this->chan ? '' : 'selected') . '>' . I18N::translate('yes') . '</option>' .
'<option value="1" ' . ($this->chan ? 'selected' : '') . '>' . I18N::translate('no') . '</option>' .
'</select></td></tr>';
}
/**
* Default buttons are update and update_all
*
* @param string $xref
*
* @return string[]
*/
public function getActionButtons($xref) {
if (Auth::user()->getPreference('auto_accept')) {
return array(
BatchUpdateModule::createSubmitButton(I18N::translate('Update'), $xref, 'update'),
BatchUpdateModule::createSubmitButton(I18N::translate('Update all'), $xref, 'update_all'),
);
} else {
return array(
BatchUpdateModule::createSubmitButton(I18N::translate('Update'), $xref, 'update'),
);
}
}
/**
* Default previewer for plugins with no custom preview.
*
* @param GedcomRecord $record
*
* @return string
*/
public function getActionPreview(GedcomRecord $record) {
$old_lines = preg_split('/[\n]+/', $record->getGedcom());
$new_lines = preg_split('/[\n]+/', $this->updateRecord($record->getXref(), $record->getGedcom()));
// Find matching lines using longest-common-subsequence algorithm.
$lcs = self::longestCommonSubsequence($old_lines, $new_lines, 0, count($old_lines) - 1, 0, count($new_lines) - 1);
$diff_lines = array();
$last_old = -1;
$last_new = -1;
while ($lcs) {
list($old, $new) = array_shift($lcs);
while ($last_old < $old - 1) {
$diff_lines[] = self::decorateDeletedText($old_lines[++$last_old]);
}
while ($last_new < $new - 1) {
$diff_lines[] = self::decorateInsertedText($new_lines[++$last_new]);
}
$diff_lines[] = $new_lines[$new];
$last_old = $old;
$last_new = $new;
}
while ($last_old < count($old_lines) - 1) {
$diff_lines[] = self::decorateDeletedText($old_lines[++$last_old]);
}
while ($last_new < count($new_lines) - 1) {
$diff_lines[] = self::decorateInsertedText($new_lines[++$last_new]);
}
return '<pre class="gedcom-data">' . self::createEditLinks(implode("\n", $diff_lines)) . '</pre>';
}
/**
* Longest Common Subsequence.
*
* @param string[] $X
* @param string[] $Y
* @param int $x1
* @param int $x2
* @param int $y1
* @param int $y2
*
* @return array
*/
private static function longestCommonSubsequence($X, $Y, $x1, $x2, $y1, $y2) {
if ($x2 - $x1 >= 0 && $y2 - $y1 >= 0) {
if ($X[$x1] == $Y[$y1]) {
// Match at start of sequence
$tmp = self::longestCommonSubsequence($X, $Y, $x1 + 1, $x2, $y1 + 1, $y2);
array_unshift($tmp, array($x1, $y1));
return $tmp;
} elseif ($X[$x2] == $Y[$y2]) {
// Match at end of sequence
$tmp = self::longestCommonSubsequence($X, $Y, $x1, $x2 - 1, $y1, $y2 - 1);
array_push($tmp, array($x2, $y2));
return $tmp;
} else {
// No match. Look for subsequences
$tmp1 = self::longestCommonSubsequence($X, $Y, $x1, $x2, $y1, $y2 - 1);
$tmp2 = self::longestCommonSubsequence($X, $Y, $x1, $x2 - 1, $y1, $y2);
return count($tmp1) > count($tmp2) ? $tmp1 : $tmp2;
}
} else {
// One array is empty - end recursion
return array();
}
}
/**
* Decorate inserted text
*
* @param string $text
*
* @return string
*/
public static function decorateInsertedText($text) {
return '<ins>' . $text . '</ins>';
}
/**
* Decorate deleted text
*
* @param string $text
*
* @return string
*/
public static function decorateDeletedText($text) {
return '<del>' . $text . '</del>';
}
/**
* Converted gedcom links into editable links
*
* @param string $gedrec
*
* @return string
*/
public static function createEditLinks($gedrec) {
return preg_replace(
"/@([^#@\n]+)@/m",
'<a href="#" onclick="return edit_raw(\'\\1\');">@\\1@</a>',
$gedrec
);
}
}
|
