Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistenceSpeedUp/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.3/Tests/ArgumentDuplicaterTest.cs

Last change on this file was 5445, checked in by swagner, 14 years ago

Updated year of copyrights (#1406)

File size: 3.2 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.Encodings.SymbolicExpressionTreeEncoding.ArchitectureManipulators;
27using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Creators;
28using HeuristicLab.Random;
29using Microsoft.VisualStudio.TestTools.UnitTesting;
30using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Symbols;
31
32namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding_3._3.Tests {
33  [TestClass]
34  public class ArgumentDuplicaterTest {
35    private const int POPULATION_SIZE = 1000;
36    private const int MAX_TREE_SIZE = 100;
37    private const int MAX_TREE_HEIGHT = 10;
38    private TestContext testContextInstance;
39
40    /// <summary>
41    ///Gets or sets the test context which provides
42    ///information about and functionality for the current test run.
43    ///</summary>
44    public TestContext TestContext {
45      get {
46        return testContextInstance;
47      }
48      set {
49        testContextInstance = value;
50      }
51    }
52
53    [TestMethod()]
54    public void ArgumentDuplicaterDistributionsTest() {
55      var trees = new List<SymbolicExpressionTree>();
56      var grammar = Grammars.CreateArithmeticAndAdfGrammar();
57      var random = new MersenneTwister(31415);
58      for (int i = 0; i < POPULATION_SIZE; i++) {
59        SymbolicExpressionTree tree = null;
60        do {
61          tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_SIZE, MAX_TREE_HEIGHT, 3, 3);
62        } while(!HasAdfWithArguments(tree));
63        var success = ArgumentDuplicater.DuplicateArgument(random, tree, grammar, MAX_TREE_SIZE, MAX_TREE_HEIGHT, 3, 3);
64        Assert.IsTrue(success);
65        Util.IsValid(tree);
66        trees.Add(tree);
67      }
68      Console.WriteLine("ArgumentDuplicater: " + Environment.NewLine +
69        Util.GetSizeDistributionString(trees, 200, 5) + Environment.NewLine +
70        Util.GetFunctionDistributionString(trees) + Environment.NewLine +
71        Util.GetNumberOfSubTreesDistributionString(trees) + Environment.NewLine +
72        Util.GetTerminalDistributionString(trees) + Environment.NewLine
73        );
74    }
75
76    private bool HasAdfWithArguments(SymbolicExpressionTree tree) {
77      return tree.Root.SubTrees.Count == 2 &&
78        tree.Root.SubTrees[1].GetAllowedSymbols(0).Where(x => x is Argument).Count() == 1;
79    }
80  }
81}
Note: See TracBrowser for help on using the repository browser.