37f7b426b6
Implements automatic creation of required plugin pages (Community Login, Trainer Registration, Trainer Dashboard) upon plugin activation. This addresses E2E test failures caused by missing pages in the test environment. - Adds activation hook in `hvac-community-events.php` to call `hvac_ce_create_required_pages`. - The callback function checks for existing pages by slug and creates them using `wp_insert_post` if missing. Includes debug logging. Also fixes issues identified during E2E test debugging: - Corrects fatal error in `includes/community/class-login-handler.php` by replacing undefined constant `HVAC_COMMUNITY_EVENTS_PATH` with `HVAC_CE_PLUGIN_DIR`. - Updates `tests/e2e/tests/login.spec.ts` to use the correct selector `#wp-submit` for the login form submit button instead of `button[type="submit"]`. Documentation updates: - Adds `docs/automatic-page-creation-plan.md`. - Updates `README.md` regarding automatic page creation. - Updates Memory Bank files (`decisionLog.md`, `progress.md`, `activeContext.md`). Note: Activation hook logging did not appear during WP-CLI activation, requiring further investigation if page creation issues persist. E2E test confirmation pending.
82 lines
2.3 KiB
PHP
82 lines
2.3 KiB
PHP
<?php declare(strict_types=1);
|
|
/*
|
|
* This file is part of sebastian/diff.
|
|
*
|
|
* (c) Sebastian Bergmann <sebastian@phpunit.de>
|
|
*
|
|
* For the full copyright and license information, please view the LICENSE
|
|
* file that was distributed with this source code.
|
|
*/
|
|
namespace SebastianBergmann\Diff;
|
|
|
|
use function array_reverse;
|
|
use function count;
|
|
use function max;
|
|
use SplFixedArray;
|
|
|
|
final class TimeEfficientLongestCommonSubsequenceCalculator implements LongestCommonSubsequenceCalculator
|
|
{
|
|
/**
|
|
* {@inheritdoc}
|
|
*/
|
|
public function calculate(array $from, array $to): array
|
|
{
|
|
$common = [];
|
|
$fromLength = count($from);
|
|
$toLength = count($to);
|
|
$width = $fromLength + 1;
|
|
$matrix = new SplFixedArray($width * ($toLength + 1));
|
|
|
|
for ($i = 0; $i <= $fromLength; ++$i) {
|
|
$matrix[$i] = 0;
|
|
}
|
|
|
|
for ($j = 0; $j <= $toLength; ++$j) {
|
|
$matrix[$j * $width] = 0;
|
|
}
|
|
|
|
for ($i = 1; $i <= $fromLength; ++$i) {
|
|
for ($j = 1; $j <= $toLength; ++$j) {
|
|
$o = ($j * $width) + $i;
|
|
|
|
// don't use max() to avoid function call overhead
|
|
$firstOrLast = $from[$i - 1] === $to[$j - 1] ? $matrix[$o - $width - 1] + 1 : 0;
|
|
|
|
if ($matrix[$o - 1] > $matrix[$o - $width]) {
|
|
if ($firstOrLast > $matrix[$o - 1]) {
|
|
$matrix[$o] = $firstOrLast;
|
|
} else {
|
|
$matrix[$o] = $matrix[$o - 1];
|
|
}
|
|
} else {
|
|
if ($firstOrLast > $matrix[$o - $width]) {
|
|
$matrix[$o] = $firstOrLast;
|
|
} else {
|
|
$matrix[$o] = $matrix[$o - $width];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
$i = $fromLength;
|
|
$j = $toLength;
|
|
|
|
while ($i > 0 && $j > 0) {
|
|
if ($from[$i - 1] === $to[$j - 1]) {
|
|
$common[] = $from[$i - 1];
|
|
--$i;
|
|
--$j;
|
|
} else {
|
|
$o = ($j * $width) + $i;
|
|
|
|
if ($matrix[$o - $width] > $matrix[$o - 1]) {
|
|
--$j;
|
|
} else {
|
|
--$i;
|
|
}
|
|
}
|
|
}
|
|
|
|
return array_reverse($common);
|
|
}
|
|
}
|