Cleaned up the Interval Tree, KD-Tree, and Matrix test cases

Author: Justin Wetherell

src/com/jwetherell/algorithms/data_structures/SegmentTree.java

@@ -329,8 +329,28 @@ else if (this.maximum != null && data.maximum == null)
                     return;
                 else if (this.maximum == null && data.maximum != null)
                     this.maximum = data.maximum;
-                else if (data.maximum.doubleValue() > this.maximum.doubleValue()) {
-                    this.maximum = data.maximum;
+                else {
+                    /* TODO: This is ugly and how to handle number overflow? */
+                    if (this.maximum instanceof BigDecimal || data.maximum instanceof BigDecimal) {
+                        if (((BigDecimal)data.maximum).compareTo(((BigDecimal)this.maximum))==1)
+                            this.maximum = data.maximum;
+                    } else if (this.maximum instanceof BigInteger || data.maximum instanceof BigInteger) {
+                        if (((BigInteger)data.maximum).compareTo(((BigInteger)this.maximum))==1)
+                            this.maximum = data.maximum;
+                    } else if (this.maximum instanceof Long || data.maximum instanceof Long) {
+                        if (((Long)data.maximum).compareTo(((Long)this.maximum))==1)
+                            this.maximum = data.maximum;
+                    } else if (this.maximum instanceof Double || data.maximum instanceof Double) {
+                        if (((Double)data.maximum).compareTo(((Double)this.maximum))==1)
+                            this.maximum = data.maximum;
+                    } else if (this.maximum instanceof Float || data.maximum instanceof Float) {
+                        if (((Float)data.maximum).compareTo(((Float)this.maximum))==1)
+                            this.maximum = data.maximum;
+                    } else {
+                        // Integer
+                        if (((Integer)data.maximum).compareTo(((Integer)this.maximum))==1)
+                            this.maximum = data.maximum;
+                    }
                 }
             }
 
@@ -449,8 +469,28 @@ else if (this.minimum != null && data.minimum == null)
                     return;
                 else if (this.minimum == null && data.minimum != null)
                     this.minimum = data.minimum;
-                else if (data.minimum.doubleValue() < this.minimum.doubleValue()) {
-                    this.minimum = data.minimum;
+                else {
+                    /* TODO: This is ugly and how to handle number overflow? */
+                    if (this.minimum instanceof BigDecimal || data.minimum instanceof BigDecimal) {
+                        if (((BigDecimal)data.minimum).compareTo(((BigDecimal)this.minimum))==-1)
+                            this.minimum = data.minimum;
+                    } else if (this.minimum instanceof BigInteger || data.minimum instanceof BigInteger) {
+                        if (((BigInteger)data.minimum).compareTo(((BigInteger)this.minimum))==-1)
+                            this.minimum = data.minimum;
+                    } else if (this.minimum instanceof Long || data.minimum instanceof Long) {
+                        if (((Long)data.minimum).compareTo(((Long)this.minimum))==-1)
+                            this.minimum = data.minimum;
+                    } else if (this.minimum instanceof Double || data.minimum instanceof Double) {
+                        if (((Double)data.minimum).compareTo(((Double)this.minimum))==-1)
+                            this.minimum = data.minimum;
+                    } else if (this.minimum instanceof Float || data.minimum instanceof Float) {
+                        if (((Float)data.minimum).compareTo(((Float)this.minimum))==-1)
+                            this.minimum = data.minimum;
+                    } else {
+                        // Integer
+                        if (((Integer)data.minimum).compareTo(((Integer)this.minimum))==-1)
+                            this.minimum = data.minimum;
+                    }
                 }
             }