This is an automated email from the ASF dual-hosted git repository. lyndonb pushed a commit to branch 3.6-dev in repository https://gitbox.apache.org/repos/asf/tinkerpop.git
commit fd50569dda56c2a1b8d329d9823876c00d2b0918 Merge: d4913bdb3c e991b66064 Author: Lyndon Bauto <[email protected]> AuthorDate: Mon May 30 09:44:51 2022 -0700 Merge branch '3.5-dev' into 3.6-dev docs/src/reference/gremlin-variants.asciidoc | 124 ++++++++++++++++ gremlin-go/driver/anonymousTraversal.go | 2 +- gremlin-go/driver/bytecode.go | 22 +-- gremlin-go/driver/bytecode_test.go | 40 ++--- gremlin-go/driver/client.go | 4 +- gremlin-go/driver/connection_test.go | 4 +- gremlin-go/driver/driverRemoteConnection.go | 12 +- gremlin-go/driver/error_codes.go | 2 +- gremlin-go/driver/graphBinary.go | 10 +- gremlin-go/driver/graphTraversal.go | 213 ++++++++++++++------------- gremlin-go/driver/graphTraversalSource.go | 44 +++--- gremlin-go/driver/request.go | 4 +- gremlin-go/driver/serializer.go | 2 +- gremlin-go/driver/strategies.go | 2 +- gremlin-go/driver/strategies_test.go | 2 +- gremlin-go/driver/traversal.go | 10 +- gremlin-go/driver/traversal_test.go | 20 +-- 17 files changed, 323 insertions(+), 194 deletions(-) diff --cc gremlin-go/driver/graphTraversal.go index 1af45ec647,eb03ae842a..98cd9597ab --- a/gremlin-go/driver/graphTraversal.go +++ b/gremlin-go/driver/graphTraversal.go @@@ -122,15 -123,9 +123,15 @@@ func (g *GraphTraversal) By(args ...int return g } +// Call adds the call step to the GraphTraversal. +func (g *GraphTraversal) Call(args ...interface{}) *GraphTraversal { + g.bytecode.addStep("call", args...) + return g +} + // Cap adds the cap step to the GraphTraversal. func (g *GraphTraversal) Cap(args ...interface{}) *GraphTraversal { - g.bytecode.addStep("cap", args...) + g.Bytecode.AddStep("cap", args...) return g } @@@ -188,15 -183,9 +189,15 @@@ func (g *GraphTraversal) Drop(args ...i return g } +// Element adds the element step to the GraphTraversal. +func (g *GraphTraversal) Element(args ...interface{}) *GraphTraversal { + g.bytecode.addStep("element", args...) + return g +} + // ElementMap adds the elementMap step to the GraphTraversal. func (g *GraphTraversal) ElementMap(args ...interface{}) *GraphTraversal { - g.bytecode.addStep("elementMap", args...) + g.Bytecode.AddStep("elementMap", args...) return g } @@@ -206,15 -195,9 +207,15 @@@ func (g *GraphTraversal) Emit(args ...i return g } +// Fail adds the fail step to the GraphTraversal. +func (g *GraphTraversal) Fail(args ...interface{}) *GraphTraversal { + g.bytecode.addStep("fail", args...) + return g +} + // Filter adds the filter step to the GraphTraversal. func (g *GraphTraversal) Filter(args ...interface{}) *GraphTraversal { - g.bytecode.addStep("filter", args...) + g.Bytecode.AddStep("filter", args...) return g } @@@ -392,21 -375,9 +393,21 @@@ func (g *GraphTraversal) Mean(args ...i return g } +// MergeE adds the mergeE step to the GraphTraversal. +func (g *GraphTraversal) MergeE(args ...interface{}) *GraphTraversal { + g.bytecode.addStep("mergeE", args...) + return g +} + +// MergeV adds the mergeE step to the GraphTraversal. +func (g *GraphTraversal) MergeV(args ...interface{}) *GraphTraversal { + g.bytecode.addStep("mergeV", args...) + return g +} + // Min adds the min step to the GraphTraversal. func (g *GraphTraversal) Min(args ...interface{}) *GraphTraversal { - g.bytecode.addStep("min", args...) + g.Bytecode.AddStep("min", args...) return g }
