Stephen Mallette created TINKERPOP-2612:
-------------------------------------------

             Summary: Infix or() with ConnectiveStrategy can produce something 
unexpected
                 Key: TINKERPOP-2612
                 URL: https://issues.apache.org/jira/browse/TINKERPOP-2612
             Project: TinkerPop
          Issue Type: Improvement
          Components: process
    Affects Versions: 3.4.12
            Reporter: Stephen Mallette


{code}
gremlin> g.V(1).project('a','b').by('zzz').select('a','b').or()
==>v[1]
gremlin> g.V(1).project('a','b').by('zzz').select('a','b').or().explain()
==>Traversal Explanation
==============================================================================================================================================
Original Traversal                    [GraphStep(vertex,[1]), ProjectStep([a, 
b],[value(zzz)]), SelectStep(last,[a, b]), OrStep]

ConnectiveStrategy              [D]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
IdentityRemovalStrategy         [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
MatchPredicateStrategy          [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
FilterRankingStrategy           [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
InlineFilterStrategy            [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
IncidentToAdjacentStrategy      [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
RepeatUnrollStrategy            [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
PathRetractionStrategy          [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
EarlyLimitStrategy              [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
AdjacentToIncidentStrategy      [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
ByModulatorOptimizationStrategy [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
CountStrategy                   [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
LazyBarrierStrategy             [O]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
TinkerGraphCountStrategy        [P]   [GraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
TinkerGraphStepStrategy         [P]   [TinkerGraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
ProfileStrategy                 [F]   [TinkerGraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
StandardVerificationStrategy    [V]   [TinkerGraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]

Final Traversal                       [TinkerGraphStep(vertex,[1]), 
OrStep([[ProjectStep([a, b],[value(zzz)]), SelectStep(last,[a, b])], []])]
{code}



--
This message was sent by Atlassian Jira
(v8.3.4#803005)

Reply via email to