fisharebest /
webtrees
@@ -1,4 +1,4 @@ |
||
| 1 | -<?php return array ( |
|
| 1 | +<?php return array( |
|
| 2 | 2 | ' but the details are unknown' => ' 但是詳情未知', |
| 3 | 3 | ' in ' => ' 在 ', |
| 4 | 4 | '#%s' => '#%s', |
@@ -1,4 +1,4 @@ |
||
| 1 | -<?php return array ( |
|
| 1 | +<?php return array( |
|
| 2 | 2 | ' but the details are unknown' => ' 但是详情未知', |
| 3 | 3 | ' in ' => ' 在 ', |
| 4 | 4 | '#%s' => '#%s', |
@@ -242,7 +242,7 @@ discard block |
||
| 242 | 242 | if ($spouse === $individual2) { |
| 243 | 243 | return $new_path; |
| 244 | 244 | } |
| 245 | - $paths[] = $new_path; |
|
| 245 | + $paths[] = $new_path; |
|
| 246 | 246 | $visited[$spouse->xref()] = true; |
| 247 | 247 | } |
| 248 | 248 | } |
@@ -255,7 +255,7 @@ discard block |
||
| 255 | 255 | if ($child === $individual2) { |
| 256 | 256 | return $new_path; |
| 257 | 257 | } |
| 258 | - $paths[] = $new_path; |
|
| 258 | + $paths[] = $new_path; |
|
| 259 | 259 | $visited[$child->xref()] = true; |
| 260 | 260 | } |
| 261 | 261 | } |
@@ -272,7 +272,7 @@ discard block |
||
| 272 | 272 | if ($spouse === $individual2) { |
| 273 | 273 | return $new_path; |
| 274 | 274 | } |
| 275 | - $paths[] = $new_path; |
|
| 275 | + $paths[] = $new_path; |
|
| 276 | 276 | $visited[$spouse->xref()] = true; |
| 277 | 277 | } |
| 278 | 278 | } |
@@ -285,7 +285,7 @@ discard block |
||
| 285 | 285 | if ($child === $individual2) { |
| 286 | 286 | return $new_path; |
| 287 | 287 | } |
| 288 | - $paths[] = $new_path; |
|
| 288 | + $paths[] = $new_path; |
|
| 289 | 289 | $visited[$child->xref()] = true; |
| 290 | 290 | } |
| 291 | 291 | } |
