Gecko [ v3.cesa.co.za ]

Linux cesa-www-main 6.1.0-49-cloud-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.174-1 (2026-05-26) x86_64
Apache/2.4.68 (Debian)
Server IP : 10.218.0.2 & Your IP : 216.73.217.117
Domains : Cant Read [ /etc/named.conf ]
User : www-data

Name	Size	Permission	Date
Exception	[ DIR ]	drwxrwxr-x	2026-08-17 03:12
Output	[ DIR ]	drwxrwxr-x	2026-08-17 03:12
.htaccess	237 B	-r-xr-xr-x	2026-08-17 03:12
Chunk.php	1.61 KB	-rwxrwxr-x	2024-03-02 06:30
Diff.php	1.1 KB	-rwxrwxr-x	2024-03-02 06:30
Differ.php	9.22 KB	-rwxrwxr-x	2024-03-02 06:30
Line.php	848 B	-rwxrwxr-x	2024-03-02 06:30
LongestCommonSubsequenceCalculator.php	486 B	-rwxrwxr-x	2024-03-02 06:30
MemoryEfficientLongestCommonSubsequenceCalculator.php	2.45 KB	-rwxrwxr-x	2024-03-02 06:30
Parser.php	3.02 KB	-rwxrwxr-x	2024-03-02 06:30
TimeEfficientLongestCommonSubsequenceCalculator.php	2.31 KB	-rwxrwxr-x	2024-03-02 06:30

Rename

<?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);
    }
}