[
https://issues.apache.org/jira/browse/TINKERPOP-1332?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15332039#comment-15332039
]
ASF GitHub Bot commented on TINKERPOP-1332:
-------------------------------------------
Github user RussellSpitzer commented on the issue:
https://github.com/apache/tinkerpop/pull/337
I still think this is pretty verbose, but I'm happy with the inclusion of
the
```graphfilter[[VertexStep(OUT,edge)]]``` so +1 on that
> Improve .explain() Dialogue
> ----------------------------
>
> Key: TINKERPOP-1332
> URL: https://issues.apache.org/jira/browse/TINKERPOP-1332
> Project: TinkerPop
> Issue Type: Improvement
> Components: process
> Affects Versions: 3.2.0-incubating
> Reporter: Russell Alexander Spitzer
> Assignee: Marko A. Rodriguez
> Priority: Minor
>
> Currently the output of explain gives you a long list of strategies but no
> details about their application
> {code}
> ==>Traversal Explanation
> ============================================================================================================================
> Original Traversal [GraphStep(vertex,[]), CountGlobalStep]
> HaltedTraverserStrategy [D] [GraphStep(vertex,[]), CountGlobalStep]
> ConnectiveStrategy [D] [GraphStep(vertex,[]), CountGlobalStep]
> VertexProgramStrategy [D]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> OrderLimitStrategy [O]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> IdentityRemovalStrategy [O]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> FilterRankingStrategy [O]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> IncidentToAdjacentStrategy [O]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> RangeByIsCountStrategy [O]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> AdjacentToIncidentStrategy [O]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> MatchPredicateStrategy [O]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> GraphFilterStrategy [O]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> PathProcessorStrategy [O]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> SparkInterceptorStrategy [P]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> SparkSingleIterationStrategy [P]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> ProfileStrategy [F]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> LambdaRestrictionStrategy [V]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> ComputerVerificationStrategy [V]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> StandardVerificationStrategy [V]
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> Final Traversal
> [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]),
> ComputerResultStep]
> {code}
> It would be helpful if filter strategies for example would list the filters
> used.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
