Github user okram commented on the issue:
https://github.com/apache/tinkerpop/pull/535
Either works, but I'm leaning more towards (a). I would do something like:
Assume the traversal:
`g.V().out().values('name').count()`
The test algorithm would:
1. If the first step is a `GraphStep` (instanceof), then make sure their is
a `ProfileStep` after it and that it has a traverser count of 6.
2. Find the next step that is an instanceof `VertexStep`. (if it doesn't
exist, oh well). Check subsequent `ProfileStep`.
3. Find the next step that is an instanceof `PropertiesStep`./ (if it
doesn't exist, oh well). Check subsequent `ProfileStep`.
4. etc.
In short, try and generalize as much as possible assuming that provider
strategies can wildly change the traversal.
Then in a `ProfileStrategyTest` you can do more what @rjbriody did in
`ProfileTest` as there you can isolate to single strategy application.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
