/// <summary>
/// Executes steps concurrently. Not compatable with code that uses TaskLocal (the compiler use TaskLocal).
/// </summary>
/// <param name="aStep"></param>
public static void DoAllThreaded(Step aStep)
{
while (aStep.parent != null)
{
aStep = aStep.parent;
}
Queue<Step> toDos = new Queue<Step>();
toDos.Enqueue(aStep);
Dictionary<Step, Task> map = new Dictionary<Step, Task>();
List<Task> leafTasks = new List<Task>();
Task top = null;
while (toDos.Count != 0)
{
Step s = toDos.Dequeue();
Task t;
if (s.parent == null)
t = top = new Task(() => { Console.WriteLine("top"); s.Process(); });
else
t = map[s.parent].ContinueWith(_ => s.Process());
if (isOut(s.GetType()))
{
t = t.ContinueWith(_ =>
{
//it ~should~ be ok to use dynamic like this as the
//FollowWith functions should have ensured that types lined up
dynamic ds = s;
dynamic res = ds.Output;
foreach (var n in s.nexts)
{
dynamic dn = n;
dn.Input = res;
}
});
foreach (var n in s.nexts)
{
toDos.Enqueue(n);
}
}
else
{
if (s.nexts.Count != 0)
throw new NotSupportedException("non-output steps should not be followed");
leafTasks.Add(t);
}
map[s] = t;
}
top.Start();
Task.WaitAll(leafTasks.ToArray());
}
public static void DoAll(Step s)
{
while (s.parent != null)
{
s = s.parent;
}
Queue<Step> toDos = new Queue<Step>();
toDos.Enqueue(s);
while (toDos.Count != 0)
{
s = toDos.Dequeue();
s.Process();
if (isOut(s.GetType()))
{
//it ~should~ be ok to use dynamic like this as the
//FollowWith functions should have ensured that types lined up
dynamic ds = s;
dynamic res = ds.Output;
foreach (var n in s.nexts)
{
dynamic dn = n;
dn.Input = res;
toDos.Enqueue(n);
}
}
else
{
if (s.nexts.Count != 0)
throw new NotSupportedException("non-output steps should not be followed");
}
s.Dispose();
}
}
public virtual void Dispose()
{
this.nexts = null;
this.parent = null;
}
protected void AddNext(Step next)
{
if (next == null)
throw new ArgumentNullException();
next.parent = this;
nexts.Add(next);
}
public static string MakeGraph(Step s)
{
while (s.parent != null)
{
s = s.parent;
}
Queue<Step> toDos = new Queue<Step>();
toDos.Enqueue(s);
var allSteps = new List<Step>();
while (toDos.Count != 0)
{
s = toDos.Dequeue();
allSteps.Add(s);
if (isOut(s.GetType()))
{
foreach (var n in s.nexts)
{
toDos.Enqueue(n);
}
}
else
{
if (s.nexts.Count != 0)
throw new NotSupportedException("non-output steps should not be followed");
}
}
var sb = new StringBuilder();
sb.AppendLine("digraph {");
for (int i = 0; i < allSteps.Count; i++)
{
sb.AppendFormat("\tn{0} [label=\"{1}\"];", i, allSteps[i].Name);
sb.AppendLine();
}
sb.AppendLine();
for (int i = 0; i < allSteps.Count; i++)
{
foreach (var next in allSteps[i].nexts)
{
sb.AppendFormat("\tn{0} -> n{1}", i, allSteps.IndexOf(next));
sb.AppendLine();
}
}
sb.AppendLine("}");
return sb.ToString();
}