Changeset 13583 for branches/PerformanceComparison/HeuristicLab.Analysis.FitnessLandscape/3.3/Analysis/UniqueThresholdCalculator.cs

Timestamp:

02/02/16 14:10:53 (8 years ago)

Author:

abeham

Message:

#2457:

• Added stripped-down version of FLA branch
• Added appropriate calculators
• Fixed detecting maximization in RLD view

Location:

branches/PerformanceComparison/HeuristicLab.Analysis.FitnessLandscape

Files:

• . (copied) (copied from branches/FitnessLandscapeAnalysis/HeuristicLab.Analysis.FitnessLandscape)
• 3.3 (added)
• 3.3/Analysis (copied) (copied from branches/FitnessLandscapeAnalysis/HeuristicLab.Analysis.FitnessLandscape/Analysis)
• 3.3/Analysis/UniqueThresholdCalculator.cs (modified) (2 diffs)

branches/PerformanceComparison/HeuristicLab.Analysis.FitnessLandscape/3.3/Analysis/UniqueThresholdCalculator.cs

@@ -1 @@
-using System;
+#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 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 <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+using System.Collections.Generic;
+using System.Diagnostics;
 using System.Linq;
-using System.Collections.Generic;
-using System.Text;
-using System.Diagnostics;
 
-namespace HeuristicLab.Analysis {
+namespace HeuristicLab.Analysis.FitnessLandscape {
 
   public static class UniqueThresholdCalculator {
@@ -61 +81 @@
       } else {
         double min = thresholds[0];
-        double max = thresholds[thresholds.Count-1];
+        double max = thresholds[thresholds.Count - 1];
         if (min == max) {
           yield return min;
         } else {
           yield return min;
-          foreach (var t in DetermineInnerThresholds(thresholds, n-2))
+          foreach (var t in DetermineInnerThresholds(thresholds, n - 2))
             yield return t;
           yield return max;