public static RevTreeBuilder createFeaturesTreeBuilder(ObjectStore source, final String namePrefix, final int numEntries) { return createFeaturesTreeBuilder(source, namePrefix, numEntries, 0, false); }
public RevTreeBuilder createFeaturesTreeBuilder(ObjectStore source, final String namePrefix, final int numEntries) { return createFeaturesTreeBuilder(source, namePrefix, numEntries, 0, false); }
public static RevTree createFeaturesTree(ObjectStore source, final String namePrefix, final int numEntries, final int startIndex, boolean randomIds) { RevTree tree = createFeaturesTreeBuilder(source, namePrefix, numEntries, startIndex, randomIds).build(); source.put(tree); return tree; }
public RevTree createFeaturesTree(ObjectStore source, final String namePrefix, final int numEntries) { RevTree tree = createFeaturesTreeBuilder(source, namePrefix, numEntries).build(); source.put(tree); return tree; }
public RevTree createFeaturesTree(ObjectStore source, final String namePrefix, final int numEntries, final int startIndex, boolean randomIds) { RevTree tree = createFeaturesTreeBuilder(source, namePrefix, numEntries, startIndex, randomIds).build(); source.put(tree); return tree; }
public static RevTree createFeaturesTree(ObjectStore source, final String namePrefix, final int numEntries) { RevTree tree = createFeaturesTreeBuilder(source, namePrefix, numEntries).build(); source.put(tree); return tree; }
@Test public void testSameChildTree() { RevTree left = RevObjectTestSupport.INSTANCE.createFeaturesTreeBuilder(leftSource, "f", 10) .build(); RevTree right = left; leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); Consumer consumer = mock(Consumer.class); visitor.walk(consumer); verifyNoMoreInteractions(consumer); }
@Test public void testSameRootTree() { RevTree left = RevObjectTestSupport.INSTANCE.createFeaturesTreeBuilder(leftSource, "f", 10) .build(); RevTree right = left; leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); Consumer consumer = mock(Consumer.class); visitor.walk(consumer); verifyNoMoreInteractions(consumer); }
@Test public void testSameRootTree() { RevTree left = createFeaturesTreeBuilder(leftSource, "f", 10).build(); RevTree right = left; leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); Consumer consumer = mock(Consumer.class); visitor.walk(consumer); verifyNoMoreInteractions(consumer); }
@Test public void testSameChildTree() { RevTree left = createFeaturesTreeBuilder(leftSource, "f", 10).build(); RevTree right = left; leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); Consumer consumer = mock(Consumer.class); visitor.walk(consumer); verifyNoMoreInteractions(consumer); }
.createFeaturesTreeBuilder(rightSource, "f", 5); builder.put(nodeChange1); builder.put(nodeChange2);
@Test public void testSimple() { RevTree left = createFeaturesTreeBuilder(leftSource, "f", 1).build(); RevTree right = createFeaturesTreeBuilder(rightSource, "f", 2).build(); leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); List<? extends Bounded> expectedLeft = newArrayList(null, nodeFor(left)); List<? extends Bounded> expectedRight = newArrayList(featureNodeRef("f", 1), nodeFor(right)); visitor.walk(testConsumer); assertEquals(expectedLeft, testConsumer.orderedLeft); assertEquals(expectedRight, testConsumer.orderedRight); }
RevTreeBuilder builder = testSupport.createFeaturesTreeBuilder(rightSource, "f", 5); builder.put(nodeChange1); builder.put(nodeChange2);
@Test public void testSimple() { RevTree left = RevObjectTestSupport.INSTANCE.createFeaturesTreeBuilder(leftSource, "f", 1) .build(); RevTree right = RevObjectTestSupport.INSTANCE.createFeaturesTreeBuilder(rightSource, "f", 2) .build(); leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); List<? extends Bounded> expectedLeft = newArrayList(null, nodeFor(left)); List<? extends Bounded> expectedRight = newArrayList(featureNodeRef("f", 1), nodeFor(right)); visitor.walk(testConsumer); assertEquals(expectedLeft, testConsumer.orderedLeft); assertEquals(expectedRight, testConsumer.orderedRight); }
@Test public void testBucketBucketFlat() { RevTree left = RevObjectTestSupport.INSTANCE.createFeaturesTreeBuilder(leftSource, "f", CanonicalNodeNameOrder.normalizedSizeLimit(0) + 1).build(); RevTree right = RevObjectTestSupport.INSTANCE.createFeaturesTreeBuilder(rightSource, "f", CanonicalNodeNameOrder.normalizedSizeLimit(0) + 2).build(); leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); visitor.walk(testConsumer); List<Bounded> leftCalls = testConsumer.orderedLeft; List<Bounded> rightCalls = testConsumer.orderedRight; NodeRef lroot = nodeFor(left); NodeRef rroot = nodeFor(right); assertEquals(3, leftCalls.size()); assertEquals(3, rightCalls.size()); assertNull(leftCalls.get(0)); assertTrue(leftCalls.get(1) instanceof Bucket); assertEquals(lroot, leftCalls.get(2)); assertEquals(rroot, rightCalls.get(2)); assertTrue(rightCalls.get(1) instanceof Bucket); assertTrue(rightCalls.get(0) instanceof NodeRef); assertEquals(RevObject.TYPE.FEATURE, ((NodeRef) rightCalls.get(0)).getType()); }
@Test public void testBucketBucketFlat() { RevTree left = createFeaturesTreeBuilder(leftSource, "f", CanonicalNodeNameOrder.normalizedSizeLimit(0) + 1).build(); RevTree right = createFeaturesTreeBuilder(rightSource, "f", CanonicalNodeNameOrder.normalizedSizeLimit(0) + 2).build(); leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); visitor.walk(testConsumer); List<Bounded> leftCalls = testConsumer.orderedLeft; List<Bounded> rightCalls = testConsumer.orderedRight; NodeRef lroot = nodeFor(left); NodeRef rroot = nodeFor(right); assertEquals(3, leftCalls.size()); assertEquals(3, rightCalls.size()); assertNull(leftCalls.get(0)); assertTrue(leftCalls.get(1) instanceof Bucket); assertEquals(lroot, leftCalls.get(2)); assertEquals(rroot, rightCalls.get(2)); assertTrue(rightCalls.get(1) instanceof Bucket); assertTrue(rightCalls.get(0) instanceof NodeRef); assertEquals(RevObject.TYPE.FEATURE, ((NodeRef) rightCalls.get(0)).getType()); }
@Test public void testLeafLeafTwoAdds() { // two leaf trees RevTree left = createFeaturesTreeBuilder(leftSource, "f", 3).build(); RevTree right = createFeaturesTreeBuilder(rightSource, "f", 5).build(); leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); List<? extends Bounded> expectedLeft = newArrayList(// null, // null, // nodeFor(left)); List<? extends Bounded> expectedRight = newArrayList(// featureNodeRef("f", 3), // featureNodeRef("f", 4), // nodeFor(right)); visitor.walk(testConsumer); assertEquals(expectedLeft, testConsumer.orderedLeft); assertEquals(expectedRight, testConsumer.orderedRight); }
public static RevTreeBuilder createTreesTreeBuilder(ObjectStore source, int numSubTrees, int featuresPerSubtre, ObjectId metadataId) { RevTreeBuilder builder = CanonicalTreeBuilder.create(source); for (int treeN = 0; treeN < numSubTrees; treeN++) { RevTree subtree = createFeaturesTreeBuilder(source, "subtree" + treeN, featuresPerSubtre).build(); source.put(subtree); builder.put( Node.create("subtree" + treeN, subtree.getId(), metadataId, TYPE.TREE, null)); } return builder; }
@Test public void testLeafLeafTwoAdds() { // two leaf trees RevTree left = RevObjectTestSupport.INSTANCE.createFeaturesTreeBuilder(leftSource, "f", 3) .build(); RevTree right = RevObjectTestSupport.INSTANCE.createFeaturesTreeBuilder(rightSource, "f", 5) .build(); leftSource.put(left); rightSource.put(right); PostOrderDiffWalk visitor = new PostOrderDiffWalk(left, right, leftSource, rightSource); List<? extends Bounded> expectedLeft = newArrayList(// null, // null, // nodeFor(left)); List<? extends Bounded> expectedRight = newArrayList(// featureNodeRef("f", 3), // featureNodeRef("f", 4), // nodeFor(right)); visitor.walk(testConsumer); assertEquals(expectedLeft, testConsumer.orderedLeft); assertEquals(expectedRight, testConsumer.orderedRight); }
public RevTreeBuilder createTreesTreeBuilder(ObjectStore source, int numSubTrees, int featuresPerSubtre, ObjectId metadataId) { RevTreeBuilder builder = RevTreeBuilder.builder(source); for (int treeN = 0; treeN < numSubTrees; treeN++) { RevTree subtree = createFeaturesTreeBuilder(source, "subtree" + treeN, featuresPerSubtre).build(); source.put(subtree); builder.put(RevObjectFactory.defaultInstance().createNode("subtree" + treeN, subtree.getId(), metadataId, TYPE.TREE, null, null)); } return builder; }