Gecko [ unitednationsplay.com ]

Linux unitednationsplay.com 3.10.0-1160.45.1.el7.x86_64 #1 SMP Wed Oct 13 17:20:51 UTC 2021 x86_64
nginx/1.20.1
Server IP : 188.130.139.92 & Your IP : 3.140.254.100
Domains : Cant Read [ /etc/named.conf ]
User : web

Name	Size	Permission	Date
Exception	[ DIR ]	drwxr-xr-x	2018-06-10 09:00
Output	[ DIR ]	drwxr-xr-x	2018-06-10 09:00
Chunk.php	1.37 KB	-rw-r--r--	2018-06-10 09:00
Diff.php	1.16 KB	-rw-r--r--	2018-06-10 09:00
Differ.php	9.31 KB	-rw-r--r--	2018-06-10 09:00
Line.php	847 B	-rw-r--r--	2018-06-10 09:00
LongestCommonSubsequenceCalculator.php	572 B	-rw-r--r--	2018-06-10 09:00
MemoryEfficientLongestCommonSubsequenceCalculator.php	2.08 KB	-rw-r--r--	2018-06-10 09:00
Parser.php	2.91 KB	-rw-r--r--	2018-06-10 09:00
TimeEfficientLongestCommonSubsequenceCalculator.php	1.76 KB	-rw-r--r--	2018-06-10 09:00

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;

final class MemoryEfficientLongestCommonSubsequenceCalculator implements LongestCommonSubsequenceCalculator
{
    /**
     * {@inheritdoc}
     */
    public function calculate(array $from, array $to): array
    {
        $cFrom = \count($from);
        $cTo   = \count($to);

if ($cFrom === 0) {
            return [];
        }

if ($cFrom === 1) {
            if (\in_array($from[0], $to, true)) {
                return [$from[0]];
            }

return [];
        }

$i         = (int) ($cFrom / 2);
        $fromStart = \array_slice($from, 0, $i);
        $fromEnd   = \array_slice($from, $i);
        $llB       = $this->length($fromStart, $to);
        $llE       = $this->length(\array_reverse($fromEnd), \array_reverse($to));
        $jMax      = 0;
        $max       = 0;

for ($j = 0; $j <= $cTo; $j++) {
            $m = $llB[$j] + $llE[$cTo - $j];

if ($m >= $max) {
                $max  = $m;
                $jMax = $j;
            }
        }

$toStart = \array_slice($to, 0, $jMax);
        $toEnd   = \array_slice($to, $jMax);

return \array_merge(
            $this->calculate($fromStart, $toStart),
            $this->calculate($fromEnd, $toEnd)
        );
    }

private function length(array $from, array $to): array
    {
        $current = \array_fill(0, \count($to) + 1, 0);
        $cFrom   = \count($from);
        $cTo     = \count($to);

for ($i = 0; $i < $cFrom; $i++) {
            $prev = $current;

for ($j = 0; $j < $cTo; $j++) {
                if ($from[$i] === $to[$j]) {
                    $current[$j + 1] = $prev[$j] + 1;
                } else {
                    $current[$j + 1] = \max($current[$j], $prev[$j + 1]);
                }
            }
        }

return $current;
    }
}