1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
26 | using HeuristicLab.Random;
|
---|
27 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Tests {
|
---|
30 | [TestClass]
|
---|
31 | public class ArgumentDuplicaterTest {
|
---|
32 | private const int POPULATION_SIZE = 1000;
|
---|
33 | private const int MAX_TREE_LENGTH = 100;
|
---|
34 | private const int MAX_TREE_DEPTH = 10;
|
---|
35 |
|
---|
36 | [TestMethod]
|
---|
37 | [TestCategory("Encodings.SymbolicExpressionTree")]
|
---|
38 | [TestProperty("Time", "long")]
|
---|
39 | public void ArgumentDuplicaterDistributionsTest() {
|
---|
40 | var trees = new List<ISymbolicExpressionTree>();
|
---|
41 | var grammar = Grammars.CreateArithmeticAndAdfGrammar();
|
---|
42 | var random = new MersenneTwister(31415);
|
---|
43 | for (int i = 0; i < POPULATION_SIZE; i++) {
|
---|
44 | ISymbolicExpressionTree tree = null;
|
---|
45 | do {
|
---|
46 | tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH);
|
---|
47 | SubroutineCreater.CreateSubroutine(random, tree, MAX_TREE_LENGTH, MAX_TREE_DEPTH, 3, 3);
|
---|
48 | } while (!HasAdfWithArguments(tree));
|
---|
49 | var success = ArgumentDuplicater.DuplicateArgument(random, tree, 3, 3);
|
---|
50 | Assert.IsTrue(success);
|
---|
51 | Util.IsValid(tree);
|
---|
52 | trees.Add(tree);
|
---|
53 | }
|
---|
54 | Console.WriteLine("ArgumentDuplicater: " + Environment.NewLine +
|
---|
55 | Util.GetSizeDistributionString(trees, 200, 5) + Environment.NewLine +
|
---|
56 | Util.GetFunctionDistributionString(trees) + Environment.NewLine +
|
---|
57 | Util.GetNumberOfSubtreesDistributionString(trees) + Environment.NewLine +
|
---|
58 | Util.GetTerminalDistributionString(trees) + Environment.NewLine
|
---|
59 | );
|
---|
60 | }
|
---|
61 |
|
---|
62 | private bool HasAdfWithArguments(ISymbolicExpressionTree tree) {
|
---|
63 | if (tree.Root.Subtrees.Count() != 2) return false;
|
---|
64 | var firstAdf = tree.Root.GetSubtree(1);
|
---|
65 | return firstAdf.Grammar.GetAllowedChildSymbols(firstAdf.Symbol, 0).Where(x => x is Argument).Count() == 1;
|
---|
66 | }
|
---|
67 | }
|
---|
68 | }
|
---|