[3360] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16662] | 3 | * Copyright (C) 2002-2019 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;
|
---|
[4068] | 25 | using HeuristicLab.Random;
|
---|
| 26 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
[3360] | 27 |
|
---|
[9764] | 28 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Tests {
|
---|
[3360] | 29 | [TestClass]
|
---|
| 30 | public class SubroutineDeleterTest {
|
---|
| 31 | private const int POPULATION_SIZE = 1000;
|
---|
[5549] | 32 | private const int MAX_TREE_LENGTH = 100;
|
---|
| 33 | private const int MAX_TREE_DEPTH = 10;
|
---|
[3360] | 34 |
|
---|
[9770] | 35 | [TestMethod]
|
---|
| 36 | [TestCategory("Encodings.SymbolicExpressionTree")]
|
---|
| 37 | [TestProperty("Time", "long")]
|
---|
[3360] | 38 | public void SubroutineDeleterDistributionsTest() {
|
---|
[5549] | 39 | var trees = new List<ISymbolicExpressionTree>();
|
---|
[3360] | 40 | var grammar = Grammars.CreateArithmeticAndAdfGrammar();
|
---|
| 41 | var random = new MersenneTwister(31415);
|
---|
| 42 | for (int i = 0; i < POPULATION_SIZE; i++) {
|
---|
[5549] | 43 | ISymbolicExpressionTree tree = null;
|
---|
[5367] | 44 | do {
|
---|
[5686] | 45 | tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH);
|
---|
| 46 | SubroutineCreater.CreateSubroutine(random, tree, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3);
|
---|
| 47 | SubroutineCreater.CreateSubroutine(random, tree, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3);
|
---|
[5367] | 48 | } while (!HasAtLeastOneAdf(tree));
|
---|
[5549] | 49 | var success = SubroutineDeleter.DeleteSubroutine(random, tree, 3, 3);
|
---|
[5367] | 50 | Assert.IsTrue(success);
|
---|
[3360] | 51 | Util.IsValid(tree);
|
---|
| 52 | trees.Add(tree);
|
---|
| 53 | }
|
---|
[5367] | 54 | Console.WriteLine("SubroutineDeleter: " + Environment.NewLine +
|
---|
[3360] | 55 | Util.GetSizeDistributionString(trees, 105, 5) + Environment.NewLine +
|
---|
| 56 | Util.GetFunctionDistributionString(trees) + Environment.NewLine +
|
---|
[5733] | 57 | Util.GetNumberOfSubtreesDistributionString(trees) + Environment.NewLine +
|
---|
[3360] | 58 | Util.GetTerminalDistributionString(trees) + Environment.NewLine
|
---|
| 59 | );
|
---|
| 60 | }
|
---|
[5367] | 61 |
|
---|
[5549] | 62 | private bool HasAtLeastOneAdf(ISymbolicExpressionTree tree) {
|
---|
[5733] | 63 | return tree.Root.Subtrees.Count() > 1;
|
---|
[5367] | 64 | }
|
---|
[3360] | 65 | }
|
---|
| 66 | }
|
---|