b533a72934
HistogramDiff is an alternative implementation of patience diff, performing a search over all matching locations and picking the longest common subsequence that has the lowest occurrence count. If there are unique common elements, its behavior is identical to that of patience diff. Actual performance on real-world source files usually beats MyersDiff, sometimes by a factor of 3, especially for complex comparators that ignore whitespace. Change-Id: I1806cd708087e36d144fb824a0e5ab7cdd579d73 Signed-off-by: Shawn O. Pearce <spearce@spearce.org> |
||
---|---|---|
.. | ||
.settings | ||
META-INF | ||
exttst/org/eclipse/jgit | ||
tst/org/eclipse/jgit | ||
tst-rsrc/org/eclipse/jgit | ||
.classpath | ||
.gitignore | ||
.project | ||
build.properties | ||
org.eclipse.jgit.core--All-External-Tests (Java 6).launch | ||
org.eclipse.jgit.core--All-External-Tests.launch | ||
org.eclipse.jgit.core--All-Tests (Java 6).launch | ||
org.eclipse.jgit.core--All-Tests.launch | ||
plugin.properties | ||
pom.xml |