Free cookie consent management tool by TermsFeed Policy Generator

source: branches/DataAnalysis Refactoring/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.4/Tests/ArgumentCreaterTest.cs @ 5549

Last change on this file since 5549 was 5549, checked in by gkronber, 13 years ago

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

File size: 3.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System;
23using System.Linq;
24using System.Collections.Generic;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.Random;
27using Microsoft.VisualStudio.TestTools.UnitTesting;
28
29namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding_3._4.Tests {
30  [TestClass]
31  public class ArgumentCreaterTest {
32    private const int POPULATION_SIZE = 1000;
33    private const int MAX_TREE_LENGTH = 100;
34    private const int MAX_TREE_DEPTH = 10;
35    private TestContext testContextInstance;
36
37    /// <summary>
38    ///Gets or sets the test context which provides
39    ///information about and functionality for the current test run.
40    ///</summary>
41    public TestContext TestContext {
42      get {
43        return testContextInstance;
44      }
45      set {
46        testContextInstance = value;
47      }
48    }
49
50    [TestMethod()]
51    public void ArgumentCreaterDistributionsTest() {
52      var trees = new List<ISymbolicExpressionTree>();
53      var grammar = Grammars.CreateArithmeticAndAdfGrammar();
54      var random = new MersenneTwister(31415);
55      int failedOps = 0;
56      for (int i = 0; i < POPULATION_SIZE; i++) {
57        ISymbolicExpressionTree tree;
58        do {
59          tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3);
60        } while (!TreeHasAdfWithParameter(tree, 3));
61        var success = ArgumentCreater.CreateNewArgument(random, tree, 60000, 100, 3, 3);
62        if (!success) failedOps++;
63        Util.IsValid(tree);
64        trees.Add(tree);
65      }
66      // difficult to make sure that create argument operations succeed because trees are macro-expanded can potentially become very big
67      // => just test if only a small proportion fails
68      Assert.IsTrue(failedOps < POPULATION_SIZE * 0.01 ); // only 1% may fail
69      Console.WriteLine("ArgumentCreator: " + Environment.NewLine +
70        "Failed operations: " + failedOps * 100.0 / POPULATION_SIZE + " %" + Environment.NewLine +
71        Util.GetSizeDistributionString(trees, 200, 20) + Environment.NewLine +
72        Util.GetFunctionDistributionString(trees) + Environment.NewLine +
73        Util.GetNumberOfSubTreesDistributionString(trees) + Environment.NewLine +
74        Util.GetTerminalDistributionString(trees) + Environment.NewLine
75        );
76    }
77
78    private bool TreeHasAdfWithParameter(ISymbolicExpressionTree tree, int maxParameters) {
79      if(tree.Root.SubTrees.Count() != 2 ) return false;
80      var firstAdf = tree.Root.GetSubTree(1);
81      return firstAdf.Grammar.GetAllowedSymbols(firstAdf.Symbol, 0).Where(x => x is Argument).Count() < maxParameters;
82    }
83  }
84}
Note: See TracBrowser for help on using the repository browser.