Since TreeWalk creates new child iterators as it dives into a subtree
(and pops them when it comes out of the subtree) we must allow callers
to locate their current iterator if they need additional APIs from it.
Signed-off-by: Shawn O. Pearce <spearce@xxxxxxxxxxx>
---
.../src/org/spearce/jgit/treewalk/TreeWalk.java | 23 ++++++++++++++++++++
1 files changed, 23 insertions(+), 0 deletions(-)
diff --git a/org.spearce.jgit/src/org/spearce/jgit/treewalk/TreeWalk.java b/org.spearce.jgit/src/org/spearce/jgit/treewalk/TreeWalk.java
index 7ea16b5..9f373e6 100644
--- a/org.spearce.jgit/src/org/spearce/jgit/treewalk/TreeWalk.java
+++ b/org.spearce.jgit/src/org/spearce/jgit/treewalk/TreeWalk.java
@@ -413,6 +413,29 @@ public class TreeWalk {
}
/**
+ * Obtain the tree iterator for the current entry.
+ * <p>
+ * Entering into (or exiting out of) a subtree causes the current tree
+ * iterator instance to be changed for the nth tree. This allows the tree
+ * iterators to manage only one list of items, with the diving handled by
+ * recursive trees.
+ *
+ * @param <T>
+ * type of the tree iterator expected by the caller.
+ * @param nth
+ * tree to obtain the current iterator of.
+ * @param clazz
+ * type of the tree iterator expected by the caller.
+ * @return r the current iterator of the requested type; null if the tree
+ * has no entry to match the current path.
+ */
+ public <T extends AbstractTreeIterator> T getTree(final int nth,
+ final Class<T> clazz) {
+ final AbstractTreeIterator t = trees[nth];
+ return t.matches == currentHead ? (T) t : null;
+ }
+
+ /**
* Obtain the raw {@link FileMode} bits for the current entry.
* <p>
* Every added tree supplies mode bits, even if the tree does not contain
--
1.6.0.rc2.219.g1250ab
--
To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
