You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tinkerpop.apache.org by sp...@apache.org on 2017/10/16 15:20:37 UTC
[24/47] tinkerpop git commit: TINKERPOP-1784 Added some more vertex
features
TINKERPOP-1784 Added some more vertex features
Project: http://git-wip-us.apache.org/repos/asf/tinkerpop/repo
Commit: http://git-wip-us.apache.org/repos/asf/tinkerpop/commit/b0423f5a
Tree: http://git-wip-us.apache.org/repos/asf/tinkerpop/tree/b0423f5a
Diff: http://git-wip-us.apache.org/repos/asf/tinkerpop/diff/b0423f5a
Branch: refs/heads/TINKERPOP-1784
Commit: b0423f5a801ba8193aa48e33a5aab2ea4638cd79
Parents: 20de593
Author: Stephen Mallette <sp...@genoprime.com>
Authored: Fri Sep 29 13:26:27 2017 -0400
Committer: Stephen Mallette <sp...@genoprime.com>
Committed: Mon Oct 16 11:19:30 2017 -0400
----------------------------------------------------------------------
gremlin-test/features/map/Vertex.feature | 105 ++++++++++++++++++++++++++
1 file changed, 105 insertions(+)
----------------------------------------------------------------------
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/b0423f5a/gremlin-test/features/map/Vertex.feature
----------------------------------------------------------------------
diff --git a/gremlin-test/features/map/Vertex.feature b/gremlin-test/features/map/Vertex.feature
index 9aa506c..1905f3a 100644
--- a/gremlin-test/features/map/Vertex.feature
+++ b/gremlin-test/features/map/Vertex.feature
@@ -169,3 +169,108 @@ Feature: Step - V(), E(), out(), in(), both(), inE(), outE(), bothE()
| e[josh-created->lop] |
| e[josh-created->ripple] |
| e[marko-knows->josh] |
+
+ Scenario: g_VX1X_outE_inV
+ Given the modern graph
+ And using the parameter v1 is "v[marko]"
+ And the traversal of
+ """
+ g.V(v1).both()
+ """
+ When iterated to list
+ Then the result should be unordered
+ | v[vadas] |
+ | v[josh] |
+ | v[lop] |
+
+ Scenario: g_VX2X_inE_outV
+ Given the modern graph
+ And using the parameter v2 is "v[vadas]"
+ And the traversal of
+ """
+ g.V(v2).inE().outV()
+ """
+ When iterated to list
+ Then the result should be unordered
+ | v[marko] |
+
+ Scenario: g_V_outE_hasXweight_1X_outV
+ Given the modern graph
+ And the traversal of
+ """
+ g.V().outE().has("weight",1.0).outV()
+ """
+ When iterated to list
+ Then the result should be unordered
+ | v[marko] |
+ | v[josh] |
+
+ Scenario: g_V_out_outE_inV_inE_inV_both_name
+ Given the modern graph
+ And the traversal of
+ """
+ g.V().out().outE().inV().inE().inV().both().values("name")
+ """
+ When iterated to list
+ Then the result should be unordered
+ | marko |
+ | marko |
+ | marko |
+ | josh |
+ | josh |
+ | josh |
+ | josh |
+ | peter |
+ | peter |
+ | peter |
+
+ Scenario: g_VX1X_outEXknowsX_bothV_name
+ Given the modern graph
+ And using the parameter v1 is "v[marko]"
+ And the traversal of
+ """
+ g.V(v1).outE("knows").bothV().values("name")
+ """
+ When iterated to list
+ Then the result should be unordered
+ | marko |
+ | marko |
+ | josh |
+ | vadas |
+
+ Scenario: g_VX1X_outE_otherV
+ Given the modern graph
+ And using the parameter v1 is "v[marko]"
+ And the traversal of
+ """
+ g.V(v1).outE().otherV()
+ """
+ When iterated to list
+ Then the result should be unordered
+ | v[vadas] |
+ | v[josh] |
+ | v[lop] |
+
+ Scenario: g_VX4X_bothE_otherV
+ Given the modern graph
+ And using the parameter v4 is "v[josh]"
+ And the traversal of
+ """
+ g.V(v4).bothE().otherV()
+ """
+ When iterated to list
+ Then the result should be unordered
+ | v[marko] |
+ | v[ripple] |
+ | v[lop] |
+
+ Scenario: g_VX4X_bothE_hasXweight_lt_1X_otherV
+ Given the modern graph
+ And using the parameter v4 is "v[josh]"
+ And the traversal of
+ """
+ g.V(v4).bothE().has("weight", P.lt(1.0)).otherV()
+ """
+ When iterated to list
+ Then the result should be unordered
+ | v[lop] |
\ No newline at end of file