@Override protected void doRun() throws Exception { TitanVertex n = Iterables.getOnlyElement(tx.getVertices(id, nodeid)); for (int i = 0; i < nodeTraversalCount; i++) { assertEquals("On vertex: " + n.getID(), expectedEdges, Iterables.size(n.getTitanEdges(Direction.BOTH, relTypeToTraverse))); for (TitanEdge r : n.getTitanEdges(Direction.OUT, relTypeToTraverse)) { n = r.getVertex(Direction.IN); } } } }
@Override protected void doRun() throws Exception { TitanVertex n = Iterables.getOnlyElement(tx.getVertices(id, nodeid)); for (int i = 0; i < nodeTraversalCount; i++) { assertEquals("On vertex: " + n.getLongId(), expectedEdges, Iterables.size(n.getTitanEdges(Direction.BOTH, relTypeToTraverse))); for (TitanEdge r : n.getTitanEdges(Direction.OUT, relTypeToTraverse)) { n = r.getVertex(Direction.IN); } } } }
@Override public void run() { while (true) { // Make or break relType between two (possibly same) random nodes // TitanVertex source = tx.getVertex(idProp, RandomGenerator.randomInt(0, nodeCount)); // TitanVertex sink = tx.getVertex(idProp, RandomGenerator.randomInt(0, nodeCount)); TitanVertex source = Iterables.getOnlyElement(tx.getVertices(idProp, 0)); TitanVertex sink = Iterables.getOnlyElement(tx.getVertices(idProp, 1)); for (TitanEdge r : source.getTitanEdges(Direction.OUT, relType)) { if (r.getVertex(Direction.IN).getLongId() == sink.getLongId()) { r.remove(); continue; } } source.addEdge(relType, sink); if (Thread.interrupted()) break; } }
@Override public void run() { while (true) { // Make or break relType between two (possibly same) random nodes // TitanVertex source = tx.getVertex(idProp, RandomGenerator.randomInt(0, nodeCount)); // TitanVertex sink = tx.getVertex(idProp, RandomGenerator.randomInt(0, nodeCount)); TitanVertex source = Iterables.getOnlyElement(tx.getVertices(idProp, 0)); TitanVertex sink = Iterables.getOnlyElement(tx.getVertices(idProp, 1)); for (TitanEdge r : source.getTitanEdges(Direction.OUT, relType)) { if (r.getVertex(Direction.IN).getID() == sink.getID()) { r.remove(); continue; } } source.addEdge(relType, sink); if (Thread.interrupted()) break; } }
assertNotNull(n2.toString()); assertEquals("Node2", n2.getProperty(name)); e = Iterables.getOnlyElement(n2.getTitanEdges(BOTH, connect)); assertNotNull(e.toString()); n1 = e.getVertex(OUT); assertEquals(1, Iterables.size(n2.getTitanEdges(BOTH, tx.getEdgeLabel("knows")))); assertEquals(1, Iterables.size(n1.getTitanEdges(BOTH, tx.getEdgeLabel("knows")))); assertEquals(2, Iterables.size(n1.getEdges())); assertEquals(e, Iterables.getOnlyElement(n2.getEdges(IN, "connect"))); log.debug("Four:"); assertEquals(e, Iterables.getOnlyElement(n1.getTitanEdges(OUT, connect))); assertEquals(e, Iterables.getOnlyElement(n1.getTitanEdges(BOTH, connect))); e = Iterables.getOnlyElement(n2.getTitanEdges(OUT, tx.getEdgeLabel("knows"))); assertTrue(e.getProperty(weight).equals(3.0)); assertEquals("HasProperties TitanRelation", e.getProperty(name)); n3 = e.getVertex(IN); e = Iterables.getOnlyElement(n3.getTitanEdges(OUT, tx.getEdgeLabel("knows"))); assertEquals(111, e.getProperty(id)); e = Iterables.getOnlyElement(n2.getTitanEdges(OUT, tx.getEdgeLabel("knows"))); e.remove(); assertEquals(0, Iterables.size(n2.getTitanEdges(BOTH, tx.getEdgeLabel("knows")))); assertEquals(1, Iterables.size(n3.getTitanEdges(BOTH, tx.getEdgeLabel("knows"))));
assertNotNull(n2.toString()); assertEquals("Node2", n2.getProperty(name)); e = Iterables.getOnlyElement(n2.getTitanEdges(BOTH, connect)); assertNotNull(e.toString()); n1 = e.getVertex(OUT); assertEquals(1, Iterables.size(n2.getTitanEdges(BOTH, tx.getEdgeLabel("knows")))); assertEquals(1, Iterables.size(n1.getTitanEdges(BOTH, tx.getEdgeLabel("knows")))); assertEquals(2, Iterables.size(n1.getEdges())); assertEquals(e, Iterables.getOnlyElement(n2.getEdges(IN, "connect"))); log.debug("Four:"); assertEquals(e, Iterables.getOnlyElement(n1.getTitanEdges(OUT, connect))); assertEquals(e, Iterables.getOnlyElement(n1.getTitanEdges(BOTH, connect))); e = Iterables.getOnlyElement(n2.getTitanEdges(OUT, tx.getEdgeLabel("knows"))); assertEquals(3.0, e.getProperty(weight)); assertEquals("HasProperties TitanRelation", e.getProperty(name)); n3 = e.getVertex(IN); e = Iterables.getOnlyElement(n3.getTitanEdges(OUT, tx.getEdgeLabel("knows"))); assertEquals(111, e.getProperty(id)); e = Iterables.getOnlyElement(n2.getTitanEdges(OUT, tx.getEdgeLabel("knows"))); e.remove(); assertEquals(0, Iterables.size(n2.getTitanEdges(BOTH, tx.getEdgeLabel("knows")))); assertEquals(1, Iterables.size(n3.getTitanEdges(BOTH, tx.getEdgeLabel("knows"))));
assertEquals(connectOff.length + knowsOff.length, Iterables.size(n.getEdges(OUT))); assertEquals(connectOff.length, Iterables.size(n.getEdges(OUT, "connect"))); assertEquals(connectOff.length * 2, Iterables.size(n.getTitanEdges(BOTH, tx.getEdgeLabel("connect")))); assertEquals(knowsOff.length * 2, Iterables.size(n.getTitanEdges(BOTH, knows)), i); for (TitanEdge r : n.getTitanEdges(OUT, knows)) { TitanVertex n2 = r.getOtherVertex(n); int idsum = ((Number) n.getProperty(id)).intValue() + ((Number) n2.getProperty(id)).intValue(); for (TitanEdge r : n.getTitanEdges(OUT)) { edgeIds.add(r.getID());
assertEquals(connectOff.length + knowsOff.length, Iterables.size(n.getEdges(OUT))); assertEquals(connectOff.length, Iterables.size(n.getEdges(OUT, "connect"))); assertEquals(connectOff.length * 2, Iterables.size(n.getTitanEdges(BOTH, tx.getEdgeLabel("connect")))); assertEquals(knowsOff.length * 2, Iterables.size(n.getTitanEdges(BOTH, knows)), i); for (TitanEdge r : n.getTitanEdges(OUT, knows)) { TitanVertex n2 = r.getOtherVertex(n); int idsum = ((Number) n.getProperty(id)).intValue() + ((Number) n2.getProperty(id)).intValue(); for (TitanEdge r : n.getTitanEdges(OUT)) { edgeIds.add(r.getLongId());