spmallette commented on code in PR #3458:
URL: https://github.com/apache/tinkerpop/pull/3458#discussion_r3423979923
##########
docs/src/reference/the-traversal.asciidoc:
##########
@@ -5187,6 +5239,19 @@ g.V().has('name', within('marko', 'vadas',
'josh')).as('person').
<1> Normally the `V()`-step will iterate over all vertices. However, graph
strategies can fold ``HasContainer``'s into a `GraphStep` to allow index
lookups.
<2> Whether the graph system provider supports mid-traversal `V()` index
lookups or not can easily be determined by inspecting the `toString()` output
of the iterated traversal. If `has` conditions were folded into the `V()`-step,
an index - if one exists - will be used.
+The `V()` step also accepts a traversal argument. The child traversal is
evaluated and its results are used as the
Review Comment:
again, i feel like this doesn't need to be an "also" in how this step works.
just integrate it into the other examples and content more seamlessly.
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
