1 files changed, 31 insertions, 31 deletions
diff --git a/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/global/BasicArray.java b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/global/BasicArray.java
index 4071cf8c7540..98feb5639a53 100644
--- a/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/global/BasicArray.java
+++ b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/global/BasicArray.java
@@ -1,31 +1,31 @@
-/**
- * Description: basic operations on Arrays 
- *
- * @ Author        Create/Modi     Note
- * Xiaofeng Xie    Oct. 9, 2002
- *
- */
-
-package net.adaptivebox.global;
-
-public class BasicArray {
-  public static double getMinValue(double[] v) {
-    double mv = Double.MAX_VALUE;
-    for (int i=0; i<v.length; i++) {
-      if (v[i]<mv) {
-        mv=v[i];
-      }
-    }
-    return mv;
-  }
-  public static double getMaxValue(double[] v) {
-    double mv = -Double.MAX_VALUE;
-    for (int i=0; i<v.length; i++) {
-      if (v[i]>mv) {
-        mv=v[i];
-      }
-    }
-    return mv;
-  }
-
-}
-\ No newline at end of file
+/**
+ * Description: basic operations on Arrays
+ *
+ * @ Author        Create/Modi     Note
+ * Xiaofeng Xie    Oct. 9, 2002
+ *
+ */
+
+package net.adaptivebox.global;
+
+public class BasicArray {
+  public static double getMinValue(double[] v) {
+    double mv = Double.MAX_VALUE;
+    for (int i=0; i<v.length; i++) {
+      if (v[i]<mv) {
+        mv=v[i];
+      }
+    }
+    return mv;
+  }
+  public static double getMaxValue(double[] v) {
+    double mv = -Double.MAX_VALUE;
+    for (int i=0; i<v.length; i++) {
+      if (v[i]>mv) {
+        mv=v[i];
+      }
+    }
+    return mv;
+  }
+
+}