Public Member Functions | |
| __construct ($tooLong=2000000, $powLimit=1.45) | |
| diff ($from, $to) | |
| diff_range ($from_lines, $to_lines) | |
| getLcsLength () | |
Public Attributes | |
| $length | |
| $removed | |
| $added | |
| $heuristicUsed | |
Private Member Functions | |
| lcs_rec ($bottoml1, $topl1, $bottoml2, $topl2, &$V, &$snake) | |
| find_middle_snake ($bottoml1, $topl1, $bottoml2, $topl2, &$V, &$snake) | |
Static Private Member Functions | |
| static | findMostProgress ($M, $N, $limit, $V) |
Private Attributes | |
| $from | |
| $to | |
| $m | |
| $n | |
| $tooLong | |
| $powLimit | |
| $maxDifferences | |
| $lcsLengthCorrectedForHeuristic = false | |
's "An O(NP) Sequence Comparison Algorithm").
This implementation supports an upper bound on the excution time.
Complexity: O((M + N)D) worst case time, O(M + N + D^2) expected time, O(M + N) space
Definition at line 33 of file Diff.php.
| WikiDiff3::__construct | ( | $ | tooLong = 2000000, |
|
| $ | powLimit = 1.45 | |||
| ) |
| WikiDiff3::diff | ( | $ | from, | |
| $ | to | |||
| ) |
| WikiDiff3::diff_range | ( | $ | from_lines, | |
| $ | to_lines | |||
| ) |
| WikiDiff3::find_middle_snake | ( | $ | bottoml1, | |
| $ | topl1, | |||
| $ | bottoml2, | |||
| $ | topl2, | |||
| &$ | V, | |||
| &$ | snake | |||
| ) | [private] |
| static WikiDiff3::findMostProgress | ( | $ | M, | |
| $ | N, | |||
| $ | limit, | |||
| $ | V | |||
| ) | [static, private] |
| WikiDiff3::lcs_rec | ( | $ | bottoml1, | |
| $ | topl1, | |||
| $ | bottoml2, | |||
| $ | topl2, | |||
| &$ | V, | |||
| &$ | snake | |||
| ) | [private] |
Definition at line 210 of file Diff.php.
References $i, and find_middle_snake().
Referenced by diff().
WikiDiff3::$from [private] |
WikiDiff3::$lcsLengthCorrectedForHeuristic = false [private] |
WikiDiff3::$powLimit [private] |
WikiDiff3::$to [private] |
WikiDiff3::$tooLong [private] |
1.5.9