]> source.dussan.org Git - jgit.git/commit
Define LowLevelDiffAlgorithm to bypass re-hashing 62/1662/3
authorShawn O. Pearce <spearce@spearce.org>
Sat, 25 Sep 2010 00:22:42 +0000 (17:22 -0700)
committerShawn O. Pearce <spearce@spearce.org>
Sun, 10 Oct 2010 21:39:29 +0000 (14:39 -0700)
commit1bd24a23f944e6e9a27eccd34109bd19a94582df
tree2990a1d5abe4efdc36e5dba0ff6c5da8343ffa9d
parent4fc50df97df55b1090d8ef5717805003527742cd
Define LowLevelDiffAlgorithm to bypass re-hashing

When passing to a fallback algorithm, we can avoid creating a new copy
of the hash codes for each sequence by passing in the hashed sequences
directly.  This makes it cheaper to switch from HistogramDiff down to
MyersDiff in a single pass.

Change-Id: Ibf2e81be57c083862eeb134279aed676653bf9b5
Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
org.eclipse.jgit/src/org/eclipse/jgit/diff/HistogramDiff.java
org.eclipse.jgit/src/org/eclipse/jgit/diff/LowLevelDiffAlgorithm.java [new file with mode: 0644]
org.eclipse.jgit/src/org/eclipse/jgit/diff/MyersDiff.java