gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/strategy/decoration/SubgraphStrategyProcessTest.java [86:127]: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - assertEquals(6, g.V().count().next().longValue()); assertEquals(3, sg.V().count().next().longValue()); // only two edges are present, even though edges are not explicitly excluded // (edges require their incident vertices) assertEquals(6, g.E().count().next().longValue()); assertEquals(2, sg.E().count().next().longValue()); // from vertex assertEquals(2, g.V(convertToVertexId("josh")).outE().count().next().longValue()); assertEquals(2, sg.V(convertToVertexId("josh")).outE().count().next().longValue()); assertEquals(2, g.V(convertToVertexId("josh")).out().count().next().longValue()); assertEquals(2, sg.V(convertToVertexId("josh")).out().count().next().longValue()); assertEquals(1, g.V(convertToVertexId("josh")).inE().count().next().longValue()); assertEquals(0, sg.V(convertToVertexId("josh")).inE().count().next().longValue()); assertEquals(1, g.V(convertToVertexId("josh")).in().count().next().longValue()); assertEquals(0, sg.V(convertToVertexId("josh")).in().count().next().longValue()); 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(2, sg.V(convertToVertexId("josh")).both().count().next().longValue()); // with label assertEquals(2, g.V(convertToVertexId("josh")).outE("created").count().next().longValue()); assertEquals(2, sg.V(convertToVertexId("josh")).outE("created").count().next().longValue()); assertEquals(2, g.V(convertToVertexId("josh")).out("created").count().next().longValue()); assertEquals(2, sg.V(convertToVertexId("josh")).out("created").count().next().longValue()); assertEquals(2, g.V(convertToVertexId("josh")).bothE("created").count().next().longValue()); 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()); assertEquals(0, sg.V(convertToVertexId("josh")).in("knows").count().next().longValue()); assertEquals(1, g.V(convertToVertexId("josh")).bothE("knows").count().next().longValue()); assertEquals(0, sg.V(convertToVertexId("josh")).bothE("knows").count().next().longValue()); assertEquals(1, g.V(convertToVertexId("josh")).both("knows").count().next().longValue()); assertEquals(0, sg.V(convertToVertexId("josh")).both("knows").count().next().longValue()); - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/strategy/decoration/SubgraphStrategyProcessTest.java [366:408]: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - assertEquals(6, g.V().count().next().longValue()); assertEquals(3, sg.V().count().next().longValue()); // three edges are explicitly included, but one is missing its out-vertex due to the vertex criterion assertEquals(6, g.E().count().next().longValue()); assertEquals(2, sg.E().count().next().longValue()); // from vertex assertEquals(2, g.V(convertToVertexId("josh")).outE().count().next().longValue()); assertEquals(2, sg.V(convertToVertexId("josh")).outE().count().next().longValue()); assertEquals(2, g.V(convertToVertexId("josh")).out().count().next().longValue()); assertEquals(2, sg.V(convertToVertexId("josh")).out().count().next().longValue()); assertEquals(1, g.V(convertToVertexId("josh")).inE().count().next().longValue()); assertEquals(0, sg.V(convertToVertexId("josh")).inE().count().next().longValue()); assertEquals(1, g.V(convertToVertexId("josh")).in().count().next().longValue()); assertEquals(0, sg.V(convertToVertexId("josh")).in().count().next().longValue()); 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(2, sg.V(convertToVertexId("josh")).both().count().next().longValue()); // with label assertEquals(2, g.V(convertToVertexId("josh")).outE("created").count().next().longValue()); assertEquals(2, sg.V(convertToVertexId("josh")).outE("created").count().next().longValue()); assertEquals(2, g.V(convertToVertexId("josh")).out("created").count().next().longValue()); assertEquals(2, sg.V(convertToVertexId("josh")).out("created").count().next().longValue()); assertEquals(2, g.V(convertToVertexId("josh")).bothE("created").count().next().longValue()); 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()); assertEquals(0, sg.V(convertToVertexId("josh")).in("knows").count().next().longValue()); assertEquals(1, g.V(convertToVertexId("josh")).bothE("knows").count().next().longValue()); assertEquals(0, sg.V(convertToVertexId("josh")).bothE("knows").count().next().longValue()); assertEquals(1, g.V(convertToVertexId("josh")).both("knows").count().next().longValue()); assertEquals(0, sg.V(convertToVertexId("josh")).both("knows").count().next().longValue()); - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -