void DoAlt()
{
graph = new LGSPGraph(new AlternativesGraphModel());
actions = new AlternativesActions(graph);
procEnv = new LGSPGraphProcessingEnvironment(graph, actions);
// use graph rewrite sequence
procEnv.ApplyGraphRewriteSequence("createComplex");
Console.WriteLine(procEnv.PerformanceInfo.MatchesFound + " matches found.");
Console.WriteLine(procEnv.PerformanceInfo.RewritesPerformed + " rewrites performed.");
procEnv.PerformanceInfo.Reset();
// use old inexact interface
IMatches matches = actions.GetAction("Complex").Match(procEnv, 0, null);
Console.WriteLine(matches.Count + " Complex matches found.");
// use new 2.5 exact interface
IMatchesExact<Rule_ComplexMax.IMatch_ComplexMax> matchesExact = actions.ComplexMax.Match(procEnv, 0);
Console.WriteLine(matchesExact.Count + " ComplexMax matches found.");
}
void DoAlt()
{
graph = new LGSPGraph(new AlternativesGraphModel());
actions = new AlternativesActions(graph);
procEnv = new LGSPGraphProcessingEnvironment(graph, actions);
// use graph rewrite sequence
procEnv.ApplyGraphRewriteSequence("createComplex");
Console.WriteLine(procEnv.PerformanceInfo.MatchesFound + " matches found.");
Console.WriteLine(procEnv.PerformanceInfo.RewritesPerformed + " rewrites performed.");
procEnv.PerformanceInfo.Reset();
// use old inexact interface
IMatches matches = actions.GetAction("Complex").Match(procEnv, 0, null);
Console.WriteLine(matches.Count + " Complex matches found.");
// use new 2.5 exact interface
IMatchesExact <Rule_ComplexMax.IMatch_ComplexMax> matchesExact = actions.ComplexMax.Match(procEnv, 0);
Console.WriteLine(matchesExact.Count + " ComplexMax matches found.");
}
