Repository: tinkerpop
Updated Branches:
  refs/heads/TRAVIS-TEST a44500d39 -> 3f5bd8d7d


foo


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

Branch: refs/heads/TRAVIS-TEST
Commit: 3f5bd8d7d59ef77f8bb33ea5e384a1d07a625dff
Parents: a44500d
Author: Daniel Kuppitz <daniel_kupp...@hotmail.com>
Authored: Mon Mar 12 09:38:04 2018 -0700
Committer: Daniel Kuppitz <daniel_kupp...@hotmail.com>
Committed: Mon Mar 12 09:38:04 2018 -0700

----------------------------------------------------------------------
 .../decoration/SubgraphStrategyProcessTest.java      | 15 ++++++++-------
 1 file changed, 8 insertions(+), 7 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/3f5bd8d7/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 fe24ff0..927a54e 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
@@ -289,20 +289,21 @@ 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());
-/*
-final Traversal<Vertex, Long> t = 
sg.V(convertToVertexId("josh")).both().count();
+
+final Traversal<Vertex, Long> t = 
sg.withPath().V(convertToVertexId("josh")).both().count();
 try {
         assertEquals(2, t.next().longValue());
 } catch (IllegalStateException ex) {
   throw new IllegalStateException(t.toString(), ex);
 }
-*/
+/*
 final Traversal<Vertex, Vertex> t = 
sg.withPath().V(convertToVertexId("josh")).union(__.outE().inV(), 
__.inE().outV());
 try {
         assertEquals(2, t.toList().size());
 } catch (Exception ex) {
   throw new IllegalStateException(t.toString(), ex);
 }
+*/
         // marko not present directly because of vertexCriterion - only 
accessible via vertices in the subgraph
         assertEquals(1, 
g.V(convertToVertexId("marko")).count().next().longValue());
         assertEquals(0, 
sg.V(convertToVertexId("marko")).count().next().longValue());
@@ -317,7 +318,7 @@ try {
         assertEquals(2, 
sg.V(convertToVertexId("josh")).bothE("created").count().next().longValue());
         assertEquals(2, 
g.V(convertToVertexId("josh")).both("created").count().next().longValue());
         assertEquals(2, 
sg.V(convertToVertexId("josh")).both("created").count().next().longValue());
-
+/*
         assertEquals(1, 
g.V(convertToVertexId("josh")).inE("knows").count().next().longValue());
         assertEquals(0, 
sg.V(convertToVertexId("josh")).inE("knows").count().next().longValue());
         assertEquals(1, 
g.V(convertToVertexId("josh")).in("knows").count().next().longValue());
@@ -342,10 +343,10 @@ try {
 
         // marko is not accessible from the edge
         assertEquals(2, g.E(convertToEdgeId("marko", "created", 
"lop")).bothV().count().next().longValue());
-        assertEquals(1, sg.E(convertToEdgeId("marko", "created", 
"lop")).bothV().count().next().longValue());
+        assertEquals(1, sg.E(convertToEdgeId("marko", "created", 
"lop")).bothV().count().next().longValue());*/
     }
 
-
+/*
     @Test
     @LoadGraphWith(MODERN)
     public void shouldFilterMixedCriteria() throws Exception {
@@ -513,6 +514,6 @@ try {
         checkResults(Arrays.asList(3, 3, 3, 4, 4, 5, 5, 5), 
sg.V().as("a").properties().select("a").dedup().outE().values("skill"));
         checkResults(Arrays.asList(3, 3, 3, 4, 4, 5, 5, 5), 
sg.V().as("a").properties().select("a").dedup().outE().properties("skill").as("b").identity().select("b").by(__.value()));
     }
-
+*/
 
 }

Reply via email to