| commit | d19c17325f1e852ed9e1d3c7531a686851bc2ba4 | |
| author | Shawn O. Pearce <spearce@spearce.org> | |
| Mon, 18 Aug 2008 23:53:16 +0000 (18 16:53 -0700) | ||
| committer | Robin Rosenberg <robin.rosenberg@dewire.com> | |
| Wed, 20 Aug 2008 21:07:32 +0000 (20 23:07 +0200) | ||
| tree | 903e360aec30f1605a60eeefc863c85acf6898c6 | treesnapshot (tar.gz zip) |
| parent | f66d3c283c03fc34f0a16994385a1b5e98e11104 | commitdiff |
Optimize path comparsion within subtrees during TreeWalk
If we are comparing two entries whose parents both match the same
tree iterator we know the path up through pathOffset must all
be identical, as the parents can only match if their paths up to
pathOffset were equal and they were both trees.
Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
Signed-off-by: Robin Rosenberg <robin.rosenberg@dewire.com>
If we are comparing two entries whose parents both match the same
tree iterator we know the path up through pathOffset must all
be identical, as the parents can only match if their paths up to
pathOffset were equal and they were both trees.
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/treewalk/AbstractTreeIterator.java | diffblobblamehistory |