|
1
|
|
|
<?php |
|
2
|
|
|
|
|
3
|
|
|
/** |
|
4
|
|
|
* webtrees: online genealogy |
|
5
|
|
|
* Copyright (C) 2019 webtrees development team |
|
6
|
|
|
* This program is free software: you can redistribute it and/or modify |
|
7
|
|
|
* it under the terms of the GNU General Public License as published by |
|
8
|
|
|
* the Free Software Foundation, either version 3 of the License, or |
|
9
|
|
|
* (at your option) any later version. |
|
10
|
|
|
* This program is distributed in the hope that it will be useful, |
|
11
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
12
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
13
|
|
|
* GNU General Public License for more details. |
|
14
|
|
|
* You should have received a copy of the GNU General Public License |
|
15
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
|
16
|
|
|
*/ |
|
17
|
|
|
|
|
18
|
|
|
declare(strict_types=1); |
|
19
|
|
|
|
|
20
|
|
|
namespace Fisharebest\Webtrees\Http\RequestHandlers; |
|
21
|
|
|
|
|
22
|
|
|
use Fisharebest\Webtrees\Auth; |
|
23
|
|
|
use Fisharebest\Webtrees\Individual; |
|
24
|
|
|
use Fisharebest\Webtrees\Tree; |
|
25
|
|
|
use Psr\Http\Message\ResponseInterface; |
|
26
|
|
|
use Psr\Http\Message\ServerRequestInterface; |
|
27
|
|
|
use Psr\Http\Server\RequestHandlerInterface; |
|
28
|
|
|
|
|
29
|
|
|
use function array_merge; |
|
30
|
|
|
use function array_search; |
|
31
|
|
|
use function assert; |
|
32
|
|
|
use function implode; |
|
33
|
|
|
use function is_array; |
|
34
|
|
|
use function is_string; |
|
35
|
|
|
use function redirect; |
|
36
|
|
|
use function uksort; |
|
37
|
|
|
|
|
38
|
|
|
/** |
|
39
|
|
|
* Reorder the parents and/or spouses of an individual. |
|
40
|
|
|
*/ |
|
41
|
|
|
class ReorderFamiliesAction implements RequestHandlerInterface |
|
42
|
|
|
{ |
|
43
|
|
|
/** |
|
44
|
|
|
* @param ServerRequestInterface $request |
|
45
|
|
|
* |
|
46
|
|
|
* @return ResponseInterface |
|
47
|
|
|
*/ |
|
48
|
|
|
public function handle(ServerRequestInterface $request): ResponseInterface |
|
49
|
|
|
{ |
|
50
|
|
|
$tree = $request->getAttribute('tree'); |
|
51
|
|
|
assert($tree instanceof Tree); |
|
52
|
|
|
|
|
53
|
|
|
$xref = $request->getAttribute('xref'); |
|
54
|
|
|
assert(is_string($xref)); |
|
55
|
|
|
|
|
56
|
|
|
$individual = Individual::getInstance($xref, $tree); |
|
57
|
|
|
$individual = Auth::checkIndividualAccess($individual, true); |
|
58
|
|
|
|
|
59
|
|
|
$order = $request->getParsedBody()['order']; |
|
60
|
|
|
assert(is_array($order)); |
|
61
|
|
|
|
|
62
|
|
|
$dummy_facts = ['0 @' . $individual->xref() . '@ INDI']; |
|
63
|
|
|
$sort_facts = []; |
|
64
|
|
|
$keep_facts = []; |
|
65
|
|
|
|
|
66
|
|
|
// Split facts into FAMS and other |
|
67
|
|
|
foreach ($individual->facts() as $fact) { |
|
68
|
|
|
$tag = $fact->getTag(); |
|
69
|
|
|
|
|
70
|
|
|
if ($tag === 'FAMC' || $tag === 'FAMS') { |
|
71
|
|
|
$sort_facts[$fact->id()] = $fact->gedcom(); |
|
72
|
|
|
} else { |
|
73
|
|
|
$keep_facts[] = $fact->gedcom(); |
|
74
|
|
|
} |
|
75
|
|
|
} |
|
76
|
|
|
|
|
77
|
|
|
// Sort the facts |
|
78
|
|
|
uksort($sort_facts, static function ($x, $y) use ($order) { |
|
79
|
|
|
return array_search($x, $order, true) <=> array_search($y, $order, true); |
|
80
|
|
|
}); |
|
81
|
|
|
|
|
82
|
|
|
// Merge the facts |
|
83
|
|
|
$gedcom = implode("\n", array_merge($dummy_facts, $sort_facts, $keep_facts)); |
|
84
|
|
|
|
|
85
|
|
|
$individual->updateRecord($gedcom, false); |
|
86
|
|
|
|
|
87
|
|
|
return redirect($individual->url()); |
|
88
|
|
|
} |
|
89
|
|
|
} |
|
90
|
|
|
|
fisharebest /
webtrees
