| commit | f9a118ebd98d27b937e497cb95bd0cdcc921348b | |
| author | Shawn O. Pearce <spearce@spearce.org> | |
| Wed, 18 Mar 2009 18:01:49 +0000 (18 11:01 -0700) | ||
| committer | Robin Rosenberg <robin.rosenberg@dewire.com> | |
| Fri, 20 Mar 2009 06:15:37 +0000 (20 07:15 +0100) | ||
| tree | ec761da1a55bf13daa231cbb52d76e348a88eee3 | treesnapshot (tar.gz zip) |
| parent | 0089788fc10578a9204b3e59e8d5df13cadda917 | commitdiff |
Micro-optimize the merge base generator
Instead of doing 3 bit-wise and operations followed by 3 compares
and two boolean and conditions on every commit we evaluate in the
history, we can fold all of the tests into a pair of fields and
do one bit mask and compare.
Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
Signed-off-by: Robin Rosenberg <robin.rosenberg@dewire.com>
Instead of doing 3 bit-wise and operations followed by 3 compares
and two boolean and conditions on every commit we evaluate in the
history, we can fold all of the tests into a pair of fields and
do one bit mask and compare.
Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
Signed-off-by: Robin Rosenberg <robin.rosenberg@dewire.com>
| org.spearce.jgit/src/org/spearce/jgit/revwalk/MergeBaseGenerator.java | diffblobblamehistory |