Uploaded image for project: 'TinkerPop'
  1. TinkerPop
  2. TINKERPOP-2230

match() step unexpected behaviours

    XMLWordPrintableJSON

    Details

    • Type: Bug
    • Status: Closed
    • Priority: Major
    • Resolution: Fixed
    • Affects Version/s: 3.4.1
    • Fix Version/s: 3.3.8, 3.4.3, 3.5.0
    • Component/s: process
    • Labels:
      None

      Description

      On the well known software graph:

      gremlin> g.V().match(
      ......1>     __.as('a').out('knows').as('b'),
      ......2>     __.as('b').out('created').as('c'))
      ==>[a:v[1],b:v[4],c:v[5]]
      ==>[a:v[1],b:v[4],c:v[3]]
      gremlin> g.V().match(
      ......1>     __.as('b').out('created').as('c'),
      ......2>     __.as('a').out('knows').as('b'))
      The provided match pattern is unsolvable: [[MatchStartStep(a), VertexStep(OUT,[knows],vertex), MatchEndStep(b)], [MatchStartStep(b), VertexStep(OUT,[created],vertex), MatchEndStep(c)]]
      

      with the second one being solvable as well (I think).

      Quoting Daniel Kuppitz:
      "I just noticed that the error message of my failing traversal actually contains a solvable form of patterns. It's really confusing; if you want, create a Jira ticket for that issue, perhaps someone dares to analyze that crazy code"

      please see this for more information.

        Attachments

          Issue Links

            Activity

              People

              • Assignee:
                dkuppitz Daniel Kuppitz
                Reporter:
                florenzi002 Fabio Lorenzi
              • Votes:
                0 Vote for this issue
                Watchers:
                4 Start watching this issue

                Dates

                • Created:
                  Updated:
                  Resolved: