Implement new List Diffing algorithm for matching #49
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| } elseif ($i > 0 && ($j === 0 || $c[$i][$j - 1] < $c[$i - 1][$j])) { | ||
| $this->compileMatches($c, $a, $b, $i - 1, $j, $comparator, $matches); | ||
| } | ||
| } |
|
Only thing that needs updates are the test and annotations on the files/functions changed. |
|
A really great job! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
New algorithm for list diffing.
The algorithm is based on the algorithm described in "An Algorithm for Differential File Comparison" (http://www.cs.dartmouth.edu/~doug/diff.pdf).
Basic concept is to find the LCS (longest common subsequence) for the list items in a list in order to help match list items against each other.