Changeset 11987 for trunk/sources/HeuristicLab.Tests/HeuristicLab.Algorithms.ParameterlessPopulationPyramid-3.3
- Timestamp:
- 02/12/15 15:39:28 (9 years ago)
- Location:
- trunk/sources/HeuristicLab.Tests/HeuristicLab.Algorithms.ParameterlessPopulationPyramid-3.3
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/sources/HeuristicLab.Tests/HeuristicLab.Algorithms.ParameterlessPopulationPyramid-3.3/LinkageTreeTest.cs
r11939 r11987 22 22 using System.Linq; 23 23 using HeuristicLab.Algorithms.ParameterlessPopulationPyramid; 24 using HeuristicLab.Encodings.BinaryVectorEncoding; 24 25 using HeuristicLab.Random; 25 26 using Microsoft.VisualStudio.TestTools.UnitTesting; … … 29 30 public class LinkageTreeTest { 30 31 private static int Length = 9; 31 private static bool[][] solutions = new bool[][]{32 new bool[] { true, true, false, false, false, false, false, false, false }, // 11000000033 new bool[] { false, false, true, true, false, false, false, false, false }, // 00110000034 new bool[] { false, false, false, false, true, true, false, false, false }, // 00001100035 new bool[] { false, false, false, false, false, false, true, true, true }, // 00000011136 new bool[] { true, true, true, true, false, false, false, false, false }, // 11110000037 new bool[] { true, true, true, true, true, true, true, true, true }, // 11111111132 private static BinaryVector[] solutions = { 33 new BinaryVector(new [] { true, true, false, false, false, false, false, false, false }), // 110000000 34 new BinaryVector(new [] { false, false, true, true, false, false, false, false, false }), // 001100000 35 new BinaryVector(new [] { false, false, false, false, true, true, false, false, false }), // 000011000 36 new BinaryVector(new [] { false, false, false, false, false, false, true, true, true }), // 000000111 37 new BinaryVector(new [] { true, true, true, true, false, false, false, false, false }), // 111100000 38 new BinaryVector(new [] { true, true, true, true, true, true, true, true, true }), // 111111111 38 39 }; 39 40 40 41 // These are the clusters that should be built using "solutions" and the seed 123 41 private static int[][] correctClusters = new int[][]{42 private static int[][] correctClusters = { 42 43 new int[] { 4, 5 }, 43 44 new int[] { 2, 3 }, -
trunk/sources/HeuristicLab.Tests/HeuristicLab.Algorithms.ParameterlessPopulationPyramid-3.3/ParameterlessPopulationPyramidTest.cs
r11983 r11987 22 22 using System; 23 23 using System.Threading; 24 using HeuristicLab.Algorithms.ParameterlessPopulationPyramid;25 24 using HeuristicLab.Common; 26 using HeuristicLab.Problems.Binary Vector;25 using HeuristicLab.Problems.Binary; 27 26 using Microsoft.VisualStudio.TestTools.UnitTesting; 28 27 … … 32 31 33 32 // Utility function that sets up and executes the run, then asserts the results 34 private PrivateObject DoRun(Binary VectorProblem problem, int maximumEvaluations, int seed, double bestQuality, int foundOn) {33 private PrivateObject DoRun(BinaryProblem problem, int maximumEvaluations, int seed, double bestQuality, int foundOn) { 35 34 var solver = new HeuristicLab.Algorithms.ParameterlessPopulationPyramid.ParameterlessPopulationPyramid(); 36 35 solver.Problem = problem; … … 41 40 try { 42 41 hidden.Invoke("Run", new CancellationToken()); 43 } 44 catch (OperationCanceledException) { 42 } catch (OperationCanceledException) { 45 43 // Ignore 46 44 }
Note: See TracChangeset
for help on using the changeset viewer.