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 System;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Tests;
|
---|
25 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Encodings.BinaryVectorEncoding.Tests {
|
---|
28 | /// <summary>
|
---|
29 | ///This is a test class for SinglePointCrossoverTest and is intended
|
---|
30 | ///to contain all SinglePointCrossoverTest Unit Tests
|
---|
31 | ///</summary>
|
---|
32 | [TestClass()]
|
---|
33 | public class SinglePointCrossoverTest {
|
---|
34 | /// <summary>
|
---|
35 | ///A test for Cross
|
---|
36 | ///</summary>
|
---|
37 | [TestMethod]
|
---|
38 | [TestCategory("Encodings.BinaryVector")]
|
---|
39 | [TestProperty("Time", "short")]
|
---|
40 | public void SinglePointCrossoverCrossTest() {
|
---|
41 | SinglePointCrossover_Accessor target = new SinglePointCrossover_Accessor(new PrivateObject(typeof(SinglePointCrossover)));
|
---|
42 | ItemArray<BinaryVector> parents;
|
---|
43 | TestRandom random = new TestRandom();
|
---|
44 | bool exceptionFired;
|
---|
45 | // The following test checks if there is an exception when there are more than 2 parents
|
---|
46 | random.Reset();
|
---|
47 | parents = new ItemArray<BinaryVector>(new BinaryVector[] { new BinaryVector(5), new BinaryVector(6), new BinaryVector(4) });
|
---|
48 | exceptionFired = false;
|
---|
49 | try {
|
---|
50 | BinaryVector actual;
|
---|
51 | actual = target.Cross(random, parents);
|
---|
52 | } catch (ArgumentException) {
|
---|
53 | exceptionFired = true;
|
---|
54 | }
|
---|
55 | Assert.IsTrue(exceptionFired);
|
---|
56 | // The following test checks if there is an exception when there are less than 2 parents
|
---|
57 | random.Reset();
|
---|
58 | parents = new ItemArray<BinaryVector>(new BinaryVector[] { new BinaryVector(4) });
|
---|
59 | exceptionFired = false;
|
---|
60 | try {
|
---|
61 | BinaryVector actual;
|
---|
62 | actual = target.Cross(random, parents);
|
---|
63 | } catch (ArgumentException) {
|
---|
64 | exceptionFired = true;
|
---|
65 | }
|
---|
66 | Assert.IsTrue(exceptionFired);
|
---|
67 | }
|
---|
68 | }
|
---|
69 | }
|
---|