[
https://issues.apache.org/jira/browse/TINKERPOP-3256?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=18143119#comment-18143119
]
ASF GitHub Bot commented on TINKERPOP-3256:
-------------------------------------------
spmallette commented on code in PR #3763:
URL: https://github.com/apache/tinkerpop/pull/3763#discussion_r4542429179
##########
gremlin-test/src/main/resources/org/apache/tinkerpop/gremlin/test/features/map/MatchString.feature:
##########
@@ -320,3 +320,512 @@ Feature: Step - match() (String form)
| result |
| marko knows vadas |
| marko knows josh |
+
+ Scenario: g_match_personXknows_1_2X_person_selectXa_bX_byXnameX
+ Given the modern graph
+ And the traversal of
+ """
+ g.match("MATCH
(a:person)-[:knows]->{1,2}(b:person)").select("a","b").by("name")
+ """
+ When iterated to list
+ Then the result should be unordered
+ | result |
+ | m[{"a":"marko","b":"vadas"}] |
+ | m[{"a":"marko","b":"josh"}] |
+
+ Scenario: g_match_airportXroute_1_2X_airport_selectXbX_byXnameX
Review Comment:
i guess it's ok that all the examples create their own data, but can we not
just use air routes? or some other existing static graph to test? Seems like we
shouldn't fall into using empty graph unless there is some specific case not
testable any other way or we need to define an intent for tinker-fluency.
> Variable-length path patterns
> -----------------------------
>
> Key: TINKERPOP-3256
> URL: https://issues.apache.org/jira/browse/TINKERPOP-3256
> Project: TinkerPop
> Issue Type: Improvement
> Components: gql
> Affects Versions: 4.0.0
> Reporter: Stephen Mallette
> Priority: Major
>
> Patterns like (a)-[:knows*1..3]->(b) are not supported. Add quantified edge
> syntax to GQL.g4 and the executor.
--
This message was sent by Atlassian Jira
(v10.3.26#10030026)
