commit | 1bd24a23f944e6e9a27eccd34109bd19a94582df | [log] [tgz] |
---|---|---|
author | Shawn O. Pearce <spearce@spearce.org> | Fri Sep 24 17:22:42 2010 -0700 |
committer | Shawn O. Pearce <spearce@spearce.org> | Sun Oct 10 14:39:29 2010 -0700 |
tree | 2990a1d5abe4efdc36e5dba0ff6c5da8343ffa9d | |
parent | 4fc50df97df55b1090d8ef5717805003527742cd [diff] |
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>