Changeset 2930 for trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Tests/MaximalPreservativeCrossoverTest.cs

Timestamp:

03/04/10 15:15:44 (15 years ago)

Author:

abeham

Message:

fixed permutation tests due to namespace change #95
removed constructor tests as well

File:

• trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Tests/MaximalPreservativeCrossoverTest.cs (modified) (5 diffs)

trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Tests/MaximalPreservativeCrossoverTest.cs

@@ -22 +22 @@
 using HeuristicLab.Core;
 using Microsoft.VisualStudio.TestTools.UnitTesting;
+using HeuristicLab.Encodings.Permutation;
 
 namespace HeuristicLab.Encodings.Permutation_33.Tests {
@@ -91 +92 @@
       bool exceptionFired = false;
       try {
-        target.Cross(random, new ItemArray<Permutation>(new Permutation[] { 
-          new Permutation(4), new Permutation(4), new Permutation(4)}));
+        target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] { 
+          new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
       }
       catch (System.InvalidOperationException) {
@@ -106 +107 @@
     public void MaximalPreservativeCrossoverApplyTest() {
       TestRandom random = new TestRandom();
-      Permutation parent1, parent2, expected, actual;
+      Permutation.Permutation parent1, parent2, expected, actual;
       // The following test is based on an example from Larranaga, 1999. Genetic Algorithms for the Traveling Salesman Problem.
       random.Reset();
       random.IntNumbers = new int[] { 3, 2 };
-      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
+      parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
       Assert.IsTrue(parent1.Validate());
-      parent2 = new Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
+      parent2 = new Permutation.Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
       Assert.IsTrue(parent2.Validate());
-      expected = new Permutation(new int[] { 1, 0, 2, 3, 4, 5, 7, 6 });
+      expected = new Permutation.Permutation(new int[] { 1, 0, 2, 3, 4, 5, 7, 6 });
       Assert.IsTrue(expected.Validate());
       actual = MaximalPreservativeCrossover.Apply(random, parent1, parent2);
@@ -124 +125 @@
       bool exceptionFired = false;
       try {
-        MaximalPreservativeCrossover.Apply(random, new Permutation(8), new Permutation(6));
+        MaximalPreservativeCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
       }
       catch (System.ArgumentException) {
@@ -131 +132 @@
       Assert.IsTrue(exceptionFired);
     }
-
-    /// <summary>
-    ///A test for OrderCrossover Constructor
-    ///</summary>
-    [TestMethod()]
-    public void MaximalPreservativeCrossoverConstructorTest() {
-      MaximalPreservativeCrossover target = new MaximalPreservativeCrossover();
-    }
   }
 }