Changeset 13583 for branches/PerformanceComparison/HeuristicLab.Analysis.FitnessLandscape/3.3/Extensions.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/Extensions.cs (copied) (copied from branches/FitnessLandscapeAnalysis/HeuristicLab.Analysis.FitnessLandscape/ListExtensions.cs) (1 diff)

branches/PerformanceComparison/HeuristicLab.Analysis.FitnessLandscape/3.3/Extensions.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 HeuristicLab.Core;
+using System;
 using System.Collections.Generic;
-using System.Linq;
-using System.Text;
 
 namespace HeuristicLab.Analysis.FitnessLandscape {
-  public static class ListExtensions {
+  public static class IListExtensions {
     public static void DuplicateLast<T>(this IList<T> l) {
-      l.Add(l[l.Count-1]);
+      l.Add(l[l.Count - 1]);
     }
-    public static T Last<T>(this IList<T> l) {
-      return l[l.Count - 1];
+
+    public static void Shuffle<T>(this IList<T> list, IRandom random) {
+      int n = list.Count - 1;
+      while (n > 0) {
+        int k = random.Next(n + 1);
+        T value = list[k];
+        list[k] = list[n];
+        list[n] = value;
+        n--;
+      }
+    }
+  }
+
+  public static class IDictionaryExtensions {
+    public static TValue GetValueOrDefault<TKey, TValue>(this IDictionary<TKey, TValue> d, TKey key, Func<TValue> @default) {
+      TValue value;
+      return d.TryGetValue(key, out value) ? value : @default();
+    }
+
+    public static TValue GetValueOrDefault<TKey, TValue>(this IDictionary<TKey, TValue> d, TKey key, TValue @default = default(TValue)) {
+      TValue value;
+      return d.TryGetValue(key, out value) ? value : @default;
     }
   }