[3360] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[9539] | 3 | * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3360] | 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 |
|
---|
| 22 | using System;
|
---|
[5686] | 23 | using System.Collections.Generic;
|
---|
[5549] | 24 | using System.Linq;
|
---|
[3360] | 25 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
[4068] | 26 | using HeuristicLab.Random;
|
---|
| 27 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
[3360] | 28 |
|
---|
[7915] | 29 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding_34.Tests {
|
---|
[3360] | 30 | [TestClass]
|
---|
| 31 | public class SubroutineDuplicaterTest {
|
---|
| 32 | private const int POPULATION_SIZE = 1000;
|
---|
[5549] | 33 | private const int MAX_TREE_LENGTH = 100;
|
---|
| 34 | private const int MAX_TREE_DEPTH = 10;
|
---|
[3360] | 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 SubroutineDuplicaterDistributionsTest() {
|
---|
[5549] | 52 | var trees = new List<ISymbolicExpressionTree>();
|
---|
[3360] | 53 | var grammar = Grammars.CreateArithmeticAndAdfGrammar();
|
---|
| 54 | var random = new MersenneTwister();
|
---|
| 55 | for (int i = 0; i < POPULATION_SIZE; i++) {
|
---|
[5549] | 56 | ISymbolicExpressionTree tree = null;
|
---|
[5367] | 57 | do {
|
---|
[5686] | 58 | tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH);
|
---|
| 59 | for (int j = random.Next(3); j < 3; j++)
|
---|
| 60 | SubroutineCreater.CreateSubroutine(random, tree, 100, 10, 3, 3);
|
---|
[5367] | 61 | } while (!HasOneAdf(tree));
|
---|
[5549] | 62 | var success = SubroutineDuplicater.DuplicateSubroutine(random, tree, 3, 3);
|
---|
[5367] | 63 | Assert.IsTrue(success);
|
---|
[3360] | 64 | Util.IsValid(tree);
|
---|
| 65 | trees.Add(tree);
|
---|
| 66 | }
|
---|
[5367] | 67 | Console.WriteLine("SubroutineDuplicater: " + Environment.NewLine +
|
---|
[3360] | 68 | Util.GetSizeDistributionString(trees, 105, 5) + Environment.NewLine +
|
---|
| 69 | Util.GetFunctionDistributionString(trees) + Environment.NewLine +
|
---|
[5733] | 70 | Util.GetNumberOfSubtreesDistributionString(trees) + Environment.NewLine +
|
---|
[3360] | 71 | Util.GetTerminalDistributionString(trees) + Environment.NewLine
|
---|
| 72 | );
|
---|
| 73 | }
|
---|
[5367] | 74 |
|
---|
[5549] | 75 | private bool HasOneAdf(ISymbolicExpressionTree tree) {
|
---|
[5733] | 76 | return tree.Root.Subtrees.Count() == 2;
|
---|
[5367] | 77 | }
|
---|
[3360] | 78 | }
|
---|
| 79 | }
|
---|