Repository: tinkerpop Updated Branches: refs/heads/TRAVIS-TEST f8b4e17e2 -> a179467fc
foo Project: http://git-wip-us.apache.org/repos/asf/tinkerpop/repo Commit: http://git-wip-us.apache.org/repos/asf/tinkerpop/commit/a179467f Tree: http://git-wip-us.apache.org/repos/asf/tinkerpop/tree/a179467f Diff: http://git-wip-us.apache.org/repos/asf/tinkerpop/diff/a179467f Branch: refs/heads/TRAVIS-TEST Commit: a179467fc9f94402e713ed689d6b133ac43e974b Parents: f8b4e17 Author: Daniel Kuppitz <daniel_kupp...@hotmail.com> Authored: Mon Mar 12 09:14:30 2018 -0700 Committer: Daniel Kuppitz <daniel_kupp...@hotmail.com> Committed: Mon Mar 12 09:14:30 2018 -0700 ---------------------------------------------------------------------- .../strategy/decoration/SubgraphStrategyProcessTest.java | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/a179467f/gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/strategy/decoration/SubgraphStrategyProcessTest.java ---------------------------------------------------------------------- diff --git a/gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/strategy/decoration/SubgraphStrategyProcessTest.java b/gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/strategy/decoration/SubgraphStrategyProcessTest.java index 23cecfe..0376540 100644 --- a/gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/strategy/decoration/SubgraphStrategyProcessTest.java +++ b/gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/strategy/decoration/SubgraphStrategyProcessTest.java @@ -267,7 +267,7 @@ public class SubgraphStrategyProcessTest extends AbstractGremlinProcessTest { final GraphTraversalSource sg = g.withStrategies(strategy); // three vertices are included in the subgraph - /*assertEquals(6, g.V().count().next().longValue()); + assertEquals(6, g.V().count().next().longValue()); assertEquals(3, sg.V().count().next().longValue()); // three edges are explicitly included as we ignore checking of adjacent vertices @@ -288,7 +288,7 @@ public class SubgraphStrategyProcessTest extends AbstractGremlinProcessTest { assertEquals(3, g.V(convertToVertexId("josh")).bothE().count().next().longValue()); assertEquals(2, sg.V(convertToVertexId("josh")).bothE().count().next().longValue()); - assertEquals(3, g.V(convertToVertexId("josh")).both().count().next().longValue());*/ + assertEquals(3, g.V(convertToVertexId("josh")).both().count().next().longValue()); /* final Traversal<Vertex, Long> t = sg.V(convertToVertexId("josh")).both().count(); try { @@ -300,7 +300,7 @@ try { final Traversal<Vertex, Vertex> t = sg.withPath().V(convertToVertexId("josh")).bothE().otherV(); try { assertEquals(2, t.toList().size()); -} catch (IllegalStateException ex) { +} catch (Exception ex) { throw new IllegalStateException(t.toString(), ex); } // marko not present directly because of vertexCriterion - only accessible via vertices in the subgraph
