Changeset 10387 for branches/HeuristicLab.Problems.GPDL/CodeGenerator/RandomSearchCodeGen.cs

Timestamp:

01/22/14 21:05:46 (10 years ago)

Author:

gkronber

Message:

#2025 reintegrated initialization of terminal values into the random search solver.

File:

• branches/HeuristicLab.Problems.GPDL/CodeGenerator/RandomSearchCodeGen.cs (modified) (4 diffs)

branches/HeuristicLab.Problems.GPDL/CodeGenerator/RandomSearchCodeGen.cs

@@ -33 +33 @@
       // terminals
       if(Grammar.subtreeCount[state] == 0) {
-        t = Grammar.CreateTerminalNode(state, random, problem);
+        t = CreateTerminalNode(state, random, problem);
       } else {
         // if the symbol has alternatives then we must choose one randomly (only one sub-tree in this case)
@@ -52 +52 @@
       curDepth -=1;
       return t;
+    }
+
+    public static Tree CreateTerminalNode(int state, Random random, ?IDENT?Problem problem) {
+      switch(state) {
+        ?CREATETERMINALNODECODE?
+        default: { throw new ArgumentException(""Unknown state index"" + state); }
+      }
     }
 
@@ -144 +151 @@
 }";
 
-    public void Generate(IGrammar grammar, bool maximization, SourceBuilder problemSourceCode) {
+    public void Generate(IGrammar grammar, IEnumerable<TerminalNode> terminals, bool maximization, SourceBuilder problemSourceCode) {
       var solverSourceCode = new SourceBuilder();
       solverSourceCode.Append(solverTemplate)
         .Replace("?MAXIMIZATION?", maximization.ToString().ToLowerInvariant())
         .Replace("?SAMPLEALTERNATIVECODE?", GenerateSampleAlternativeSource(grammar))
+        .Replace("?CREATETERMINALNODECODE?", GenerateCreateTerminalCode(grammar, terminals))
       ;
 
@@ -188 +196 @@
       return sb.ToString();
     }
+    private string GenerateCreateTerminalCode(IGrammar grammar, IEnumerable<TerminalNode> terminals) {
+      Debug.Assert(grammar.Symbols.First().Equals(grammar.StartSymbol));
+      var sb = new SourceBuilder();
+      var allSymbols = grammar.Symbols.ToList();
+      foreach (var s in grammar.Symbols) {
+        if (grammar.IsTerminal(s)) {
+          sb.AppendFormat("case {0}: {{", allSymbols.IndexOf(s)).BeginBlock();
+          sb.AppendFormat("var t = new {0}Tree();", s.Name).AppendLine();
+          var terminal = terminals.Single(t => t.Ident == s.Name);
+          foreach (var constr in terminal.Constraints) {
+            if (constr.Type == ConstraintNodeType.Set) {
+              sb.Append("{").BeginBlock();
+              sb.AppendFormat("var elements = problem.GetAllowed{0}_{1}().ToArray();", terminal.Ident, constr.Ident).AppendLine();
+              sb.AppendFormat("t.{0} = elements[random.Next(elements.Length)]; ", constr.Ident).EndBlock();
+              sb.AppendLine("}");
+            } else {
+              sb.Append("{").BeginBlock();
+              sb.AppendFormat(" var max = problem.GetMax{0}_{1}();", terminal.Ident, constr.Ident).AppendLine();
+              sb.AppendFormat(" var min = problem.GetMin{0}_{1}();", terminal.Ident, constr.Ident).AppendLine();
+              sb.AppendFormat("t.{0} = random.NextDouble() * (max - min) + min;", constr.Ident).EndBlock();
+              sb.AppendLine("}");
+            }
+          }
+          sb.AppendLine("return t;").EndBlock();
+          sb.Append("}");
+        }
+      }
+      return sb.ToString();
+    }
     private void GenerateReturnStatement(IEnumerable<int> idxs, SourceBuilder sb) {
       if (idxs.Count() == 1) {