/** * Is the current entry a subtree returned after its children? * * @return true if the current node is a tree that has been returned after * its children were already processed. * @see #isPostOrderTraversal() */ public boolean isPostChildren() { return postChildren && isSubtree(); }
/** {@inheritDoc} */ @Override public boolean include(TreeWalk walker) throws MissingObjectException, IncorrectObjectTypeException, IOException { if (walker.isSubtree()) return true; else return walker.isPathSuffix(pathRaw, pathRaw.length); }
private static CanonicalTreeParser createParserAtPath(ObjectReader reader, AnyObjectId srcId, String prefix) throws IOException { ObjectId root = toTree(reader, srcId); if (prefix.isEmpty()) { return new CanonicalTreeParser(BINARY_R_REFS, reader, root); } String dir = RefTree.refPath(Paths.stripTrailingSeparator(prefix)); TreeWalk tw = TreeWalk.forPath(reader, dir, root); if (tw == null || !tw.isSubtree()) { return null; } ObjectId id = tw.getObjectId(0); return new CanonicalTreeParser(encode(prefix), reader, id); }
attr = walk.getAttributes(); break; } else if (walk.isSubtree()) { walk.enterSubtree();
/** * Is the current entry a subtree returned after its children? * * @return true if the current node is a tree that has been returned after * its children were already processed. * @see #isPostOrderTraversal() */ public boolean isPostChildren() { return postChildren && isSubtree(); }
/** * Is the current entry a subtree returned after its children? * * @return true if the current node is a tree that has been returned after * its children were already processed. * @see #isPostOrderTraversal() */ public boolean isPostChildren() { return postChildren && isSubtree(); }
if (includeTrees && walk.isSubtree()) walk.enterSubtree();
FileMode mode = walk.getFileMode(0); if (walk.isSubtree()) walk.enterSubtree();
@Override public boolean include(TreeWalk walker) { byte[] rp = walker.getRawPath(); Hasher hasher = new Hasher(rp, walker.getPathLength()); while (hasher.hasNext()) { int hash = hasher.nextHash(); if (fullpaths.contains(rp, hasher.length(), hash)) return true; if (!hasher.hasNext() && walker.isSubtree() && prefixes.contains(rp, hasher.length(), hash)) return true; } final int cmp = walker.isPathPrefix(max, max.length); if (cmp > 0) throw StopWalkException.INSTANCE; return false; }
if (f.isDone(tw)) { return tw; } else if (tw.isSubtree()) { tw.enterSubtree();
return false; if (treeWalk.isSubtree() && enterSubtree) treeWalk.enterSubtree();
@Override public boolean include(TreeWalk walker) { if (walker.isSubtree()) { return true; } return matches(walker); }
if (tw.isSubtree()) return true;
@Override public boolean include(TreeWalk walker) throws MissingObjectException, IncorrectObjectTypeException, IOException { if (walker.isSubtree()) return true; else return walker.isPathSuffix(pathRaw, pathRaw.length); }
@Override public boolean include(TreeWalk walker) { if (walker.isSubtree()) { return true; } return matches(walker); }
/** {@inheritDoc} */ @Override public boolean include(TreeWalk walker) throws MissingObjectException, IncorrectObjectTypeException, IOException { if (walker.isSubtree()) return true; else return walker.isPathSuffix(pathRaw, pathRaw.length); }
@Override public boolean include(TreeWalk walker) { if (walker.isSubtree()) { return true; } return matches(walker); }
TreeWalk treeWalk = new TreeWalk(repository); treeWalk.addTree(tree); treeWalk.setRecursive(false); while (treeWalk.next()) { if (treeWalk.isSubtree()) { System.out.println("dir: " + treeWalk.getPathString()); treeWalk.enterSubtree(); } else { System.out.println("file: " + treeWalk.getPathString()); } }
public boolean include(final RevWalk commitWalk, final TreeWalk treeWalk, final RevCommit commit) throws IOException { treeWalk.reset(); treeWalk.setFilter(filter); while (treeWalk.next()) if (treeWalk.isSubtree()) treeWalk.enterSubtree(); return true; }
private static CanonicalTreeParser createParserAtPath(ObjectReader reader, AnyObjectId srcId, String prefix) throws IOException { ObjectId root = toTree(reader, srcId); if (prefix.isEmpty()) { return new CanonicalTreeParser(BINARY_R_REFS, reader, root); } String dir = RefTree.refPath(Paths.stripTrailingSeparator(prefix)); TreeWalk tw = TreeWalk.forPath(reader, dir, root); if (tw == null || !tw.isSubtree()) { return null; } ObjectId id = tw.getObjectId(0); return new CanonicalTreeParser(encode(prefix), reader, id); }