This is an automated email from the ASF dual-hosted git repository.

spmallette pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/tinkerpop.git


The following commit(s) were added to refs/heads/master by this push:
     new 7bcce48dba Fix conditional looping recipe narration to match the 
example output
7bcce48dba is described below

commit 7bcce48dba6b8d33c4ca4d9d54bad9ff762e7dfc
Author: Stephen Mallette <[email protected]>
AuthorDate: Fri Sep 25 17:00:01 2026 +0000

    Fix conditional looping recipe narration to match the example output
    
    The 'Conditional Looping with Max Depth' recipe described the second
    example as continuing through a non-existent 'vertex X'. Correct the
    narration to describe the actual out() traversal from vertex A along the
    path A->B->C->E, note that vertex G is unreachable so the loop exits on
    the maximum depth, and state that it returns v[E]. Also fix a 'thorough'
    to 'through' typo.
    
    Assisted-by: Kiro:claude-opus-4.8
---
 docs/src/recipes/looping.asciidoc | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/docs/src/recipes/looping.asciidoc 
b/docs/src/recipes/looping.asciidoc
index 2f9042e69a..0f41565860 100644
--- a/docs/src/recipes/looping.asciidoc
+++ b/docs/src/recipes/looping.asciidoc
@@ -57,9 +57,10 @@ g.V('A').
 
 In the above case the traversal processes the `out().simplePath()` step once 
to move from vertex A to 
 vertex B, a second time to move from vertex B to vertex C, and then exits the 
traversal because it 
-satisfies the `hasId('C')` condition since it's reached vertex C.  If we 
however change that exit condition 
-to be vertex G, we will see that this traversal now will continue to process 
thorough vertex X and will 
-exit based on reaching the maximum number of loops (3).
+satisfies the `hasId('C')` condition since it's reached vertex C.  If that 
exit condition is instead changed 
+to vertex G, the traversal continues through vertex C on to vertex E, 
following the path A->B->C->E.  Because 
+vertex G is unreachable from vertex A by way of `out()` edges, the traversal 
exits upon reaching the maximum 
+number of loops (3) and returns `v[E]`.
 
 [gremlin-groovy,existing]
 ----

Reply via email to