Changeset 10104 for branches/HeuristicLab.Analysis.AlgorithmBehavior/AlgorithmBehaviorUnitTests/PermutationCacheTest.cs

Timestamp:

11/04/13 10:18:18 (11 years ago)

Author:

ascheibe

Message:

#1886 fixed RealVectorEqualityComparer and added unit tests for caches

File:

• branches/HeuristicLab.Analysis.AlgorithmBehavior/AlgorithmBehaviorUnitTests/PermutationCacheTest.cs (modified) (1 diff)

branches/HeuristicLab.Analysis.AlgorithmBehavior/AlgorithmBehaviorUnitTests/PermutationCacheTest.cs

@@ -34 +34 @@
       PermutationEqualityComparer comp = new PermutationEqualityComparer();
       PermutationSolutionCache dict = new PermutationSolutionCache();
-      int realDuplicates = 0;
-      int noDuplicates = 0;
+      int nrOfPermutations = 200;
 
-      Permutation[] permutations = new Permutation[500];
-      for (int i = 0; i < permutations.Length; i += 2) {
+
+      for (int i = 0; i < nrOfPermutations; i++) {
         var p = new Permutation(PermutationTypes.RelativeUndirected, 21, rand);
-        permutations[i] = p;
-        permutations[i + 1] = p;
 
+        //should be added
         PermutationSolutionInformation pi = new PermutationSolutionInformation();
-        pi.Generation = rand.Next(0, 100);
+        pi.Generation = 9;
         pi.ProducedBy = ProducedBy.Mutation;
+        dict.Add(p, pi);
 
+        //should be added
+        pi = new PermutationSolutionInformation();
+        pi.Generation = 10;
+        pi.ProducedBy = ProducedBy.Mutation;
+        dict.Add(p, pi);
+
+        //should be added
+        pi = new PermutationSolutionInformation();
+        pi.Generation = 10;
+        pi.ProducedBy = ProducedBy.Crossover;
+        dict.Add(p, pi);
+
+        //should not be added
+        pi = new PermutationSolutionInformation();
+        pi.Generation = 10;
+        pi.ProducedBy = ProducedBy.Mutation;
         dict.Add(p, pi);
       }
 
-      for (int i = 0; i < permutations.Length; i++) {
-        for (int j = i + 1; j < permutations.Length; j++) {
-          if (comp.Equals(permutations[i], permutations[j])) {
-            realDuplicates++;
-            break;
-          }
-        }
+      foreach (var value in dict.Values()) {
+        Assert.AreEqual(3, value.Count);
       }
 
-      for (int i = 0; i < dict.SolutionDictionary.Keys.Count; i++) {
-        for (int j = i + 1; j < dict.SolutionDictionary.Keys.Count; j++) {
-          if (comp.Equals(dict.SolutionDictionary.Keys.ElementAt(i), dict.SolutionDictionary.Keys.ElementAt(j))) {
-            noDuplicates++;
-            break;
-          }
-        }
+      foreach (var key in dict.Keys()) {
+        int cnt = dict.Keys().Count(x => comp.Equals(key, x));
+        Assert.AreEqual(1, cnt);
       }
-
-      Assert.AreNotEqual(0, realDuplicates);
-      Assert.AreEqual(0, noDuplicates);
-      Assert.AreEqual(250, dict.SolutionDictionary.Keys.Count);
     }
   }