Free cookie consent management tool by TermsFeed Policy Generator

source: addons/HeuristicLab.Problems.BioBoost/HeuristicLab.Problems.BioBoost/3.3/Utils/Util.cs @ 17777

Last change on this file since 17777 was 13071, checked in by gkronber, 8 years ago

#2499: added license headers and removed unused usings

File size: 1.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System;
23using System.Drawing;
24using HeuristicLab.Core;
25
26namespace HeuristicLab.BioBoost.Utils {
27  public class Util {
28
29    public static double Distance(Point p1, Point p2) {
30      return Math.Sqrt(Sqr(p1.X - p2.X) + Sqr(p1.Y - p2.Y));
31    }
32
33    public static double Sqr(double x) { return x * x; }
34
35    public static void Shuffle<T>(T[] elements, IRandom random) {
36      for (int i = elements.Length - 1; i > 0; i--) {
37        // Swap element "i" with a random earlier element (including itself)
38        int swapIndex = random.Next(i + 1);
39        T temp = elements[swapIndex];
40        elements[swapIndex] = elements[i];
41        elements[i] = temp;
42      }
43    }
44
45    public static T[] Clone<T>(T[] t) {
46      return (T[]) (t == null ? null : t.Clone());
47    }
48
49    public static T Clone<T>(T t) where T : ICloneable {
50      return (T) (t == null ? null : t.Clone());
51    }
52
53  }
54}
Note: See TracBrowser for help on using the repository browser.