Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Tests/SinglePointCrossoverTest.cs @ 5757

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

Updated year of copyrights (#1406)

File size: 5.3 KB
RevLine 
[3742]1#region License Information
2/* HeuristicLab
[5445]3 * Copyright (C) 2002-2011 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[3742]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
[4068]22using HeuristicLab.Core;
[3742]23using HeuristicLab.Encodings.IntegerVectorEncoding;
[3032]24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
[3053]26namespace HeuristicLab.Encodings.IntegerVectorEncoding_33.Tests {
[3032]27
28
29  /// <summary>
30  ///This is a test class for SinglePointCrossoverTest and is intended
31  ///to contain all SinglePointCrossoverTest Unit Tests
32  ///</summary>
33  [TestClass()]
34  public class SinglePointCrossoverTest {
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()]
[3053]86    [DeploymentItem("HeuristicLab.Encodings.IntegerVectorEncoding-3.3.dll")]
[3032]87    public void SinglePointCrossoverCrossTest() {
88      SinglePointCrossover_Accessor target = new SinglePointCrossover_Accessor(new PrivateObject(typeof(SinglePointCrossover)));
[3059]89      ItemArray<IntegerVector> parents;
[3032]90      TestRandom random = new TestRandom();
91      bool exceptionFired;
92      // The following test checks if there is an exception when there are more than 2 parents
93      random.Reset();
[3059]94      parents = new ItemArray<IntegerVector>(new IntegerVector[] { new IntegerVector(5), new IntegerVector(6), new IntegerVector(4) });
[3032]95      exceptionFired = false;
96      try {
[3059]97        IntegerVector actual;
[3032]98        actual = target.Cross(random, parents);
99      }
100      catch (System.ArgumentException) {
101        exceptionFired = true;
102      }
103      Assert.IsTrue(exceptionFired);
104      // The following test checks if there is an exception when there are less than 2 parents
105      random.Reset();
[3059]106      parents = new ItemArray<IntegerVector>(new IntegerVector[] { new IntegerVector(4) });
[3032]107      exceptionFired = false;
108      try {
[3059]109        IntegerVector actual;
[3032]110        actual = target.Cross(random, parents);
[4068]111      }
112      catch (System.ArgumentException) {
[3032]113        exceptionFired = true;
114      }
115      Assert.IsTrue(exceptionFired);
116    }
117
118    /// <summary>
119    ///A test for Apply
120    ///</summary>
121    [TestMethod()]
122    public void SinglePointCrossoverApplyTest() {
123      TestRandom random = new TestRandom();
[3059]124      IntegerVector parent1, parent2, expected, actual;
[3032]125      bool exceptionFired;
126      // The following test is not based on published examples
127      random.Reset();
128      random.IntNumbers = new int[] { 3 };
[3059]129      parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1 });
130      parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
131      expected = new IntegerVector(new int[] { 2, 2, 3, 2, 8 });
[3032]132      actual = SinglePointCrossover.Apply(random, parent1, parent2);
[3061]133      Assert.IsTrue(Auxiliary.IntegerVectorIsEqualByPosition(actual, expected));
[3032]134      // The following test is not based on published examples
135      random.Reset();
136      random.IntNumbers = new int[] { 2 };
[3059]137      parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1, 9 }); // this parent is longer
138      parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
[3032]139      exceptionFired = false;
140      try {
141        actual = SinglePointCrossover.Apply(random, parent1, parent2);
[4068]142      }
143      catch (System.ArgumentException) {
[3032]144        exceptionFired = true;
145      }
146      Assert.IsTrue(exceptionFired);
147    }
148
149    /// <summary>
150    ///A test for SinglePointCrossover Constructor
151    ///</summary>
152    [TestMethod()]
153    public void SinglePointCrossoverConstructorTest() {
154      SinglePointCrossover target = new SinglePointCrossover();
155    }
156  }
157}
Note: See TracBrowser for help on using the repository browser.