Free cookie consent management tool by TermsFeed Policy Generator

source: branches/crossvalidation-2434/HeuristicLab.Tests/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding-3.4/FullTreeCreatorTest.cs @ 14648

Last change on this file since 14648 was 12869, checked in by gkronber, 9 years ago

#2434: merged r12835:12868 from trunk to cross-validation branch

File size: 3.4 KB
RevLine 
[6888]1#region License Information
2/* HeuristicLab
[12012]3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[6888]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.Collections.Generic;
24using System.Diagnostics;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.Random;
27using Microsoft.VisualStudio.TestTools.UnitTesting;
28
[9764]29namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Tests {
[6888]30  [TestClass]
31  public class FullTreeCreatorTest {
32    private const int POPULATION_SIZE = 10000;
[7915]33    private const int MAX_TREE_DEPTH = 9;
[7079]34    private const int MAX_TREE_LENGTH = 256;
[6888]35
[9770]36    [TestMethod]
37    [TestCategory("Encodings.SymbolicExpressionTree")]
38    [TestProperty("Time", "long")]
[6888]39    public void FullTreeCreatorDistributionsTest() {
40      var randomTrees = new List<ISymbolicExpressionTree>();
41      var grammar = Grammars.CreateSimpleArithmeticGrammar();
42      var random = new MersenneTwister(31415);
43      var stopwatch = new Stopwatch();
44      stopwatch.Start();
45      for (int i = 0; i != POPULATION_SIZE; i++) {
[7053]46        randomTrees.Add(FullTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH));
[6888]47      }
48      stopwatch.Stop();
[6949]49      double msPerRandomTreeCreation = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE;
50      int count = 0;
51      int depth = 0;
52      int maxLength = 0;
[6888]53      foreach (var tree in randomTrees) {
54        Util.IsValid(tree);
[12869]55        Assert.IsTrue(tree.Depth-1 == MAX_TREE_DEPTH);
[6949]56        if (maxLength < tree.Length)
57          maxLength = tree.Length;
58        count += tree.Length;
59        depth += tree.Depth;
[6888]60      }
61
62      Console.WriteLine("FullTreeCreator: " + Environment.NewLine +
[6949]63        msPerRandomTreeCreation + " ms per random tree (~" +
64        Math.Round(1000.0 / (msPerRandomTreeCreation)) + "random trees / s)" + Environment.NewLine +
65        Util.GetSizeDistributionString(randomTrees, maxLength, 5) + Environment.NewLine +
[6888]66        Util.GetFunctionDistributionString(randomTrees) + Environment.NewLine +
67        Util.GetNumberOfSubtreesDistributionString(randomTrees) + Environment.NewLine +
[6949]68        Util.GetTerminalDistributionString(randomTrees) + Environment.NewLine +
69        "Average tree depth: " + depth / POPULATION_SIZE + Environment.NewLine +
70        "Average tree length: " + count / POPULATION_SIZE + Environment.NewLine +
71        "Maximum tree length: " + maxLength + Environment.NewLine +
72        "Total nodes created: " + count + Environment.NewLine
[6888]73        );
[9322]74      //mkommend: commented due to performance issues on the builder
75      //Assert.IsTrue(Math.Round(1000.0 / (msPerRandomTreeCreation)) > 300); // must achieve more than 300 random trees / s
[6888]76    }
77  }
78}
Note: See TracBrowser for help on using the repository browser.