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