Repository: tinkerpop
Updated Branches:
  refs/heads/TRAVIS-TEST 730eb293a -> 232c9987f


bla


Project: http://git-wip-us.apache.org/repos/asf/tinkerpop/repo
Commit: http://git-wip-us.apache.org/repos/asf/tinkerpop/commit/232c9987
Tree: http://git-wip-us.apache.org/repos/asf/tinkerpop/tree/232c9987
Diff: http://git-wip-us.apache.org/repos/asf/tinkerpop/diff/232c9987

Branch: refs/heads/TRAVIS-TEST
Commit: 232c9987f09f1ecd1db13a8df41700efa5bcf1a5
Parents: 730eb29
Author: Daniel Kuppitz <daniel_kupp...@hotmail.com>
Authored: Fri Mar 9 20:18:11 2018 -0700
Committer: Daniel Kuppitz <daniel_kupp...@hotmail.com>
Committed: Fri Mar 9 20:18:11 2018 -0700

----------------------------------------------------------------------
 .../strategy/decoration/SubgraphStrategyProcessTest.java         | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/232c9987/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 b62396f..1cc6222 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 {
         assertEquals(2, t.next().longValue());

Reply via email to