Free cookie consent management tool by TermsFeed Policy Generator

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

Last change on this file since 4065 was 3742, checked in by gkronber, 14 years ago

Fixed GPL license headers and deleted files which are not referenced by projects. #893

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