You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tinkerpop.apache.org by sp...@apache.org on 2017/07/12 14:25:36 UTC
[39/48] tinkerpop git commit: TINKERPOP-1552 Removed the dotnet
generator module
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversal.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversal.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversal.cs
index 0f3fbb7..5aaaef0 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversal.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversal.cs
@@ -26,6 +26,9 @@ using Gremlin.Net.Structure;
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public class GraphTraversal<S, E> : DefaultTraversal<S, E>
{
public GraphTraversal()
@@ -50,592 +53,594 @@ namespace Gremlin.Net.Process.Traversal
}
- public GraphTraversal<S, Vertex> V(params object[] args)
+ public GraphTraversal< S , Vertex > V (params object[] args)
{
Bytecode.AddStep("V", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, Edge> AddE(params object[] args)
+ public GraphTraversal< S , Edge > AddE (params object[] args)
{
Bytecode.AddStep("addE", args);
- return Wrap<S, Edge>(this);
+ return Wrap< S , Edge >(this);
}
- public GraphTraversal<S, Edge> AddInE(params object[] args)
+ public GraphTraversal< S , Edge > AddInE (params object[] args)
{
Bytecode.AddStep("addInE", args);
- return Wrap<S, Edge>(this);
+ return Wrap< S , Edge >(this);
}
- public GraphTraversal<S, Edge> AddOutE(params object[] args)
+ public GraphTraversal< S , Edge > AddOutE (params object[] args)
{
Bytecode.AddStep("addOutE", args);
- return Wrap<S, Edge>(this);
+ return Wrap< S , Edge >(this);
}
- public GraphTraversal<S, Vertex> AddV(params object[] args)
+ public GraphTraversal< S , Vertex > AddV (params object[] args)
{
Bytecode.AddStep("addV", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, E> Aggregate(params object[] args)
+ public GraphTraversal< S , E > Aggregate (params object[] args)
{
Bytecode.AddStep("aggregate", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> And(params object[] args)
+ public GraphTraversal< S , E > And (params object[] args)
{
Bytecode.AddStep("and", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> As(params object[] args)
+ public GraphTraversal< S , E > As (params object[] args)
{
Bytecode.AddStep("as", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Barrier(params object[] args)
+ public GraphTraversal< S , E > Barrier (params object[] args)
{
Bytecode.AddStep("barrier", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, Vertex> Both(params object[] args)
+ public GraphTraversal< S , Vertex > Both (params object[] args)
{
Bytecode.AddStep("both", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, Edge> BothE(params object[] args)
+ public GraphTraversal< S , Edge > BothE (params object[] args)
{
Bytecode.AddStep("bothE", args);
- return Wrap<S, Edge>(this);
+ return Wrap< S , Edge >(this);
}
- public GraphTraversal<S, Vertex> BothV(params object[] args)
+ public GraphTraversal< S , Vertex > BothV (params object[] args)
{
Bytecode.AddStep("bothV", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, E2> Branch<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Branch<E2> (params object[] args)
{
Bytecode.AddStep("branch", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> By(params object[] args)
+ public GraphTraversal< S , E > By (params object[] args)
{
Bytecode.AddStep("by", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E2> Cap<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Cap<E2> (params object[] args)
{
Bytecode.AddStep("cap", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> Choose<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Choose<E2> (params object[] args)
{
Bytecode.AddStep("choose", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> Coalesce<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Coalesce<E2> (params object[] args)
{
Bytecode.AddStep("coalesce", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> Coin(params object[] args)
+ public GraphTraversal< S , E > Coin (params object[] args)
{
Bytecode.AddStep("coin", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E2> Constant<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Constant<E2> (params object[] args)
{
Bytecode.AddStep("constant", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, long> Count(params object[] args)
+ public GraphTraversal< S , long > Count (params object[] args)
{
Bytecode.AddStep("count", args);
- return Wrap<S, long>(this);
+ return Wrap< S , long >(this);
}
- public GraphTraversal<S, E> CyclicPath(params object[] args)
+ public GraphTraversal< S , E > CyclicPath (params object[] args)
{
Bytecode.AddStep("cyclicPath", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Dedup(params object[] args)
+ public GraphTraversal< S , E > Dedup (params object[] args)
{
Bytecode.AddStep("dedup", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Drop(params object[] args)
+ public GraphTraversal< S , E > Drop (params object[] args)
{
Bytecode.AddStep("drop", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Emit(params object[] args)
+ public GraphTraversal< S , E > Emit (params object[] args)
{
Bytecode.AddStep("emit", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Filter(params object[] args)
+ public GraphTraversal< S , E > Filter (params object[] args)
{
Bytecode.AddStep("filter", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E2> FlatMap<E2>(params object[] args)
+ public GraphTraversal< S , E2 > FlatMap<E2> (params object[] args)
{
Bytecode.AddStep("flatMap", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> Fold<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Fold<E2> (params object[] args)
{
Bytecode.AddStep("fold", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> From(params object[] args)
+ public GraphTraversal< S , E > From (params object[] args)
{
Bytecode.AddStep("from", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Group(params object[] args)
+ public GraphTraversal< S , E > Group (params object[] args)
{
Bytecode.AddStep("group", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> GroupCount(params object[] args)
+ public GraphTraversal< S , E > GroupCount (params object[] args)
{
Bytecode.AddStep("groupCount", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> GroupV3d0(params object[] args)
+ public GraphTraversal< S , E > GroupV3d0 (params object[] args)
{
Bytecode.AddStep("groupV3d0", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Has(params object[] args)
+ public GraphTraversal< S , E > Has (params object[] args)
{
Bytecode.AddStep("has", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> HasId(params object[] args)
+ public GraphTraversal< S , E > HasId (params object[] args)
{
Bytecode.AddStep("hasId", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> HasKey(params object[] args)
+ public GraphTraversal< S , E > HasKey (params object[] args)
{
Bytecode.AddStep("hasKey", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> HasLabel(params object[] args)
+ public GraphTraversal< S , E > HasLabel (params object[] args)
{
Bytecode.AddStep("hasLabel", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> HasNot(params object[] args)
+ public GraphTraversal< S , E > HasNot (params object[] args)
{
Bytecode.AddStep("hasNot", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> HasValue(params object[] args)
+ public GraphTraversal< S , E > HasValue (params object[] args)
{
Bytecode.AddStep("hasValue", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, object> Id(params object[] args)
+ public GraphTraversal< S , object > Id (params object[] args)
{
Bytecode.AddStep("id", args);
- return Wrap<S, object>(this);
+ return Wrap< S , object >(this);
}
- public GraphTraversal<S, E> Identity(params object[] args)
+ public GraphTraversal< S , E > Identity (params object[] args)
{
Bytecode.AddStep("identity", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, Vertex> In(params object[] args)
+ public GraphTraversal< S , Vertex > In (params object[] args)
{
Bytecode.AddStep("in", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, Edge> InE(params object[] args)
+ public GraphTraversal< S , Edge > InE (params object[] args)
{
Bytecode.AddStep("inE", args);
- return Wrap<S, Edge>(this);
+ return Wrap< S , Edge >(this);
}
- public GraphTraversal<S, Vertex> InV(params object[] args)
+ public GraphTraversal< S , Vertex > InV (params object[] args)
{
Bytecode.AddStep("inV", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, E> Inject(params object[] args)
+ public GraphTraversal< S , E > Inject (params object[] args)
{
Bytecode.AddStep("inject", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Is(params object[] args)
+ public GraphTraversal< S , E > Is (params object[] args)
{
Bytecode.AddStep("is", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, string> Key(params object[] args)
+ public GraphTraversal< S , string > Key (params object[] args)
{
Bytecode.AddStep("key", args);
- return Wrap<S, string>(this);
+ return Wrap< S , string >(this);
}
- public GraphTraversal<S, string> Label(params object[] args)
+ public GraphTraversal< S , string > Label (params object[] args)
{
Bytecode.AddStep("label", args);
- return Wrap<S, string>(this);
+ return Wrap< S , string >(this);
}
- public GraphTraversal<S, E2> Limit<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Limit<E2> (params object[] args)
{
Bytecode.AddStep("limit", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> Local<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Local<E2> (params object[] args)
{
Bytecode.AddStep("local", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, int> Loops(params object[] args)
+ public GraphTraversal< S , int > Loops (params object[] args)
{
Bytecode.AddStep("loops", args);
- return Wrap<S, int>(this);
+ return Wrap< S , int >(this);
}
- public GraphTraversal<S, E2> Map<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Map<E2> (params object[] args)
{
Bytecode.AddStep("map", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> MapKeys<E2>(params object[] args)
+ public GraphTraversal< S , E2 > MapKeys<E2> (params object[] args)
{
Bytecode.AddStep("mapKeys", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> MapValues<E2>(params object[] args)
+ public GraphTraversal< S , E2 > MapValues<E2> (params object[] args)
{
Bytecode.AddStep("mapValues", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, IDictionary<string, E2>> Match<E2>(params object[] args)
+ public GraphTraversal< S , IDictionary<string, E2> > Match<E2> (params object[] args)
{
Bytecode.AddStep("match", args);
- return Wrap<S, IDictionary<string, E2>>(this);
+ return Wrap< S , IDictionary<string, E2> >(this);
}
- public GraphTraversal<S, E2> Max<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Max<E2> (params object[] args)
{
Bytecode.AddStep("max", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> Mean<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Mean<E2> (params object[] args)
{
Bytecode.AddStep("mean", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> Min<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Min<E2> (params object[] args)
{
Bytecode.AddStep("min", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> Not(params object[] args)
+ public GraphTraversal< S , E > Not (params object[] args)
{
Bytecode.AddStep("not", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Option(params object[] args)
+ public GraphTraversal< S , E > Option (params object[] args)
{
Bytecode.AddStep("option", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E2> Optional<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Optional<E2> (params object[] args)
{
Bytecode.AddStep("optional", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> Or(params object[] args)
+ public GraphTraversal< S , E > Or (params object[] args)
{
Bytecode.AddStep("or", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Order(params object[] args)
+ public GraphTraversal< S , E > Order (params object[] args)
{
Bytecode.AddStep("order", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, Vertex> OtherV(params object[] args)
+ public GraphTraversal< S , Vertex > OtherV (params object[] args)
{
Bytecode.AddStep("otherV", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, Vertex> Out(params object[] args)
+ public GraphTraversal< S , Vertex > Out (params object[] args)
{
Bytecode.AddStep("out", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, Edge> OutE(params object[] args)
+ public GraphTraversal< S , Edge > OutE (params object[] args)
{
Bytecode.AddStep("outE", args);
- return Wrap<S, Edge>(this);
+ return Wrap< S , Edge >(this);
}
- public GraphTraversal<S, Vertex> OutV(params object[] args)
+ public GraphTraversal< S , Vertex > OutV (params object[] args)
{
Bytecode.AddStep("outV", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, E> PageRank(params object[] args)
+ public GraphTraversal< S , E > PageRank (params object[] args)
{
Bytecode.AddStep("pageRank", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, Path> Path(params object[] args)
+ public GraphTraversal< S , Path > Path (params object[] args)
{
Bytecode.AddStep("path", args);
- return Wrap<S, Path>(this);
+ return Wrap< S , Path >(this);
}
- public GraphTraversal<S, E> PeerPressure(params object[] args)
+ public GraphTraversal< S , E > PeerPressure (params object[] args)
{
Bytecode.AddStep("peerPressure", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Profile(params object[] args)
+ public GraphTraversal< S , E > Profile (params object[] args)
{
Bytecode.AddStep("profile", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Program(params object[] args)
+ public GraphTraversal< S , E > Program (params object[] args)
{
Bytecode.AddStep("program", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, IDictionary<string, E2>> Project<E2>(params object[] args)
+ public GraphTraversal< S , IDictionary<string, E2> > Project<E2> (params object[] args)
{
Bytecode.AddStep("project", args);
- return Wrap<S, IDictionary<string, E2>>(this);
+ return Wrap< S , IDictionary<string, E2> >(this);
}
- public GraphTraversal<S, E2> Properties<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Properties<E2> (params object[] args)
{
Bytecode.AddStep("properties", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> Property(params object[] args)
+ public GraphTraversal< S , E > Property (params object[] args)
{
Bytecode.AddStep("property", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, IDictionary<string, E2>> PropertyMap<E2>(params object[] args)
+ public GraphTraversal< S , IDictionary<string, E2> > PropertyMap<E2> (params object[] args)
{
Bytecode.AddStep("propertyMap", args);
- return Wrap<S, IDictionary<string, E2>>(this);
+ return Wrap< S , IDictionary<string, E2> >(this);
}
- public GraphTraversal<S, E2> Range<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Range<E2> (params object[] args)
{
Bytecode.AddStep("range", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> Repeat(params object[] args)
+ public GraphTraversal< S , E > Repeat (params object[] args)
{
Bytecode.AddStep("repeat", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Sack(params object[] args)
+ public GraphTraversal< S , E > Sack (params object[] args)
{
Bytecode.AddStep("sack", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Sample(params object[] args)
+ public GraphTraversal< S , E > Sample (params object[] args)
{
Bytecode.AddStep("sample", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, IDictionary<string, E2>> Select<E2>(params object[] args)
+ public GraphTraversal< S , IDictionary<string, E2> > Select<E2> (params object[] args)
{
Bytecode.AddStep("select", args);
- return Wrap<S, IDictionary<string, E2>>(this);
+ return Wrap< S , IDictionary<string, E2> >(this);
}
- public GraphTraversal<S, E> SideEffect(params object[] args)
+ public GraphTraversal< S , E > SideEffect (params object[] args)
{
Bytecode.AddStep("sideEffect", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> SimplePath(params object[] args)
+ public GraphTraversal< S , E > SimplePath (params object[] args)
{
Bytecode.AddStep("simplePath", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Store(params object[] args)
+ public GraphTraversal< S , E > Store (params object[] args)
{
Bytecode.AddStep("store", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, Edge> Subgraph(params object[] args)
+ public GraphTraversal< S , Edge > Subgraph (params object[] args)
{
Bytecode.AddStep("subgraph", args);
- return Wrap<S, Edge>(this);
+ return Wrap< S , Edge >(this);
}
- public GraphTraversal<S, E2> Sum<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Sum<E2> (params object[] args)
{
Bytecode.AddStep("sum", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> Tail<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Tail<E2> (params object[] args)
{
Bytecode.AddStep("tail", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> TimeLimit(params object[] args)
+ public GraphTraversal< S , E > TimeLimit (params object[] args)
{
Bytecode.AddStep("timeLimit", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E> Times(params object[] args)
+ public GraphTraversal< S , E > Times (params object[] args)
{
Bytecode.AddStep("times", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, Vertex> To(params object[] args)
+ public GraphTraversal< S , Vertex > To (params object[] args)
{
Bytecode.AddStep("to", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, Edge> ToE(params object[] args)
+ public GraphTraversal< S , Edge > ToE (params object[] args)
{
Bytecode.AddStep("toE", args);
- return Wrap<S, Edge>(this);
+ return Wrap< S , Edge >(this);
}
- public GraphTraversal<S, Vertex> ToV(params object[] args)
+ public GraphTraversal< S , Vertex > ToV (params object[] args)
{
Bytecode.AddStep("toV", args);
- return Wrap<S, Vertex>(this);
+ return Wrap< S , Vertex >(this);
}
- public GraphTraversal<S, E> Tree(params object[] args)
+ public GraphTraversal< S , E > Tree (params object[] args)
{
Bytecode.AddStep("tree", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E2> Unfold<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Unfold<E2> (params object[] args)
{
Bytecode.AddStep("unfold", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E2> Union<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Union<E2> (params object[] args)
{
Bytecode.AddStep("union", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> Until(params object[] args)
+ public GraphTraversal< S , E > Until (params object[] args)
{
Bytecode.AddStep("until", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
- public GraphTraversal<S, E2> Value<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Value<E2> (params object[] args)
{
Bytecode.AddStep("value", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, IDictionary<string, E2>> ValueMap<E2>(params object[] args)
+ public GraphTraversal< S , IDictionary<string, E2> > ValueMap<E2> (params object[] args)
{
Bytecode.AddStep("valueMap", args);
- return Wrap<S, IDictionary<string, E2>>(this);
+ return Wrap< S , IDictionary<string, E2> >(this);
}
- public GraphTraversal<S, E2> Values<E2>(params object[] args)
+ public GraphTraversal< S , E2 > Values<E2> (params object[] args)
{
Bytecode.AddStep("values", args);
- return Wrap<S, E2>(this);
+ return Wrap< S , E2 >(this);
}
- public GraphTraversal<S, E> Where(params object[] args)
+ public GraphTraversal< S , E > Where (params object[] args)
{
Bytecode.AddStep("where", args);
- return Wrap<S, E>(this);
+ return Wrap< S , E >(this);
}
+
+
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversalSource.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversalSource.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversalSource.cs
index 07d98fb..1380be7 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversalSource.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversalSource.cs
@@ -28,6 +28,9 @@ using Gremlin.Net.Structure;
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public class GraphTraversalSource
{
public ICollection<ITraversalStrategy> TraversalStrategies { get; set; }
@@ -44,10 +47,11 @@ namespace Gremlin.Net.Process.Traversal
Bytecode = bytecode;
}
+
public GraphTraversalSource WithBulk(params object[] args)
{
var source = new GraphTraversalSource(new List<ITraversalStrategy>(TraversalStrategies),
- new Bytecode(Bytecode));
+ new Bytecode(Bytecode));
source.Bytecode.AddSource("withBulk", args);
return source;
}
@@ -55,7 +59,7 @@ namespace Gremlin.Net.Process.Traversal
public GraphTraversalSource WithPath(params object[] args)
{
var source = new GraphTraversalSource(new List<ITraversalStrategy>(TraversalStrategies),
- new Bytecode(Bytecode));
+ new Bytecode(Bytecode));
source.Bytecode.AddSource("withPath", args);
return source;
}
@@ -63,7 +67,7 @@ namespace Gremlin.Net.Process.Traversal
public GraphTraversalSource WithSack(params object[] args)
{
var source = new GraphTraversalSource(new List<ITraversalStrategy>(TraversalStrategies),
- new Bytecode(Bytecode));
+ new Bytecode(Bytecode));
source.Bytecode.AddSource("withSack", args);
return source;
}
@@ -71,7 +75,7 @@ namespace Gremlin.Net.Process.Traversal
public GraphTraversalSource WithSideEffect(params object[] args)
{
var source = new GraphTraversalSource(new List<ITraversalStrategy>(TraversalStrategies),
- new Bytecode(Bytecode));
+ new Bytecode(Bytecode));
source.Bytecode.AddSource("withSideEffect", args);
return source;
}
@@ -79,7 +83,7 @@ namespace Gremlin.Net.Process.Traversal
public GraphTraversalSource WithStrategies(params object[] args)
{
var source = new GraphTraversalSource(new List<ITraversalStrategy>(TraversalStrategies),
- new Bytecode(Bytecode));
+ new Bytecode(Bytecode));
source.Bytecode.AddSource("withStrategies", args);
return source;
}
@@ -87,7 +91,7 @@ namespace Gremlin.Net.Process.Traversal
public GraphTraversalSource WithoutStrategies(params object[] args)
{
var source = new GraphTraversalSource(new List<ITraversalStrategy>(TraversalStrategies),
- new Bytecode(Bytecode));
+ new Bytecode(Bytecode));
source.Bytecode.AddSource("withoutStrategies", args);
return source;
}
@@ -104,7 +108,7 @@ namespace Gremlin.Net.Process.Traversal
source.TraversalStrategies.Add(new RemoteStrategy(remoteConnection));
return source;
}
-
+
public GraphTraversalSource WithComputer(string graphComputer = null, int? workers = null, string persist = null,
string result = null, ITraversal vertices = null, ITraversal edges = null,
Dictionary<string, dynamic> configuration = null)
@@ -112,25 +116,27 @@ namespace Gremlin.Net.Process.Traversal
return WithStrategies(new VertexProgramStrategy(graphComputer, workers, persist, result, vertices, edges, configuration));
}
- public GraphTraversal<Edge, Edge> E(params object[] args)
+
+ public GraphTraversal< Edge,Edge > E(params object[] args)
{
- var traversal = new GraphTraversal<Edge, Edge>(TraversalStrategies, new Bytecode(Bytecode));
+ var traversal = new GraphTraversal< Edge,Edge >(TraversalStrategies, new Bytecode(Bytecode));
traversal.Bytecode.AddStep("E", args);
return traversal;
}
- public GraphTraversal<Vertex, Vertex> V(params object[] args)
+ public GraphTraversal< Vertex,Vertex > V(params object[] args)
{
- var traversal = new GraphTraversal<Vertex, Vertex>(TraversalStrategies, new Bytecode(Bytecode));
+ var traversal = new GraphTraversal< Vertex,Vertex >(TraversalStrategies, new Bytecode(Bytecode));
traversal.Bytecode.AddStep("V", args);
return traversal;
}
- public GraphTraversal<Vertex, Vertex> AddV(params object[] args)
+ public GraphTraversal< Vertex,Vertex > AddV(params object[] args)
{
- var traversal = new GraphTraversal<Vertex, Vertex>(TraversalStrategies, new Bytecode(Bytecode));
+ var traversal = new GraphTraversal< Vertex,Vertex >(TraversalStrategies, new Bytecode(Bytecode));
traversal.Bytecode.AddStep("addV", args);
return traversal;
}
+
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GryoVersion.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GryoVersion.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GryoVersion.cs
new file mode 100644
index 0000000..c271a9f
--- /dev/null
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GryoVersion.cs
@@ -0,0 +1,33 @@
+#region License
+
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#endregion
+
+namespace Gremlin.Net.Process.Traversal
+{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
+ public enum GryoVersion
+ {
+ V1_0
+ }
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/NamingConversions.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/NamingConversions.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/NamingConversions.cs
index 2e95da1..bfee0da 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/NamingConversions.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/NamingConversions.cs
@@ -25,6 +25,9 @@ using System.Collections.Generic;
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
internal static class NamingConversions
{
/// <summary>
@@ -41,46 +44,50 @@ namespace Gremlin.Net.Process.Traversal
return javaName;
}
- private static readonly IDictionary<string, string> CSharpToJavaEnums = new Dictionary<string, string>
+ internal static readonly IDictionary<string, string> CSharpToJavaEnums = new Dictionary<string, string>
{
- {"T.Value", "value"},
- {"Order.Decr", "decr"},
- {"Order.KeyDecr", "keyDecr"},
- {"T.Key", "key"},
- {"Column.Values", "values"},
- {"Order.KeyIncr", "keyIncr"},
- {"Operator.Or", "or"},
- {"Order.ValueIncr", "valueIncr"},
+ {"Barrier.NormSack", "normSack"},
{"Cardinality.List", "list"},
- {"Order.Incr", "incr"},
- {"Pop.All", "all"},
- {"Operator.SumLong", "sumLong"},
- {"Pop.First", "first"},
- {"T.Label", "label"},
{"Cardinality.Set", "set"},
- {"Order.Shuffle", "shuffle"},
- {"Direction.In", "IN"},
+ {"Cardinality.Single", "single"},
+ {"Column.Keys", "keys"},
+ {"Column.Values", "values"},
{"Direction.Both", "BOTH"},
- {"Scope.Local", "local"},
- {"Operator.Max", "max"},
+ {"Direction.In", "IN"},
{"Direction.Out", "OUT"},
- {"Scope.Global", "global"},
- {"Pick.Any", "any"},
- {"Order.ValueDecr", "valueDecr"},
- {"Column.Keys", "keys"},
+ {"GraphSONVersion.V1_0", "V1_0"},
+ {"GraphSONVersion.V2_0", "V2_0"},
+ {"GryoVersion.V1_0", "V1_0"},
{"Operator.AddAll", "addAll"},
+ {"Operator.And", "and"},
+ {"Operator.Assign", "assign"},
+ {"Operator.Div", "div"},
+ {"Operator.Max", "max"},
+ {"Operator.Min", "min"},
+ {"Operator.Minus", "minus"},
{"Operator.Mult", "mult"},
+ {"Operator.Or", "or"},
+ {"Operator.Sum", "sum"},
+ {"Operator.SumLong", "sumLong"},
+ {"Order.Decr", "decr"},
+ {"Order.Incr", "incr"},
+ {"Order.KeyDecr", "keyDecr"},
+ {"Order.KeyIncr", "keyIncr"},
+ {"Order.Shuffle", "shuffle"},
+ {"Order.ValueDecr", "valueDecr"},
+ {"Order.ValueIncr", "valueIncr"},
+ {"Pick.Any", "any"},
{"Pick.None", "none"},
+ {"Pop.All", "all"},
+ {"Pop.First", "first"},
{"Pop.Last", "last"},
- {"Operator.And", "and"},
+ {"Scope.Global", "global"},
+ {"Scope.Local", "local"},
{"T.Id", "id"},
- {"Operator.Min", "min"},
- {"Barrier.NormSack", "normSack"},
- {"Operator.Minus", "minus"},
- {"Cardinality.Single", "single"},
- {"Operator.Assign", "assign"},
- {"Operator.Div", "div"},
- {"Operator.Sum", "sum"}
+ {"T.Key", "key"},
+ {"T.Label", "label"},
+ {"T.Value", "value"}
+
};
}
}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Operator.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Operator.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Operator.cs
index 17b44a4..a7a01ee 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Operator.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Operator.cs
@@ -23,18 +23,11 @@
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public enum Operator
{
- AddAll,
- And,
- Assign,
- Div,
- Max,
- Min,
- Minus,
- Mult,
- Or,
- Sum,
- SumLong
+ AddAll,And,Assign,Div,Max,Min,Minus,Mult,Or,Sum,SumLong
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Order.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Order.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Order.cs
index 179182b..a59daf5 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Order.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Order.cs
@@ -23,14 +23,11 @@
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public enum Order
{
- Decr,
- Incr,
- KeyDecr,
- KeyIncr,
- Shuffle,
- ValueDecr,
- ValueIncr
+ Decr,Incr,KeyDecr,KeyIncr,Shuffle,ValueDecr,ValueIncr
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/P.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/P.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/P.cs
index cf388bd..ee184e6 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/P.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/P.cs
@@ -21,11 +21,14 @@
#endregion
-
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public class P
{
+
public static TraversalPredicate Between(params object[] args)
{
var value = args.Length == 1 ? args[0] : args;
@@ -103,5 +106,6 @@ namespace Gremlin.Net.Process.Traversal
var value = args.Length == 1 ? args[0] : args;
return new TraversalPredicate("without", value);
}
+
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pick.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pick.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pick.cs
index 624f66e..2306cc0 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pick.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pick.cs
@@ -23,9 +23,11 @@
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public enum Pick
{
- Any,
- None
+ Any,None
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pop.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pop.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pop.cs
index dcbe698..72ea8d9 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pop.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Pop.cs
@@ -23,10 +23,11 @@
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public enum Pop
{
- All,
- First,
- Last
+ All,First,Last
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Scope.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Scope.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Scope.cs
index f27725e..b19d709 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Scope.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Scope.cs
@@ -23,9 +23,11 @@
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public enum Scope
{
- Global,
- Local
+ Global,Local
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/T.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/T.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/T.cs
index 76ca40f..ccd0242 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/T.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/T.cs
@@ -23,11 +23,11 @@
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public enum T
{
- Id,
- Key,
- Label,
- Value
+ Id,Key,Label,Value
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/__.cs
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/__.cs b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/__.cs
index f2e6162..aaf61aa 100644
--- a/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/__.cs
+++ b/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/__.cs
@@ -26,6 +26,9 @@ using Gremlin.Net.Structure;
namespace Gremlin.Net.Process.Traversal
{
+ /// <summary>
+ /// THIS IS A GENERATED CLASS - DO NOT MODIFY THIS CLASS DIRECTLY - see pom.xml
+ /// </summary>
public static class __
{
public static GraphTraversal<object, object> Start()
@@ -487,5 +490,6 @@ namespace Gremlin.Net.Process.Traversal
{
return new GraphTraversal<object, object>().Where(args);
}
+
}
-}
+}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/src/pom.xml
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/src/pom.xml b/gremlin-dotnet/src/pom.xml
index 3b0bf68..dd43b1f 100644
--- a/gremlin-dotnet/src/pom.xml
+++ b/gremlin-dotnet/src/pom.xml
@@ -26,6 +26,23 @@ limitations under the License.
<artifactId>gremlin-dotnet-source</artifactId>
<name>Apache TinkerPop :: Gremlin-DotNet - Source</name>
<packaging>${packaging.type}</packaging>
+
+ <build>
+ <plugins>
+ <!-- Override the execution from gremlin-dotnet to disable code generation from happening a second time -->
+ <plugin>
+ <groupId>org.codehaus.gmavenplus</groupId>
+ <artifactId>gmavenplus-plugin</artifactId>
+ <executions>
+ <execution>
+ <id>generate-dsl</id>
+ <phase/>
+ </execution>
+ </executions>
+ </plugin>
+ </plugins>
+ </build>
+
<profiles>
<profile>
<id>gremlin-dotnet-standard</id>
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/gremlin-dotnet/test/pom.xml
----------------------------------------------------------------------
diff --git a/gremlin-dotnet/test/pom.xml b/gremlin-dotnet/test/pom.xml
index d062620..8cdffa9 100644
--- a/gremlin-dotnet/test/pom.xml
+++ b/gremlin-dotnet/test/pom.xml
@@ -34,6 +34,22 @@ limitations under the License.
<gremlin.server.dir>${project.parent.parent.basedir}/gremlin-server</gremlin.server.dir>
</properties>
+ <build>
+ <plugins>
+ <!-- Override the execution from gremlin-dotnet to disable code generation from happening a second time -->
+ <plugin>
+ <groupId>org.codehaus.gmavenplus</groupId>
+ <artifactId>gmavenplus-plugin</artifactId>
+ <executions>
+ <execution>
+ <id>generate-dsl</id>
+ <phase/>
+ </execution>
+ </executions>
+ </plugin>
+ </plugins>
+ </build>
+
<profiles>
<profile>
<id>gremlin-dotnet-standard</id>
http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/77fbfcdf/pom.xml
----------------------------------------------------------------------
diff --git a/pom.xml b/pom.xml
index 62ada6c..2d2c559 100644
--- a/pom.xml
+++ b/pom.xml
@@ -119,7 +119,6 @@ limitations under the License.
<module>gremlin-groovy</module>
<module>tinkergraph-gremlin</module>
<module>gremlin-python</module>
- <module>gremlin-dotnet-generator</module>
<module>gremlin-dotnet</module>
<module>hadoop-gremlin</module>
<module>spark-gremlin</module>