public static Node featureNode(String namePrefix, int index) { return featureNode(namePrefix, index, false); }
public static Node featureNode(String namePrefix, int index) { return featureNode(namePrefix, index, false); }
public static List<Node> featureNodes(int fromIndexInclussive, int toIndexExclussive, boolean randomIds) { List<Node> nodes = new ArrayList<>(1 + (toIndexExclussive - fromIndexInclussive)); for (int i = fromIndexInclussive; i < toIndexExclussive; i++) { nodes.add(featureNode("f", i, randomIds)); } return nodes; }
public static List<Node> featureNodes(int fromIndexInclussive, int toIndexExclussive, boolean randomIds) { List<Node> nodes = new ArrayList<>(1 + (toIndexExclussive - fromIndexInclussive)); for (int i = fromIndexInclussive; i < toIndexExclussive; i++) { nodes.add(featureNode("f", i, randomIds)); } return nodes; }
private NodeRef featureNodeRef(String namePrefix, int index) { boolean randomIds = false; return NodeRef.create(NodeRef.ROOT, RevObjectTestSupport.featureNode(namePrefix, index, randomIds)); }
private NodeRef featureNodeRef(String namePrefix, int index) { boolean randomIds = false; return NodeRef.create(NodeRef.ROOT, RevObjectTestSupport.featureNode(namePrefix, index, randomIds)); }
public static NodeRef featureNodeRef(String namePrefix, int index) { Node node = RevObjectTestSupport.featureNode(namePrefix, index, false); return NodeRef.create(NodeRef.ROOT, node); }
public static NodeRef featureNodeRef(String namePrefix, int index) { Node node = RevObjectTestSupport.featureNode(namePrefix, index, false); return NodeRef.create(NodeRef.ROOT, node); }
private NodeRef featureNodeRef(String namePrefix, int index) { boolean randomIds = false; return NodeRef.create(NodeRef.ROOT, RevObjectTestSupport.featureNode(namePrefix, index, randomIds)); }
private RevTree manuallyCreateLeafTree(final int nodeCount) { Preconditions.checkArgument(nodeCount <= CanonicalNodeNameOrder.normalizedSizeLimit(0)); ImmutableList.Builder<Node> nodes = ImmutableList.builder(); for (int i = 0; i < nodeCount; i++) { nodes.add(featureNode("f", i)); } return createLeafTree(nodes.build()); }
private RevTree manuallyCreateLeafTree(final int nodeCount) { Preconditions.checkArgument(nodeCount <= CanonicalNodeNameOrder.normalizedSizeLimit(0)); ImmutableList.Builder<Node> nodes = ImmutableList.builder(); for (int i = 0; i < nodeCount; i++) { nodes.add(featureNode("f", i)); } return createLeafTree(nodes.build()); }
public static RevTreeBuilder createFeaturesTreeBuilder(ObjectStore source, final String namePrefix, final int numEntries, final int startIndex, boolean randomIds) { RevTreeBuilder tree = CanonicalTreeBuilder.create(source); for (int i = startIndex; i < startIndex + numEntries; i++) { tree.put(featureNode(namePrefix, i, randomIds)); } return tree; }
public static RevTreeBuilder createLargeFeaturesTreeBuilder(ObjectDatabase source, final String namePrefix, final int numEntries, final int startIndex, boolean randomIds) { RevTreeBuilder tree = CanonicalTreeBuilder.create(source); for (int i = startIndex; i < startIndex + numEntries; i++) { tree.put(featureNode(namePrefix, i, randomIds)); } return tree; }
@Test public void testFullEntry() throws IOException { Node ln = RevObjectTestSupport.featureNode("testNode", 1); Node rn = RevObjectTestSupport.featureNode("testNode", 2); ObjectId metadataId = RevObjectTestSupport.hashString("test"); NodeRef left = new NodeRef(ln, "parent/path", metadataId); NodeRef right = new NodeRef(rn, "parent/path", metadataId); DiffEntry entry = new DiffEntry(left, right); serializer.write(out, entry); byte[] array = stream.toByteArray(); DiffEntry read = serializer.read(new DataInputStream(new ByteArrayInputStream(array))); assertEquals(entry, read); }
@Test public void testFullEntry() throws IOException { Node ln = RevObjectTestSupport.featureNode("testNode", 1); Node rn = RevObjectTestSupport.featureNode("testNode", 2); ObjectId metadataId = RevObjectTestSupport.hashString("test"); NodeRef left = new NodeRef(ln, "parent/path", metadataId); NodeRef right = new NodeRef(rn, "parent/path", metadataId); DiffEntry entry = new DiffEntry(left, right); serializer.write(out, entry); byte[] array = stream.toByteArray(); DiffEntry read = serializer.read(new DataInputStream(new ByteArrayInputStream(array))); assertEquals(entry, read); }
@Test public void testNullNodeRef() throws IOException { // null parent path is only allowed for NodeRef.ROOT named nodes Node rn = RevObjectTestSupport.featureNode("testNode", 2); ObjectId metadataId = RevObjectTestSupport.hashString("test"); NodeRef left = null; NodeRef right = new NodeRef(rn, "parent/path", metadataId); DiffEntry entry = new DiffEntry(left, right); serializer.write(out, entry); byte[] array = stream.toByteArray(); DiffEntry read = serializer.read(new DataInputStream(new ByteArrayInputStream(array))); assertEquals(entry, read); }
@Test public void testNullNodeRef() throws IOException { // null parent path is only allowed for NodeRef.ROOT named nodes Node rn = RevObjectTestSupport.featureNode("testNode", 2); ObjectId metadataId = RevObjectTestSupport.hashString("test"); NodeRef left = null; NodeRef right = new NodeRef(rn, "parent/path", metadataId); DiffEntry entry = new DiffEntry(left, right); serializer.write(out, entry); byte[] array = stream.toByteArray(); DiffEntry read = serializer.read(new DataInputStream(new ByteArrayInputStream(array))); assertEquals(entry, read); }
@Test public void buildSimpleDAGFromScratch() { strategy = canonical.build(); for (int i = 0; i < strategy.normalizedSizeLimit(0); i++) { Node node = featureNode("f", i); strategy.put(node); } DAG root = strategy.buildRoot(); assertTrue(buckets(root).isEmpty()); assertFalse(children(root).isEmpty()); assertEquals(strategy.normalizedSizeLimit(0), children(root).size()); assertEquals(0, strategy.depth()); }
@Test public void buildSplittedDAGFromScratch() { strategy = canonical.build(); final int numNodes = 2 * strategy.normalizedSizeLimit(0); for (int i = 0; i < numNodes; i++) { Node node = featureNode("f", i, true); strategy.put(node); } DAG root = strategy.buildRoot(); assertTrue(children(root).isEmpty()); assertFalse(buckets(root).isEmpty()); assertEquals(1, strategy.depth()); List<NodeId> flattenedNodes = flatten(root); assertEquals(numNodes, flattenedNodes.size()); }
@Test public void buildSimpleDAGFromScratch() { strategy = canonical.build(); for (int i = 0; i < strategy.normalizedSizeLimit(0); i++) { Node node = featureNode("f", i); strategy.put(node); } DAG root = strategy.buildRoot(); assertTrue(buckets(root).isEmpty()); assertFalse(children(root).isEmpty()); assertEquals(strategy.normalizedSizeLimit(0), children(root).size()); assertEquals(0, strategy.depth()); }