protected ObjectId createAndSaveTree(final int numEntries, final boolean insertInAscendingKeyOrder) throws Exception { List<Node> nodes = createNodes(numEntries); ObjectId treeId = createAndSaveTree(nodes, insertInAscendingKeyOrder); return treeId; }
protected ObjectId createAndSaveTree(final int numEntries, final boolean insertInAscendingKeyOrder) throws Exception { List<Node> nodes = createNodes(numEntries); ObjectId treeId = createAndSaveTree(nodes, insertInAscendingKeyOrder); return treeId; }
private void testEquality(final int numEntries) throws Exception { final ObjectId treeId1; final ObjectId treeId2; List<Node> nodes = createNodes(numEntries); treeId1 = createAndSaveTree(nodes, true); treeId2 = createAndSaveTree(nodes, false); assertEquals(treeId1, treeId2); }
private void testEquality(final int numEntries) throws Exception { final ObjectId treeId1; final ObjectId treeId2; List<Node> nodes = createNodes(numEntries); treeId1 = createAndSaveTree(nodes, true); treeId2 = createAndSaveTree(nodes, false); assertEquals(treeId1, treeId2); }
private void checkTreeBounds(int size) { RevTreeBuilder b = createBuiler(); List<Node> nodes = createNodes(size); Envelope expectedBounds = new Envelope(); for (Node n : nodes) { b.put(n); n.expand(expectedBounds); } expectedBounds = RevObjects.makePrecise(expectedBounds); RevTree tree = b.build(); assertEquals(size, tree.size()); Envelope bounds = SpatialOps.boundsOf(tree); bounds = RevObjects.makePrecise(bounds); assertEquals(expectedBounds, bounds); }
private void checkTreeBounds(int size) { RevTreeBuilder b = createBuiler(); List<Node> nodes = createNodes(size); Envelope expectedBounds = new Envelope(); for (Node n : nodes) { b.put(n); n.expand(expectedBounds); } expectedBounds = Node.makePrecise(expectedBounds); RevTree tree = b.build(); assertEquals(size, tree.size()); Envelope bounds = SpatialOps.boundsOf(tree); bounds = Node.makePrecise(bounds); assertEquals(expectedBounds, bounds); }