Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
03/16/10 00:56:44 (15 years ago)
Author:
swagner
Message:

Renamed solution encoding plugins (#909)

Location:
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3
Files:
2 edited

Legend:

Unmodified
Added
Removed

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3

    • Property svn:ignore

      •  

        old new  
        22bin
        33obj
        4 HeuristicLabEncodingsPermutationPlugin.cs
         4HeuristicLabEncodingsPermutationEncodingPlugin.cs

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/EdgeRecombinationCrossoverTest.cs

    r2930 r3053  
    2222using HeuristicLab.Core;
    2323using Microsoft.VisualStudio.TestTools.UnitTesting;
    24 using HeuristicLab.Encodings.Permutation;
     24using HeuristicLab.Encodings.PermutationEncoding;
    2525
    26 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     26namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2727  /// <summary>
    2828  ///This is a test class for EdgeRecombinationCrossover and is intended
    … …  
    9292      bool exceptionFired = false;
    9393      try {
    94         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    95           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     94        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     95          new Permutation(4), new Permutation(4), new Permutation(4)}));
    9696      }
    9797      catch (System.InvalidOperationException) {
    … …  
    107107    public void EdgeRecombinationCrossoverApplyTest() {
    108108      TestRandom random = new TestRandom();
    109       Permutation.Permutation parent1, parent2, expected, actual;
     109      Permutation parent1, parent2, expected, actual;
    110110      // The following test is based on an example from Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg, pp. 54-55
    111111      random.Reset();
    112112      random.IntNumbers = new int[] { 0 };
    113113      random.DoubleNumbers = new double[] { 0.5, 0, 0, 0 };
    114       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
     114      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
    115115      Assert.IsTrue(parent1.Validate());
    116       parent2 = new Permutation.Permutation(new int[] { 8, 2, 6, 7, 1, 5, 4, 0, 3 });
     116      parent2 = new Permutation(new int[] { 8, 2, 6, 7, 1, 5, 4, 0, 3 });
    117117      Assert.IsTrue(parent2.Validate());
    118       expected = new Permutation.Permutation(new int[] { 0, 4, 5, 1, 7, 6, 2, 8, 3 });
     118      expected = new Permutation(new int[] { 0, 4, 5, 1, 7, 6, 2, 8, 3 });
    119119      Assert.IsTrue(expected.Validate());
    120120      actual = EdgeRecombinationCrossover.Apply(random, parent1, parent2);
    … …  
    126126      bool exceptionFired = false;
    127127      try {
    128         EdgeRecombinationCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     128        EdgeRecombinationCrossover.Apply(random, new Permutation(8), new Permutation(6));
    129129      }
    130130      catch (System.ArgumentException) {
Note: See TracChangeset for help on using the changeset viewer.