[TINKERPOP-2612] Infix or() with ConnectiveStrategy can produce something unexpected

• Type: Improvement
• Status: Open
• Priority: Minor
• Resolution: Unresolved
• Affects Version/s: 3.4.12
• Component/s: process
• Assignee: Unassigned
• Reporter: Stephen Mallette
• Created: 30/Aug/21 21:03
• Updated: 30/Aug/21 21:03

Description

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])], []])]