-
Notifications
You must be signed in to change notification settings - Fork 0
/
draw-tree.php
1049 lines (934 loc) · 43.2 KB
/
draw-tree.php
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
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<html>
<head>
<title>Descendant Tree</title>
<meta id="meta" name="viewport" content="width=device-width; initial-scale=1.0" />
<style>a {text-decoration: none}</style>
</head>
<body>
<?php
$classes = array();
$debug;
if (isset($_POST["debug"]) && $_POST["debug"] == "on") {
$debug = TRUE;
} else {
$debug = FALSE;
}
function debug() {
global $debug;
return ($debug);
}
$familyCirclesURL = "https://apps.wikitree.com/apps/mcgillis84/explorer?service=/apps/mcgillis84/fcservice.php&start=";
// an individual in the tree
class Person {
// raw person data as downloaded from WikiTree
var $rawData = array();
// parents of this person
var $parents = array();
// kids of this person
var $kids = array();
// generation this person is part of (if multiple, this is the latest)
var $generation = 0;
// whether this person's kids have already been searched
var $kidsSearched = FALSE;
// whether this is the target ancestor (top of the chart)
var $isTarget = FALSE;
// whether this is the base person (bottom of the chart)
var $isBase = FALSE;
function __construct(&$rawData = null, &$parent = null) {
$this->rawData = &$rawData;
$this->rawData["object"] = $this;
if ($parent != null){
$this->parents[] = &$parent;
}
if ($rawData != null){
global $classes;
$classes[] = $this->getWTID();
}
}
function getId() {
return ($this->rawData["Id"]);
}
function getWTID() {
return ($this->rawData["Name"]);
}
function getGender() {
return ($this->rawData["Gender"]);
}
function getName() {
if (array_key_exists("BirthName", $this->rawData)) {
return ($this->rawData["BirthName"]);
} else {
return ($this->rawData["ShortName"]);
}
}
function getDates() {
if (isset($this->rawData["BirthDate"]))
$birth = substr($this->rawData["BirthDate"], 0, 4);
if (!isset($birth) || $birth == "0000")
$birth = " ";
if (isset($this->rawData["DeathDate"]))
$death = substr($this->rawData["DeathDate"], 0, 4);
if (!isset($death) || $death == "0000")
$death = " ";
return ($birth . "-" . $death);
}
function getThumb() {
if (array_key_exists("PhotoData", $this->rawData))
return ("<img src=\"http://www.wikitree.com/" . $this->rawData["PhotoData"]["url"] . "\" style=\"vertical-align:top\">\n");
else if ($this->getGender() == "Male")
return("<img src=\"https://www.wikitree.com/images/icons/male.gif \" style=\"vertical-align:top\">\n");
else
return("<img src=\"https://www.wikitree.com/images/icons/female.gif \" style=\"vertical-align:top\">\n");
}
function addKid(&$rawData) {
if ($rawData["object"] == null) { // If there isn't already an object
$this->kids[] = new Person($rawData, $this);
$kidObject = &$this->kids[count($this->kids) - 1];
$kidObject->addToFamilyCircles();
} else { // object already exists
$kidObject = &$rawData["object"];
$this->kids[] = &$kidObject;
$kidObject->parents[] = &$this;
}
}
function addToFamilyCircles() {
global $familyCirclesURL;
// if this isn't the first family being added then add a comma separator
if (!(substr($familyCirclesURL, -1) == "=")) {
$familyCirclesURL .= ",";
}
// add the family to the Family Circles URL
$familyCirclesURL .= $this->rawData["Father"] . ":" . $this->rawData["Mother"];
}
}
// a string of people that goes from the target ancestor to the base person
class Path {
// array of persons in this path
var $persons = array();
// index of path in array
var $index;
// family groups this path is part of
var $families = array();
// neighbor paths to the left and right
var $left;
var $right;
// paths that must be next to this path
var $mustBeNeighbor = array(null, null);
function __construct($index = -1) {
$this->index = $index;
}
// returns the path to the left of this one
function &left() {
return ($this->left);
}
// returns the path to the right of this one
function &right() {
return ($this->right);
}
// returns this path (so paths and families can be treated the same way)
function &leftPath() {
return $this;
}
// returns this path (so paths and families can be treated the same way)
function &rightPath() {
return $this;
}
// returns true if the path to the left of this one must be next to this one
function leftLocked() {
for($i=0; $i<2; $i++) {
if ($this->mustBeNeighbor[$i] == $this->left) {
//echo " Left side of path " . $this->index . " is locked.<br>";
return TRUE;
}
}
return FALSE;
}
// returns true if the path to the right of this one must be next to this one
function rightLocked() {
for($i=0; $i<2; $i++) {
if ($this->mustBeNeighbor[$i] == $this->right) {
//echo " Right side of path " . $this->index . " is locked.<br>";
return TRUE;
}
}
return FALSE;
}
// returns true if the paths to the left and right of this one must both be next to this one
function neighborsLocked() {
return ($this->rightLocked() && $this->leftLocked());
}
// returns true if this path is locked to a path outside of its smallest family
function lockedToEdgeOfFamily() {
for($i=0; $i<2 && $this->mustBeNeighbor[$i]!=null; $i++) {
if (!in_array($this->mustBeNeighbor[$i], $this->families[count($this->families)-2]->paths)) {
if (debug()) echo " Path " . $this->index . " is locked to the edge of a family already.<br>/n";
return TRUE;
}
}
return FALSE;
}
function addFamily(&$family) {
for ($i=0; $i<count($this->families); $i++) {
if ($this->families[$i]->index > $family->index){
array_splice($this->families, $i, 0, array($family));
// if (debug()) $this->printFamilies();
return;
}
}
// if we got here this new family has a higher index number than all of the others
$this->families[] = &$family;
// $this->printFamilies();
}
function printFamilies() {
echo "--Families that Path " . $this->index . " is part of: ";
for ($i=0; $i<count($this->families); $i++) {
echo $this->families[$i]->index . " ";
}
echo "<br>";
}
function isPath(){
return TRUE;
}
function isFamily(){
return FALSE;
}
}
// a collection of paths which must be grouped together because of sibling relationships
class Family {
// the paths that make up the family
var $paths = array();
// index of this family in the array of families
var $index;
function __construct(&$path, $index) {
$this->paths[0] = &$path;
$this->index = $index;
if ($this->index != -1)
$path->addFamily($this);
}
// returns the left-most path in the family
function &leftPath() {
$leftSide = &$this->paths[0];
while (in_array($leftSide->left(), $this->paths, TRUE)) {
$leftSide = &$leftSide->left();
}
return ($leftSide);
}
// returns the right-most path in the family
function &rightPath() {
$rightSide = &$this->paths[count($this->paths) - 1];
while (in_array($rightSide->right(), $this->paths, TRUE)) {
$rightSide = &$rightSide->right();
}
return ($rightSide);
}
// returns the path to the right of the family
function &right() {
return ($this->rightPath()->right());
}
// returns the path to the left of the family
function &left() {
return ($this->leftPath()->left());
}
// returns true if the left side of the family is locked to its left neighbor
function leftLocked() {
return ($this->leftPath()->leftLocked());
}
// returns true if the right side of the family is locked to its right neighbor
function rightLocked() {
return ($this->rightPath()->rightLocked());
}
// returns true if both sides of the family are locked
function neighborsLocked() {
return ($this->rightLocked() && $this->leftLocked());
}
function isPath(){
return FALSE;
}
function isFamily(){
return TRUE;
}
}
// A cell in the html table
class Cell {
// how many columns wide
var $colspan = 1;
// how the contents of the cell are aligned
var $align = "center";
// link to the person to show in the cell (if this cell contains a person)
var $person;
// text that will show in the cell if there isn't a person
var $text = " ";
// column that the cell is in (used by endCol() )
private $column;
function __construct($index) {
$this->column = $index;
}
// reset the contenets of the cell
function reset() {
$this->person = null;
$this->text = " ";
$this->colspan = 1;
}
// returns the end column (actually, the start of the next column)
function endCol() {
return $this->column + $this->colspan;
}
}
// Recursive function to find kids and kids’ kids and kids’ kids’ kids...
// It also puts together all of the paths between the base person and target person and groups the paths into families.
function findKids(&$parent, &$people, &$currentPathIndex, &$paths, &$families, $parentFamilyIndex) {
$paths[$currentPathIndex]->persons[] = &$parent;
if(!$parent->kidsSearched){
for ($i=0; $i<count($people); $i++){ // Loop through everyone
if ($people[$i]["Father"] == $parent->getId() || $people[$i]["Mother"] == $parent->getId()){
$parent->addKid($people[$i]); // Establish parent-child connection
}
}
$parent->kidsSearched = TRUE;
}
$currentFamilyIndex = $parentFamilyIndex;
$parentPath = clone $paths[$currentPathIndex]; // temp copy of parent's path to use for kids after first
if (count($parent->kids) > 1) {
$families[] = new Family($paths[$currentPathIndex], count($families));
$currentFamilyIndex = count($families) - 1;
if (debug()) echo "Added path " . $currentPathIndex . " to new family " . $currentFamilyIndex . "<br>";
}
for($i=0; $i<count($parent->kids); $i++) { // Loop through all of this person’s kids
if ($i > 0) {
$paths[$currentPathIndex] = clone $parentPath;
$paths[$currentPathIndex]->index = $currentPathIndex;
$families[$currentFamilyIndex]->paths[] = &$paths[$currentPathIndex];
$paths[$currentPathIndex]->addFamily($families[$currentFamilyIndex]);
if (debug()) echo "Added path " . $currentPathIndex . " to family " . $currentFamilyIndex . "<br>";
}
$parent->kids[$i]->generation = max($parent->kids[$i]->generation, $parent->generation + 1);
if($parent->kids[$i]->isBase) { // If we’re at the base person we’ve completed another path
$paths[$currentPathIndex]->persons[] = &$parent->kids[$i];
$currentPathIndex++;
} else {
findKids($parent->kids[$i], $people, $currentPathIndex, $paths, $families, $currentFamilyIndex);
}
}
if ($currentFamilyIndex != $parentFamilyIndex && $parentFamilyIndex >= 0) {
for ($i=0; $i<count($families[$currentFamilyIndex]->paths); $i++) {
if (!in_array($families[$currentFamilyIndex]->paths[$i], $families[$parentFamilyIndex]->paths)) {
$families[$parentFamilyIndex]->paths[] = &$families[$currentFamilyIndex]->paths[$i];
}
}
}
}
// Evaluate which paths must be placed next to each other
function findNeighbors (&$families) {
for ($i=0; $i<count($families); $i++) {
if (count($families[$i]->paths) == 2) {
$families[$i]->paths[0]->mustBeNeighbor[0] = &$families[$i]->paths[1];
$families[$i]->paths[1]->mustBeNeighbor[0] = &$families[$i]->paths[0];
// if (debug()) echo "Path " . $families[$i]->paths[0]->index . " must be next to " . $families[$i]->paths[1]->index . "<br>";
}
}
}
// attempt to shift two paths next to each other
function consolidate(&$path1, &$path2) {
// path1 will always be left of path2 upon entering here
// first figure out the first family that the two paths do not share.
$index1stUnique = 0;
for ($i=0; $i<min(count($path1->families), count($path2->families)); $i++) {
if ($path1->families[$i] != $path2->families[$i]) {
$index1stUnique = $i;
break;
}
}
if (debug()) echo " Families " . $path1->families[$index1stUnique]->index . " and " . $path2->families[$index1stUnique]->index . " are at index " . $index1stUnique . "<br>\n";
// make sure neither path is in a non-shared family that has their neighbors on both sides locked down
for ($i=$index1stUnique; $i<count($path1->families)-1; $i++) {
if ($path1->families[$i]->neighborsLocked()) {
if (debug()) echo " They can't because path " . $path1->index . " is in family " . $path1->families[$i]->index . " that's already got both sides locked down.<br>\n";
return(-1);
}
// also make sure it's not in a family below the 1st unique which is already locked down to a path outside the 1st unique family.
if ($i > $index1stUnique) { // this will check every family below 1st unique, but really only the 1st below needs to be checked
for ($j=0; $j<2 && $path1->families[$i]->leftPath()->mustBeNeighbor[$j] != null; $j++) {
if (!in_array($path1->families[$i]->leftPath()->mustBeNeighbor[$j], $path1->families[$index1stUnique]->paths)) {
if (debug()) echo " Path " . $path1->index . " is part of family " . $path1->families[$i]->index . " that is locked to the edge of family " . $path1->families[$index1stUnique]->index . " already.<br>\n";
return(-1);
}
}
for ($j=0; $j<2 && $path1->families[$i]->rightPath()->mustBeNeighbor[$j] != null; $j++) {
if (!in_array($path1->families[$i]->rightPath()->mustBeNeighbor[$j], $path1->families[$index1stUnique]->paths)) {
if (debug()) echo " Path " . $path1->index . " is part of a family that is locked to the edge of a family already.<br>\n";
return(-1);
}
}
}
}
for ($i=$index1stUnique; $i<count($path2->families)-1; $i++) {
if ($path2->families[$i]->neighborsLocked()) {
if (debug()) echo " They can't because path " . $path2->index . " is in family " . $path2->families[$i]->index . " that's already got both sides locked down.<br>\n";
return(-1);
}
// also make sure it's not in a family below the 1st unique which is already locked down to a path outside the 1st unique family.
if ($i > $index1stUnique) { // this will check every family below 1st unique, but really only the 1st below needs to be checked
for ($j=0; $j<2 && $path2->families[$i]->leftPath()->mustBeNeighbor[$j] != null; $j++) {
if (!in_array($path2->families[$i]->leftPath()->mustBeNeighbor[$j], $path2->families[$index1stUnique]->paths)) {
if (debug()) echo " Path " . $path2->index . " is part of a family that is locked to the edge of a family already.<br>\n";
return(-1);
}
}
for ($j=0; $j<2 && $path2->families[$i]->rightPath()->mustBeNeighbor[$j] != null; $j++) {
if (!in_array($path2->families[$i]->rightPath()->mustBeNeighbor[$j], $path2->families[$index1stUnique]->paths)) {
if (debug()) echo " Path " . $path2->index . " is part of a family that is locked to the edge of a family already.<br>\n";
return(-1);
}
}
}
}
// make sure neither path is already locked down to a path outside of its smallest family, unless they're in the same family
if (($path1->lockedToEdgeOfFamily() || $path2->lockedToEdgeOfFamily()) && ($path1->families[$index1stUnique]->isFamily() || $path2->families[$index1stUnique]->isFamily())) {
if (debug()) echo " They can't because at least one is already locked to the edge of its family.<br>\n";
return(-1);
}
// if they are in the same family, make sure they aren't each locked down to opposite sides of it
if ($path1->families[$index1stUnique]->isPath() && $path2->families[$index1stUnique]->isPath()) {
for ($i=0; $i<2 && $path1->mustBeNeighbor[$i] != null; $i++) {
if (!in_array($path1->mustBeNeighbor[$i], $path1->families[$index1stUnique-1]->paths)) {
// path1 is locked to one side of the family, now see if path2 is locked to the other
for ($j=0; $j<2 && $path2->mustBeNeighbor[$j] != null; $j++) {
if (!in_array($path2->mustBeNeighbor[$j], $path2->families[$index1stUnique-1]->paths)) {
if (debug()) echo "Paths are each locked down to opposite sides of a family.<br>\n";
return(-1);
}
}
}
}
}
//
// move the two families together
//
for ($i=$index1stUnique, $j=0;
$i < max(count($path1->families), count($path2->families));
$i++, $j++) {
$path1FamilyIndex = min($i, count($path1->families) - 1);
$path2FamilyIndex = min($i, count($path2->families) - 1);
if (debug()) {
if ($path1->families[$path1FamilyIndex]->isFamily()) {
echo "Family ";
} else {
echo "Path ";
}
echo $path1->families[$path1FamilyIndex]->index . " ";
if ($path2->families[$path2FamilyIndex]->isFamily()) {
echo "Family ";
} else {
echo "Path ";
}
echo $path2->families[$path2FamilyIndex]->index . "<br>\n";
}
$group1LeftExtent = &$path1->families[$path1FamilyIndex]->leftPath();
$group1RightExtent = &$path1->families[$path1FamilyIndex]->rightPath();
$group1LeftNeighbor = &$group1LeftExtent->left();
$group1RightNeighbor = &$group1RightExtent->right();
// if a family is locked down on the side facing the other family, then reverse the family.
if ($path1->families[$path1FamilyIndex]->rightLocked()) {
while ($group1RightExtent->rightLocked() ||
((count($group1RightExtent->right()->families) > $path1FamilyIndex) &&
($group1RightExtent->families[$path1FamilyIndex] == $group1RightExtent->right()->families[$path1FamilyIndex]))) {
$group1RightExtent = &$group1RightExtent->right();
if (debug()) echo "(1)Bumped left group right extent over 1, to " . $group1RightExtent->index . ".<br>\n";
if ($group1RightExtent === $path2) {
if (debug()) echo "Groups of paths are too closely tied together.<br>\n";
return(-1);
}
}
$group1LeftNeighbor = &$group1LeftExtent->left();
$group1RightNeighbor = &$group1RightExtent->right();
// if (debug()) checkPaths($path1);
$group1LeftNeighbor->right = &$group1RightExtent;
for ($thisPath=&$group1RightExtent->left(); $thisPath!==$group1LeftExtent; $thisPath=&$thisPath->right()) {
$tempPath = &$thisPath->right();
$thisPath->right = &$thisPath->left();
$thisPath->left = &$tempPath;
}
$tempPath = &$group1RightExtent->left();
$group1RightExtent->left = &$group1LeftNeighbor;
$group1RightExtent->right = &$tempPath;
$group1RightNeighbor->left = &$group1LeftExtent;
$group1LeftExtent->left = &$group1LeftExtent->right();
$group1LeftExtent->right = &$group1RightNeighbor;
if (debug()) echo "Reversed the order of family/path " . $path1->families[$path1FamilyIndex]->index . ".<br>\n";
// if (debug()) checkPaths($path1);
$group1LeftExtent = &$path1->families[$path1FamilyIndex]->leftPath();
$group1RightExtent = &$path1->families[$path1FamilyIndex]->rightPath();
$group1LeftNeighbor = &$group1LeftExtent->left();
$group1RightNeighbor = &$group1RightExtent->right();
}
$group2LeftExtent = &$path2->families[$path2FamilyIndex]->leftPath();
$group2RightExtent = &$path2->families[$path2FamilyIndex]->rightPath();
$group2RightNeighbor = &$group2RightExtent->right();
$group2LeftNeighbor = &$group2LeftExtent->left();
if ($path2->families[$path2FamilyIndex]->leftLocked()) {
while ($group2LeftExtent->leftLocked() ||
((count($group2LeftExtent->left()->families) > $path2FamilyIndex) &&
($group2LeftExtent->families[$path2FamilyIndex] == $group2LeftExtent->left()->families[$path2FamilyIndex]))) {
$group2LeftExtent = &$group2LeftExtent->left();
if (debug()) echo "(1)Bumped right group left extent over 1, to " . $group2LeftExtent->index . ".<br>\n";
if ($group2LeftExtent === $path1) {
if (debug()) echo "Groups of paths are too closely tied together.<br>\n";
return(-1);
}
}
$group2RightNeighbor = &$group2RightExtent->right();
$group2LeftNeighbor = &$group2LeftExtent->left();
$group2RightNeighbor->left = &$group2LeftExtent;
for ($thisPath=&$group2LeftExtent->right(); $thisPath!=$group2RightExtent; $thisPath=&$thisPath->left()) {
$tempPath = &$thisPath->left();
$thisPath->left = &$thisPath->right();
$thisPath->right = &$tempPath;
}
$tempPath = &$group2LeftExtent->right();
$group2LeftExtent->right = &$group2RightNeighbor;
$group2LeftExtent->left = &$tempPath;
$group2LeftNeighbor->right = &$group2RightExtent;
$tempPath = &$group2RightExtent->left();
$group2RightExtent->right = &$tempPath;
$group2RightExtent->left = &$group2LeftNeighbor;
if (debug()) echo "Reversed the order of family/path " . $path2->families[$path2FamilyIndex]->index . ".<br>\n";
$group2RightExtent = &$path2->families[$path2FamilyIndex]->rightPath();
$group2LeftExtent = &$path2->families[$path2FamilyIndex]->leftPath();
$group2RightNeighbor = &$group2RightExtent->right();
$group2LeftNeighbor = &$group2LeftExtent->left();
// if (debug()) checkPaths($path1);
}
// if the left is tied to its left neighbor by lock or by family tie
while ($group1LeftExtent->leftLocked() ||
((count($group1LeftExtent->left()->families) > $path1FamilyIndex) &&
($group1LeftExtent->families[$path1FamilyIndex] == $group1LeftExtent->left()->families[$path1FamilyIndex]))) {
$group1LeftExtent = &$group1LeftExtent->left();
if (debug()) echo "(2)Bumped left group left extent over 1, to " . $group1LeftExtent->index . ".<br>\n";
}
$group1LeftNeighbor = &$group1LeftExtent->left();
// if the right is tied to its right neighbor by lock or by family tie
while ($group2RightExtent->rightLocked() ||
((count($group2RightExtent->right()->families) > $path2FamilyIndex) &&
($group2RightExtent->families[$path2FamilyIndex] == $group2RightExtent->right()->families[$path2FamilyIndex]))) {
$group2RightExtent = &$group2RightExtent->right();
if (debug()) echo "(2)Bumped right group right extent over 1, to " . $group2RightExtent->index . ".<br>\n";
}
$group2RightNeighbor = &$group2RightExtent->right();
// if they're not already next to each other
if ($group1RightNeighbor != $group2LeftExtent) {
// if the right path isn't already next to the left family
if ($path1->families[$index1stUnique]->rightPath()->right() != $path2) {
// move it left
$group1RightExtent->right = &$group2LeftExtent;
$group2LeftExtent->left = &$group1RightExtent;
$group1RightNeighbor->left = &$group2RightExtent;
$group2RightExtent->right = &$group1RightNeighbor;
$group2LeftNeighbor->right = &$group2RightNeighbor;
$group2RightNeighbor->left = &$group2LeftNeighbor;
} else if ($path2->families[$index1stUnique]->leftPath()->left() != $path1) {
// else if the left path isn't already next to the right family move it right
$group1RightExtent->right = &$group2LeftExtent;
$group2LeftExtent->left = &$group1RightExtent;
$group1RightNeighbor->left = &$group1LeftNeighbor;
$group1LeftNeighbor->right = &$group1RightNeighbor;
$group2LeftNeighbor->right = &$group1LeftExtent;
$group1LeftExtent->left = &$group2LeftNeighbor;
}
// if (debug()) checkPaths($path1);
}
}
//
// lock the paths to each other
//
if ($path1->right() == $path2 && $path2->left() == $path1) {
if ($path1->mustBeNeighbor[0] == null) {
$path1->mustBeNeighbor[0] = &$path2;
} else {
$path1->mustBeNeighbor[1] = &$path2;
}
if ($path2->mustBeNeighbor[0] == null) {
$path2->mustBeNeighbor[0] = &$path1;
} else {
$path2->mustBeNeighbor[1] = &$path1;
}
}
return (0);
}
function checkPaths (&$startPath) {
// check that pointers still agree in both directions
$tempPath = &$startPath->right();
while ($tempPath !== $startPath) {
if ($tempPath->left()->right() !== $tempPath) {
echo "INDICES ARE MESSED UP!<br>";
echo "Path " . $tempPath->index . " says Path " . $tempPath->left()->index . " is on its left, but Path " . $tempPath->left()->index .
" says Path " . $tempPath->left()->right()->index . " is on its right!<br>\n";
return;
}
$tempPath = &$tempPath->right();
}
echo " Paths indices are good<br>\n";
}
// Place all of the people from a path into a given column in the table
function placePath (&$grid, &$path, $col) {
// each generation has four rows: a vertical line, name and info, and two more vertical lines
for ($j=0; $j<count($path->persons); $j++) {
// flag so we know if this is an empty space
$dummy = ($path->persons[$j] == "dummy");
if (!$dummy) {
$nameRow = $path->persons[$j]->generation * 4 - 3;
} else {
$nameRow += 4; // could calculate it this way every time
}
if ($dummy || !$path->persons[$j]->isTarget) {
// vertical line above everyone (including empty spaces) except the top person
$grid[$nameRow-1][$col]->text = "|";
}
if (!$dummy) {
$grid[$nameRow][$col]->person = &$path->persons[$j];
} else {
$grid[$nameRow][$col]->text = "|<br>|";
// once in the grid, empty spaces are no longer marked with "dummy", but by ->person = null
}
if ($dummy || !$path->persons[$j]->isBase) {
// two vertical lines below everyone (including empty spaces) except the bottom person
$grid[$nameRow+1][$col]->text = "|";
$grid[$nameRow+2][$col]->text = "|";
}
}
}
// Print the chart
function printTheChart(&$grid) {
if (!debug()) echo "\n\n<table style=\"width:95%\" border=\"0\" cellpadding=\"0\" cellspacing=\"0\">\n";
for ($i=0; $i<count($grid); $i++) {
echo "<tr>\n";
for ($j=0; $j<count($grid[$i]); ) {
echo "<td align=\"" . $grid[$i][$j]->align . "\" colspan=\"" . $grid[$i][$j]->colspan . "\">";
if ($grid[$i][$j]->person == null) {
echo $grid[$i][$j]->text;
} else {
echo "<div class=\"" . $grid[$i][$j]->person->getWTID() . "\">";
echo "<a href=\"http://www.wikitree.com/wiki/" . $grid[$i][$j]->person->getWTID() . "\">";
//echo $grid[$i][$j]->person->getThumb();
//echo "<br>";
echo $grid[$i][$j]->person->getName();
echo "<br>";
echo $grid[$i][$j]->person->getDates();
echo "</a></div>";
}
echo "</td>\n";
$j += $grid[$i][$j]->colspan;
}
echo "</tr>\n";
}
echo "</table>\n<br><br>";
}
//$targetAncestor = "Bartlett-249";
//$targetAncestor = "Bartlett-297";
//$targetAncestor = "Doty-42";
//$targetAncestor = "Cooke-36";
$targetAncestor = $_POST["target"];
$base = $_POST["base"];
//$base = "Holmes-8874";
//$base = "Griffith-5239";
// Array to hold only one copy of each ancestor
$ancestors = array();
// To keep track of current path as tree is being formed
$currentPathIndex = 0;
// Array to hold paths through the tree
$paths = array();
// Array to hold groups of paths that are connected by siblings
$families = array();
// Fetch all of the ancestors of the base person
$json = file_get_contents('https://apps.wikitree.com/api.php?action=getAncestors&key=' . $base . '&depth=10');
// Decode JSON data into PHP associative array format
$arr = json_decode($json, true);
//if (debug()) var_dump($arr[0]["ancestors"][5]);
//if (debug()) echo "<br><br>";
// Filter out duplicates and find target ancestor and base
for ($i=0, $j=0; $i<count($arr[0]["ancestors"]); $i++){ // Loop through decoded json array
for($k=0, $found=FALSE; $k<count($ancestors) && $found==FALSE; $k++){ // Loop through already found ancestors
// If they match we’ve already got this one so set $found so we exit the loop
if($arr[0]["ancestors"][$i]["Name"] == $ancestors[$k]["Name"]) $found = TRUE;
}
if(!$found) {
$ancestors[$j] = &$arr[0]["ancestors"][$i];
$ancestors[$j]["object"] = null;
if($targetAncestor == $ancestors[$j]["Name"]) {
$targetObject = new Person($ancestors[$j]);
$targetObject->generation = 1;
$targetObject->isTarget = TRUE;
} else if ($base == $ancestors[$j]["Name"]) {
$baseObject = new Person($ancestors[$j]);
$baseObject->isBase = TRUE;
}
$j++;
}
}
if (!isset($targetObject)) die("Ancestor not found. This app only goes back 10 (or so) generations for now.<br></body></html>");
$paths[$currentPathIndex] = new Path($currentPathIndex);
findKids($targetObject, $ancestors, $currentPathIndex, $paths, $families, -1);
$width = count($paths);
$depth = $baseObject->generation;
// echo "<br>" . $width . " wide by " . $depth . " deep<br>";
// echo "<br>";
$leftMargin = new Path(-1);
$rightMargin = new Path(-2);
$leftMargin->left = &$rightMargin;
$leftMargin->mustBeNeighbor[0] = &$rightMargin;
$rightMargin->right = &$leftMargin;
$rightMargin->mustBeNeighbor[0] = &$leftMargin;
// create linked list of paths
for ($i=0; $i<$width; $i++) {
if ($i > 0) {
$paths[$i]->left = &$paths[$i-1];
} else {
$leftMargin->right = &$paths[$i];
$paths[$i]->left = &$leftMargin;
}
if ($i < $width-1) {
$paths[$i]->right = &$paths[$i+1];
} else {
$rightMargin->left = &$paths[$i];
$paths[$i]->right = &$rightMargin;
}
// While we're here, insert spaces where needed so people line up between paths
for ($j=2; $j<$depth; $j++) {
// if the generation of the current person is greater than the index + 1
if ($paths[$i]->persons[$j]->generation > $j + 1) {
if (debug()) echo "Inserting space(s) into path " . $paths[$i]->index .
" before generation " . $paths[$i]->persons[$j]->generation . "<br>";
for ($k=0;
$k <= ($paths[$i]->persons[$j]->generation - ($j + 1));
$k++) {
array_splice($paths[$i]->persons, $j, 0, array("dummy"));
if (debug()) echo "Space inserted<br>";
$j++;
if ($j>=$depth) break;
}
}
}
// Also while we're here, each path must have as it's last family, itself
$paths[$i]->families[count($paths[$i]->families)] = &$paths[$i];
}
findNeighbors($families);
if (debug()) {
$grid = array();
for ($j=0; $j<$width; $j++) {
for ($i=0; $i<$depth*4; $i++) {
$grid[$i][$j] = new Cell($j);
}
}
echo "\n\n<table style=\"width:95%\" border=\"0\" cellpadding=\"0\" cellspacing=\"0\">\n<tr>\n";
// Place people in grid by path
for ($thisPath=&$leftMargin->right, $col=0;
$col<$width;
$thisPath=&$thisPath->right, $col++) {
placePath($grid, $thisPath, $col);
echo "<td align=\"center\">" . $thisPath->index;
if ($thisPath->mustBeNeighbor[0] != null) {
echo " (" . $thisPath->mustBeNeighbor[0]->index;
if ($thisPath->mustBeNeighbor[1] != null) {
echo ", " . $thisPath->mustBeNeighbor[1]->index;
}
echo ")";
}
echo "</td>\n";
}
echo "</tr>\n";
printTheChart($grid);
}
// Rearrange paths for efficiency
for ($row=2; $row<$depth-1; $row++) { // skip the first generation since there's just one person
for ($currentPath = &$leftMargin->right;
$currentPath->right !== $leftMargin;
$currentPath = &$currentPath->right) {
if ($currentPath->neighborsLocked() || $currentPath->persons[$row] == "dummy") continue;
// if (debug()) echo "Checking Path " . $currentPath->index . " as left path.<br>";
$nameBreak = FALSE;
for ($checkPath = &$currentPath->right;
$checkPath->right !== $leftMargin;
$checkPath = &$checkPath->right) {
if ($checkPath->persons[$row] == "dummy") {
$nameBreak = TRUE;
continue;
}
// if (debug()) echo "Checking Path " . $checkPath->index . " as right path.<br>";
if ($currentPath->persons[$row] === $checkPath->persons[$row]) {
if ($nameBreak) {
if ($checkPath->neighborsLocked()) continue;
// These are duplicates so try to move the paths next to each other.
if (debug()) echo "<br>Paths " . $currentPath->index . " and " . $checkPath->index . " should go next to each other if possible (generation " . $row;
if (debug()) echo " " . $currentPath->persons[$row]->getWTID() . ")<br>\n";
$status = consolidate($currentPath, $checkPath);
if ($status == 0 && debug()) {
echo "\n\n<table style=\"width:95%\" border=\"0\" cellpadding=\"0\" cellspacing=\"0\">\n<tr>\n";
$grid = array();
for ($j=0; $j<$width; $j++) {
for ($i=0; $i<$depth*4; $i++) {
$grid[$i][$j] = new Cell($j);
}
}
// Place people in grid by path
for ($thisPath=&$leftMargin->right, $col=0;
$col<$width;
$thisPath=&$thisPath->right, $col++) {
placePath($grid, $thisPath, $col);
echo "<td align=\"center\">" . $thisPath->index;
if ($thisPath->mustBeNeighbor[0] != null) {
echo " (" . $thisPath->mustBeNeighbor[0]->index;
if ($thisPath->mustBeNeighbor[1] != null) {
echo ", " . $thisPath->mustBeNeighbor[1]->index;
}
echo ")";
}
echo "</td>\n";
}
echo "</tr>\n";
printTheChart($grid);
}
} else {
// Lock these two together if they aren't already, lest they be torn asunder later.
// echo "Attempting to lock together adjacent Paths " . $currentPath->index . " and " . $checkPath->index . " in generation " . $row . ".<br>\n";
if ($currentPath->mustBeNeighbor[0] !== $checkPath && $currentPath->mustBeNeighbor[1] !== $checkPath &&
$currentPath->persons[$row-1] !== $checkPath->persons[$row-1]) {
if ($currentPath->mustBeNeighbor[0] == null) {
$currentPath->mustBeNeighbor[0] = &$checkPath;
} else if ($currentPath->mustBeNeighbor[1] == null) {
$currentPath->mustBeNeighbor[1] = &$checkPath;
}
if ($checkPath->mustBeNeighbor[0] == null) {
$checkPath->mustBeNeighbor[0] = &$currentPath;
} else if ($checkPath->mustBeNeighbor[1] == null) {
$checkPath->mustBeNeighbor[1] = &$currentPath;
}
if (debug()) echo "Locked together adjacent Paths " . $currentPath->index . " and " . $checkPath->index . " in generation " . $row . ".<br>\n";
}
$currentPath = &$checkPath;
}
} else {
$nameBreak = TRUE;
}
}
}
}
$grid = array();
for ($j=0; $j<$width; $j++) {
for ($i=0; $i<$depth*4; $i++) {
$grid[$i][$j] = new Cell($j);
}
}
// Place people in grid by path
for ($thisPath=&$leftMargin->right, $col=0;
$col<$width;
$thisPath=&$thisPath->right, $col++) {
placePath($grid, $thisPath, $col);
}
// Consolidate adjacent duplicate persons
for ($i=1; $i<$depth*4; $i+=4) { // start at 1st row with name (very 1st is blank), jump by 4 rows (names every 4 rows)
for ($j=0; $grid[$i][$j]->endCol() < $width; ) {
// if this isn't an empty space and the next space to the right is the same person
if (($grid[$i][$j]->person != null) && ($grid[$i][$j]->person == $grid[$i][$grid[$i][$j]->endCol()]->person)) {
// the for($m) loop will traverse down the columns, merging this person and any subsequent empty blocks
for ($m=0;
$i+$m<$depth*4 && ($m == 0 || $grid[$i+$m][$j]->person == null);
$m+=4) {
// combine vertical blocks of 4 cells into 1 vertical block of 4 cells
for ($k=-1; $k<3; $k++) {
// wipe out what was there (cell won't be printed anyway)
$grid[$i+$m+$k][$grid[$i+$m+$k][$j]->endCol()] = new Cell($grid[$i+$m+$k][$j]->endCol());
// increase colspan by colspan of covered cell
$grid[$i+$m+$k][$j]->colspan += $grid[$i+$m+$k][$grid[$i+$m+$k][$j]->endCol()]->colspan;
}
}
// if this isn't the top person and if the child span is bigger than the parent span
if (!$grid[$i][$j]->person->isTarget && $grid[$i][$j]->colspan > $grid[$i-4][$j]->colspan) {
// Draw horizontal line linking parents
$grid[$i-2][$j]->align = "right";
$grid[$i-2][$j]->text = "<hr width=\"50%\" align=\"right\">"; // first cell
for ($k=1; $k<$grid[$i][$j]->colspan; $k+= $grid[$i][$j+$k]->colspan) {
if ($grid[$i-2][$j+$k]->endCol() < $grid[$i][$j]->endCol()) {
$grid[$i-2][$j+$k]->text = "<hr width=\"100%\">"; // middle cells
} else {
$grid[$i-2][$j+$k]->align = "left";
$grid[$i-2][$j+$k]->text = "<hr width=\"50%\" align=\"left\">"; //last cell
}
}
}
} else {
$j += $grid[$i][$j]->colspan;
}
}
}
// Draw horizontal lines linking siblings
for ($i=5; $i<$depth*4; $i+=4) { // start with 2nd row of 2nd generation (contains names)
for ($j=0; $grid[$i][$j]->endCol() < $width; $j += $grid[$i][$j]->colspan) {
// if child span is smaller than parent span
if ($grid[$i][$j]->colspan < $grid[$i-4][$j]->colspan) {
// Draw horizontal line linking siblings, in last row of previous generation
$grid[$i-2][$j]->colspan = $grid[$i][$j]->colspan;
$grid[$i-2][$j]->align = "right";
$grid[$i-2][$j]->text = "<hr width=\"50%\" align=\"right\">"; // left-most cell
for ($k=1; $k<$grid[$i-3][$j]->colspan; $k += $grid[$i][$j+$k]->colspan) {
$grid[$i-2][$j+$k]->colspan = $grid[$i][$j+$k]->colspan;
if ($j + $k + $grid[$i-2][$j+$k]->colspan < $j + $grid[$i-3][$j]->colspan) {
$grid[$i-2][$j+$k]->text = "<hr width=\"100%\">"; // middle cell(s)
} else {
$grid[$i-2][$j+$k]->align = "left";
$grid[$i-2][$j+$k]->text = "<hr width=\"50%\" align=\"left\">"; // right-most cell
}
}
}
}
}
// reduce the space between generations where possible
for ($i=7; $i<$depth*4-1; $i+=4) {
$noHzLines = TRUE;
for ($j=0; $j < $width; $j += $grid[$i][$j]->colspan) {
if ($grid[$i][$j]->text != "|") $noHzLines = FALSE;
}
if ($noHzLines) {
// delete some extra vertical space
unset($grid[$i]);