public OperatorEnqArgs(int threadId, Dataflow.Stage stage, int shardId, Pointstamp pointstamp)
{
this.ThreadId = threadId;
this.Stage = stage;
this.ShardId = shardId;
this.Pointstamp = pointstamp;
}
public OperatorSendArgs(Dataflow.Stage stage, int shardId, int channelId, int count)
{
this.Stage = stage;
this.ShardId = shardId;
this.ChannelId = channelId;
this.Count = count;
}
internal StageOutput(Stage stage, Dataflow.ITimeContext <T> context, Expression <Func <R, int> > partitionedBy)
{
this.ForStage = stage;
this.Context = new TimeContext <T>(context);
endpointMap = new Dictionary <int, VertexOutput <R, T> >();
this.partitionedBy = partitionedBy;
}
public OperatorSendArgs(Dataflow.Stage stage, int vertexId, int channelId, int count)
{
this.Stage = stage;
this.VertexId = vertexId;
this.ChannelId = channelId;
this.Count = count;
}
internal VertexEnqueuedArgs(int threadId, Dataflow.Stage stage, int vertexId, Pointstamp pointstamp)
{
this.ThreadId = threadId;
this.Stage = stage;
this.VertexId = vertexId;
this.Pointstamp = pointstamp;
}
public int Register(Dataflow.Stage stage)
{
int ret = AllocateNewGraphIdentifier();
this.stages.Add(ret, stage);
return(ret);
}
public readonly bool IsStage; // true iff a stage node.
public GraphNode(Dataflow.Stage stage)
{
this.Index = stage.StageId;
this.Depth = stage.DefaultVersion.Timestamp.Length;
this.Ingress = stage.IsIterationIngress;
this.Egress = stage.IsIterationEgress;
this.Advance = stage.IsIterationAdvance;
this.Neighbors = new int[stage.Targets.Count];
for (int i = 0; i < Neighbors.Length; i++)
{
Neighbors[i] = stage.Targets[i].ChannelId;
}
this.Exchanges = false;
this.IsStage = true;
}
