|
| 1 | +package overflowdb; |
| 2 | + |
| 3 | +import org.junit.Test; |
| 4 | +import overflowdb.testdomains.simple.SimpleDomain; |
| 5 | +import overflowdb.testdomains.simple.TestEdge; |
| 6 | +import overflowdb.testdomains.simple.TestNode; |
| 7 | + |
| 8 | +import static org.junit.Assert.assertEquals; |
| 9 | + |
| 10 | +public class DiffGraphTest { |
| 11 | + |
| 12 | + @Test |
| 13 | + public void nodeRemovalTest() { |
| 14 | + try (Graph graph = SimpleDomain.newGraph()) { |
| 15 | + BatchedUpdate.DiffGraphBuilder diff1 = new BatchedUpdate.DiffGraphBuilder(); |
| 16 | + DetachedNodeData newNode = new DetachedNodeGeneric(TestNode.LABEL, TestNode.STRING_PROPERTY, "node 1"); |
| 17 | + diff1.addNode(newNode); |
| 18 | + BatchedUpdate.applyDiff(graph, diff1); |
| 19 | + assertNodeCount(1, graph); |
| 20 | + Node node = graph.nodes().next(); |
| 21 | + |
| 22 | + BatchedUpdate.DiffGraphBuilder diff2 = new BatchedUpdate.DiffGraphBuilder(); |
| 23 | + diff2.removeNode(node); |
| 24 | + // it shouldn't matter (and especially not error) if we remove the same node twice |
| 25 | + diff2.removeNode(node); |
| 26 | + BatchedUpdate.applyDiff(graph, diff2); |
| 27 | + assertNodeCount(0, graph); |
| 28 | + } |
| 29 | + } |
| 30 | + |
| 31 | + @Test |
| 32 | + public void edgeRemovalTest() { |
| 33 | + try (Graph graph = SimpleDomain.newGraph()) { |
| 34 | + BatchedUpdate.DiffGraphBuilder diff1 = new BatchedUpdate.DiffGraphBuilder(); |
| 35 | + DetachedNodeData n1D = new DetachedNodeGeneric(TestNode.LABEL, TestNode.STRING_PROPERTY, "node 1"); |
| 36 | + DetachedNodeData n2D = new DetachedNodeGeneric(TestNode.LABEL, TestNode.STRING_PROPERTY, "node 2"); |
| 37 | + diff1.addEdge(n1D, n2D,TestEdge.LABEL, TestEdge.LONG_PROPERTY, 99L); |
| 38 | + |
| 39 | + BatchedUpdate.applyDiff(graph, diff1); |
| 40 | + assertNodeCount(2, graph); |
| 41 | + assertEdgeCount(1, graph); |
| 42 | + Edge edge = graph.edges().next(); |
| 43 | + |
| 44 | + BatchedUpdate.DiffGraphBuilder diff2 = new BatchedUpdate.DiffGraphBuilder(); |
| 45 | + diff2.removeEdge(edge); |
| 46 | + // it shouldn't matter (and especially not error) if we remove the same edge twice |
| 47 | + diff2.removeEdge(edge); |
| 48 | + BatchedUpdate.applyDiff(graph, diff2); |
| 49 | + assertNodeCount(2, graph); |
| 50 | + assertEdgeCount(0, graph); |
| 51 | + } |
| 52 | + } |
| 53 | + |
| 54 | + private void assertNodeCount(int expected, Graph graph) { |
| 55 | + assertEquals("node count different to expected", expected, graph.nodeCount()); |
| 56 | + } |
| 57 | + |
| 58 | + private void assertEdgeCount(int expected, Graph graph) { |
| 59 | + assertEquals("edge count different to expected", expected, graph.edgeCount()); |
| 60 | + } |
| 61 | + |
| 62 | +} |
0 commit comments