protected void print(RevTree root) { PreOrderDiffWalk walk = new PreOrderDiffWalk(RevTree.EMPTY, root, objectStore, objectStore, true); walk.walk(new PreOrderDiffWalk.AbstractConsumer() { String indent = "";
: source.getTree(rightTreeId); PreOrderDiffWalk walk = new PreOrderDiffWalk(left, right, source, source); walk.nodeOrder(this.diffOrder); walk.walk(new PreOrderDiffWalk.AbstractConsumer() {
public void call(PreOrderDiffWalk.Consumer consumer) { checkArgument(oldRefSpec != null || oldTreeId != null || oldTree != null, "old version not specified"); checkArgument(newRefSpec != null || oldTreeId != null || newTree != null, "new version not specified"); final ObjectStore leftSource; final ObjectStore rightSource; leftSource = this.leftSource == null ? objectDatabase() : this.leftSource; rightSource = this.rightSource == null ? objectDatabase() : this.rightSource; final RevTree oldTree = resolveTree(oldRefSpec, this.oldTreeId, this.oldTree, leftSource); final RevTree newTree = resolveTree(newRefSpec, this.newTreeId, this.newTree, rightSource); final PreOrderDiffWalk visitor = new PreOrderDiffWalk(oldTree, newTree, leftSource, rightSource, preserveIterationOrder); visitor.setDefaultMetadataId(this.metadataId); visitor.walk(consumer); }
public final void walk(final Predicate<Bounded> filter, final Consumer consumer) { DepthFirstConsumer depthFirstConsumer = new DepthFirstConsumer(filter, consumer); inOrder.walk(depthFirstConsumer); }
public PostOrderDiffWalk(RevTree left, RevTree right, ObjectStore leftSource, ObjectStore rightSource) { this.inOrder = new PreOrderDiffWalk(left, right, leftSource, rightSource); }
public final void walk(final Predicate<Bounded> filter, final Consumer consumer) { DepthFirstConsumer depthFirstConsumer = new DepthFirstConsumer(filter, consumer); inOrder.walk(depthFirstConsumer); }
public PostOrderDiffWalk(RevTree left, RevTree right, ObjectStore leftSource, ObjectStore rightSource) { this.inOrder = new PreOrderDiffWalk(left, right, leftSource, rightSource); }
protected void print(RevTree root) { PreOrderDiffWalk walk = new PreOrderDiffWalk(RevTree.EMPTY, root, objectStore, objectStore, true); walk.walk(new PreOrderDiffWalk.AbstractConsumer() { String indent = "";
@Test public void testSameRootTree() { RevTree left = RevObjectTestSupport.INSTANCE.createFeaturesTree(leftSource, "f", 10); RevTree right = left; PreOrderDiffWalk visitor = newVisitor(left, right); visitor.walk(consumer); verifyNoMoreInteractions(consumer); }
private PreOrderDiffWalk newVisitor(RevTree left, RevTree right) { PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource); return visitor; }
/** * */ private int getTreeDepth(RevTree tree, ObjectDatabase source, final int depth) { PreOrderDiffWalk visitor = new PreOrderDiffWalk(tree, RevTree.EMPTY, source, source); final AtomicInteger maxDepth = new AtomicInteger(); visitor.walk(new PreOrderDiffWalk.AbstractConsumer() { @Override public boolean bucket(NodeRef lparent, NodeRef rparent, BucketIndex bucketIndex, Bucket left, Bucket right) { int bucketDepth = bucketIndex.depthIndex(); maxDepth.set(Math.max(maxDepth.get(), bucketDepth + 1));// use +1 cause we want the // number of levels, not the // zero-based level index return true; } }); return maxDepth.get(); }
@Test public void testSameRootTree() { RevTree left = testSupport.createFeaturesTree(leftSource, "f", 10); RevTree right = left; PreOrderDiffWalk visitor = newVisitor(left, right); visitor.walk(consumer); verifyNoMoreInteractions(consumer); }
private PreOrderDiffWalk newVisitor(RevTree left, RevTree right) { PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource); return visitor; }
/** * */ private int getTreeDepth(RevTree tree, ObjectDatabase source, final int depth) { PreOrderDiffWalk visitor = new PreOrderDiffWalk(tree, RevTree.EMPTY, source, source); final AtomicInteger maxDepth = new AtomicInteger(); visitor.walk(new PreOrderDiffWalk.AbstractConsumer() { @Override public boolean bucket(NodeRef lparent, NodeRef rparent, BucketIndex bucketIndex, Bucket left, Bucket right) { int bucketDepth = bucketIndex.depthIndex(); maxDepth.set(Math.max(maxDepth.get(), bucketDepth + 1));// use +1 cause we want the // number of levels, not the // zero-based level index return true; } }); return maxDepth.get(); }
@Test public void testSameRootTree() { RevTree left = createFeaturesTree(leftSource, "f", 10); RevTree right = left; PreOrderDiffWalk visitor = newVisitor(left, right); visitor.walk(consumer); verifyNoMoreInteractions(consumer); }
private PreOrderDiffWalk newVisitor(RevTree left, RevTree right) { PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource); return visitor; }
/** * */ private int getTreeDepth(RevTree tree, ObjectDatabase source, final int depth) { PreOrderDiffWalk visitor = new PreOrderDiffWalk(tree, RevTree.EMPTY, source, source); final AtomicInteger maxDepth = new AtomicInteger(); visitor.walk(new PreOrderDiffWalk.AbstractConsumer() { @Override public boolean bucket(NodeRef lparent, NodeRef rparent, BucketIndex bucketIndex, Bucket left, Bucket right) { int bucketDepth = bucketIndex.depthIndex(); maxDepth.set(Math.max(maxDepth.get(), bucketDepth + 1));// use +1 cause we want the // number of levels, not the // zero-based level index return true; } }); return maxDepth.get(); }
@Test public void testSameChildTree() { RevTree left = testSupport.createFeaturesTree(leftSource, "f", 10); RevTree right = left; PreOrderDiffWalk visitor = newVisitor(left, right); visitor.walk(consumer); verifyNoMoreInteractions(consumer); }