TINKERPOP-1784 Add union() feature tests
Project: http://git-wip-us.apache.org/repos/asf/tinkerpop/repo Commit: http://git-wip-us.apache.org/repos/asf/tinkerpop/commit/f784e719 Tree: http://git-wip-us.apache.org/repos/asf/tinkerpop/tree/f784e719 Diff: http://git-wip-us.apache.org/repos/asf/tinkerpop/diff/f784e719 Branch: refs/heads/TINKERPOP-1784 Commit: f784e71988183852cdef8713fa66b84f3e332a28 Parents: c45bac7 Author: Stephen Mallette <sp...@genoprime.com> Authored: Mon Oct 23 10:58:36 2017 -0400 Committer: Stephen Mallette <sp...@genoprime.com> Committed: Tue Nov 21 15:52:52 2017 -0500 ---------------------------------------------------------------------- gremlin-test/features/branch/Union.feature | 133 ++++++++++++++++++++++++ 1 file changed, 133 insertions(+) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/f784e719/gremlin-test/features/branch/Union.feature ---------------------------------------------------------------------- diff --git a/gremlin-test/features/branch/Union.feature b/gremlin-test/features/branch/Union.feature new file mode 100644 index 0000000..938f51a --- /dev/null +++ b/gremlin-test/features/branch/Union.feature @@ -0,0 +1,133 @@ +# Licensed to the Apache Software Foundation (ASF) under one +# or more contributor license agreements. See the NOTICE file +# distributed with this work for additional information +# regarding copyright ownership. The ASF licenses this file +# to you under the Apache License, Version 2.0 (the +# "License"); you may not use this file except in compliance +# with the License. You may obtain a copy of the License at +# +# http://www.apache.org/licenses/LICENSE-2.0 +# +# Unless required by applicable law or agreed to in writing, +# software distributed under the License is distributed on an +# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY +# KIND, either express or implied. See the License for the +# specific language governing permissions and limitations +# under the License. + +Feature: Step - union() + + Scenario: g_V_unionXout__inX_name + Given the modern graph + And the traversal of + """ + g.V().union(__.out(), __.in()).values("name") + """ + When iterated to list + Then the result should be unordered + | lop | + | vadas | + | josh | + | marko | + | marko | + | josh | + | peter | + | ripple | + | lop | + | marko | + | josh | + | lop | + + Scenario: g_VX1X_unionXrepeatXoutX_timesX2X__outX_name + Given the modern graph + And using the parameter v1Id defined as "v[marko].id" + And the traversal of + """ + g.V(v1Id).union(__.repeat(__.out()).times(2), __.out()).values("name") + """ + When iterated to list + Then the result should be unordered + | ripple | + | lop | + | lop | + | vadas | + | josh | + + Scenario: g_V_chooseXlabel_is_person__unionX__out_lang__out_nameX__in_labelX + Given the modern graph + And the traversal of + """ + g.V().choose(__.label().is("person"), __.union(__.out().values("lang"), __.out().values("name")), __.in().label()) + """ + When iterated to list + Then the result should be unordered + | java | + | lop | + | vadas | + | josh | + | person | + | person | + | person | + | java | + | java | + | ripple | + | lop | + | person | + | java | + | lop | + + Scenario: g_V_chooseXlabel_is_person__unionX__out_lang__out_nameX__in_labelX_groupCount + Given the modern graph + And the traversal of + """ + g.V().choose(__.label().is("person"), __.union(__.out().values("lang"), __.out().values("name")), __.in().label()).groupCount() + """ + When iterated to list + Then the result should be unordered + | m[{"java":4,"ripple":1,"person":4,"vadas":1,"josh":1,"lop":3}] | + + Scenario: g_V_unionXrepeatXunionXoutXcreatedX__inXcreatedXX_timesX2X__repeatXunionXinXcreatedX__outXcreatedXX_timesX2XX_label_groupCount + Given the modern graph + And the traversal of + """ + g.V().union(__.repeat(__.union( + __.out("created"), + __.in("created"))).times(2), + __.repeat(__.union( + __.in("created"), + __.out("created"))).times(2)).label().groupCount() + """ + When iterated to list + Then the result should be unordered + | m[{"software":12,"person":20}] | + + Scenario: g_VX1_2X_unionXoutE_count__inE_count__outE_weight_sumX + Given the modern graph + And using the parameter v1Id defined as "v[marko].id" + And using the parameter v2Id defined as "v[vadas].id" + And the traversal of + """ + g.V(v1Id, v2Id).union(__.outE().count(), __.inE().count(), __.outE().values("weight").sum()) + """ + When iterated to list + Then the result should be unordered + | d[3] | + | d[1.9] | + | d[1] | + + Scenario: get_g_VX1_2X_localXunionXoutE_count__inE_count__outE_weight_sumXX + Given the modern graph + And using the parameter v1Id defined as "v[marko].id" + And using the parameter v2Id defined as "v[vadas].id" + And the traversal of + """ + g.V(v1Id, v2Id).local(__.union(__.outE().count(), __.inE().count(), __.outE().values("weight").sum())) + """ + When iterated to list + Then the result should be unordered + | d[3] | + | d[0] | + | d[1.9] | + | d[0] | + | d[0] | + | d[1] | \ No newline at end of file
