Free cookie consent management tool by TermsFeed Policy Generator

source: branches/crossvalidation-2434/HeuristicLab.Tests/HeuristicLab.Encodings.IntegerVectorEncoding-3.3/SinglePointCrossoverTest.cs @ 13599

Last change on this file since 13599 was 12012, checked in by ascheibe, 10 years ago

#2212 merged r12008, r12009, r12010 back into trunk

File size: 4.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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.Tests;
24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
26namespace HeuristicLab.Encodings.IntegerVectorEncoding.Tests {
27  /// <summary>
28  ///This is a test class for SinglePointCrossoverTest and is intended
29  ///to contain all SinglePointCrossoverTest Unit Tests
30  ///</summary>
31  [TestClass()]
32  public class SinglePointCrossoverTest {
33    /// <summary>
34    ///A test for Cross
35    ///</summary>
36    [TestMethod]
37    [TestCategory("Encodings.IntegerVector")]
38    [TestProperty("Time", "short")]
39    public void SinglePointCrossoverCrossTest() {
40      SinglePointCrossover_Accessor target = new SinglePointCrossover_Accessor(new PrivateObject(typeof(SinglePointCrossover)));
41      ItemArray<IntegerVector> parents;
42      TestRandom random = new TestRandom();
43      bool exceptionFired;
44      // The following test checks if there is an exception when there are more than 2 parents
45      random.Reset();
46      parents = new ItemArray<IntegerVector>(new IntegerVector[] { new IntegerVector(5), new IntegerVector(6), new IntegerVector(4) });
47      exceptionFired = false;
48      try {
49        IntegerVector actual;
50        actual = target.Cross(random, parents);
51      } catch (System.ArgumentException) {
52        exceptionFired = true;
53      }
54      Assert.IsTrue(exceptionFired);
55      // The following test checks if there is an exception when there are less than 2 parents
56      random.Reset();
57      parents = new ItemArray<IntegerVector>(new IntegerVector[] { new IntegerVector(4) });
58      exceptionFired = false;
59      try {
60        IntegerVector actual;
61        actual = target.Cross(random, parents);
62      } catch (System.ArgumentException) {
63        exceptionFired = true;
64      }
65      Assert.IsTrue(exceptionFired);
66    }
67
68    /// <summary>
69    ///A test for Apply
70    ///</summary>
71    [TestMethod]
72    [TestCategory("Encodings.IntegerVector")]
73    [TestProperty("Time", "short")]
74    public void SinglePointCrossoverApplyTest() {
75      TestRandom random = new TestRandom();
76      IntegerVector parent1, parent2, expected, actual;
77      bool exceptionFired;
78      // The following test is not based on published examples
79      random.Reset();
80      random.IntNumbers = new int[] { 3 };
81      parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1 });
82      parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
83      expected = new IntegerVector(new int[] { 2, 2, 3, 2, 8 });
84      actual = SinglePointCrossover.Apply(random, parent1, parent2);
85      Assert.IsTrue(Auxiliary.IntegerVectorIsEqualByPosition(actual, expected));
86      // The following test is not based on published examples
87      random.Reset();
88      random.IntNumbers = new int[] { 2 };
89      parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1, 9 }); // this parent is longer
90      parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
91      exceptionFired = false;
92      try {
93        actual = SinglePointCrossover.Apply(random, parent1, parent2);
94      } catch (System.ArgumentException) {
95        exceptionFired = true;
96      }
97      Assert.IsTrue(exceptionFired);
98    }
99  }
100}
Note: See TracBrowser for help on using the repository browser.