Free cookie consent management tool by TermsFeed Policy Generator

source: branches/DataAnalysis SolutionEnsembles/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Tests/DiscreteCrossoverTest.cs @ 5991

Last change on this file since 5991 was 5445, checked in by swagner, 14 years ago

Updated year of copyrights (#1406)

File size: 4.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 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
22using HeuristicLab.Core;
23using HeuristicLab.Encodings.IntegerVectorEncoding;
24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
26namespace HeuristicLab.Encodings.IntegerVectorEncoding_33.Tests {
27
28
29  /// <summary>
30  ///This is a test class for DiscreteCrossoverTest and is intended
31  ///to contain all DiscreteCrossoverTest Unit Tests
32  ///</summary>
33  [TestClass()]
34  public class DiscreteCrossoverTest {
35
36
37    private TestContext testContextInstance;
38
39    /// <summary>
40    ///Gets or sets the test context which provides
41    ///information about and functionality for the current test run.
42    ///</summary>
43    public TestContext TestContext {
44      get {
45        return testContextInstance;
46      }
47      set {
48        testContextInstance = value;
49      }
50    }
51
52    #region Additional test attributes
53    //
54    //You can use the following additional attributes as you write your tests:
55    //
56    //Use ClassInitialize to run code before running the first test in the class
57    //[ClassInitialize()]
58    //public static void MyClassInitialize(TestContext testContext)
59    //{
60    //}
61    //
62    //Use ClassCleanup to run code after all tests in a class have run
63    //[ClassCleanup()]
64    //public static void MyClassCleanup()
65    //{
66    //}
67    //
68    //Use TestInitialize to run code before running each test
69    //[TestInitialize()]
70    //public void MyTestInitialize()
71    //{
72    //}
73    //
74    //Use TestCleanup to run code after each test has run
75    //[TestCleanup()]
76    //public void MyTestCleanup()
77    //{
78    //}
79    //
80    #endregion
81
82    /// <summary>
83    ///A test for Cross
84    ///</summary>
85    [TestMethod()]
86    [DeploymentItem("HeuristicLab.Encodings.IntegerVectorEncoding-3.3.dll")]
87    public void DiscreteCrossoverCrossTest() {
88      DiscreteCrossover_Accessor target = new DiscreteCrossover_Accessor(new PrivateObject(typeof(DiscreteCrossover)));
89      ItemArray<IntegerVector> parents;
90      TestRandom random = new TestRandom();
91      bool exceptionFired;
92      // The following test checks if there is an exception when there are less than 2 parents
93      random.Reset();
94      parents = new ItemArray<IntegerVector>(new IntegerVector[] { new IntegerVector(4) });
95      exceptionFired = false;
96      try {
97        IntegerVector actual;
98        actual = target.Cross(random, parents);
99      }
100      catch (System.ArgumentException) {
101        exceptionFired = true;
102      }
103      Assert.IsTrue(exceptionFired);
104    }
105
106    /// <summary>
107    ///A test for Apply
108    ///</summary>
109    [TestMethod()]
110    public void DiscreteCrossoverApplyTest() {
111      TestRandom random = new TestRandom();
112      IntegerVector parent1, parent2, expected, actual;
113      bool exceptionFired;
114      // The following test is not based on published examples
115      random.Reset();
116      random.DoubleNumbers = new double[] { 0, 0, 0.9, 0, 0.9 };
117      parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1 });
118      parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
119      expected = new IntegerVector(new int[] { 2, 2, 3, 5, 8 });
120      actual = DiscreteCrossover.Apply(random, parent1, parent2);
121      Assert.IsTrue(Auxiliary.IntegerVectorIsEqualByPosition(actual, expected));
122
123      // The following test is not based on published examples
124      random.Reset();
125      random.DoubleNumbers = new double[] { 0, 0, 0.9, 0, 0.9 };
126      parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1, 9 }); // this parent is longer
127      parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
128      exceptionFired = false;
129      try {
130        actual = DiscreteCrossover.Apply(random, parent1, parent2);
131      }
132      catch (System.ArgumentException) {
133        exceptionFired = true;
134      }
135      Assert.IsTrue(exceptionFired);
136    }
137
138    /// <summary>
139    ///A test for DiscreteCrossover Constructor
140    ///</summary>
141    [TestMethod()]
142    public void DiscreteCrossoverConstructorTest() {
143      DiscreteCrossover target = new DiscreteCrossover();
144    }
145  }
146}
Note: See TracBrowser for help on using the repository browser.