?HAMA

Edit File Size: 2.31 KB

/proc/thread-self/root/home/byroehnu/easetack.com/vendor/sebastian/diff/src/TimeEfficientLongestCommonSubsequenceCalculator.php

Text Base64

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

Exit & Reset Text mode: syntax highlighting auto-detects file type.

Name	Size	Perms	Modified	Actions
Exception DIR	-	drwxrwxrwx	2025-05-16 16:14:51	Edit Download recursive recursive
Output DIR	-	drwxrwxrwx	2025-05-16 16:14:51	Edit Download recursive recursive
Chunk.php	1.79 KB	lrw-rw-rw-	2024-07-03 04:53:05	Edit Download recursive recursive
Diff.php	1.57 KB	lrw-rw-rw-	2024-07-03 04:53:05	Edit Download recursive recursive
Differ.php	6.76 KB	lrw-rw-rw-	2024-07-03 04:53:05	Edit Download recursive recursive
Line.php	1.05 KB	lrw-rw-rw-	2024-07-03 04:53:05	Edit Download recursive recursive
LongestCommonSubsequenceCalculator.php	486 B	lrw-rw-rw-	2024-07-03 04:53:05	Edit Download recursive recursive
MemoryEfficientLongestCommonSubsequenceCalculator.php	2.61 KB	lrw-rw-rw-	2024-07-03 04:53:05	Edit Download recursive recursive
Parser.php	3.11 KB	lrw-rw-rw-	2024-07-03 04:53:05	Edit Download recursive recursive
TimeEfficientLongestCommonSubsequenceCalculator.php	2.31 KB	lrw-rw-rw-	2024-07-03 04:53:05	Edit Download recursive recursive

Directory Contents