/// <summary>
/// Iterates all <see cref="Traverser" /> instances in the traversal.
/// </summary>
/// <returns>The fully drained traversal.</returns>
public ITraversal <S, E> Iterate()
{
Bytecode.AddStep("none");
while (MoveNext())
{
}
return(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>
/// Initializes a new instance of the <see cref="GraphTraversalSource" /> class.
/// </summary>
/// <param name="traversalStrategies">The traversal strategies associated with this graph traversal source.</param>
/// <param name="bytecode">
/// The <see cref="Traversal.Bytecode" /> associated with the current state of this graph traversal
/// source.
/// </param>
public GraphTraversalSource(ICollection <ITraversalStrategy> traversalStrategies, Bytecode bytecode)
{
TraversalStrategies = traversalStrategies;
Bytecode = bytecode;
}
/// <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 values step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Values <E2> (params object[] args)
{
Bytecode.AddStep("values", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the until step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Until(params object[] args)
{
Bytecode.AddStep("until", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the tree step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, object> Tree(params object[] args)
{
Bytecode.AddStep("tree", args);
return(Wrap <S, object>(this));
}
/// <summary>
/// Adds the toE step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, Edge> ToE(params object[] args)
{
Bytecode.AddStep("toE", args);
return(Wrap <S, Edge>(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 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 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 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 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 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 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 tail step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Tail <E2> (params object[] args)
{
Bytecode.AddStep("tail", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the times step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> Times(params object[] args)
{
Bytecode.AddStep("times", args);
return(Wrap <S, E>(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 toV step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, Vertex> ToV(params object[] args)
{
Bytecode.AddStep("toV", args);
return(Wrap <S, Vertex>(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 union step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Union <E2> (params object[] args)
{
Bytecode.AddStep("union", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the selectV3d2 step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, IDictionary <string, E2> > SelectV3d2 <E2> (params object[] args)
{
Bytecode.AddStep("selectV3d2", args);
return(Wrap <S, IDictionary <string, E2> >(this));
}
/// <summary>
/// Adds the valueMap step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, IDictionary <TKey, TValue> > ValueMap <TKey, TValue> (params object[] args)
{
Bytecode.AddStep("valueMap", args);
return(Wrap <S, IDictionary <TKey, TValue> >(this));
}
/// <summary>
/// Adds the sideEffect step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> SideEffect(params object[] args)
{
Bytecode.AddStep("sideEffect", 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));
}
/// <summary>
/// Adds the simplePath step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E> SimplePath(params object[] args)
{
Bytecode.AddStep("simplePath", args);
return(Wrap <S, E>(this));
}
/// <summary>
/// Adds the skip step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, E2> Skip <E2> (params object[] args)
{
Bytecode.AddStep("skip", args);
return(Wrap <S, E2>(this));
}
/// <summary>
/// Adds the subgraph step to this <see cref="GraphTraversal{SType, EType}" />.
/// </summary>
public GraphTraversal <S, Edge> Subgraph(params object[] args)
{
Bytecode.AddStep("subgraph", args);
return(Wrap <S, Edge>(this));
}
/// <summary>
/// Initializes a new instance of the <see cref="Bytecode" /> class.
/// </summary>
/// <param name="byteCode">Already existing <see cref="Bytecode" /> that should be cloned.</param>
public Bytecode(Bytecode byteCode)
{
SourceInstructions = new List <Instruction>(byteCode.SourceInstructions);
StepInstructions = new List <Instruction>(byteCode.StepInstructions);
}
/// <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));
}
