additional optimizations for MVRTreeMap

h2/src/main/org/h2/mvstore/rtree/MVRTreeMap.java

@@ -271,8 +271,11 @@ public final class MVRTreeMap<V> extends MVMap<SpatialKey, V> {
             } else {
                 result = operate(c, key, value, decisionMaker);
                 Object bounds = p.getKey(index);
-                keyType.increaseBounds(bounds, key);
-                p.setKey(index, bounds);
+                if (!keyType.contains(bounds, key)) {
+                    bounds = keyType.createBoundingBox(bounds);
+                    keyType.increaseBounds(bounds, key);
+                    p.setKey(index, bounds);
+                }
                 p.setChild(index, c);
             }
         }

h2/src/main/org/h2/mvstore/rtree/SpatialDataType.java

@@ -163,8 +163,14 @@ public class SpatialDataType implements DataType {
             return;
         }
         for (int i = 0; i < dimensions; i++) {
-            b.setMin(i, Math.min(b.min(i), a.min(i)));
-            b.setMax(i, Math.max(b.max(i), a.max(i)));
+            float v = a.min(i);
+            if (v < b.min(i)) {
+                b.setMin(i, v);
+            }
+            v = a.max(i);
+            if (v > b.max(i)) {
+                b.setMax(i, v);
+            }
         }
     }
 
@@ -287,12 +293,7 @@ public class SpatialDataType implements DataType {
         if (a.isNull()) {
             return a;
         }
-        float[] minMax = new float[dimensions * 2];
-        for (int i = 0; i < dimensions; i++) {
-            minMax[i + i] = a.min(i);
-            minMax[i + i + 1] = a.max(i);
-        }
-        return new SpatialKey(0, minMax);
+        return new SpatialKey(0, a);
     }
 
     /**

h2/src/main/org/h2/mvstore/rtree/SpatialKey.java

@@ -26,6 +26,11 @@ public class SpatialKey {
         this.minMax = minMax;
     }
 
+    public SpatialKey(long id, SpatialKey other) {
+        this.id = id;
+        this.minMax = other.minMax.clone();
+    }
+
     /**
      * Get the minimum value for the given dimension.
      *