1 files changed, 46 insertions, 0 deletions
diff --git a/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/global/GlobalCompare.java b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/global/GlobalCompare.java
new file mode 100755
index 000000000000..57fef7beb0df
--- /dev/null
+++ b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/global/GlobalCompare.java
@@ -0,0 +1,46 @@
+/**
+ * Description: Global package for comparison.
+ *
+ * @ Author        Create/Modi     Note
+ * Xiaofeng Xie    Jun 15, 2002    xiaofengxie@tsinghua.org.cn
+ *
+ *
+ * @version 1.0
+ * @Since MAOS1.0
+ */
+
+
+package net.adaptivebox.global;
+
+import java.util.*;
+
+public class GlobalCompare {
+
+/* compare the data1 and data2, if data1=data2, return 0
+ * if data1 < data2, return LESS_THAN, else if data1 > data2, LARGER_THAN
+ **/
+  static public int compare(double data1, double data2) {
+    if (data1 < data2)
+      return CompareValue.LESS_THAN;
+    else if (data1 > data2)
+      return CompareValue.LARGER_THAN;
+    else
+      return CompareValue.EQUAL_TO;
+  }
+
+/* check the magnitude of two array, the frontial is more important
+ **/
+  public static int compareArray(double[] fit1, double[] fit2) {
+    if (fit1.length!=fit2.length) {
+      return CompareValue.INVALID;  //error
+    }
+    for (int i=0; i<fit1.length; i++) {
+      if (fit1[i]>fit2[i]) {
+        return CompareValue.LARGER_THAN; //Large than
+      } else if (fit1[i]<fit2[i]){
+        return CompareValue.LESS_THAN; //Less than
+      }
+    }
+    return CompareValue.EQUAL_TO; //same
+  }
+}