Changeset 1787 for trunk/sources/HeuristicLab.GP.StructureIdentification

Timestamp:

05/13/09 15:45:32 (16 years ago)

Author:

gkronber

Message:

simplified code of BakedTreeEvaluator: removed constant expression folding and special cases for DIV and SUB with only one operand. #615 (Evaluation of HL3 function trees should be equivalent to evaluation in HL2)

File:

• trunk/sources/HeuristicLab.GP.StructureIdentification/3.3/BakedTreeEvaluator.cs (modified) (6 diffs)

trunk/sources/HeuristicLab.GP.StructureIdentification/3.3/BakedTreeEvaluator.cs

@@ -45 +45 @@
       public byte arity;
       public byte symbol;
-      public ushort exprLength;
       public IFunction function;
     }
@@ -69 +68 @@
         codeArr[i++] = TranslateToInstr(f);
       }
-      exprIndex = 0;
-      ushort exprLength;
-      bool constExpr;
-      PatchExpressionLengthsAndConstants(0, out constExpr, out exprLength);
-    }
-
-    ushort exprIndex;
-    private void PatchExpressionLengthsAndConstants(ushort index, out bool constExpr, out ushort exprLength) {
-      exprLength = 1;
-      if (codeArr[index].arity == 0) {
-        // when no children then it's a constant expression only if the terminal is a constant
-        constExpr = codeArr[index].symbol == EvaluatorSymbolTable.CONSTANT;
-      } else {
-        constExpr = true; // when there are children it's a constant expression if all children are constant;
-      }
-      for (int i = 0; i < codeArr[index].arity; i++) {
-        exprIndex++;
-        ushort branchLength;
-        bool branchConstExpr;
-        PatchExpressionLengthsAndConstants(exprIndex, out branchConstExpr, out branchLength);
-        exprLength += branchLength;
-        constExpr &= branchConstExpr;
-      }
-
-      if (constExpr) {
-        PC = index;
-        codeArr[index].d_arg0 = EvaluateBakedCode();
-        codeArr[index].symbol = EvaluatorSymbolTable.CONSTANT;
-      }
-      codeArr[index].exprLength = exprLength;
     }
 
@@ -111 +80 @@
             instr.d_arg0 = f.data[1]; // weight
             instr.i_arg1 = (short)f.data[2]; // sample-offset
-            instr.exprLength = 1;
             break;
           }
         case EvaluatorSymbolTable.CONSTANT: {
             instr.d_arg0 = f.data[0]; // value
-            instr.exprLength = 1;
             break;
           }
         case EvaluatorSymbolTable.UNKNOWN: {
             instr.function = f.functionType;
-            instr.exprLength = 1;
             break;
           }
@@ -145 +111 @@
     // skips a whole branch
     private void SkipBakedCode() {
-      PC += codeArr[PC].exprLength;
+      int i = 1;
+      while (i > 0) {
+        i += codeArr[PC++].arity;
+        i--;
+      }
     }
 
@@ -157 +127 @@
           }
         case EvaluatorSymbolTable.CONSTANT: {
-            PC += currInstr.exprLength - 1;
             return currInstr.d_arg0;
           }
@@ -185 +154 @@
           }
         case EvaluatorSymbolTable.SUBTRACTION: {
-            if (currInstr.arity == 1) {
-              return -EvaluateBakedCode();
-            } else {
-              double result = EvaluateBakedCode();
-              for (int i = 1; i < currInstr.arity; i++) {
-                result -= EvaluateBakedCode();
-              }
-              return result;
-            }
+            double result = EvaluateBakedCode();
+            for (int i = 1; i < currInstr.arity; i++) {
+              result -= EvaluateBakedCode();
+            }
+            return result;
           }
         case EvaluatorSymbolTable.DIVISION: {
             double result;
-            if (currInstr.arity == 1) {
-              result = 1.0 / EvaluateBakedCode();
-            } else {
-              result = EvaluateBakedCode();
-              for (int i = 1; i < currInstr.arity; i++) {
-                result /= EvaluateBakedCode();
-              }
+            result = EvaluateBakedCode();
+            for (int i = 1; i < currInstr.arity; i++) {
+              result /= EvaluateBakedCode();
             }
             if (double.IsInfinity(result)) return 0.0;