Changeset 5549 for branches/DataAnalysis Refactoring/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.4/Tests/AllArchitectureAlteringOperatorsTest.cs

Timestamp:

02/22/11 19:04:54 (14 years ago)

Author:

gkronber

Message:

#1418 unified size/height vs. length/depth terminology and adapted unit tests for symbolic expression tree encoding version 3.4

File:

• branches/DataAnalysis Refactoring/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.4/Tests/AllArchitectureAlteringOperatorsTest.cs (modified) (5 diffs)

branches/DataAnalysis Refactoring/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.4/Tests/AllArchitectureAlteringOperatorsTest.cs

@@ -25 +25 @@
 using HeuristicLab.Data;
 using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
-using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.ArchitectureManipulators;
-using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Creators;
-using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Crossovers;
 using HeuristicLab.Random;
 using Microsoft.VisualStudio.TestTools.UnitTesting;
 
-namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding_3._3.Tests {
+namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding_3._4.Tests {
   [TestClass]
   public class AllArchitectureAlteringOperatorsTest {
     private const int POPULATION_SIZE = 1000;
     private const int N_ITERATIONS = 20;
-    private const int MAX_TREE_SIZE = 100;
-    private const int MAX_TREE_HEIGHT = 10;
+    private const int MAX_TREE_LENGTH = 100;
+    private const int MAX_TREE_DEPTH = 10;
     private TestContext testContextInstance;
 
@@ -55 +52 @@
     [TestMethod()]
     public void AllArchitectureAlteringOperatorsDistributionTest() {
-      var trees = new List<SymbolicExpressionTree>();
-      var newTrees = new List<SymbolicExpressionTree>();
+      var trees = new List<ISymbolicExpressionTree>();
+      var newTrees = new List<ISymbolicExpressionTree>();
       var grammar = Grammars.CreateArithmeticAndAdfGrammar();
       var random = new MersenneTwister(31415);
-      IntValue maxTreeSize = new IntValue(MAX_TREE_SIZE);
-      IntValue maxTreeHeigth = new IntValue(MAX_TREE_HEIGHT);
+      IntValue maxTreeSize = new IntValue(MAX_TREE_LENGTH);
+      IntValue maxTreeHeigth = new IntValue(MAX_TREE_DEPTH);
       IntValue maxDefuns = new IntValue(3);
       IntValue maxArgs = new IntValue(3);
       for (int i = 0; i < POPULATION_SIZE; i++) {
-        var tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_SIZE, MAX_TREE_HEIGHT, 3, 3);
+        var tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3);
         Util.IsValid(tree);
         trees.Add(tree);
@@ -70 +67 @@
       Stopwatch stopwatch = new Stopwatch();
       stopwatch.Start();
-      var combinedAAOperator = new MultiSymbolicExpressionTreeArchitectureManipulator();
       int failedEvents = 0;
       for (int g = 0; g < N_ITERATIONS; g++) {
@@ -76 +72 @@
           if (random.NextDouble() < 0.5) {
             // manipulate
-            var selectedTree = (SymbolicExpressionTree)trees.SelectRandom(random).Clone();
-            var op = combinedAAOperator.Operators.SelectRandom(random);
+            var selectedTree = (ISymbolicExpressionTree)trees.SelectRandom(random).Clone();
             bool success = false;
-            op.ModifyArchitecture(random, selectedTree, grammar, maxTreeSize, maxTreeHeigth, maxDefuns, maxArgs, out success);
-            if (!success) failedEvents++; // architecture manipulation might fail
+            switch (random.Next(6)) {
+              case 0: success = ArgumentCreater.CreateNewArgument(random, selectedTree, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3); break;
+              case 1: success = ArgumentDeleter.DeleteArgument(random, selectedTree, 3, 3); break;
+              case 2: success = ArgumentDuplicater.DuplicateArgument(random, selectedTree, 3, 3); break;
+              case 3: success = SubroutineCreater.CreateSubroutine(random, selectedTree, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3); break;
+              case 4: success = SubroutineDuplicater.DuplicateSubroutine(random, selectedTree, 3, 3); break;
+              case 5: success = SubroutineDeleter.DeleteSubroutine(random, selectedTree, 3, 3); break;
+            }
+            if (!success) failedEvents++;
             Util.IsValid(selectedTree);
             newTrees.Add(selectedTree);
@@ -90 +92 @@
               par0 = (SymbolicExpressionTree)trees.SelectRandom(random).Clone();
               par1 = (SymbolicExpressionTree)trees.SelectRandom(random).Clone();
-            } while (par0.Size > MAX_TREE_SIZE || par1.Size > MAX_TREE_SIZE);
-            bool success;
-            newTrees.Add(SubtreeCrossover.Cross(random, par0, par1, 0.9, MAX_TREE_SIZE, MAX_TREE_HEIGHT, out success));
-            Assert.IsTrue(success); // crossover must succeed
+            } while (par0.Length > MAX_TREE_LENGTH || par1.Length > MAX_TREE_LENGTH);
+            newTrees.Add(SubtreeCrossover.Cross(random, par0, par1, 0.9, MAX_TREE_LENGTH, MAX_TREE_DEPTH));
           }
         }