[3742] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16140] | 3 | * Copyright (C) 2002-2018 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] | 22 | using HeuristicLab.Core;
|
---|
[6891] | 23 | using HeuristicLab.Tests;
|
---|
[3032] | 24 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
| 25 |
|
---|
[9764] | 26 | namespace HeuristicLab.Encodings.IntegerVectorEncoding.Tests {
|
---|
[3032] | 27 | /// <summary>
|
---|
| 28 | ///This is a test class for DiscreteCrossoverTest and is intended
|
---|
| 29 | ///to contain all DiscreteCrossoverTest Unit Tests
|
---|
| 30 | ///</summary>
|
---|
| 31 | [TestClass()]
|
---|
| 32 | public class DiscreteCrossoverTest {
|
---|
| 33 | /// <summary>
|
---|
| 34 | ///A test for Apply
|
---|
| 35 | ///</summary>
|
---|
[9766] | 36 | [TestMethod]
|
---|
[9777] | 37 | [TestCategory("Encodings.IntegerVector")]
|
---|
| 38 | [TestProperty("Time", "short")]
|
---|
[3032] | 39 | public void DiscreteCrossoverApplyTest() {
|
---|
| 40 | TestRandom random = new TestRandom();
|
---|
[3059] | 41 | IntegerVector parent1, parent2, expected, actual;
|
---|
[3032] | 42 | bool exceptionFired;
|
---|
| 43 | // The following test is not based on published examples
|
---|
| 44 | random.Reset();
|
---|
[8023] | 45 | random.IntNumbers = new int[] { 0, 0, 1, 0, 1 };
|
---|
[3059] | 46 | parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1 });
|
---|
| 47 | parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
|
---|
| 48 | expected = new IntegerVector(new int[] { 2, 2, 3, 5, 8 });
|
---|
[8019] | 49 | actual = DiscreteCrossover.Apply(random, new ItemArray<IntegerVector>(new IntegerVector[] { parent1, parent2 }));
|
---|
[3061] | 50 | Assert.IsTrue(Auxiliary.IntegerVectorIsEqualByPosition(actual, expected));
|
---|
[3032] | 51 |
|
---|
| 52 | // The following test is not based on published examples
|
---|
| 53 | random.Reset();
|
---|
[8023] | 54 | random.IntNumbers = new int[] { 0, 0, 1, 0, 1 };
|
---|
[3059] | 55 | parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1, 9 }); // this parent is longer
|
---|
| 56 | parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
|
---|
[3032] | 57 | exceptionFired = false;
|
---|
| 58 | try {
|
---|
[8019] | 59 | actual = DiscreteCrossover.Apply(random, new ItemArray<IntegerVector>(new IntegerVector[] { parent1, parent2 }));
|
---|
[13235] | 60 | }
|
---|
| 61 | catch (System.ArgumentException) {
|
---|
[3032] | 62 | exceptionFired = true;
|
---|
| 63 | }
|
---|
| 64 | Assert.IsTrue(exceptionFired);
|
---|
| 65 | }
|
---|
| 66 | }
|
---|
| 67 | }
|
---|