From b7dd08b9e8ab6f7f3258155f1578d2e8406ddbed Mon Sep 17 00:00:00 2001 From: Ryan Tan <65996005+ryn5@users.noreply.github.com> Date: Mon, 16 Oct 2023 11:34:23 -0700 Subject: [PATCH] Use Go style step syntax Co-authored-by: Cole Greer <112986082+Cole-Greer@users.noreply.github.com> --- gremlin-go/example/example.go | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/gremlin-go/example/example.go b/gremlin-go/example/example.go index 02f91f7e8a3..6c9667610f0 100644 --- a/gremlin-go/example/example.go +++ b/gremlin-go/example/example.go @@ -143,15 +143,15 @@ func modernTraversalExample() { /* 1. There are three edges from the vertex with the identifier of "1". - 2. Filter those three edges using the where()-step using the identifier of the vertex returned by otherV() to + 2. Filter those three edges using the Where()-step using the identifier of the vertex returned by OtherV() to ensure it matches on the vertex of concern, which is the one with an identifier of "2". 3. Note that the same traversal will work if there are actual Vertex instances rather than just vertex identifiers. 4. The vertex with identifier "1" has all outgoing edges, so it would also be acceptable to use the directional - steps of outE() and inV() since the schema allows it. + steps of OutE() and InV() since the schema allows it. 5. There is also no problem with filtering the terminating side of the traversal on multiple vertices, in this case, vertices with identifiers "2" and "3". - 6. There’s no reason why the same pattern of exclusion used for edges with where() can’t work for a vertex + 6. There’s no reason why the same pattern of exclusion used for edges with Where() can’t work for a vertex between two vertices. */ }