/home/techb158/ileadtechnology.com/vendor/sebastian/diff/src
NameSizeModeActions
Exception/-0755rm
Output/-0755rm
Chunk.php16450644editdlrm
Diff.php11840644editdlrm
Differ.php95290644editdlrm
Line.php8470644editdlrm
LongestCommonSubsequenceCalculator.php5720644editdlrm
MemoryEfficientLongestCommonSubsequenceCalculator.php23530644editdlrm
Parser.php29820644editdlrm
TimeEfficientLongestCommonSubsequenceCalculator.php22890644editdlrm
Edit: /home/techb158/ileadtechnology.com/vendor/sebastian/diff/src/LongestCommonSubsequenceCalculator.php (572B)
* * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. */ namespace SebastianBergmann\Diff; interface LongestCommonSubsequenceCalculator { /** * Calculates the longest common subsequence of two arrays. * * @param array $from * @param array $to * * @return array */ public function calculate(array $from, array $to): array; }