#region License Information /* HeuristicLab * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using System; using System.Collections.Generic; using System.Linq; using HeuristicLab.Random; using Microsoft.VisualStudio.TestTools.UnitTesting; namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Tests { [TestClass] public class SubroutineDeleterTest { private const int POPULATION_SIZE = 1000; private const int MAX_TREE_LENGTH = 100; private const int MAX_TREE_DEPTH = 10; [TestMethod] [TestCategory("Encodings.SymbolicExpressionTree")] [TestProperty("Time", "long")] public void SubroutineDeleterDistributionsTest() { var trees = new List(); var grammar = Grammars.CreateArithmeticAndAdfGrammar(); var random = new MersenneTwister(31415); for (int i = 0; i < POPULATION_SIZE; i++) { ISymbolicExpressionTree tree = null; do { tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH); SubroutineCreater.CreateSubroutine(random, tree, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3); SubroutineCreater.CreateSubroutine(random, tree, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3); } while (!HasAtLeastOneAdf(tree)); var success = SubroutineDeleter.DeleteSubroutine(random, tree, 3, 3); Assert.IsTrue(success); Util.IsValid(tree); trees.Add(tree); } Console.WriteLine("SubroutineDeleter: " + Environment.NewLine + Util.GetSizeDistributionString(trees, 105, 5) + Environment.NewLine + Util.GetFunctionDistributionString(trees) + Environment.NewLine + Util.GetNumberOfSubtreesDistributionString(trees) + Environment.NewLine + Util.GetTerminalDistributionString(trees) + Environment.NewLine ); } private bool HasAtLeastOneAdf(ISymbolicExpressionTree tree) { return tree.Root.Subtrees.Count() > 1; } } }