Chris@0
|
1 <?php
|
Chris@0
|
2 /*
|
Chris@0
|
3 * This file is part of the Diff package.
|
Chris@0
|
4 *
|
Chris@0
|
5 * (c) Sebastian Bergmann <sebastian@phpunit.de>
|
Chris@0
|
6 *
|
Chris@0
|
7 * For the full copyright and license information, please view the LICENSE
|
Chris@0
|
8 * file that was distributed with this source code.
|
Chris@0
|
9 */
|
Chris@0
|
10
|
Chris@0
|
11 namespace SebastianBergmann\Diff\LCS;
|
Chris@0
|
12
|
Chris@0
|
13 /**
|
Chris@0
|
14 * Time-efficient implementation of longest common subsequence calculation.
|
Chris@0
|
15 */
|
Chris@0
|
16 class TimeEfficientImplementation implements LongestCommonSubsequence
|
Chris@0
|
17 {
|
Chris@0
|
18 /**
|
Chris@0
|
19 * Calculates the longest common subsequence of two arrays.
|
Chris@0
|
20 *
|
Chris@0
|
21 * @param array $from
|
Chris@0
|
22 * @param array $to
|
Chris@0
|
23 *
|
Chris@0
|
24 * @return array
|
Chris@0
|
25 */
|
Chris@0
|
26 public function calculate(array $from, array $to)
|
Chris@0
|
27 {
|
Chris@0
|
28 $common = array();
|
Chris@0
|
29 $fromLength = count($from);
|
Chris@0
|
30 $toLength = count($to);
|
Chris@0
|
31 $width = $fromLength + 1;
|
Chris@0
|
32 $matrix = new \SplFixedArray($width * ($toLength + 1));
|
Chris@0
|
33
|
Chris@0
|
34 for ($i = 0; $i <= $fromLength; ++$i) {
|
Chris@0
|
35 $matrix[$i] = 0;
|
Chris@0
|
36 }
|
Chris@0
|
37
|
Chris@0
|
38 for ($j = 0; $j <= $toLength; ++$j) {
|
Chris@0
|
39 $matrix[$j * $width] = 0;
|
Chris@0
|
40 }
|
Chris@0
|
41
|
Chris@0
|
42 for ($i = 1; $i <= $fromLength; ++$i) {
|
Chris@0
|
43 for ($j = 1; $j <= $toLength; ++$j) {
|
Chris@0
|
44 $o = ($j * $width) + $i;
|
Chris@0
|
45 $matrix[$o] = max(
|
Chris@0
|
46 $matrix[$o - 1],
|
Chris@0
|
47 $matrix[$o - $width],
|
Chris@0
|
48 $from[$i - 1] === $to[$j - 1] ? $matrix[$o - $width - 1] + 1 : 0
|
Chris@0
|
49 );
|
Chris@0
|
50 }
|
Chris@0
|
51 }
|
Chris@0
|
52
|
Chris@0
|
53 $i = $fromLength;
|
Chris@0
|
54 $j = $toLength;
|
Chris@0
|
55
|
Chris@0
|
56 while ($i > 0 && $j > 0) {
|
Chris@0
|
57 if ($from[$i-1] === $to[$j-1]) {
|
Chris@0
|
58 $common[] = $from[$i-1];
|
Chris@0
|
59 --$i;
|
Chris@0
|
60 --$j;
|
Chris@0
|
61 } else {
|
Chris@0
|
62 $o = ($j * $width) + $i;
|
Chris@0
|
63 if ($matrix[$o - $width] > $matrix[$o - 1]) {
|
Chris@0
|
64 --$j;
|
Chris@0
|
65 } else {
|
Chris@0
|
66 --$i;
|
Chris@0
|
67 }
|
Chris@0
|
68 }
|
Chris@0
|
69 }
|
Chris@0
|
70
|
Chris@0
|
71 return array_reverse($common);
|
Chris@0
|
72 }
|
Chris@0
|
73 }
|