Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding-3.4/ArgumentCreaterTest.cs @ 9770

Last change on this file since 9770 was 9770, checked in by mkommend, 11 years ago

#2088: Removed useless brackets in the TestMethod attribute and added test categories and properties for SymExpTreeEncoding unit test.

File size: 3.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2013 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.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.Random;
27using Microsoft.VisualStudio.TestTools.UnitTesting;
28
29namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.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    [TestMethod]
38    [TestCategory("Encodings.SymbolicExpressionTree")]
39    [TestProperty("Time", "long")]
40    public void ArgumentCreaterDistributionsTest() {
41      var trees = new List<ISymbolicExpressionTree>();
42      var grammar = Grammars.CreateArithmeticAndAdfGrammar();
43      var random = new MersenneTwister(31415);
44      int failedOps = 0;
45      for (int i = 0; i < POPULATION_SIZE; i++) {
46        ISymbolicExpressionTree tree;
47        do {
48          tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH);
49          SubroutineCreater.CreateSubroutine(random, tree, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3);
50        } while (!TreeHasAdfWithParameter(tree, 3));
51        var success = ArgumentCreater.CreateNewArgument(random, tree, 60000, 100, 3, 3);
52        if (!success) failedOps++;
53        Util.IsValid(tree);
54        trees.Add(tree);
55      }
56      // difficult to make sure that create argument operations succeed because trees are macro-expanded can potentially become very big
57      // => just test if only a small proportion fails
58      Assert.IsTrue(failedOps < POPULATION_SIZE * 0.05); // only 5% may fail
59      Console.WriteLine("ArgumentCreator: " + Environment.NewLine +
60        "Failed operations: " + failedOps * 100.0 / POPULATION_SIZE + " %" + Environment.NewLine +
61        Util.GetSizeDistributionString(trees, 200, 20) + Environment.NewLine +
62        Util.GetFunctionDistributionString(trees) + Environment.NewLine +
63        Util.GetNumberOfSubtreesDistributionString(trees) + Environment.NewLine +
64        Util.GetTerminalDistributionString(trees) + Environment.NewLine
65        );
66    }
67
68    private bool TreeHasAdfWithParameter(ISymbolicExpressionTree tree, int maxParameters) {
69      if (tree.Root.Subtrees.Count() != 2) return false;
70      var firstAdf = tree.Root.GetSubtree(1);
71      return firstAdf.Grammar.GetAllowedChildSymbols(firstAdf.Symbol, 0).Where(x => x is Argument).Count() < maxParameters;
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.