public void removeNodes(QuadTreeClusteringStrategy strategy, List<Node> nodes) { for (Node node : nodes) { if (!strategy.remove(node)) { NodeId nodeid = strategy.computeId(node); Assert.fail("Node " + nodeid + " was not removed"); } } }
public void removeNodes(QuadTreeClusteringStrategy strategy, List<Node> nodes) { for (Node node : nodes) { if (!strategy.remove(node)) { NodeId nodeid = strategy.computeId(node); Assert.fail("Node " + nodeid + " was not removed"); } } }
@Test public void testInitOriginalSinglePointFeature() { QuadTreeClusteringStrategy orig = support.newStrategy(); Node node = support.createNode("1", new Envelope(1, 1, 1, 1)); orig.put(node); RevTree quadTree = DAGTreeBuilder.build(orig, support.store()); assertEquals(1, quadTree.size()); QuadTreeClusteringStrategy update = support.newStrategy(quadTree); Node node2 = support.createNode("2", new Envelope(2, 2, 2, 2)); update.remove(node); update.put(node2); RevTree quadTree2 = DAGTreeBuilder.build(update, support.store()); assertEquals(1, quadTree2.size()); List<Node> lnodes = findNode("2", quadTree2, support.store()); assertEquals(1, lnodes.size()); assertEquals(node2, lnodes.get(0)); }
@Test public void testInitOriginalSinglePointFeature() { QuadTreeClusteringStrategy orig = support.newStrategy(); Node node = support.createNode("1", new Envelope(1, 1, 1, 1)); orig.put(node); RevTree quadTree = DAGTreeBuilder.build(orig, support.store()); assertEquals(1, quadTree.size()); QuadTreeClusteringStrategy update = support.newStrategy(quadTree); Node node2 = support.createNode("2", new Envelope(2, 2, 2, 2)); update.remove(node); update.put(node2); RevTree quadTree2 = DAGTreeBuilder.build(update, support.store()); assertEquals(1, quadTree2.size()); List<Node> lnodes = findNode("2", quadTree2, support.store()); assertEquals(1, lnodes.size()); assertEquals(node2, lnodes.get(0)); }
removeNodes.forEach((n) -> assertTrue(updateBuilder.remove(n)));
removeNodes.forEach((n) -> assertTrue(updateBuilder.remove(n)));