/// <summary>
/// Adds the aggregate step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Aggregate(params object[] args)
{
Bytecode.AddStep("aggregate", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the propertyMap step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, IDictionary <string, E2> > PropertyMap <E2> (params object[] args)
{
Bytecode.AddStep("propertyMap", args);
return(Wrap <S, IDictionary <string, E2> >(this));
}
/// <summary>
/// Adds the repeat step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Repeat(params object[] args)
{
Bytecode.AddStep("repeat", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the path step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, Path> Path(params object[] args)
{
Bytecode.AddStep("path", args);
return(Wrap <S, Path>(this));
}
/// <summary>
/// Adds the V step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, Vertex> V(params object[] args)
{
Bytecode.AddStep("V", args);
return(Wrap <S, Vertex>(this));
}
/// <summary>
/// Adds the optional step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Optional <E2> (params object[] args)
{
Bytecode.AddStep("optional", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the outE step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, Edge> OutE(params object[] args)
{
Bytecode.AddStep("outE", args);
return(Wrap <S, Edge>(this));
}
/// <summary>
/// Adds the drop step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Drop(params object[] args)
{
Bytecode.AddStep("drop", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the flatMap step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> FlatMap <E2> (params object[] args)
{
Bytecode.AddStep("flatMap", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the count step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, long> Count(params object[] args)
{
Bytecode.AddStep("count", args);
return(Wrap <S, long>(this));
}
/// <summary>
/// Adds the cyclicPath step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> CyclicPath(params object[] args)
{
Bytecode.AddStep("cyclicPath", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the constant step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Constant <E2> (params object[] args)
{
Bytecode.AddStep("constant", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the coin step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Coin(params object[] args)
{
Bytecode.AddStep("coin", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the branch step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Branch <E2> (params object[] args)
{
Bytecode.AddStep("branch", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the match step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, IDictionary <string, E2> > Match <E2> (params object[] args)
{
Bytecode.AddStep("match", args);
return(Wrap <S, IDictionary <string, E2> >(this));
}
/// <summary>
/// Adds the from step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> From(params object[] args)
{
Bytecode.AddStep("from", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the min step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Min <E2> (params object[] args)
{
Bytecode.AddStep("min", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the groupCount step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> GroupCount(params object[] args)
{
Bytecode.AddStep("groupCount", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the order step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Order(params object[] args)
{
Bytecode.AddStep("order", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the hasValue step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> HasValue(params object[] args)
{
Bytecode.AddStep("hasValue", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the pageRank step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> PageRank(params object[] args)
{
Bytecode.AddStep("pageRank", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the id step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, object> Id(params object[] args)
{
Bytecode.AddStep("id", args);
return(Wrap <S, object>(this));
}
/// <summary>
/// Adds the peerPressure step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> PeerPressure(params object[] args)
{
Bytecode.AddStep("peerPressure", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the label step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, string> Label(params object[] args)
{
Bytecode.AddStep("label", args);
return(Wrap <S, string>(this));
}
/// <summary>
/// Adds the property step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Property(params object[] args)
{
Bytecode.AddStep("property", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the limit step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Limit <E2> (params object[] args)
{
Bytecode.AddStep("limit", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the range step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Range <E2> (params object[] args)
{
Bytecode.AddStep("range", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the loops step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, int> Loops(params object[] args)
{
Bytecode.AddStep("loops", args);
return(Wrap <S, int>(this));
}
/// <summary>
/// Adds the sack step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Sack(params object[] args)
{
Bytecode.AddStep("sack", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the where step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Where(params object[] args)
{
Bytecode.AddStep("where", args);
return(Wrap <S, E>(this));
}
