#region License Information /* HeuristicLab * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using Microsoft.VisualStudio.TestTools.UnitTesting; using HeuristicLab.Encodings.RealVector; using HeuristicLab.Data; namespace HeuristicLab.Encodings.RealVector_33.Tests { /// ///This is a test class for PolynomialAllPositionManipulator and is intended ///to contain all PolynomialAllPositionManipulator Unit Tests /// [TestClass()] public class PolynomialAllPositionManipulatorTest { private TestContext testContextInstance; /// ///Gets or sets the test context which provides ///information about and functionality for the current test run. /// public TestContext TestContext { get { return testContextInstance; } set { testContextInstance = value; } } #region Additional test attributes // //You can use the following additional attributes as you write your tests: // //Use ClassInitialize to run code before running the first test in the class //[ClassInitialize()] //public static void MyClassInitialize(TestContext testContext) //{ //} // //Use ClassCleanup to run code after all tests in a class have run //[ClassCleanup()] //public static void MyClassCleanup() //{ //} // //Use TestInitialize to run code before running each test //[TestInitialize()] //public void MyTestInitialize() //{ //} // //Use TestCleanup to run code after each test has run //[TestCleanup()] //public void MyTestCleanup() //{ //} // #endregion /// ///A test for Apply /// [TestMethod()] public void PolynomialAllPositionManipulatorApplyTest() { TestRandom random = new TestRandom(); DoubleArrayData parent, expected; DoubleData contiguity, maxManipulation; bool exceptionFired; // The following test is not based on published examples random.Reset(); random.DoubleNumbers = new double[] { 0.2, 0.7, 0.8, 0.01, 0.1 }; parent = new DoubleArrayData(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1 }); expected = new DoubleArrayData(new double[] { 0.120213215256006, 0.336631954950876, 0.474551336679454, 0.322759240811056, -0.0182075293954083 }); contiguity = new DoubleData(0.8); maxManipulation = new DoubleData(0.2); PolynomialAllPositionManipulator.Apply(random, parent, contiguity, maxManipulation); Assert.IsTrue(Auxiliary.RealVectorIsAlmostEqualByPosition(expected, parent)); // The following test is not based on published examples exceptionFired = false; random.Reset(); random.DoubleNumbers = new double[] { 0.2, 0.7, 0.8, 0.01, 0.1 }; parent = new DoubleArrayData(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1 }); contiguity = new DoubleData(-1); //Contiguity value < 0 maxManipulation = new DoubleData(0.2); try { PolynomialAllPositionManipulator.Apply(random, parent, contiguity, maxManipulation); } catch (System.ArgumentException) { exceptionFired = true; } Assert.IsTrue(exceptionFired); } /// ///A test for PolynomialAllPositionManipulator Constructor /// [TestMethod()] public void PolynomialAllPositionManipulatorConstructorTest() { PolynomialAllPositionManipulator target = new PolynomialAllPositionManipulator(); } } }