@maptiler/geocoding-control 1.2.3 → 1.2.4

package/maplibregl-controller.js

@@ -524,10 +524,10 @@ var Ka = Hr * Hr, Po = function(t, e) {
   var s = {
     x: r.x - t.x,
     y: r.y - t.y
-  }, a = li(s, e) / o, u = li(s, i) / o, l = t.x + u * e.x, c = r.x + a * i.x, f = t.y + u * e.y, h = r.y + a * i.y, g = (l + c) / 2, p = (f + h) / 2;
+  }, a = li(s, e) / o, u = li(s, i) / o, l = t.x + u * e.x, c = r.x + a * i.x, f = t.y + u * e.y, h = r.y + a * i.y, p = (l + c) / 2, g = (f + h) / 2;
   return {
-    x: g,
-    y: p
+    x: p,
+    y: g
   };
 }, vr = /* @__PURE__ */ function() {
   ae(n, null, [{
@@ -604,8 +604,8 @@ var Ka = Hr * Hr, Po = function(t, e) {
       };
       return function(s, a) {
         i.has(s) || o(s), i.has(a) || o(a);
-        var u = i.get(s), l = u.sine, c = u.cosine, f = i.get(a), h = f.sine, g = f.cosine;
-        return l >= 0 && h >= 0 ? c < g ? 1 : c > g ? -1 : 0 : l < 0 && h < 0 ? c < g ? -1 : c > g ? 1 : 0 : h < l ? -1 : h > l ? 1 : 0;
+        var u = i.get(s), l = u.sine, c = u.cosine, f = i.get(a), h = f.sine, p = f.cosine;
+        return l >= 0 && h >= 0 ? c < p ? 1 : c > p ? -1 : 0 : l < 0 && h < 0 ? c < p ? -1 : c > p ? 1 : 0 : h < l ? -1 : h > l ? 1 : 0;
       };
     }
   }]), n;
@@ -642,28 +642,28 @@ var Ka = Hr * Hr, Po = function(t, e) {
           return 1;
         if (h > 0)
           return -1;
-        var g = r.comparePoint(e.rightSE.point);
-        return g !== 0 ? g : -1;
+        var p = r.comparePoint(e.rightSE.point);
+        return p !== 0 ? p : -1;
       }
       if (i > o) {
         if (u < l && u < f)
           return -1;
         if (u > l && u > f)
           return 1;
-        var p = r.comparePoint(e.leftSE.point);
-        if (p !== 0)
-          return p;
-        var v = e.comparePoint(r.rightSE.point);
-        return v < 0 ? 1 : v > 0 ? -1 : 1;
+        var g = r.comparePoint(e.leftSE.point);
+        if (g !== 0)
+          return g;
+        var m = e.comparePoint(r.rightSE.point);
+        return m < 0 ? 1 : m > 0 ? -1 : 1;
       }
       if (u < l)
         return -1;
       if (u > l)
         return 1;
       if (s < a) {
-        var m = r.comparePoint(e.rightSE.point);
-        if (m !== 0)
-          return m;
+        var d = r.comparePoint(e.rightSE.point);
+        if (d !== 0)
+          return d;
       }
       if (s > a) {
         var E = e.comparePoint(r.rightSE.point);
@@ -673,10 +673,10 @@ var Ka = Hr * Hr, Po = function(t, e) {
           return -1;
       }
       if (s !== a) {
-        var I = c - u, C = s - i, S = f - l, D = a - o;
-        if (I > C && S < D)
+        var I = c - u, C = s - i, x = f - l, R = a - o;
+        if (I > C && x < R)
           return 1;
-        if (I < C && S > D)
+        if (I < C && x > R)
           return -1;
       }
       return s > a ? 1 : s < a || c < f ? -1 : c > f ? 1 : e.id < r.id ? -1 : e.id > r.id ? 1 : 0;
@@ -770,21 +770,21 @@ var Ka = Hr * Hr, Po = function(t, e) {
       var r = this.bbox(), i = e.bbox(), o = wo(r, i);
       if (o === null)
         return null;
-      var s = this.leftSE.point, a = this.rightSE.point, u = e.leftSE.point, l = e.rightSE.point, c = oi(r, u) && this.comparePoint(u) === 0, f = oi(i, s) && e.comparePoint(s) === 0, h = oi(r, l) && this.comparePoint(l) === 0, g = oi(i, a) && e.comparePoint(a) === 0;
+      var s = this.leftSE.point, a = this.rightSE.point, u = e.leftSE.point, l = e.rightSE.point, c = oi(r, u) && this.comparePoint(u) === 0, f = oi(i, s) && e.comparePoint(s) === 0, h = oi(r, l) && this.comparePoint(l) === 0, p = oi(i, a) && e.comparePoint(a) === 0;
       if (f && c)
-        return g && !h ? a : !g && h ? l : null;
+        return p && !h ? a : !p && h ? l : null;
       if (f)
         return h && s.x === l.x && s.y === l.y ? null : s;
       if (c)
-        return g && a.x === u.x && a.y === u.y ? null : u;
-      if (g && h)
+        return p && a.x === u.x && a.y === u.y ? null : u;
+      if (p && h)
         return null;
-      if (g)
+      if (p)
         return a;
       if (h)
         return l;
-      var p = $a(s, this.vector(), u, e.vector());
-      return p === null || !oi(o, p) ? null : fi.round(p.x, p.y);
+      var g = $a(s, this.vector(), u, e.vector());
+      return g === null || !oi(o, g) ? null : fi.round(g.x, g.y);
     }
     /**
      * Split the given segment into multiple segments on the given points.
@@ -879,21 +879,21 @@ var Ka = Hr * Hr, Po = function(t, e) {
         var u = this.rings[s], l = this.windings[s], c = r.indexOf(u);
         c === -1 ? (r.push(u), i.push(l)) : i[c] += l;
       }
-      for (var f = [], h = [], g = 0, p = r.length; g < p; g++)
-        if (i[g] !== 0) {
-          var v = r[g], m = v.poly;
-          if (h.indexOf(m) === -1)
-            if (v.isExterior)
-              f.push(m);
+      for (var f = [], h = [], p = 0, g = r.length; p < g; p++)
+        if (i[p] !== 0) {
+          var m = r[p], d = m.poly;
+          if (h.indexOf(d) === -1)
+            if (m.isExterior)
+              f.push(d);
             else {
-              h.indexOf(m) === -1 && h.push(m);
-              var E = f.indexOf(v.poly);
+              h.indexOf(d) === -1 && h.push(d);
+              var E = f.indexOf(m.poly);
               E !== -1 && f.splice(E, 1);
             }
         }
       for (var I = 0, C = f.length; I < C; I++) {
-        var S = f[I].multiPoly;
-        o.indexOf(S) === -1 && o.push(S);
+        var x = f[I].multiPoly;
+        o.indexOf(x) === -1 && o.push(x);
       }
       return this._afterState;
     }
@@ -1056,31 +1056,31 @@ var Ka = Hr * Hr, Po = function(t, e) {
         if (!(!s.isInResult() || s.ringOut)) {
           for (var a = null, u = s.leftSE, l = s.rightSE, c = [u], f = u.point, h = []; a = u, u = l, c.push(u), u.point !== f; )
             for (; ; ) {
-              var g = u.getAvailableLinkedEvents();
-              if (g.length === 0) {
-                var p = c[0].point, v = c[c.length - 1].point;
-                throw new Error("Unable to complete output ring starting at [".concat(p.x, ",") + " ".concat(p.y, "]. Last matching segment found ends at") + " [".concat(v.x, ", ").concat(v.y, "]."));
+              var p = u.getAvailableLinkedEvents();
+              if (p.length === 0) {
+                var g = c[0].point, m = c[c.length - 1].point;
+                throw new Error("Unable to complete output ring starting at [".concat(g.x, ",") + " ".concat(g.y, "]. Last matching segment found ends at") + " [".concat(m.x, ", ").concat(m.y, "]."));
               }
-              if (g.length === 1) {
-                l = g[0].otherSE;
+              if (p.length === 1) {
+                l = p[0].otherSE;
                 break;
               }
-              for (var m = null, E = 0, I = h.length; E < I; E++)
+              for (var d = null, E = 0, I = h.length; E < I; E++)
                 if (h[E].point === u.point) {
-                  m = E;
+                  d = E;
                   break;
                 }
-              if (m !== null) {
-                var C = h.splice(m)[0], S = c.splice(C.index);
-                S.unshift(S[0].otherSE), r.push(new n(S.reverse()));
+              if (d !== null) {
+                var C = h.splice(d)[0], x = c.splice(C.index);
+                x.unshift(x[0].otherSE), r.push(new n(x.reverse()));
                 continue;
               }
               h.push({
                 index: c.length,
                 point: u.point
               });
-              var D = u.getLeftmostComparator(a);
-              l = g.sort(D)[0].otherSE;
+              var R = u.getLeftmostComparator(a);
+              l = p.sort(R)[0].otherSE;
               break;
             }
           r.push(new n(c));
@@ -1106,9 +1106,9 @@ var Ka = Hr * Hr, Po = function(t, e) {
         return null;
       var u = r[0], l = r[1];
       ss(u, e, l) === 0 && r.shift(), r.push(r[0]);
-      for (var c = this.isExteriorRing() ? 1 : -1, f = this.isExteriorRing() ? 0 : r.length - 1, h = this.isExteriorRing() ? r.length : -1, g = [], p = f; p != h; p += c)
-        g.push([r[p].x, r[p].y]);
-      return g;
+      for (var c = this.isExteriorRing() ? 1 : -1, f = this.isExteriorRing() ? 0 : r.length - 1, h = this.isExteriorRing() ? r.length : -1, p = [], g = f; g != h; g += c)
+        p.push([r[g].x, r[g].y]);
+      return p;
     }
   }, {
     key: "isExteriorRing",
@@ -1217,29 +1217,29 @@ var Ka = Hr * Hr, Po = function(t, e) {
         if (u) {
           var f = u.getIntersection(r);
           if (f !== null && (r.isAnEndpoint(f) || (c = f), !u.isAnEndpoint(f)))
-            for (var h = this._splitSafely(u, f), g = 0, p = h.length; g < p; g++)
-              i.push(h[g]);
+            for (var h = this._splitSafely(u, f), p = 0, g = h.length; p < g; p++)
+              i.push(h[p]);
         }
-        var v = null;
+        var m = null;
         if (l) {
-          var m = l.getIntersection(r);
-          if (m !== null && (r.isAnEndpoint(m) || (v = m), !l.isAnEndpoint(m)))
-            for (var E = this._splitSafely(l, m), I = 0, C = E.length; I < C; I++)
+          var d = l.getIntersection(r);
+          if (d !== null && (r.isAnEndpoint(d) || (m = d), !l.isAnEndpoint(d)))
+            for (var E = this._splitSafely(l, d), I = 0, C = E.length; I < C; I++)
               i.push(E[I]);
         }
-        if (c !== null || v !== null) {
-          var S = null;
+        if (c !== null || m !== null) {
+          var x = null;
           if (c === null)
-            S = v;
-          else if (v === null)
-            S = c;
+            x = m;
+          else if (m === null)
+            x = c;
           else {
-            var D = vr.comparePoints(c, v);
-            S = D <= 0 ? c : v;
+            var R = vr.comparePoints(c, m);
+            x = R <= 0 ? c : m;
           }
           this.queue.remove(r.rightSE), i.push(r.rightSE);
-          for (var R = r.split(S), F = 0, G = R.length; F < G; F++)
-            i.push(R[F]);
+          for (var O = r.split(x), F = 0, G = O.length; F < G; F++)
+            i.push(O[F]);
         }
         i.length > 0 ? (this.tree.remove(r), i.push(e)) : (this.segments.push(r), r.prev = u);
       } else {
@@ -1285,32 +1285,32 @@ var Ka = Hr * Hr, Po = function(t, e) {
           wo(o[l].bbox, u.bbox) !== null ? l++ : o.splice(l, 1);
       if (tr.type === "intersection") {
         for (var c = 0, f = o.length; c < f; c++)
-          for (var h = o[c], g = c + 1, p = o.length; g < p; g++)
-            if (wo(h.bbox, o[g].bbox) === null)
+          for (var h = o[c], p = c + 1, g = o.length; p < g; p++)
+            if (wo(h.bbox, o[p].bbox) === null)
               return [];
       }
-      for (var v = new Vo(vr.compare), m = 0, E = o.length; m < E; m++)
-        for (var I = o[m].getSweepEvents(), C = 0, S = I.length; C < S; C++)
-          if (v.insert(I[C]), v.size > hs)
+      for (var m = new Vo(vr.compare), d = 0, E = o.length; d < E; d++)
+        for (var I = o[d].getSweepEvents(), C = 0, x = I.length; C < x; C++)
+          if (m.insert(I[C]), m.size > hs)
             throw new Error("Infinite loop when putting segment endpoints in a priority queue (queue size too big). Please file a bug report.");
-      for (var D = new iu(v), R = v.size, F = v.pop(); F; ) {
+      for (var R = new iu(m), O = m.size, F = m.pop(); F; ) {
         var G = F.key;
-        if (v.size === R) {
+        if (m.size === O) {
           var M = G.segment;
           throw new Error("Unable to pop() ".concat(G.isLeft ? "left" : "right", " SweepEvent ") + "[".concat(G.point.x, ", ").concat(G.point.y, "] from segment #").concat(M.id, " ") + "[".concat(M.leftSE.point.x, ", ").concat(M.leftSE.point.y, "] -> ") + "[".concat(M.rightSE.point.x, ", ").concat(M.rightSE.point.y, "] from queue. ") + "Please file a bug report.");
         }
-        if (v.size > hs)
+        if (m.size > hs)
           throw new Error("Infinite loop when passing sweep line over endpoints (queue size too big). Please file a bug report.");
-        if (D.segments.length > ou)
+        if (R.segments.length > ou)
           throw new Error("Infinite loop when passing sweep line over endpoints (too many sweep line segments). Please file a bug report.");
-        for (var et = D.process(G), K = 0, nt = et.length; K < nt; K++) {
+        for (var et = R.process(G), K = 0, nt = et.length; K < nt; K++) {
           var ct = et[K];
-          ct.consumedBy === void 0 && v.insert(ct);
+          ct.consumedBy === void 0 && m.insert(ct);
         }
-        R = v.size, F = v.pop();
+        O = m.size, F = m.pop();
       }
       fi.reset();
-      var w = ru.factory(D.segments), X = new nu(w);
+      var w = ru.factory(R.segments), X = new nu(w);
       return X.getGeom();
     }
   }]), n;
@@ -1560,9 +1560,9 @@ function bu(n, t, e, r, i, o, s = null, a = [-1]) {
   };
   s && s(l.root);
   let c = !1;
-  if (l.ctx = e ? e(n, t.props || {}, (f, h, ...g) => {
-    const p = g.length ? g[0] : h;
-    return l.ctx && i(l.ctx[f], l.ctx[f] = p) && (!l.skip_bound && l.bound[f] && l.bound[f](p), c && Pu(n, f)), h;
+  if (l.ctx = e ? e(n, t.props || {}, (f, h, ...p) => {
+    const g = p.length ? p[0] : h;
+    return l.ctx && i(l.ctx[f], l.ctx[f] = g) && (!l.skip_bound && l.bound[f] && l.bound[f](g), c && Pu(n, f)), h;
   }) : [], l.update(), c = !0, no(l.before_update), l.fragment = r ? r(l.ctx) : !1, t.target) {
     if (t.hydrate) {
       const f = _u(t.target);
@@ -1678,14 +1678,14 @@ class Mu extends Ru {
 }
 function Js(n, t, e) {
   if (n !== null)
-    for (var r, i, o, s, a, u, l, c = 0, f = 0, h, g = n.type, p = g === "FeatureCollection", v = g === "Feature", m = p ? n.features.length : 1, E = 0; E < m; E++) {
-      l = p ? n.features[E].geometry : v ? n.geometry : n, h = l ? l.type === "GeometryCollection" : !1, a = h ? l.geometries.length : 1;
+    for (var r, i, o, s, a, u, l, c = 0, f = 0, h, p = n.type, g = p === "FeatureCollection", m = p === "Feature", d = g ? n.features.length : 1, E = 0; E < d; E++) {
+      l = g ? n.features[E].geometry : m ? n.geometry : n, h = l ? l.type === "GeometryCollection" : !1, a = h ? l.geometries.length : 1;
       for (var I = 0; I < a; I++) {
-        var C = 0, S = 0;
+        var C = 0, x = 0;
         if (s = h ? l.geometries[I] : l, s !== null) {
           u = s.coordinates;
-          var D = s.type;
-          switch (c = 0, D) {
+          var R = s.type;
+          switch (c = 0, R) {
             case null:
               break;
             case "Point":
@@ -1694,7 +1694,7 @@ function Js(n, t, e) {
                 f,
                 E,
                 C,
-                S
+                x
               ) === !1)
                 return !1;
               f++, C++;
@@ -1707,12 +1707,12 @@ function Js(n, t, e) {
                   f,
                   E,
                   C,
-                  S
+                  x
                 ) === !1)
                   return !1;
-                f++, D === "MultiPoint" && C++;
+                f++, R === "MultiPoint" && C++;
               }
-              D === "LineString" && C++;
+              R === "LineString" && C++;
               break;
             case "Polygon":
             case "MultiLineString":
@@ -1723,30 +1723,30 @@ function Js(n, t, e) {
                     f,
                     E,
                     C,
-                    S
+                    x
                   ) === !1)
                     return !1;
                   f++;
                 }
-                D === "MultiLineString" && C++, D === "Polygon" && S++;
+                R === "MultiLineString" && C++, R === "Polygon" && x++;
               }
-              D === "Polygon" && C++;
+              R === "Polygon" && C++;
               break;
             case "MultiPolygon":
               for (r = 0; r < u.length; r++) {
-                for (S = 0, i = 0; i < u[r].length; i++) {
+                for (x = 0, i = 0; i < u[r].length; i++) {
                   for (o = 0; o < u[r][i].length - c; o++) {
                     if (t(
                       u[r][i][o],
                       f,
                       E,
                       C,
-                      S
+                      x
                     ) === !1)
                       return !1;
                     f++;
                   }
-                  S++;
+                  x++;
                 }
                 C++;
               }
@@ -1771,9 +1771,9 @@ function ms(n, t) {
       ;
 }
 function Zs(n, t) {
-  var e, r, i, o, s, a, u, l, c, f, h = 0, g = n.type === "FeatureCollection", p = n.type === "Feature", v = g ? n.features.length : 1;
-  for (e = 0; e < v; e++) {
-    for (a = g ? n.features[e].geometry : p ? n.geometry : n, l = g ? n.features[e].properties : p ? n.properties : {}, c = g ? n.features[e].bbox : p ? n.bbox : void 0, f = g ? n.features[e].id : p ? n.id : void 0, u = a ? a.type === "GeometryCollection" : !1, s = u ? a.geometries.length : 1, i = 0; i < s; i++) {
+  var e, r, i, o, s, a, u, l, c, f, h = 0, p = n.type === "FeatureCollection", g = n.type === "Feature", m = p ? n.features.length : 1;
+  for (e = 0; e < m; e++) {
+    for (a = p ? n.features[e].geometry : g ? n.geometry : n, l = p ? n.features[e].properties : g ? n.properties : {}, c = p ? n.features[e].bbox : g ? n.bbox : void 0, f = p ? n.features[e].id : g ? n.id : void 0, u = a ? a.type === "GeometryCollection" : !1, s = u ? a.geometries.length : 1, i = 0; i < s; i++) {
       if (o = u ? a.geometries[i] : a, o === null) {
         if (t(
           null,
@@ -1900,7 +1900,7 @@ var Ee = function() {
 };
 function Ie() {
 }
-var d = function n() {
+var v = function n() {
   if (this.x = null, this.y = null, this.z = null, arguments.length === 0)
     this.x = 0, this.y = 0, this.z = n.NULL_ORDINATE;
   else if (arguments.length === 1) {
@@ -1909,22 +1909,22 @@ var d = function n() {
   } else
     arguments.length === 2 ? (this.x = arguments[0], this.y = arguments[1], this.z = n.NULL_ORDINATE) : arguments.length === 3 && (this.x = arguments[0], this.y = arguments[1], this.z = arguments[2]);
 }, Cn = { DimensionalComparator: { configurable: !0 }, serialVersionUID: { configurable: !0 }, NULL_ORDINATE: { configurable: !0 }, X: { configurable: !0 }, Y: { configurable: !0 }, Z: { configurable: !0 } };
-d.prototype.setOrdinate = function(t, e) {
+v.prototype.setOrdinate = function(t, e) {
   switch (t) {
-    case d.X:
+    case v.X:
       this.x = e;
       break;
-    case d.Y:
+    case v.Y:
       this.y = e;
       break;
-    case d.Z:
+    case v.Z:
       this.z = e;
       break;
     default:
       throw new it("Invalid ordinate index: " + t);
   }
 };
-d.prototype.equals2D = function() {
+v.prototype.equals2D = function() {
   if (arguments.length === 1) {
     var t = arguments[0];
     return !(this.x !== t.x || this.y !== t.y);
@@ -1933,60 +1933,60 @@ d.prototype.equals2D = function() {
     return !(!ln.equalsWithTolerance(this.x, e.x, r) || !ln.equalsWithTolerance(this.y, e.y, r));
   }
 };
-d.prototype.getOrdinate = function(t) {
+v.prototype.getOrdinate = function(t) {
   switch (t) {
-    case d.X:
+    case v.X:
       return this.x;
-    case d.Y:
+    case v.Y:
       return this.y;
-    case d.Z:
+    case v.Z:
       return this.z;
   }
   throw new it("Invalid ordinate index: " + t);
 };
-d.prototype.equals3D = function(t) {
+v.prototype.equals3D = function(t) {
   return this.x === t.x && this.y === t.y && (this.z === t.z || A.isNaN(this.z)) && A.isNaN(t.z);
 };
-d.prototype.equals = function(t) {
-  return t instanceof d ? this.equals2D(t) : !1;
+v.prototype.equals = function(t) {
+  return t instanceof v ? this.equals2D(t) : !1;
 };
-d.prototype.equalInZ = function(t, e) {
+v.prototype.equalInZ = function(t, e) {
   return ln.equalsWithTolerance(this.z, t.z, e);
 };
-d.prototype.compareTo = function(t) {
+v.prototype.compareTo = function(t) {
   var e = t;
   return this.x < e.x ? -1 : this.x > e.x ? 1 : this.y < e.y ? -1 : this.y > e.y ? 1 : 0;
 };
-d.prototype.clone = function() {
+v.prototype.clone = function() {
 };
-d.prototype.copy = function() {
-  return new d(this);
+v.prototype.copy = function() {
+  return new v(this);
 };
-d.prototype.toString = function() {
+v.prototype.toString = function() {
   return "(" + this.x + ", " + this.y + ", " + this.z + ")";
 };
-d.prototype.distance3D = function(t) {
+v.prototype.distance3D = function(t) {
   var e = this.x - t.x, r = this.y - t.y, i = this.z - t.z;
   return Math.sqrt(e * e + r * r + i * i);
 };
-d.prototype.distance = function(t) {
+v.prototype.distance = function(t) {
   var e = this.x - t.x, r = this.y - t.y;
   return Math.sqrt(e * e + r * r);
 };
-d.prototype.hashCode = function() {
+v.prototype.hashCode = function() {
   var t = 17;
-  return t = 37 * t + d.hashCode(this.x), t = 37 * t + d.hashCode(this.y), t;
+  return t = 37 * t + v.hashCode(this.x), t = 37 * t + v.hashCode(this.y), t;
 };
-d.prototype.setCoordinate = function(t) {
+v.prototype.setCoordinate = function(t) {
   this.x = t.x, this.y = t.y, this.z = t.z;
 };
-d.prototype.interfaces_ = function() {
+v.prototype.interfaces_ = function() {
   return [Ee, io, Ie];
 };
-d.prototype.getClass = function() {
-  return d;
+v.prototype.getClass = function() {
+  return v;
 };
-d.hashCode = function() {
+v.hashCode = function() {
   if (arguments.length === 1) {
     var t = arguments[0], e = A.doubleToLongBits(t);
     return Math.trunc((e ^ e) >>> 32);
@@ -2010,7 +2010,7 @@ Cn.Y.get = function() {
 Cn.Z.get = function() {
   return 2;
 };
-Object.defineProperties(d, Cn);
+Object.defineProperties(v, Cn);
 var Rr = function(t) {
   if (this._dimensionsToTest = 2, arguments.length !== 0) {
     if (arguments.length === 1) {
@@ -2196,8 +2196,8 @@ _.prototype.extractSignificantDigits = function(t, e) {
       break;
     var f = !1, h = 0;
     c > 9 ? (f = !0, h = "9") : h = "0" + c, a.append(h), r = r.subtract(_.valueOf(c)).multiply(_.TEN), f && r.selfAdd(_.TEN);
-    var g = !0, p = _.magnitude(r._hi);
-    if (p < 0 && Math.abs(p) >= u - l && (g = !1), !g)
+    var p = !0, g = _.magnitude(r._hi);
+    if (g < 0 && Math.abs(g) >= u - l && (p = !1), !p)
       break;
   }
   return e[0] = i, a.toString();
@@ -2329,10 +2329,10 @@ _.prototype.selfAdd = function() {
       return o = this._hi + e, a = o - this._hi, s = o - a, s = e - a + (this._hi - s), u = s + this._lo, r = o + u, i = u + (o - r), this._hi = r + i, this._lo = i + (r - this._hi), this;
     }
   } else if (arguments.length === 2) {
-    var l = arguments[0], c = arguments[1], f = null, h = null, g = null, p = null, v = null, m = null, E = null, I = null;
-    v = this._hi + l, g = this._lo + c, E = v - this._hi, I = g - this._lo, m = v - E, p = g - I, m = l - E + (this._hi - m), p = c - I + (this._lo - p), E = m + g, f = v + E, h = E + (v - f), E = p + h;
-    var C = f + E, S = E + (f - C);
-    return this._hi = C, this._lo = S, this;
+    var l = arguments[0], c = arguments[1], f = null, h = null, p = null, g = null, m = null, d = null, E = null, I = null;
+    m = this._hi + l, p = this._lo + c, E = m - this._hi, I = p - this._lo, d = m - E, g = p - I, d = l - E + (this._hi - d), g = c - I + (this._lo - g), E = d + p, f = m + E, h = E + (m - f), E = g + h;
+    var C = f + E, x = E + (f - C);
+    return this._hi = C, this._lo = x, this;
   }
 };
 _.prototype.selfMultiply = function() {
@@ -2517,17 +2517,17 @@ _.parse = function(t) {
     }
     throw new Error("Unexpected character '" + c + "' at position " + e + " in string " + t);
   }
-  var g = s, p = a - u - l;
-  if (p === 0)
-    g = s;
-  else if (p > 0) {
-    var v = _.TEN.pow(p);
-    g = s.divide(v);
-  } else if (p < 0) {
-    var m = _.TEN.pow(-p);
-    g = s.multiply(m);
+  var p = s, g = a - u - l;
+  if (g === 0)
+    p = s;
+  else if (g > 0) {
+    var m = _.TEN.pow(g);
+    p = s.divide(m);
+  } else if (g < 0) {
+    var d = _.TEN.pow(-g);
+    p = s.multiply(d);
   }
-  return i ? g.negate() : g;
+  return i ? p.negate() : p;
 };
 _.createNaN = function() {
   return new _(A.NaN, A.NaN);
@@ -2601,8 +2601,8 @@ Kt.signOfDet2x2 = function(t, e, r, i) {
   return o.signum();
 };
 Kt.intersection = function(t, e, r, i) {
-  var o = _.valueOf(i.y).selfSubtract(r.y).selfMultiply(_.valueOf(e.x).selfSubtract(t.x)), s = _.valueOf(i.x).selfSubtract(r.x).selfMultiply(_.valueOf(e.y).selfSubtract(t.y)), a = o.subtract(s), u = _.valueOf(i.x).selfSubtract(r.x).selfMultiply(_.valueOf(t.y).selfSubtract(r.y)), l = _.valueOf(i.y).selfSubtract(r.y).selfMultiply(_.valueOf(t.x).selfSubtract(r.x)), c = u.subtract(l), f = c.selfDivide(a).doubleValue(), h = _.valueOf(t.x).selfAdd(_.valueOf(e.x).selfSubtract(t.x).selfMultiply(f)).doubleValue(), g = _.valueOf(e.x).selfSubtract(t.x).selfMultiply(_.valueOf(t.y).selfSubtract(r.y)), p = _.valueOf(e.y).selfSubtract(t.y).selfMultiply(_.valueOf(t.x).selfSubtract(r.x)), v = g.subtract(p), m = v.selfDivide(a).doubleValue(), E = _.valueOf(r.y).selfAdd(_.valueOf(i.y).selfSubtract(r.y).selfMultiply(m)).doubleValue();
-  return new d(h, E);
+  var o = _.valueOf(i.y).selfSubtract(r.y).selfMultiply(_.valueOf(e.x).selfSubtract(t.x)), s = _.valueOf(i.x).selfSubtract(r.x).selfMultiply(_.valueOf(e.y).selfSubtract(t.y)), a = o.subtract(s), u = _.valueOf(i.x).selfSubtract(r.x).selfMultiply(_.valueOf(t.y).selfSubtract(r.y)), l = _.valueOf(i.y).selfSubtract(r.y).selfMultiply(_.valueOf(t.x).selfSubtract(r.x)), c = u.subtract(l), f = c.selfDivide(a).doubleValue(), h = _.valueOf(t.x).selfAdd(_.valueOf(e.x).selfSubtract(t.x).selfMultiply(f)).doubleValue(), p = _.valueOf(e.x).selfSubtract(t.x).selfMultiply(_.valueOf(t.y).selfSubtract(r.y)), g = _.valueOf(e.y).selfSubtract(t.y).selfMultiply(_.valueOf(t.x).selfSubtract(r.x)), m = p.subtract(g), d = m.selfDivide(a).doubleValue(), E = _.valueOf(r.y).selfAdd(_.valueOf(i.y).selfSubtract(r.y).selfMultiply(d)).doubleValue();
+  return new v(h, E);
 };
 Kt.orientationIndexFilter = function(t, e, r) {
   var i = null, o = (t.x - r.x) * (e.y - r.y), s = (t.y - r.y) * (e.x - r.x), a = o - s;
@@ -2706,7 +2706,7 @@ var Ce = function n() {
     } else if (arguments[0] instanceof n && arguments[1] instanceof n) {
       var i = arguments[0], o = arguments[1];
       this.x = i.y * o.w - o.y * i.w, this.y = o.x * i.w - i.x * o.w, this.w = i.x * o.y - o.x * i.y;
-    } else if (arguments[0] instanceof d && arguments[1] instanceof d) {
+    } else if (arguments[0] instanceof v && arguments[1] instanceof v) {
       var s = arguments[0], a = arguments[1];
       this.x = s.y - a.y, this.y = a.x - s.x, this.w = s.x * a.y - a.x * s.y;
     }
@@ -2714,8 +2714,8 @@ var Ce = function n() {
     var u = arguments[0], l = arguments[1], c = arguments[2];
     this.x = u, this.y = l, this.w = c;
   } else if (arguments.length === 4) {
-    var f = arguments[0], h = arguments[1], g = arguments[2], p = arguments[3], v = f.y - h.y, m = h.x - f.x, E = f.x * h.y - h.x * f.y, I = g.y - p.y, C = p.x - g.x, S = g.x * p.y - p.x * g.y;
-    this.x = m * S - C * E, this.y = I * E - v * S, this.w = v * C - I * m;
+    var f = arguments[0], h = arguments[1], p = arguments[2], g = arguments[3], m = f.y - h.y, d = h.x - f.x, E = f.x * h.y - h.x * f.y, I = p.y - g.y, C = g.x - p.x, x = p.x * g.y - g.x * p.y;
+    this.x = d * x - C * E, this.y = I * E - m * x, this.w = m * C - I * d;
   }
 };
 Ce.prototype.getY = function() {
@@ -2731,7 +2731,7 @@ Ce.prototype.getX = function() {
   return t;
 };
 Ce.prototype.getCoordinate = function() {
-  var t = new d();
+  var t = new v();
   return t.x = this.getX(), t.y = this.getY(), t;
 };
 Ce.prototype.interfaces_ = function() {
@@ -2741,16 +2741,16 @@ Ce.prototype.getClass = function() {
   return Ce;
 };
 Ce.intersection = function(t, e, r, i) {
-  var o = t.y - e.y, s = e.x - t.x, a = t.x * e.y - e.x * t.y, u = r.y - i.y, l = i.x - r.x, c = r.x * i.y - i.x * r.y, f = s * c - l * a, h = u * a - o * c, g = o * l - u * s, p = f / g, v = h / g;
-  if (A.isNaN(p) || A.isInfinite(p) || A.isNaN(v) || A.isInfinite(v))
+  var o = t.y - e.y, s = e.x - t.x, a = t.x * e.y - e.x * t.y, u = r.y - i.y, l = i.x - r.x, c = r.x * i.y - i.x * r.y, f = s * c - l * a, h = u * a - o * c, p = o * l - u * s, g = f / p, m = h / p;
+  if (A.isNaN(g) || A.isInfinite(g) || A.isNaN(m) || A.isInfinite(m))
     throw new $n();
-  return new d(p, v);
+  return new v(g, m);
 };
 var P = function n() {
   if (this._minx = null, this._maxx = null, this._miny = null, this._maxy = null, arguments.length === 0)
     this.init();
   else if (arguments.length === 1) {
-    if (arguments[0] instanceof d) {
+    if (arguments[0] instanceof v) {
       var t = arguments[0];
       this.init(t.x, t.x, t.y, t.y);
     } else if (arguments[0] instanceof n) {
@@ -2788,7 +2788,7 @@ P.prototype.getMaxX = function() {
 };
 P.prototype.covers = function() {
   if (arguments.length === 1) {
-    if (arguments[0] instanceof d) {
+    if (arguments[0] instanceof v) {
       var t = arguments[0];
       return this.covers(t.x, t.y);
     } else if (arguments[0] instanceof P) {
@@ -2805,7 +2805,7 @@ P.prototype.intersects = function() {
     if (arguments[0] instanceof P) {
       var t = arguments[0];
       return this.isNull() || t.isNull() ? !1 : !(t._minx > this._maxx || t._maxx < this._minx || t._miny > this._maxy || t._maxy < this._miny);
-    } else if (arguments[0] instanceof d) {
+    } else if (arguments[0] instanceof v) {
       var e = arguments[0];
       return this.intersects(e.x, e.y);
     }
@@ -2822,7 +2822,7 @@ P.prototype.getMinX = function() {
 };
 P.prototype.expandToInclude = function() {
   if (arguments.length === 1) {
-    if (arguments[0] instanceof d) {
+    if (arguments[0] instanceof v) {
       var t = arguments[0];
       this.expandToInclude(t.x, t.y);
     } else if (arguments[0] instanceof P) {
@@ -2885,7 +2885,7 @@ P.prototype.contains = function() {
     if (arguments[0] instanceof P) {
       var t = arguments[0];
       return this.covers(t);
-    } else if (arguments[0] instanceof d) {
+    } else if (arguments[0] instanceof v) {
       var e = arguments[0];
       return this.covers(e);
     }
@@ -2895,13 +2895,13 @@ P.prototype.contains = function() {
   }
 };
 P.prototype.centre = function() {
-  return this.isNull() ? null : new d((this.getMinX() + this.getMaxX()) / 2, (this.getMinY() + this.getMaxY()) / 2);
+  return this.isNull() ? null : new v((this.getMinX() + this.getMaxX()) / 2, (this.getMinY() + this.getMaxY()) / 2);
 };
 P.prototype.init = function() {
   if (arguments.length === 0)
     this.setToNull();
   else if (arguments.length === 1) {
-    if (arguments[0] instanceof d) {
+    if (arguments[0] instanceof v) {
       var t = arguments[0];
       this.init(t.x, t.x, t.y, t.y);
     } else if (arguments[0] instanceof P) {
@@ -2929,7 +2929,7 @@ P.prototype.distance = function(t) {
 };
 P.prototype.hashCode = function() {
   var t = 17;
-  return t = 37 * t + d.hashCode(this._minx), t = 37 * t + d.hashCode(this._maxx), t = 37 * t + d.hashCode(this._miny), t = 37 * t + d.hashCode(this._maxy), t;
+  return t = 37 * t + v.hashCode(this._minx), t = 37 * t + v.hashCode(this._maxx), t = 37 * t + v.hashCode(this._miny), t = 37 * t + v.hashCode(this._maxy), t;
 };
 P.prototype.interfaces_ = function() {
   return [Ee, Ie];
@@ -3082,7 +3082,7 @@ var gr = {
     if (t === void 0)
       return this.geometryFactory.createPoint();
     var e = t.trim().split(Me.spaces);
-    return this.geometryFactory.createPoint(new d(
+    return this.geometryFactory.createPoint(new v(
       Number.parseFloat(e[0]),
       Number.parseFloat(e[1])
     ));
@@ -3113,7 +3113,7 @@ var gr = {
     if (t === void 0)
       return this.geometryFactory.createLineString();
     for (var e = t.trim().split(","), r = [], i, o = 0, s = e.length; o < s; ++o)
-      i = e[o].trim().split(Me.spaces), r.push(new d(Number.parseFloat(i[0]), Number.parseFloat(i[1])));
+      i = e[o].trim().split(Me.spaces), r.push(new v(Number.parseFloat(i[0]), Number.parseFloat(i[1])));
     return this.geometryFactory.createLineString(r);
   },
   /**
@@ -3127,7 +3127,7 @@ var gr = {
     if (t === void 0)
       return this.geometryFactory.createLinearRing();
     for (var e = t.trim().split(","), r = [], i, o = 0, s = e.length; o < s; ++o)
-      i = e[o].trim().split(Me.spaces), r.push(new d(Number.parseFloat(i[0]), Number.parseFloat(i[1])));
+      i = e[o].trim().split(Me.spaces), r.push(new v(Number.parseFloat(i[0]), Number.parseFloat(i[1])));
     return this.geometryFactory.createLinearRing(r);
   },
   /**
@@ -3254,7 +3254,7 @@ V.equals = function() {
 var ot = function() {
   this._result = null, this._inputLines = Array(2).fill().map(function() {
     return Array(2);
-  }), this._intPt = new Array(2).fill(null), this._intLineIndex = null, this._isProper = null, this._pa = null, this._pb = null, this._precisionModel = null, this._intPt[0] = new d(), this._intPt[1] = new d(), this._pa = this._intPt[0], this._pb = this._intPt[1], this._result = 0;
+  }), this._intPt = new Array(2).fill(null), this._intLineIndex = null, this._isProper = null, this._pa = null, this._pb = null, this._precisionModel = null, this._intPt[0] = new v(), this._intPt[1] = new v(), this._pa = this._intPt[0], this._pb = this._intPt[1], this._result = 0;
 }, Nn = { DONT_INTERSECT: { configurable: !0 }, DO_INTERSECT: { configurable: !0 }, COLLINEAR: { configurable: !0 }, NO_INTERSECTION: { configurable: !0 }, POINT_INTERSECTION: { configurable: !0 }, COLLINEAR_INTERSECTION: { configurable: !0 } };
 ot.prototype.getIndexAlongSegment = function(t, e) {
   return this.computeIntLineIndex(), this._intLineIndex[t][e];
@@ -3399,7 +3399,7 @@ var sn = function(n) {
     return a;
   }, t.prototype.intersection = function(r, i, o, s) {
     var a = this.intersectionWithNormalization(r, i, o, s);
-    return this.isInSegmentEnvelopes(a) || (a = new d(t.nearestEndpoint(r, i, o, s))), this._precisionModel !== null && this._precisionModel.makePrecise(a), a;
+    return this.isInSegmentEnvelopes(a) || (a = new v(t.nearestEndpoint(r, i, o, s))), this._precisionModel !== null && this._precisionModel.makePrecise(a), a;
   }, t.prototype.smallestInAbsValue = function(r, i, o, s) {
     var a = r, u = Math.abs(a);
     return Math.abs(i) < u && (a = i, u = Math.abs(i)), Math.abs(o) < u && (a = o, u = Math.abs(o)), Math.abs(s) < u && (a = s), a;
@@ -3407,7 +3407,7 @@ var sn = function(n) {
     var u = Kt.intersection(r, i, o, s), l = this.isInSegmentEnvelopes(u);
     Rt.out.println("DD in env = " + l + "  --------------------- " + u), a.distance(u) > 1e-4 && Rt.out.println("Distance = " + a.distance(u));
   }, t.prototype.intersectionWithNormalization = function(r, i, o, s) {
-    var a = new d(r), u = new d(i), l = new d(o), c = new d(s), f = new d();
+    var a = new v(r), u = new v(i), l = new v(o), c = new v(s), f = new v();
     this.normalizeToEnvCentre(a, u, l, c, f);
     var h = this.safeHCoordinateIntersection(a, u, l, c);
     return h.x += f.x, h.y += f.y, h;
@@ -3415,8 +3415,8 @@ var sn = function(n) {
     var a = P.intersects(r, i, o), u = P.intersects(r, i, s), l = P.intersects(o, s, r), c = P.intersects(o, s, i);
     return a && u ? (this._intPt[0] = o, this._intPt[1] = s, n.COLLINEAR_INTERSECTION) : l && c ? (this._intPt[0] = r, this._intPt[1] = i, n.COLLINEAR_INTERSECTION) : a && l ? (this._intPt[0] = o, this._intPt[1] = r, o.equals(r) && !u && !c ? n.POINT_INTERSECTION : n.COLLINEAR_INTERSECTION) : a && c ? (this._intPt[0] = o, this._intPt[1] = i, o.equals(i) && !u && !l ? n.POINT_INTERSECTION : n.COLLINEAR_INTERSECTION) : u && l ? (this._intPt[0] = s, this._intPt[1] = r, s.equals(r) && !a && !c ? n.POINT_INTERSECTION : n.COLLINEAR_INTERSECTION) : u && c ? (this._intPt[0] = s, this._intPt[1] = i, s.equals(i) && !a && !l ? n.POINT_INTERSECTION : n.COLLINEAR_INTERSECTION) : n.NO_INTERSECTION;
   }, t.prototype.normalizeToEnvCentre = function(r, i, o, s, a) {
-    var u = r.x < i.x ? r.x : i.x, l = r.y < i.y ? r.y : i.y, c = r.x > i.x ? r.x : i.x, f = r.y > i.y ? r.y : i.y, h = o.x < s.x ? o.x : s.x, g = o.y < s.y ? o.y : s.y, p = o.x > s.x ? o.x : s.x, v = o.y > s.y ? o.y : s.y, m = u > h ? u : h, E = c < p ? c : p, I = l > g ? l : g, C = f < v ? f : v, S = (m + E) / 2, D = (I + C) / 2;
-    a.x = S, a.y = D, r.x -= a.x, r.y -= a.y, i.x -= a.x, i.y -= a.y, o.x -= a.x, o.y -= a.y, s.x -= a.x, s.y -= a.y;
+    var u = r.x < i.x ? r.x : i.x, l = r.y < i.y ? r.y : i.y, c = r.x > i.x ? r.x : i.x, f = r.y > i.y ? r.y : i.y, h = o.x < s.x ? o.x : s.x, p = o.y < s.y ? o.y : s.y, g = o.x > s.x ? o.x : s.x, m = o.y > s.y ? o.y : s.y, d = u > h ? u : h, E = c < g ? c : g, I = l > p ? l : p, C = f < m ? f : m, x = (d + E) / 2, R = (I + C) / 2;
+    a.x = x, a.y = R, r.x -= a.x, r.y -= a.y, i.x -= a.x, i.y -= a.y, o.x -= a.x, o.y -= a.y, s.x -= a.x, s.y -= a.y;
   }, t.prototype.computeIntersect = function(r, i, o, s) {
     if (this._isProper = !1, !P.intersects(r, i, o, s))
       return n.NO_INTERSECTION;
@@ -3427,7 +3427,7 @@ var sn = function(n) {
     if (l > 0 && c > 0 || l < 0 && c < 0)
       return n.NO_INTERSECTION;
     var f = a === 0 && u === 0 && l === 0 && c === 0;
-    return f ? this.computeCollinearIntersection(r, i, o, s) : (a === 0 || u === 0 || l === 0 || c === 0 ? (this._isProper = !1, r.equals2D(o) || r.equals2D(s) ? this._intPt[0] = r : i.equals2D(o) || i.equals2D(s) ? this._intPt[0] = i : a === 0 ? this._intPt[0] = new d(o) : u === 0 ? this._intPt[0] = new d(s) : l === 0 ? this._intPt[0] = new d(r) : c === 0 && (this._intPt[0] = new d(i))) : (this._isProper = !0, this._intPt[0] = this.intersection(r, i, o, s)), n.POINT_INTERSECTION);
+    return f ? this.computeCollinearIntersection(r, i, o, s) : (a === 0 || u === 0 || l === 0 || c === 0 ? (this._isProper = !1, r.equals2D(o) || r.equals2D(s) ? this._intPt[0] = r : i.equals2D(o) || i.equals2D(s) ? this._intPt[0] = i : a === 0 ? this._intPt[0] = new v(o) : u === 0 ? this._intPt[0] = new v(s) : l === 0 ? this._intPt[0] = new v(r) : c === 0 && (this._intPt[0] = new v(i))) : (this._isProper = !0, this._intPt[0] = this.intersection(r, i, o, s)), n.POINT_INTERSECTION);
   }, t.prototype.interfaces_ = function() {
     return [];
   }, t.prototype.getClass = function() {
@@ -3538,12 +3538,12 @@ Ge.prototype.getClass = function() {
   return Ge;
 };
 Ge.locatePointInRing = function() {
-  if (arguments[0] instanceof d && T(arguments[1], q)) {
-    for (var t = arguments[0], e = arguments[1], r = new Ge(t), i = new d(), o = new d(), s = 1; s < e.size(); s++)
+  if (arguments[0] instanceof v && T(arguments[1], q)) {
+    for (var t = arguments[0], e = arguments[1], r = new Ge(t), i = new v(), o = new v(), s = 1; s < e.size(); s++)
       if (e.getCoordinate(s, i), e.getCoordinate(s - 1, o), r.countSegment(i, o), r.isOnSegment())
         return r.getLocation();
     return r.getLocation();
-  } else if (arguments[0] instanceof d && arguments[1] instanceof Array) {
+  } else if (arguments[0] instanceof v && arguments[1] instanceof Array) {
     for (var a = arguments[0], u = arguments[1], l = new Ge(a), c = 1; c < u.length; c++) {
       var f = u[c], h = u[c - 1];
       if (l.countSegment(f, h), l.isOnSegment())
@@ -3577,13 +3577,13 @@ L.signedArea = function() {
     var u = arguments[0], l = u.size();
     if (l < 3)
       return 0;
-    var c = new d(), f = new d(), h = new d();
+    var c = new v(), f = new v(), h = new v();
     u.getCoordinate(0, f), u.getCoordinate(1, h);
-    var g = f.x;
-    h.x -= g;
-    for (var p = 0, v = 1; v < l - 1; v++)
-      c.y = f.y, f.x = h.x, f.y = h.y, u.getCoordinate(v + 1, h), h.x -= g, p += f.x * (c.y - h.y);
-    return p / 2;
+    var p = f.x;
+    h.x -= p;
+    for (var g = 0, m = 1; m < l - 1; m++)
+      c.y = f.y, f.x = h.x, f.y = h.y, u.getCoordinate(m + 1, h), h.x -= p, g += f.x * (c.y - h.y);
+    return g / 2;
   }
 };
 L.distanceLineLine = function(t, e, r, i) {
@@ -3612,7 +3612,7 @@ L.computeLength = function(t) {
   var e = t.size();
   if (e <= 1)
     return 0;
-  var r = 0, i = new d();
+  var r = 0, i = new v();
   t.getCoordinate(0, i);
   for (var o = i.x, s = i.y, a = 1; a < e; a++) {
     t.getCoordinate(a, i);
@@ -3713,56 +3713,56 @@ Ir.prototype.interfaces_ = function() {
 Ir.prototype.getClass = function() {
   return Ir;
 };
-var O = function() {
+var D = function() {
   var t = arguments[0];
   this._envelope = null, this._factory = null, this._SRID = null, this._userData = null, this._factory = t, this._SRID = t.getSRID();
 }, hr = { serialVersionUID: { configurable: !0 }, SORTINDEX_POINT: { configurable: !0 }, SORTINDEX_MULTIPOINT: { configurable: !0 }, SORTINDEX_LINESTRING: { configurable: !0 }, SORTINDEX_LINEARRING: { configurable: !0 }, SORTINDEX_MULTILINESTRING: { configurable: !0 }, SORTINDEX_POLYGON: { configurable: !0 }, SORTINDEX_MULTIPOLYGON: { configurable: !0 }, SORTINDEX_GEOMETRYCOLLECTION: { configurable: !0 }, geometryChangedFilter: { configurable: !0 } };
-O.prototype.isGeometryCollection = function() {
-  return this.getSortIndex() === O.SORTINDEX_GEOMETRYCOLLECTION;
+D.prototype.isGeometryCollection = function() {
+  return this.getSortIndex() === D.SORTINDEX_GEOMETRYCOLLECTION;
 };
-O.prototype.getFactory = function() {
+D.prototype.getFactory = function() {
   return this._factory;
 };
-O.prototype.getGeometryN = function(t) {
+D.prototype.getGeometryN = function(t) {
   return this;
 };
-O.prototype.getArea = function() {
+D.prototype.getArea = function() {
   return 0;
 };
-O.prototype.isRectangle = function() {
+D.prototype.isRectangle = function() {
   return !1;
 };
-O.prototype.equals = function() {
-  if (arguments[0] instanceof O) {
+D.prototype.equals = function() {
+  if (arguments[0] instanceof D) {
     var t = arguments[0];
     return t === null ? !1 : this.equalsTopo(t);
   } else if (arguments[0] instanceof Object) {
     var e = arguments[0];
-    if (!(e instanceof O))
+    if (!(e instanceof D))
       return !1;
     var r = e;
     return this.equalsExact(r);
   }
 };
-O.prototype.equalsExact = function(t) {
+D.prototype.equalsExact = function(t) {
   return this === t || this.equalsExact(t, 0);
 };
-O.prototype.geometryChanged = function() {
-  this.apply(O.geometryChangedFilter);
+D.prototype.geometryChanged = function() {
+  this.apply(D.geometryChangedFilter);
 };
-O.prototype.geometryChangedAction = function() {
+D.prototype.geometryChangedAction = function() {
   this._envelope = null;
 };
-O.prototype.equalsNorm = function(t) {
+D.prototype.equalsNorm = function(t) {
   return t === null ? !1 : this.norm().equalsExact(t.norm());
 };
-O.prototype.getLength = function() {
+D.prototype.getLength = function() {
   return 0;
 };
-O.prototype.getNumGeometries = function() {
+D.prototype.getNumGeometries = function() {
   return 1;
 };
-O.prototype.compareTo = function() {
+D.prototype.compareTo = function() {
   if (arguments.length === 1) {
     var t = arguments[0], e = t;
     return this.getSortIndex() !== e.getSortIndex() ? this.getSortIndex() - e.getSortIndex() : this.isEmpty() && e.isEmpty() ? 0 : this.isEmpty() ? -1 : e.isEmpty() ? 1 : this.compareToSameClass(t);
@@ -3771,39 +3771,39 @@ O.prototype.compareTo = function() {
     return this.getSortIndex() !== r.getSortIndex() ? this.getSortIndex() - r.getSortIndex() : this.isEmpty() && r.isEmpty() ? 0 : this.isEmpty() ? -1 : r.isEmpty() ? 1 : this.compareToSameClass(r, i);
   }
 };
-O.prototype.getUserData = function() {
+D.prototype.getUserData = function() {
   return this._userData;
 };
-O.prototype.getSRID = function() {
+D.prototype.getSRID = function() {
   return this._SRID;
 };
-O.prototype.getEnvelope = function() {
+D.prototype.getEnvelope = function() {
   return this.getFactory().toGeometry(this.getEnvelopeInternal());
 };
-O.prototype.checkNotGeometryCollection = function(t) {
-  if (t.getSortIndex() === O.SORTINDEX_GEOMETRYCOLLECTION)
+D.prototype.checkNotGeometryCollection = function(t) {
+  if (t.getSortIndex() === D.SORTINDEX_GEOMETRYCOLLECTION)
     throw new it("This method does not support GeometryCollection arguments");
 };
-O.prototype.equal = function(t, e, r) {
+D.prototype.equal = function(t, e, r) {
   return r === 0 ? t.equals(e) : t.distance(e) <= r;
 };
-O.prototype.norm = function() {
+D.prototype.norm = function() {
   var t = this.copy();
   return t.normalize(), t;
 };
-O.prototype.getPrecisionModel = function() {
+D.prototype.getPrecisionModel = function() {
   return this._factory.getPrecisionModel();
 };
-O.prototype.getEnvelopeInternal = function() {
+D.prototype.getEnvelopeInternal = function() {
   return this._envelope === null && (this._envelope = this.computeEnvelopeInternal()), new P(this._envelope);
 };
-O.prototype.setSRID = function(t) {
+D.prototype.setSRID = function(t) {
   this._SRID = t;
 };
-O.prototype.setUserData = function(t) {
+D.prototype.setUserData = function(t) {
   this._userData = t;
 };
-O.prototype.compare = function(t, e) {
+D.prototype.compare = function(t, e) {
   for (var r = t.iterator(), i = e.iterator(); r.hasNext() && i.hasNext(); ) {
     var o = r.next(), s = i.next(), a = o.compareTo(s);
     if (a !== 0)
@@ -3811,25 +3811,25 @@ O.prototype.compare = function(t, e) {
   }
   return r.hasNext() ? 1 : i.hasNext() ? -1 : 0;
 };
-O.prototype.hashCode = function() {
+D.prototype.hashCode = function() {
   return this.getEnvelopeInternal().hashCode();
 };
-O.prototype.isGeometryCollectionOrDerived = function() {
-  return this.getSortIndex() === O.SORTINDEX_GEOMETRYCOLLECTION || this.getSortIndex() === O.SORTINDEX_MULTIPOINT || this.getSortIndex() === O.SORTINDEX_MULTILINESTRING || this.getSortIndex() === O.SORTINDEX_MULTIPOLYGON;
+D.prototype.isGeometryCollectionOrDerived = function() {
+  return this.getSortIndex() === D.SORTINDEX_GEOMETRYCOLLECTION || this.getSortIndex() === D.SORTINDEX_MULTIPOINT || this.getSortIndex() === D.SORTINDEX_MULTILINESTRING || this.getSortIndex() === D.SORTINDEX_MULTIPOLYGON;
 };
-O.prototype.interfaces_ = function() {
+D.prototype.interfaces_ = function() {
   return [io, Ee, Ie];
 };
-O.prototype.getClass = function() {
-  return O;
+D.prototype.getClass = function() {
+  return D;
 };
-O.hasNonEmptyElements = function(t) {
+D.hasNonEmptyElements = function(t) {
   for (var e = 0; e < t.length; e++)
     if (!t[e].isEmpty())
       return !0;
   return !1;
 };
-O.hasNullElements = function(t) {
+D.hasNullElements = function(t) {
   for (var e = 0; e < t.length; e++)
     if (t[e] === null)
       return !0;
@@ -3865,7 +3865,7 @@ hr.SORTINDEX_GEOMETRYCOLLECTION.get = function() {
 hr.geometryChangedFilter.get = function() {
   return zo;
 };
-Object.defineProperties(O, hr);
+Object.defineProperties(D, hr);
 var zo = function() {
 };
 zo.interfaces_ = function() {
@@ -4009,7 +4009,7 @@ function ei(n) {
 }
 ei.prototype = new Error();
 ei.prototype.name = "NoSuchElementException";
-var x = function(n) {
+var S = function(n) {
   function t() {
     n.call(this), this.array_ = [], arguments[0] instanceof _t && this.addAll(arguments[0]);
   }
@@ -4105,7 +4105,7 @@ var x = function(n) {
       if (arguments[0] instanceof Array && typeof arguments[1] == "boolean") {
         var s = arguments[0], a = arguments[1];
         return this.add(s, a, !0), !0;
-      } else if (arguments[0] instanceof d && typeof arguments[1] == "boolean") {
+      } else if (arguments[0] instanceof v && typeof arguments[1] == "boolean") {
         var u = arguments[0], l = arguments[1];
         if (!l && this.size() >= 1) {
           var c = this.get(this.size() - 1);
@@ -4119,25 +4119,25 @@ var x = function(n) {
       }
     } else if (arguments.length === 3) {
       if (typeof arguments[2] == "boolean" && arguments[0] instanceof Array && typeof arguments[1] == "boolean") {
-        var g = arguments[0], p = arguments[1], v = arguments[2];
-        if (v)
-          for (var m = 0; m < g.length; m++)
-            i.add(g[m], p);
+        var p = arguments[0], g = arguments[1], m = arguments[2];
+        if (m)
+          for (var d = 0; d < p.length; d++)
+            i.add(p[d], g);
         else
-          for (var E = g.length - 1; E >= 0; E--)
-            i.add(g[E], p);
+          for (var E = p.length - 1; E >= 0; E--)
+            i.add(p[E], g);
         return !0;
-      } else if (typeof arguments[2] == "boolean" && Number.isInteger(arguments[0]) && arguments[1] instanceof d) {
-        var I = arguments[0], C = arguments[1], S = arguments[2];
-        if (!S) {
-          var D = this.size();
-          if (D > 0) {
+      } else if (typeof arguments[2] == "boolean" && Number.isInteger(arguments[0]) && arguments[1] instanceof v) {
+        var I = arguments[0], C = arguments[1], x = arguments[2];
+        if (!x) {
+          var R = this.size();
+          if (R > 0) {
             if (I > 0) {
-              var R = this.get(I - 1);
-              if (R.equals2D(C))
+              var O = this.get(I - 1);
+              if (O.equals2D(C))
                 return null;
             }
-            if (I < D) {
+            if (I < R) {
               var F = this.get(I);
               if (F.equals2D(C))
                 return null;
@@ -4154,13 +4154,13 @@ var x = function(n) {
       return !0;
     }
   }, t.prototype.closeRing = function() {
-    this.size() > 0 && this.add(new d(this.get(0)), !1);
+    this.size() > 0 && this.add(new v(this.get(0)), !1);
   }, t.prototype.interfaces_ = function() {
     return [];
   }, t.prototype.getClass = function() {
     return t;
   }, Object.defineProperties(t, e), t;
-}(x), z = function() {
+}(S), z = function() {
 }, so = { ForwardComparator: { configurable: !0 }, BidirectionalComparator: { configurable: !0 }, coordArrayType: { configurable: !0 } };
 so.ForwardComparator.get = function() {
   return gi;
@@ -4254,11 +4254,11 @@ z.removeNull = function(t) {
 z.copyDeep = function() {
   if (arguments.length === 1) {
     for (var t = arguments[0], e = new Array(t.length).fill(null), r = 0; r < t.length; r++)
-      e[r] = new d(t[r]);
+      e[r] = new v(t[r]);
     return e;
   } else if (arguments.length === 5)
     for (var i = arguments[0], o = arguments[1], s = arguments[2], a = arguments[3], u = arguments[4], l = 0; l < u; l++)
-      s[a + l] = new d(i[o + l]);
+      s[a + l] = new v(i[o + l]);
 };
 z.isEqualReversed = function(t, e) {
   for (var r = 0; r < t.length; r++) {
@@ -4525,7 +4525,7 @@ At.prototype.fixAfterInsertion = function(n) {
   this.root_.color = yr;
 };
 At.prototype.values = function() {
-  var n = new x(), t = this.getFirstEntry();
+  var n = new S(), t = this.getFirstEntry();
   if (t !== null)
     for (n.add(t.value); (t = At.successor(t)) !== null; )
       n.add(t.value);
@@ -4667,7 +4667,7 @@ Wr.sort = function() {
       t.push(s[e]);
 };
 Wr.asList = function(t) {
-  for (var e = new x(), r = 0, i = t.length; r < i; r++)
+  for (var e = new S(), r = 0, i = t.length; r < i; r++)
     e.add(t[r]);
   return e;
 };
@@ -4847,13 +4847,13 @@ var Xt = function(n) {
       var o = arguments[0], s = new ze(Wr.asList(this._geometries)), a = new ze(Wr.asList(o._geometries));
       return this.compare(s, a);
     } else if (arguments.length === 2) {
-      for (var u = arguments[0], l = arguments[1], c = u, f = this.getNumGeometries(), h = c.getNumGeometries(), g = 0; g < f && g < h; ) {
-        var p = i.getGeometryN(g), v = c.getGeometryN(g), m = p.compareToSameClass(v, l);
-        if (m !== 0)
-          return m;
-        g++;
+      for (var u = arguments[0], l = arguments[1], c = u, f = this.getNumGeometries(), h = c.getNumGeometries(), p = 0; p < f && p < h; ) {
+        var g = i.getGeometryN(p), m = c.getGeometryN(p), d = g.compareToSameClass(m, l);
+        if (d !== 0)
+          return d;
+        p++;
       }
-      return g < f ? 1 : g < h ? -1 : 0;
+      return p < f ? 1 : p < h ? -1 : 0;
     }
   }, t.prototype.apply = function() {
     var i = this;
@@ -4904,14 +4904,14 @@ var Xt = function(n) {
   }, e.serialVersionUID.get = function() {
     return -5694727726395021e3;
   }, Object.defineProperties(t, e), t;
-}(O), Qr = function(n) {
+}(D), Qr = function(n) {
   function t() {
     n.apply(this, arguments);
   }
   n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t;
   var e = { serialVersionUID: { configurable: !0 } };
   return t.prototype.getSortIndex = function() {
-    return O.SORTINDEX_MULTILINESTRING;
+    return D.SORTINDEX_MULTILINESTRING;
   }, t.prototype.equalsExact = function() {
     if (arguments.length === 2) {
       var i = arguments[0], o = arguments[1];
@@ -4980,7 +4980,7 @@ ge.prototype.getEmptyMultiPoint = function() {
   return this._geomFact.createMultiPoint();
 };
 ge.prototype.computeBoundaryCoordinates = function(t) {
-  var e = this, r = new x();
+  var e = this, r = new S();
   this._endpointMap = new At();
   for (var i = 0; i < t.getNumGeometries(); i++) {
     var o = t.getGeometryN(i);
@@ -5066,7 +5066,7 @@ de.getStackTrace = function() {
   }
 };
 de.split = function(t, e) {
-  for (var r = e.length, i = new x(), o = "" + t, s = o.indexOf(e); s >= 0; ) {
+  for (var r = e.length, i = new S(), o = "" + t, s = o.indexOf(e); s >= 0; ) {
     var a = o.substring(0, s);
     i.add(a), o = o.substring(s + r), s = o.indexOf(e);
   }
@@ -5297,7 +5297,7 @@ var ut = function(n) {
   }, e.serialVersionUID.get = function() {
     return 3110669828065365500;
   }, Object.defineProperties(t, e), t;
-}(O), vi = function() {
+}(D), vi = function() {
 };
 vi.prototype.interfaces_ = function() {
   return [];
@@ -5395,7 +5395,7 @@ var te = function(n) {
   }, e.serialVersionUID.get = function() {
     return 4902022702746615e3;
   }, Object.defineProperties(t, e), t;
-}(O), Tr = function() {
+}(D), Tr = function() {
 };
 Tr.prototype.interfaces_ = function() {
   return [];
@@ -5445,10 +5445,10 @@ var Nt = function(n) {
         return !1;
     }
     for (var l = i.getX(0), c = i.getY(0), f = 1; f <= 4; f++) {
-      var h = i.getX(f), g = i.getY(f), p = h !== l, v = g !== c;
-      if (p === v)
+      var h = i.getX(f), p = i.getY(f), g = h !== l, m = p !== c;
+      if (g === m)
         return !1;
-      l = h, c = g;
+      l = h, c = p;
     }
     return !0;
   }, t.prototype.equalsExact = function() {
@@ -5514,16 +5514,16 @@ var Nt = function(n) {
       var o = arguments[0], s = this._shell, a = o._shell;
       return s.compareToSameClass(a);
     } else if (arguments.length === 2) {
-      var u = arguments[0], l = arguments[1], c = u, f = this._shell, h = c._shell, g = f.compareToSameClass(h, l);
-      if (g !== 0)
-        return g;
-      for (var p = this.getNumInteriorRing(), v = c.getNumInteriorRing(), m = 0; m < p && m < v; ) {
-        var E = i.getInteriorRingN(m), I = c.getInteriorRingN(m), C = E.compareToSameClass(I, l);
+      var u = arguments[0], l = arguments[1], c = u, f = this._shell, h = c._shell, p = f.compareToSameClass(h, l);
+      if (p !== 0)
+        return p;
+      for (var g = this.getNumInteriorRing(), m = c.getNumInteriorRing(), d = 0; d < g && d < m; ) {
+        var E = i.getInteriorRingN(d), I = c.getInteriorRingN(d), C = E.compareToSameClass(I, l);
         if (C !== 0)
           return C;
-        m++;
+        d++;
       }
-      return m < p ? 1 : m < v ? -1 : 0;
+      return d < g ? 1 : d < m ? -1 : 0;
     }
   }, t.prototype.apply = function(i) {
     var o = this;
@@ -5577,14 +5577,14 @@ var Nt = function(n) {
   }, e.serialVersionUID.get = function() {
     return -3494792200821764600;
   }, Object.defineProperties(t, e), t;
-}(O), Vn = function(n) {
+}(D), Vn = function(n) {
   function t() {
     n.apply(this, arguments);
   }
   n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t;
   var e = { serialVersionUID: { configurable: !0 } };
   return t.prototype.getSortIndex = function() {
-    return O.SORTINDEX_MULTIPOINT;
+    return D.SORTINDEX_MULTIPOINT;
   }, t.prototype.isValid = function() {
     return !0;
   }, t.prototype.equalsExact = function() {
@@ -5620,12 +5620,12 @@ var Nt = function(n) {
   }, Object.defineProperties(t, e), t;
 }(Xt), ir = function(n) {
   function t(r, i) {
-    r instanceof d && i instanceof k && (r = i.getCoordinateSequenceFactory().create(r)), n.call(this, r, i), this.validateConstruction();
+    r instanceof v && i instanceof k && (r = i.getCoordinateSequenceFactory().create(r)), n.call(this, r, i), this.validateConstruction();
   }
   n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t;
   var e = { MINIMUM_VALID_SIZE: { configurable: !0 }, serialVersionUID: { configurable: !0 } };
   return t.prototype.getSortIndex = function() {
-    return O.SORTINDEX_LINEARRING;
+    return D.SORTINDEX_LINEARRING;
   }, t.prototype.getBoundaryDimension = function() {
     return Y.FALSE;
   }, t.prototype.isClosed = function() {
@@ -5660,7 +5660,7 @@ var Nt = function(n) {
   n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t;
   var e = { serialVersionUID: { configurable: !0 } };
   return t.prototype.getSortIndex = function() {
-    return O.SORTINDEX_MULTIPOLYGON;
+    return D.SORTINDEX_MULTIPOLYGON;
   }, t.prototype.equalsExact = function() {
     if (arguments.length === 2) {
       var i = arguments[0], o = arguments[1];
@@ -5679,7 +5679,7 @@ var Nt = function(n) {
     var i = this;
     if (this.isEmpty())
       return this.getFactory().createMultiLineString();
-    for (var o = new x(), s = 0; s < this._geometries.length; s++)
+    for (var o = new S(), s = 0; s < this._geometries.length; s++)
       for (var a = i._geometries[s], u = a.getBoundary(), l = 0; l < u.getNumGeometries(); l++)
         o.add(u.getGeometryN(l));
     var c = new Array(o.size()).fill(null);
@@ -5713,7 +5713,7 @@ me.prototype.editInternal = function(t, e) {
   return this._factory === null && (this._factory = t.getFactory()), t instanceof Xt ? this.editGeometryCollection(t, e) : t instanceof Nt ? this.editPolygon(t, e) : t instanceof te ? e.edit(t, this._factory) : t instanceof ut ? e.edit(t, this._factory) : (V.shouldNeverReachHere("Unsupported Geometry class: " + t.getClass().getName()), null);
 };
 me.prototype.editGeometryCollection = function(t, e) {
-  for (var r = this, i = e.edit(t, this._factory), o = new x(), s = 0; s < i.getNumGeometries(); s++) {
+  for (var r = this, i = e.edit(t, this._factory), o = new S(), s = 0; s < i.getNumGeometries(); s++) {
     var a = r.edit(i.getGeometryN(s), e);
     a === null || a.isEmpty() || o.add(a);
   }
@@ -5726,7 +5726,7 @@ me.prototype.editPolygon = function(t, e) {
   var o = this.edit(i.getExteriorRing(), e);
   if (o === null || o.isEmpty())
     return this._factory.createPolygon();
-  for (var s = new x(), a = 0; a < i.getNumInteriorRing(); a++) {
+  for (var s = new S(), a = 0; a < i.getNumInteriorRing(); a++) {
     var u = r.edit(i.getInteriorRingN(a), e);
     u === null || u.isEmpty() || s.add(u);
   }
@@ -5793,7 +5793,7 @@ var ht = function() {
       var e = arguments[0];
       this._coordinates = new Array(e).fill(null);
       for (var r = 0; r < e; r++)
-        t._coordinates[r] = new d();
+        t._coordinates[r] = new v();
     } else if (T(arguments[0], q)) {
       var i = arguments[0];
       if (i === null)
@@ -5810,7 +5810,7 @@ var ht = function() {
       var u = arguments[0], l = arguments[1];
       this._coordinates = new Array(u).fill(null), this._dimension = l;
       for (var c = 0; c < u; c++)
-        t._coordinates[c] = new d();
+        t._coordinates[c] = new v();
     }
   }
 }, oa = { serialVersionUID: { configurable: !0 } };
@@ -5853,7 +5853,7 @@ ht.prototype.getCoordinate = function() {
   }
 };
 ht.prototype.getCoordinateCopy = function(t) {
-  return new d(this._coordinates[t]);
+  return new v(this._coordinates[t]);
 };
 ht.prototype.getDimension = function() {
   return this._dimension;
@@ -5947,7 +5947,7 @@ var sa = function(n) {
   }, t.prototype.put = function(r, i) {
     return this.map_.set(r, i), i;
   }, t.prototype.values = function() {
-    for (var r = new x(), i = this.map_.values(), o = i.next(); !o.done; )
+    for (var r = new S(), i = this.map_.values(), o = i.next(); !o.done; )
       r.add(o.value), o = i.next();
     return r;
   }, t.prototype.entrySet = function() {
@@ -6007,7 +6007,7 @@ W.prototype.makePrecise = function() {
       return e;
     }
     return this._modelType === W.FIXED ? Math.round(t * this._scale) / this._scale : t;
-  } else if (arguments[0] instanceof d) {
+  } else if (arguments[0] instanceof v) {
     var r = arguments[0];
     if (this._modelType === W.FLOATING)
       return null;
@@ -6067,7 +6067,7 @@ var k = function n() {
   this._precisionModel = new W(), this._SRID = 0, this._coordinateSequenceFactory = n.getDefaultCoordinateSequenceFactory(), arguments.length === 0 || (arguments.length === 1 ? T(arguments[0], Tn) ? this._coordinateSequenceFactory = arguments[0] : arguments[0] instanceof W && (this._precisionModel = arguments[0]) : arguments.length === 2 ? (this._precisionModel = arguments[0], this._SRID = arguments[1]) : arguments.length === 3 && (this._precisionModel = arguments[0], this._SRID = arguments[1], this._coordinateSequenceFactory = arguments[2]));
 }, aa = { serialVersionUID: { configurable: !0 } };
 k.prototype.toGeometry = function(t) {
-  return t.isNull() ? this.createPoint(null) : t.getMinX() === t.getMaxX() && t.getMinY() === t.getMaxY() ? this.createPoint(new d(t.getMinX(), t.getMinY())) : t.getMinX() === t.getMaxX() || t.getMinY() === t.getMaxY() ? this.createLineString([new d(t.getMinX(), t.getMinY()), new d(t.getMaxX(), t.getMaxY())]) : this.createPolygon(this.createLinearRing([new d(t.getMinX(), t.getMinY()), new d(t.getMinX(), t.getMaxY()), new d(t.getMaxX(), t.getMaxY()), new d(t.getMaxX(), t.getMinY()), new d(t.getMinX(), t.getMinY())]), null);
+  return t.isNull() ? this.createPoint(null) : t.getMinX() === t.getMaxX() && t.getMinY() === t.getMaxY() ? this.createPoint(new v(t.getMinX(), t.getMinY())) : t.getMinX() === t.getMaxX() || t.getMinY() === t.getMaxY() ? this.createLineString([new v(t.getMinX(), t.getMinY()), new v(t.getMaxX(), t.getMaxY())]) : this.createPolygon(this.createLinearRing([new v(t.getMinX(), t.getMinY()), new v(t.getMinX(), t.getMaxY()), new v(t.getMaxX(), t.getMaxY()), new v(t.getMaxX(), t.getMinY()), new v(t.getMinX(), t.getMinY())]), null);
 };
 k.prototype.createLineString = function(t) {
   if (t) {
@@ -6114,7 +6114,7 @@ k.prototype.createPoint = function() {
   if (arguments.length === 0)
     return this.createPoint(this.getCoordinateSequenceFactory().create([]));
   if (arguments.length === 1) {
-    if (arguments[0] instanceof d) {
+    if (arguments[0] instanceof v) {
       var t = arguments[0];
       return this.createPoint(t !== null ? this.getCoordinateSequenceFactory().create([t]) : null);
     } else if (T(arguments[0], q)) {
@@ -6330,7 +6330,7 @@ var Fe = {
   coordinates: function(n) {
     for (var t = [], e = 0; e < n.length; ++e) {
       var r = n[e];
-      t.push(new d(r[0], r[1]));
+      t.push(new v(r[0], r[1]));
     }
     return t;
   },
@@ -6344,11 +6344,11 @@ var Fe = {
    */
   bbox: function(n) {
     return this.geometryFactory.createLinearRing([
-      new d(n[0], n[1]),
-      new d(n[2], n[1]),
-      new d(n[2], n[3]),
-      new d(n[0], n[3]),
-      new d(n[0], n[1])
+      new v(n[0], n[1]),
+      new v(n[2], n[1]),
+      new v(n[2], n[3]),
+      new v(n[0], n[3]),
+      new v(n[0], n[1])
     ]);
   },
   /**
@@ -6360,7 +6360,7 @@ var Fe = {
    * @return {Point} Point.
    */
   Point: function(n) {
-    var t = new d(n[0], n[1]);
+    var t = new v(n[0], n[1]);
     return this.geometryFactory.createPoint(t);
   },
   /**
@@ -6726,7 +6726,7 @@ Xe.prototype.getClass = function() {
 };
 var Cr = function(n) {
   function t(e, r) {
-    n.call(this, t.msgWithCoord(e, r)), this.pt = r ? new d(r) : null, this.name = "TopologyException";
+    n.call(this, t.msgWithCoord(e, r)), this.pt = r ? new v(r) : null, this.name = "TopologyException";
   }
   return n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t, t.prototype.getCoordinate = function() {
     return this.pt;
@@ -6750,7 +6750,7 @@ po.prototype.isEmpty = function() {
   return this.array_.length === 0;
 };
 var Yt = function() {
-  this._finder = null, this._dirEdgeList = new x(), this._nodes = new x(), this._rightMostCoord = null, this._env = null, this._finder = new Xe();
+  this._finder = null, this._dirEdgeList = new S(), this._nodes = new S(), this._rightMostCoord = null, this._env = null, this._finder = new Xe();
 };
 Yt.prototype.clearVisitedEdges = function() {
   for (var t = this._dirEdgeList.iterator(); t.hasNext(); ) {
@@ -7055,7 +7055,7 @@ Q.toLineLabel = function(t) {
   return e;
 };
 var mt = function() {
-  this._startDe = null, this._maxNodeDegree = -1, this._edges = new x(), this._pts = new x(), this._label = new Q(y.NONE), this._ring = null, this._isHole = null, this._shell = null, this._holes = new x(), this._geometryFactory = null;
+  this._startDe = null, this._maxNodeDegree = -1, this._edges = new S(), this._pts = new S(), this._label = new Q(y.NONE), this._ring = null, this._isHole = null, this._shell = null, this._holes = new S(), this._geometryFactory = null;
   var t = arguments[0], e = arguments[1];
   this._geometryFactory = e, this.computePoints(t), this.computeRing();
 };
@@ -7199,7 +7199,7 @@ var Hu = function(n) {
     n.call(this, e, r);
   }
   return n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t, t.prototype.buildMinimalRings = function() {
-    var r = this, i = new x(), o = this._startDe;
+    var r = this, i = new S(), o = this._startDe;
     do {
       if (o.getMinEdgeRing() === null) {
         var s = new Hu(o, r._geometryFactory);
@@ -7346,7 +7346,7 @@ Ye.prototype.find = function(t) {
   return this.nodeMap.get(t);
 };
 Ye.prototype.addNode = function() {
-  if (arguments[0] instanceof d) {
+  if (arguments[0] instanceof v) {
     var t = arguments[0], e = this.nodeMap.get(t);
     return e === null && (e = this.nodeFact.createNode(t), this.nodeMap.put(t, e)), e;
   } else if (arguments[0] instanceof go) {
@@ -7367,7 +7367,7 @@ Ye.prototype.values = function() {
   return this.nodeMap.values();
 };
 Ye.prototype.getBoundaryNodes = function(t) {
-  for (var e = new x(), r = this.iterator(); r.hasNext(); ) {
+  for (var e = new S(), r = this.iterator(); r.hasNext(); ) {
     var i = r.next();
     i.getLabel().getLocation(t) === y.BOUNDARY && e.add(i);
   }
@@ -7418,7 +7418,7 @@ J.quadrant = function() {
     if (t === 0 && e === 0)
       throw new it("Cannot compute the quadrant for point ( " + t + ", " + e + " )");
     return t >= 0 ? e >= 0 ? J.NE : J.SE : e >= 0 ? J.NW : J.SW;
-  } else if (arguments[0] instanceof d && arguments[1] instanceof d) {
+  } else if (arguments[0] instanceof v && arguments[1] instanceof v) {
     var r = arguments[0], i = arguments[1];
     if (i.x === r.x && i.y === r.y)
       throw new it("Cannot compute the quadrant for two identical points " + r);
@@ -7596,7 +7596,7 @@ kn.prototype.getClass = function() {
   return kn;
 };
 var st = function() {
-  if (this._edges = new x(), this._nodes = null, this._edgeEndList = new x(), arguments.length === 0)
+  if (this._edges = new S(), this._nodes = null, this._edgeEndList = new S(), arguments.length === 0)
     this._nodes = new Ye(new kn());
   else if (arguments.length === 1) {
     var t = arguments[0];
@@ -7619,7 +7619,7 @@ st.prototype.addNode = function() {
   if (arguments[0] instanceof go) {
     var t = arguments[0];
     return this._nodes.addNode(t);
-  } else if (arguments[0] instanceof d) {
+  } else if (arguments[0] instanceof v) {
     var e = arguments[0];
     return this._nodes.addNode(e);
   }
@@ -7715,7 +7715,7 @@ st.linkResultDirectedEdges = function(t) {
   }
 };
 var ee = function() {
-  this._geometryFactory = null, this._shellList = new x();
+  this._geometryFactory = null, this._shellList = new S();
   var t = arguments[0];
   this._geometryFactory = t;
 };
@@ -7726,7 +7726,7 @@ ee.prototype.sortShellsAndHoles = function(t, e, r) {
   }
 };
 ee.prototype.computePolygons = function(t) {
-  for (var e = this, r = new x(), i = t.iterator(); i.hasNext(); ) {
+  for (var e = this, r = new S(), i = t.iterator(); i.hasNext(); ) {
     var o = i.next(), s = o.toPolygon(e._geometryFactory);
     r.add(s);
   }
@@ -7744,7 +7744,7 @@ ee.prototype.placeFreeHoles = function(t, e) {
   }
 };
 ee.prototype.buildMinimalEdgeRings = function(t, e, r) {
-  for (var i = this, o = new x(), s = t.iterator(); s.hasNext(); ) {
+  for (var i = this, o = new S(), s = t.iterator(); s.hasNext(); ) {
     var a = s.next();
     if (a.getMaxNodeDegree() > 2) {
       a.linkDirectedEdgesForMinimalEdgeRings();
@@ -7764,7 +7764,7 @@ ee.prototype.containsPoint = function(t) {
   return !1;
 };
 ee.prototype.buildMaximalEdgeRings = function(t) {
-  for (var e = this, r = new x(), i = t.iterator(); i.hasNext(); ) {
+  for (var e = this, r = new S(), i = t.iterator(); i.hasNext(); ) {
     var o = i.next();
     if (o.isInResult() && o.getLabel().isArea() && o.getEdgeRing() === null) {
       var s = new Wu(o, e._geometryFactory);
@@ -7806,7 +7806,7 @@ ee.prototype.add = function() {
   } else if (arguments.length === 2) {
     var e = arguments[0], r = arguments[1];
     st.linkResultDirectedEdges(r);
-    var i = this.buildMaximalEdgeRings(e), o = new x(), s = this.buildMinimalEdgeRings(i, this._shellList, o);
+    var i = this.buildMaximalEdgeRings(e), o = new S(), s = this.buildMinimalEdgeRings(i, this._shellList, o);
     this.sortShellsAndHoles(s, this._shellList, o), this.placeFreeHoles(this._shellList, o);
   }
 };
@@ -7844,7 +7844,7 @@ Le.prototype.getClass = function() {
   return Le;
 };
 var Nr = function() {
-  this._size = null, this._items = null, this._size = 0, this._items = new x(), this._items.add(null);
+  this._size = null, this._items = null, this._size = 0, this._items = new S(), this._items.add(null);
 };
 Nr.prototype.poll = function() {
   if (this.isEmpty())
@@ -7905,7 +7905,7 @@ fn.prototype.getClass = function() {
   return fn;
 };
 var Ct = function() {
-  if (this._childBoundables = new x(), this._bounds = null, this._level = null, arguments.length !== 0) {
+  if (this._childBoundables = new S(), this._bounds = null, this._level = null, arguments.length !== 0) {
     if (arguments.length === 1) {
       var t = arguments[0];
       this._level = t;
@@ -7959,7 +7959,7 @@ we.sort = function(t, e) {
     i.next(), i.set(r[o]);
 };
 we.singletonList = function(t) {
-  var e = new x();
+  var e = new S();
   return e.add(t), e;
 };
 var vt = function() {
@@ -8012,7 +8012,7 @@ vt.isComposite = function(t) {
   return t instanceof Ct;
 };
 var xt = function n() {
-  if (this._root = null, this._built = !1, this._itemBoundables = new x(), this._nodeCapacity = null, arguments.length === 0) {
+  if (this._root = null, this._built = !1, this._itemBoundables = new S(), this._nodeCapacity = null, arguments.length === 0) {
     var t = n.DEFAULT_NODE_CAPACITY;
     this._nodeCapacity = t;
   } else if (arguments.length === 1) {
@@ -8050,9 +8050,9 @@ xt.prototype.itemsTree = function() {
   if (arguments.length === 0) {
     this.build();
     var e = this.itemsTree(this._root);
-    return e === null ? new x() : e;
+    return e === null ? new S() : e;
   } else if (arguments.length === 1) {
-    for (var r = arguments[0], i = new x(), o = r.getChildBoundables().iterator(); o.hasNext(); ) {
+    for (var r = arguments[0], i = new S(), o = r.getChildBoundables().iterator(); o.hasNext(); ) {
       var s = o.next();
       if (s instanceof Ct) {
         var a = t.itemsTree(s);
@@ -8069,7 +8069,7 @@ xt.prototype.insert = function(t, e) {
 xt.prototype.boundablesAtLevel = function() {
   var t = this;
   if (arguments.length === 1) {
-    var e = arguments[0], r = new x();
+    var e = arguments[0], r = new S();
     return this.boundablesAtLevel(e, this._root, r), r;
   } else if (arguments.length === 3) {
     var i = arguments[0], o = arguments[1], s = arguments[2];
@@ -8087,7 +8087,7 @@ xt.prototype.query = function() {
   if (arguments.length === 1) {
     var e = arguments[0];
     this.build();
-    var r = new x();
+    var r = new S();
     return this.isEmpty() || this.getIntersectsOp().intersects(this._root.getBounds(), e) && this.query(e, this._root, r), r;
   } else if (arguments.length === 2) {
     var i = arguments[0], o = arguments[1];
@@ -8101,9 +8101,9 @@ xt.prototype.query = function() {
         t.getIntersectsOp().intersects(f.getBounds(), s) && (f instanceof Ct ? t.query(s, f, u) : f instanceof Le ? u.visitItem(f.getItem()) : V.shouldNeverReachHere());
       }
     else if (T(arguments[2], Ne) && arguments[0] instanceof Object && arguments[1] instanceof Ct)
-      for (var h = arguments[0], g = arguments[1], p = arguments[2], v = g.getChildBoundables(), m = 0; m < v.size(); m++) {
-        var E = v.get(m);
-        t.getIntersectsOp().intersects(E.getBounds(), h) && (E instanceof Ct ? t.query(h, E, p) : E instanceof Le ? p.add(E.getItem()) : V.shouldNeverReachHere());
+      for (var h = arguments[0], p = arguments[1], g = arguments[2], m = p.getChildBoundables(), d = 0; d < m.size(); d++) {
+        var E = m.get(d);
+        t.getIntersectsOp().intersects(E.getBounds(), h) && (E instanceof Ct ? t.query(h, E, g) : E instanceof Le ? g.add(E.getItem()) : V.shouldNeverReachHere());
       }
   }
 };
@@ -8157,9 +8157,9 @@ xt.prototype.depth = function() {
 xt.prototype.createParentBoundables = function(t, e) {
   var r = this;
   V.isTrue(!t.isEmpty());
-  var i = new x();
+  var i = new S();
   i.add(this.createNode(e));
-  var o = new x(t);
+  var o = new S(t);
   we.sort(o, this.getComparator());
   for (var s = o.iterator(); s.hasNext(); ) {
     var a = s.next();
@@ -8209,7 +8209,7 @@ var ca = function(n) {
   return t.prototype.createParentBoundablesFromVerticalSlices = function(i, o) {
     var s = this;
     V.isTrue(i.length > 0);
-    for (var a = new x(), u = 0; u < i.length; u++)
+    for (var a = new S(), u = 0; u < i.length; u++)
       a.addAll(s.createParentBoundablesFromVerticalSlice(i[u], o));
     return a;
   }, t.prototype.createNode = function(i) {
@@ -8228,7 +8228,7 @@ var ca = function(n) {
     return t.intersectsOp;
   }, t.prototype.verticalSlices = function(i, o) {
     for (var s = Math.trunc(Math.ceil(i.size() / o)), a = new Array(o).fill(null), u = i.iterator(), l = 0; l < o; l++) {
-      a[l] = new x();
+      a[l] = new S();
       for (var c = 0; u.hasNext() && c < s; ) {
         var f = u.next();
         a[l].add(f), c++;
@@ -8265,7 +8265,7 @@ var ca = function(n) {
     return arguments.length === 0 ? n.prototype.depth.call(this) : n.prototype.depth.apply(this, arguments);
   }, t.prototype.createParentBoundables = function(i, o) {
     V.isTrue(!i.isEmpty());
-    var s = Math.trunc(Math.ceil(i.size() / this.getNodeCapacity())), a = new x(i);
+    var s = Math.trunc(Math.ceil(i.size() / this.getNodeCapacity())), a = new S(i);
     we.sort(a, t.xComparator);
     var u = this.verticalSlices(a, Math.trunc(Math.ceil(Math.sqrt(s))));
     return this.createParentBoundablesFromVerticalSlices(u, o);
@@ -8283,18 +8283,18 @@ var ca = function(n) {
         var a = arguments[0], u = arguments[1], l = new vt(this.getRoot(), a.getRoot(), u);
         return this.nearestNeighbour(l);
       } else if (arguments[0] instanceof vt && typeof arguments[1] == "number") {
-        var c = arguments[0], f = arguments[1], h = f, g = null, p = new Nr();
-        for (p.add(c); !p.isEmpty() && h > 0; ) {
-          var v = p.poll(), m = v.getDistance();
-          if (m >= h)
+        var c = arguments[0], f = arguments[1], h = f, p = null, g = new Nr();
+        for (g.add(c); !g.isEmpty() && h > 0; ) {
+          var m = g.poll(), d = m.getDistance();
+          if (d >= h)
             break;
-          v.isLeaves() ? (h = m, g = v) : v.expandToQueue(p, h);
+          m.isLeaves() ? (h = d, p = m) : m.expandToQueue(g, h);
         }
-        return [g.getBoundable(0).getItem(), g.getBoundable(1).getItem()];
+        return [p.getBoundable(0).getItem(), p.getBoundable(1).getItem()];
       }
     } else if (arguments.length === 3) {
-      var E = arguments[0], I = arguments[1], C = arguments[2], S = new Le(E, I), D = new vt(this.getRoot(), S, C);
-      return this.nearestNeighbour(D)[0];
+      var E = arguments[0], I = arguments[1], C = arguments[2], x = new Le(E, I), R = new vt(this.getRoot(), x, C);
+      return this.nearestNeighbour(R)[0];
     }
   }, t.prototype.interfaces_ = function() {
     return [fn, Ie];
@@ -8397,7 +8397,7 @@ jt.compareValue = function(t, e) {
 var Ar = function() {
   this._segString = null, this.coord = null, this.segmentIndex = null, this._segmentOctant = null, this._isInterior = null;
   var t = arguments[0], e = arguments[1], r = arguments[2], i = arguments[3];
-  this._segString = t, this.coord = new d(e), this.segmentIndex = r, this._segmentOctant = i, this._isInterior = !e.equals2D(t.getCoordinate(r));
+  this._segString = t, this.coord = new v(e), this.segmentIndex = r, this._segmentOctant = i, this._isInterior = !e.equals2D(t.getCoordinate(r));
 };
 Ar.prototype.getCoordinate = function() {
   return this.coord;
@@ -8436,7 +8436,7 @@ Ht.prototype.getSplitCoordinates = function() {
   return e.toCoordinateArray();
 };
 Ht.prototype.addCollapsedNodes = function() {
-  var t = this, e = new x();
+  var t = this, e = new S();
   this.findCollapsesFromInsertedNodes(e), this.findCollapsesFromExistingVertices(e);
   for (var r = e.iterator(); r.hasNext(); ) {
     var i = r.next().intValue();
@@ -8458,10 +8458,10 @@ Ht.prototype.findCollapsesFromExistingVertices = function(t) {
 };
 Ht.prototype.addEdgeCoordinates = function(t, e, r) {
   var i = this, o = this._edge.getCoordinate(e.segmentIndex), s = e.isInterior() || !e.coord.equals2D(o);
-  r.add(new d(t.coord), !1);
+  r.add(new v(t.coord), !1);
   for (var a = t.segmentIndex + 1; a <= e.segmentIndex; a++)
     r.add(i._edge.getCoordinate(a));
-  s && r.add(new d(e.coord));
+  s && r.add(new v(e.coord));
 };
 Ht.prototype.iterator = function() {
   return this._nodeMap.values().iterator();
@@ -8497,10 +8497,10 @@ Ht.prototype.createSplitEdge = function(t, e) {
   var r = this, i = e.segmentIndex - t.segmentIndex + 2, o = this._edge.getCoordinate(e.segmentIndex), s = e.isInterior() || !e.coord.equals2D(o);
   s || i--;
   var a = new Array(i).fill(null), u = 0;
-  a[u++] = new d(t.coord);
+  a[u++] = new v(t.coord);
   for (var l = t.segmentIndex + 1; l <= e.segmentIndex; l++)
     a[u++] = r._edge.getCoordinate(l);
-  return s && (a[u] = new d(e.coord)), new dt(a, this._edge.getData());
+  return s && (a[u] = new v(e.coord)), new dt(a, this._edge.getData());
 };
 Ht.prototype.add = function(t, e) {
   var r = new Ar(this._edge, t, e, this._edge.getSegmentOctant(e)), i = this._nodeMap.get(r);
@@ -8535,7 +8535,7 @@ hn.octant = function() {
       throw new it("Cannot compute the octant for point ( " + t + ", " + e + " )");
     var r = Math.abs(t), i = Math.abs(e);
     return t >= 0 ? e >= 0 ? r >= i ? 0 : 1 : r >= i ? 7 : 6 : e >= 0 ? r >= i ? 3 : 2 : r >= i ? 4 : 5;
-  } else if (arguments[0] instanceof d && arguments[1] instanceof d) {
+  } else if (arguments[0] instanceof v && arguments[1] instanceof v) {
     var o = arguments[0], s = arguments[1], a = s.x - o.x, u = s.y - o.y;
     if (a === 0 && u === 0)
       throw new it("Cannot compute the octant for two identical points " + o);
@@ -8606,7 +8606,7 @@ dt.prototype.addIntersection = function() {
     var t = arguments[0], e = arguments[1];
     this.addIntersectionNode(t, e);
   } else if (arguments.length === 4) {
-    var r = arguments[0], i = arguments[1], o = arguments[3], s = new d(r.getIntersection(o));
+    var r = arguments[0], i = arguments[1], o = arguments[3], s = new v(r.getIntersection(o));
     this.addIntersection(s, i);
   }
 };
@@ -8637,7 +8637,7 @@ dt.prototype.getClass = function() {
 };
 dt.getNodedSubstrings = function() {
   if (arguments.length === 1) {
-    var t = arguments[0], e = new x();
+    var t = arguments[0], e = new S();
     return dt.getNodedSubstrings(t, e), e;
   } else if (arguments.length === 2)
     for (var r = arguments[0], i = arguments[1], o = r.iterator(); o.hasNext(); ) {
@@ -8647,15 +8647,15 @@ dt.getNodedSubstrings = function() {
 };
 var b = function() {
   if (this.p0 = null, this.p1 = null, arguments.length === 0)
-    this.p0 = new d(), this.p1 = new d();
+    this.p0 = new v(), this.p1 = new v();
   else if (arguments.length === 1) {
     var t = arguments[0];
-    this.p0 = new d(t.p0), this.p1 = new d(t.p1);
+    this.p0 = new v(t.p0), this.p1 = new v(t.p1);
   } else if (arguments.length === 2)
     this.p0 = arguments[0], this.p1 = arguments[1];
   else if (arguments.length === 4) {
     var e = arguments[0], r = arguments[1], i = arguments[2], o = arguments[3];
-    this.p0 = new d(e, r), this.p1 = new d(i, o);
+    this.p0 = new v(e, r), this.p1 = new v(i, o);
   }
 }, fa = { serialVersionUID: { configurable: !0 } };
 b.prototype.minX = function() {
@@ -8665,7 +8665,7 @@ b.prototype.orientationIndex = function() {
   if (arguments[0] instanceof b) {
     var t = arguments[0], e = L.orientationIndex(this.p0, this.p1, t.p0), r = L.orientationIndex(this.p0, this.p1, t.p1);
     return e >= 0 && r >= 0 || e <= 0 && r <= 0 ? Math.max(e, r) : 0;
-  } else if (arguments[0] instanceof d) {
+  } else if (arguments[0] instanceof v) {
     var i = arguments[0];
     return L.orientationIndex(this.p0, this.p1, i);
   }
@@ -8687,11 +8687,11 @@ b.prototype.intersection = function(t) {
   return e.computeIntersection(this.p0, this.p1, t.p0, t.p1), e.hasIntersection() ? e.getIntersection(0) : null;
 };
 b.prototype.project = function() {
-  if (arguments[0] instanceof d) {
+  if (arguments[0] instanceof v) {
     var t = arguments[0];
     if (t.equals(this.p0) || t.equals(this.p1))
-      return new d(t);
-    var e = this.projectionFactor(t), r = new d();
+      return new v(t);
+    var e = this.projectionFactor(t), r = new v();
     return r.x = this.p0.x + e * (this.p1.x - this.p0.x), r.y = this.p0.y + e * (this.p1.y - this.p0.y), r;
   } else if (arguments[0] instanceof b) {
     var i = arguments[0], o = this.projectionFactor(i.p0), s = this.projectionFactor(i.p1);
@@ -8790,7 +8790,7 @@ b.prototype.pointAlongOffset = function(t, e) {
       throw new Error("Cannot compute offset from zero-length line segment");
     u = e * o / a, l = e * s / a;
   }
-  var c = r - l, f = i + u, h = new d(c, f);
+  var c = r - l, f = i + u, h = new v(c, f);
   return h;
 };
 b.prototype.setCoordinates = function() {
@@ -8816,13 +8816,13 @@ b.prototype.distance = function() {
   if (arguments[0] instanceof b) {
     var t = arguments[0];
     return L.distanceLineLine(this.p0, this.p1, t.p0, t.p1);
-  } else if (arguments[0] instanceof d) {
+  } else if (arguments[0] instanceof v) {
     var e = arguments[0];
     return L.distancePointLine(e, this.p0, this.p1);
   }
 };
 b.prototype.pointAlong = function(t) {
-  var e = new d();
+  var e = new v();
   return e.x = this.p0.x + t * (this.p1.x - this.p0.x), e.y = this.p0.y + t * (this.p1.y - this.p0.y), e;
 };
 b.prototype.hashCode = function() {
@@ -8840,7 +8840,7 @@ b.prototype.getClass = function() {
   return b;
 };
 b.midPoint = function(t, e) {
-  return new d((t.x + e.x) / 2, (t.y + e.y) / 2);
+  return new v((t.x + e.x) / 2, (t.y + e.y) / 2);
 };
 fa.serialVersionUID.get = function() {
   return 3252005833466256400;
@@ -8937,7 +8937,7 @@ Ve.prototype.getClass = function() {
   return Ve;
 };
 Ve.getChainStartIndices = function(t) {
-  var e = 0, r = new x();
+  var e = 0, r = new S();
   r.add(new ke(e));
   do {
     var i = Ve.findChainEnd(t, e);
@@ -8966,7 +8966,7 @@ Ve.getChains = function() {
     var t = arguments[0];
     return Ve.getChains(t, null);
   } else if (arguments.length === 2) {
-    for (var e = arguments[0], r = arguments[1], i = new x(), o = Ve.getChainStartIndices(e), s = 0; s < o.length - 1; s++) {
+    for (var e = arguments[0], r = arguments[1], i = new S(), o = Ve.getChainStartIndices(e), s = 0; s < o.length - 1; s++) {
       var a = new re(e, o[s], o[s + 1], r);
       i.add(a);
     }
@@ -9009,7 +9009,7 @@ Ci.prototype.getClass = function() {
 };
 var Ko = function(n) {
   function t(r) {
-    r ? n.call(this, r) : n.call(this), this._monoChains = new x(), this._index = new ca(), this._idCounter = 0, this._nodedSegStrings = null, this._nOverlaps = 0;
+    r ? n.call(this, r) : n.call(this), this._monoChains = new S(), this._index = new ca(), this._idCounter = 0, this._nodedSegStrings = null, this._nOverlaps = 0;
   }
   n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t;
   var e = { SegmentOverlapAction: { configurable: !0 } };
@@ -9229,7 +9229,7 @@ Di.NUM_PTS_TO_CHECK.get = function() {
 };
 Object.defineProperties(lt, Di);
 var ce = function() {
-  this._ptList = null, this._precisionModel = null, this._minimimVertexDistance = 0, this._ptList = new x();
+  this._ptList = null, this._precisionModel = null, this._minimimVertexDistance = 0, this._ptList = new S();
 }, ha = { COORDINATE_ARRAY_TYPE: { configurable: !0 } };
 ce.prototype.getCoordinates = function() {
   var t = this._ptList.toArray(ce.COORDINATE_ARRAY_TYPE);
@@ -9239,7 +9239,7 @@ ce.prototype.setPrecisionModel = function(t) {
   this._precisionModel = t;
 };
 ce.prototype.addPt = function(t) {
-  var e = new d(t);
+  var e = new v(t);
   if (this._precisionModel.makePrecise(e), this.isRedundant(e))
     return null;
   this._ptList.add(e);
@@ -9268,7 +9268,7 @@ ce.prototype.toString = function() {
 ce.prototype.closeRing = function() {
   if (this._ptList.size() < 1)
     return null;
-  var t = new d(this._ptList.get(0)), e = this._ptList.get(this._ptList.size() - 1);
+  var t = new v(this._ptList.get(0)), e = this._ptList.get(this._ptList.size() - 1);
   if (t.equals(e))
     return null;
   this._ptList.add(t);
@@ -9400,9 +9400,9 @@ rt.prototype.addLineEndCap = function(t, e) {
       this._segList.addPt(i.p1), this._segList.addPt(o.p1);
       break;
     case H.CAP_SQUARE:
-      var l = new d();
+      var l = new v();
       l.x = Math.abs(this._distance) * Math.cos(u), l.y = Math.abs(this._distance) * Math.sin(u);
-      var c = new d(i.p1.x + l.x, i.p1.y + l.y), f = new d(o.p1.x + l.x, o.p1.y + l.y);
+      var c = new v(i.p1.x + l.x, i.p1.y + l.y), f = new v(o.p1.x + l.x, o.p1.y + l.y);
       this._segList.addPt(c), this._segList.addPt(f);
       break;
   }
@@ -9419,7 +9419,7 @@ rt.prototype.addMitreJoin = function(t, e, r, i) {
     a > this._bufParams.getMitreLimit() && (o = !1);
   } catch (u) {
     if (u instanceof $n)
-      s = new d(0, 0), o = !1;
+      s = new v(0, 0), o = !1;
     else
       throw u;
   } finally {
@@ -9436,7 +9436,7 @@ rt.prototype.addOutsideTurn = function(t, e) {
   this._bufParams.getJoinStyle() === H.JOIN_MITRE ? this.addMitreJoin(this._s1, this._offset0, this._offset1, this._distance) : this._bufParams.getJoinStyle() === H.JOIN_BEVEL ? this.addBevelJoin(this._offset0, this._offset1) : (e && this._segList.addPt(this._offset0.p1), this.addFilletCorner(this._s1, this._offset0.p1, this._offset1.p0, t, this._distance), this._segList.addPt(this._offset1.p0));
 };
 rt.prototype.createSquare = function(t) {
-  this._segList.addPt(new d(t.x + this._distance, t.y + this._distance)), this._segList.addPt(new d(t.x + this._distance, t.y - this._distance)), this._segList.addPt(new d(t.x - this._distance, t.y - this._distance)), this._segList.addPt(new d(t.x - this._distance, t.y + this._distance)), this._segList.closeRing();
+  this._segList.addPt(new v(t.x + this._distance, t.y + this._distance)), this._segList.addPt(new v(t.x + this._distance, t.y - this._distance)), this._segList.addPt(new v(t.x - this._distance, t.y - this._distance)), this._segList.addPt(new v(t.x - this._distance, t.y + this._distance)), this._segList.closeRing();
 };
 rt.prototype.addSegments = function(t, e) {
   this._segList.addPts(t, e);
@@ -9451,7 +9451,7 @@ rt.prototype.initSideSegments = function(t, e, r) {
   this._s1 = t, this._s2 = e, this._side = r, this._seg1.setCoordinates(t, e), this.computeOffsetSegment(this._seg1, r, this._distance, this._offset1);
 };
 rt.prototype.addLimitedMitreJoin = function(t, e, r, i) {
-  var o = this._seg0.p1, s = U.angle(o, this._seg0.p0), a = U.angleBetweenOriented(this._seg0.p0, o, this._seg1.p1), u = a / 2, l = U.normalize(s + u), c = U.normalize(l + Math.PI), f = i * r, h = f * Math.abs(Math.sin(u)), g = r - h, p = o.x + f * Math.cos(c), v = o.y + f * Math.sin(c), m = new d(p, v), E = new b(o, m), I = E.pointAlongOffset(1, g), C = E.pointAlongOffset(1, -g);
+  var o = this._seg0.p1, s = U.angle(o, this._seg0.p0), a = U.angleBetweenOriented(this._seg0.p0, o, this._seg1.p1), u = a / 2, l = U.normalize(s + u), c = U.normalize(l + Math.PI), f = i * r, h = f * Math.abs(Math.sin(u)), p = r - h, g = o.x + f * Math.cos(c), m = o.y + f * Math.sin(c), d = new v(g, m), E = new b(o, d), I = E.pointAlongOffset(1, p), C = E.pointAlongOffset(1, -p);
   this._side === N.LEFT ? (this._segList.addPt(I), this._segList.addPt(C)) : (this._segList.addPt(C), this._segList.addPt(I));
 };
 rt.prototype.computeOffsetSegment = function(t, e, r, i) {
@@ -9462,9 +9462,9 @@ rt.prototype.addFilletArc = function(t, e, r, i, o) {
   var s = this, a = i === L.CLOCKWISE ? -1 : 1, u = Math.abs(e - r), l = Math.trunc(u / this._filletAngleQuantum + 0.5);
   if (l < 1)
     return null;
-  for (var c = 0, f = u / l, h = c, g = new d(); h < u; ) {
-    var p = e + a * h;
-    g.x = t.x + o * Math.cos(p), g.y = t.y + o * Math.sin(p), s._segList.addPt(g), h += f;
+  for (var c = 0, f = u / l, h = c, p = new v(); h < u; ) {
+    var g = e + a * h;
+    p.x = t.x + o * Math.cos(g), p.y = t.y + o * Math.sin(g), s._segList.addPt(p), h += f;
   }
 };
 rt.prototype.addInsideTurn = function(t, e) {
@@ -9474,9 +9474,9 @@ rt.prototype.addInsideTurn = function(t, e) {
     this._segList.addPt(this._offset0.p1);
   else {
     if (this._segList.addPt(this._offset0.p1), this._closingSegLengthFactor > 0) {
-      var r = new d((this._closingSegLengthFactor * this._offset0.p1.x + this._s1.x) / (this._closingSegLengthFactor + 1), (this._closingSegLengthFactor * this._offset0.p1.y + this._s1.y) / (this._closingSegLengthFactor + 1));
+      var r = new v((this._closingSegLengthFactor * this._offset0.p1.x + this._s1.x) / (this._closingSegLengthFactor + 1), (this._closingSegLengthFactor * this._offset0.p1.y + this._s1.y) / (this._closingSegLengthFactor + 1));
       this._segList.addPt(r);
-      var i = new d((this._closingSegLengthFactor * this._offset1.p0.x + this._s1.x) / (this._closingSegLengthFactor + 1), (this._closingSegLengthFactor * this._offset1.p0.y + this._s1.y) / (this._closingSegLengthFactor + 1));
+      var i = new v((this._closingSegLengthFactor * this._offset1.p0.x + this._s1.x) / (this._closingSegLengthFactor + 1), (this._closingSegLengthFactor * this._offset1.p0.y + this._s1.y) / (this._closingSegLengthFactor + 1));
       this._segList.addPt(i);
     } else
       this._segList.addPt(this._s1);
@@ -9484,7 +9484,7 @@ rt.prototype.addInsideTurn = function(t, e) {
   }
 };
 rt.prototype.createCircle = function(t) {
-  var e = new d(t.x + this._distance, t.y);
+  var e = new v(t.x + this._distance, t.y);
   this._segList.addPt(e), this.addFilletArc(t, 0, 2 * Math.PI, -1, this._distance), this._segList.closeRing();
 };
 rt.prototype.addBevelJoin = function(t, e) {
@@ -9640,7 +9640,7 @@ Qt.prototype.getClass = function() {
 };
 Qt.copyCoordinates = function(t) {
   for (var e = new Array(t.length).fill(null), r = 0; r < e.length; r++)
-    e[r] = new d(t[r]);
+    e[r] = new v(t[r]);
   return e;
 };
 var pn = function() {
@@ -9651,27 +9651,27 @@ var pn = function() {
 pn.prototype.findStabbedSegments = function() {
   var t = this;
   if (arguments.length === 1) {
-    for (var e = arguments[0], r = new x(), i = this._subgraphs.iterator(); i.hasNext(); ) {
+    for (var e = arguments[0], r = new S(), i = this._subgraphs.iterator(); i.hasNext(); ) {
       var o = i.next(), s = o.getEnvelope();
       e.y < s.getMinY() || e.y > s.getMaxY() || t.findStabbedSegments(e, o.getDirectedEdges(), r);
     }
     return r;
   } else if (arguments.length === 3) {
-    if (T(arguments[2], Ne) && arguments[0] instanceof d && arguments[1] instanceof To)
+    if (T(arguments[2], Ne) && arguments[0] instanceof v && arguments[1] instanceof To)
       for (var a = arguments[0], u = arguments[1], l = arguments[2], c = u.getEdge().getCoordinates(), f = 0; f < c.length - 1; f++) {
         t._seg.p0 = c[f], t._seg.p1 = c[f + 1], t._seg.p0.y > t._seg.p1.y && t._seg.reverse();
         var h = Math.max(t._seg.p0.x, t._seg.p1.x);
         if (!(h < a.x) && !t._seg.isHorizontal() && !(a.y < t._seg.p0.y || a.y > t._seg.p1.y) && L.computeOrientation(t._seg.p0, t._seg.p1, a) !== L.RIGHT) {
-          var g = u.getDepth(N.LEFT);
-          t._seg.p0.equals(c[f]) || (g = u.getDepth(N.RIGHT));
-          var p = new Zr(t._seg, g);
-          l.add(p);
+          var p = u.getDepth(N.LEFT);
+          t._seg.p0.equals(c[f]) || (p = u.getDepth(N.RIGHT));
+          var g = new Zr(t._seg, p);
+          l.add(g);
         }
       }
-    else if (T(arguments[2], Ne) && arguments[0] instanceof d && T(arguments[1], Ne))
-      for (var v = arguments[0], m = arguments[1], E = arguments[2], I = m.iterator(); I.hasNext(); ) {
+    else if (T(arguments[2], Ne) && arguments[0] instanceof v && T(arguments[1], Ne))
+      for (var m = arguments[0], d = arguments[1], E = arguments[2], I = d.iterator(); I.hasNext(); ) {
         var C = I.next();
-        C.isForward() && t.findStabbedSegments(v, C, E);
+        C.isForward() && t.findStabbedSegments(m, C, E);
       }
   }
 };
@@ -9767,8 +9767,8 @@ j.det = function(t, e, r, i) {
   return t * i - e * r;
 };
 j.interpolateZ = function(t, e, r, i) {
-  var o = e.x, s = e.y, a = r.x - o, u = i.x - o, l = r.y - s, c = i.y - s, f = a * c - u * l, h = t.x - o, g = t.y - s, p = (c * h - u * g) / f, v = (-l * h + a * g) / f, m = e.z + p * (r.z - e.z) + v * (i.z - e.z);
-  return m;
+  var o = e.x, s = e.y, a = r.x - o, u = i.x - o, l = r.y - s, c = i.y - s, f = a * c - u * l, h = t.x - o, p = t.y - s, g = (c * h - u * p) / f, m = (-l * h + a * p) / f, d = e.z + g * (r.z - e.z) + m * (i.z - e.z);
+  return d;
 };
 j.longestSideLength = function(t, e, r) {
   var i = t.distance(e), o = e.distance(r), s = r.distance(t), a = i;
@@ -9778,31 +9778,31 @@ j.isAcute = function(t, e, r) {
   return !(!U.isAcute(t, e, r) || !U.isAcute(e, r, t) || !U.isAcute(r, t, e));
 };
 j.circumcentre = function(t, e, r) {
-  var i = r.x, o = r.y, s = t.x - i, a = t.y - o, u = e.x - i, l = e.y - o, c = 2 * j.det(s, a, u, l), f = j.det(a, s * s + a * a, l, u * u + l * l), h = j.det(s, s * s + a * a, u, u * u + l * l), g = i - f / c, p = o + h / c;
-  return new d(g, p);
+  var i = r.x, o = r.y, s = t.x - i, a = t.y - o, u = e.x - i, l = e.y - o, c = 2 * j.det(s, a, u, l), f = j.det(a, s * s + a * a, l, u * u + l * l), h = j.det(s, s * s + a * a, u, u * u + l * l), p = i - f / c, g = o + h / c;
+  return new v(p, g);
 };
 j.perpendicularBisector = function(t, e) {
   var r = e.x - t.x, i = e.y - t.y, o = new Ce(t.x + r / 2, t.y + i / 2, 1), s = new Ce(t.x - i + r / 2, t.y + r + i / 2, 1);
   return new Ce(o, s);
 };
 j.angleBisector = function(t, e, r) {
-  var i = e.distance(t), o = e.distance(r), s = i / (i + o), a = r.x - t.x, u = r.y - t.y, l = new d(t.x + s * a, t.y + s * u);
+  var i = e.distance(t), o = e.distance(r), s = i / (i + o), a = r.x - t.x, u = r.y - t.y, l = new v(t.x + s * a, t.y + s * u);
   return l;
 };
 j.area3D = function(t, e, r) {
-  var i = e.x - t.x, o = e.y - t.y, s = e.z - t.z, a = r.x - t.x, u = r.y - t.y, l = r.z - t.z, c = o * l - s * u, f = s * a - i * l, h = i * u - o * a, g = c * c + f * f + h * h, p = Math.sqrt(g) / 2;
-  return p;
+  var i = e.x - t.x, o = e.y - t.y, s = e.z - t.z, a = r.x - t.x, u = r.y - t.y, l = r.z - t.z, c = o * l - s * u, f = s * a - i * l, h = i * u - o * a, p = c * c + f * f + h * h, g = Math.sqrt(p) / 2;
+  return g;
 };
 j.centroid = function(t, e, r) {
   var i = (t.x + e.x + r.x) / 3, o = (t.y + e.y + r.y) / 3;
-  return new d(i, o);
+  return new v(i, o);
 };
 j.inCentre = function(t, e, r) {
   var i = e.distance(r), o = t.distance(r), s = t.distance(e), a = i + o + s, u = (i * t.x + o * e.x + s * r.x) / a, l = (i * t.y + o * e.y + s * r.y) / a;
-  return new d(u, l);
+  return new v(u, l);
 };
 var _e = function() {
-  this._inputGeom = null, this._distance = null, this._curveBuilder = null, this._curveList = new x();
+  this._inputGeom = null, this._distance = null, this._curveBuilder = null, this._curveList = new S();
   var t = arguments[0], e = arguments[1], r = arguments[2];
   this._inputGeom = t, this._distance = e, this._curveBuilder = r;
 };
@@ -10046,7 +10046,7 @@ Bt.prototype.iterator = function() {
   return this.getEdges().iterator();
 };
 Bt.prototype.getEdges = function() {
-  return this._edgeList === null && (this._edgeList = new x(this._edgeMap.values())), this._edgeList;
+  return this._edgeList === null && (this._edgeList = new S(this._edgeMap.values())), this._edgeList;
 };
 Bt.prototype.getLocation = function(t, e, r) {
   return this._ptInAreaLocation[t] === y.NONE && (this._ptInAreaLocation[t] = se.locate(e, r[t].getGeometry())), this._ptInAreaLocation[t];
@@ -10081,8 +10081,8 @@ Bt.prototype.computeLabelling = function(t) {
         if (r[f])
           h = y.EXTERIOR;
         else {
-          var g = l.getCoordinate();
-          h = e.getLocation(f, g, t);
+          var p = l.getCoordinate();
+          h = e.getLocation(f, p, t);
         }
         c.setAllLocationsIfNull(f, h);
       }
@@ -10149,7 +10149,7 @@ var Ku = function(n) {
     var r = this;
     if (this._resultAreaEdgeList !== null)
       return this._resultAreaEdgeList;
-    this._resultAreaEdgeList = new x();
+    this._resultAreaEdgeList = new S();
     for (var i = this.iterator(); i.hasNext(); ) {
       var o = i.next();
       (o.isInResult() || o.getSym().isInResult()) && r._resultAreaEdgeList.add(o);
@@ -10175,11 +10175,11 @@ var Ku = function(n) {
       if (l !== a)
         throw new Cr("depth mismatch at " + i.getCoordinate());
     } else if (arguments.length === 3) {
-      for (var c = arguments[0], f = arguments[1], h = arguments[2], g = h, p = c; p < f; p++) {
-        var v = r._edgeList.get(p);
-        v.setEdgeDepths(N.RIGHT, g), g = v.getDepth(N.LEFT);
+      for (var c = arguments[0], f = arguments[1], h = arguments[2], p = h, g = c; g < f; g++) {
+        var m = r._edgeList.get(g);
+        m.setEdgeDepths(N.RIGHT, p), p = m.getDepth(N.LEFT);
       }
-      return g;
+      return p;
     }
   }, t.prototype.mergeSymLabels = function() {
     for (var r = this.iterator(); r.hasNext(); ) {
@@ -10287,17 +10287,17 @@ Fr.compareOriented = function(t, e, r, i) {
     if (f !== 0)
       return f;
     l += o, c += s;
-    var h = l === a, g = c === u;
-    if (h && !g)
+    var h = l === a, p = c === u;
+    if (h && !p)
       return -1;
-    if (!h && g)
+    if (!h && p)
       return 1;
-    if (h && g)
+    if (h && p)
       return 0;
   }
 };
 var Pe = function() {
-  this._edges = new x(), this._ocaMap = new At();
+  this._edges = new S(), this._ocaMap = new At();
 };
 Pe.prototype.print = function(t) {
   var e = this;
@@ -10414,7 +10414,7 @@ fe.isAdjacentSegments = function(t, e) {
 var He = function() {
   this.coord = null, this.segmentIndex = null, this.dist = null;
   var t = arguments[0], e = arguments[1], r = arguments[2];
-  this.coord = new d(t), this.segmentIndex = e, this.dist = r;
+  this.coord = new v(t), this.segmentIndex = e, this.dist = r;
 };
 He.prototype.getSegmentIndex = function() {
   return this.segmentIndex;
@@ -10478,7 +10478,7 @@ ar.prototype.createSplitEdge = function(t, e) {
   var r = this, i = e.segmentIndex - t.segmentIndex + 2, o = this.edge.pts[e.segmentIndex], s = e.dist > 0 || !e.coord.equals2D(o);
   s || i--;
   var a = new Array(i).fill(null), u = 0;
-  a[u++] = new d(t.coord);
+  a[u++] = new v(t.coord);
   for (var l = t.segmentIndex + 1; l <= e.segmentIndex; l++)
     a[u++] = r.edge.pts[l];
   return s && (a[u] = e.coord), new ji(a, new Q(this.edge._label));
@@ -10504,7 +10504,7 @@ ar.prototype.getClass = function() {
 var tn = function() {
 };
 tn.prototype.getChainStartIndices = function(t) {
-  var e = this, r = 0, i = new x();
+  var e = this, r = 0, i = new S();
   i.add(new ke(r));
   do {
     var o = e.findChainEnd(t, r);
@@ -10556,13 +10556,13 @@ xr.prototype.computeIntersectsForChain = function() {
     var t = arguments[0], e = arguments[1], r = arguments[2], i = arguments[3];
     this.computeIntersectsForChain(this.startIndex[t], this.startIndex[t + 1], e, e.startIndex[r], e.startIndex[r + 1], i);
   } else if (arguments.length === 6) {
-    var o = arguments[0], s = arguments[1], a = arguments[2], u = arguments[3], l = arguments[4], c = arguments[5], f = this.pts[o], h = this.pts[s], g = a.pts[u], p = a.pts[l];
+    var o = arguments[0], s = arguments[1], a = arguments[2], u = arguments[3], l = arguments[4], c = arguments[5], f = this.pts[o], h = this.pts[s], p = a.pts[u], g = a.pts[l];
     if (s - o === 1 && l - u === 1)
       return c.addIntersections(this.e, o, a.e, u), null;
-    if (this.env1.init(f, h), this.env2.init(g, p), !this.env1.intersects(this.env2))
+    if (this.env1.init(f, h), this.env2.init(p, g), !this.env1.intersects(this.env2))
       return null;
-    var v = Math.trunc((o + s) / 2), m = Math.trunc((u + l) / 2);
-    o < v && (u < m && this.computeIntersectsForChain(o, v, a, u, m, c), m < l && this.computeIntersectsForChain(o, v, a, m, l, c)), v < s && (u < m && this.computeIntersectsForChain(v, s, a, u, m, c), m < l && this.computeIntersectsForChain(v, s, a, m, l, c));
+    var m = Math.trunc((o + s) / 2), d = Math.trunc((u + l) / 2);
+    o < m && (u < d && this.computeIntersectsForChain(o, m, a, u, d, c), d < l && this.computeIntersectsForChain(o, m, a, d, l, c)), m < s && (u < d && this.computeIntersectsForChain(m, s, a, u, d, c), d < l && this.computeIntersectsForChain(m, s, a, d, l, c));
   }
 };
 xr.prototype.getStartIndexes = function() {
@@ -10734,7 +10734,7 @@ var ji = function(n) {
     }
     return this._env;
   }, t.prototype.addIntersection = function(r, i, o, s) {
-    var a = new d(r.getIntersection(s)), u = i, l = r.getEdgeDistance(o, s), c = u + 1;
+    var a = new v(r.getIntersection(s)), u = i, l = r.getEdgeDistance(o, s), c = u + 1;
     if (c < this.pts.length) {
       var f = this.pts[c];
       a.equals2D(f) && (u = c, l = 0);
@@ -10789,13 +10789,13 @@ qt.prototype.insertUniqueEdge = function(t) {
     this._edgeList.add(t), t.setDepthDelta(qt.depthDelta(t.getLabel()));
 };
 qt.prototype.buildSubgraphs = function(t, e) {
-  for (var r = new x(), i = t.iterator(); i.hasNext(); ) {
+  for (var r = new S(), i = t.iterator(); i.hasNext(); ) {
     var o = i.next(), s = o.getRightmostCoordinate(), a = new pn(r), u = a.getDepth(s);
     o.computeDepth(u), o.findResultEdges(), r.add(o), e.add(o.getDirectedEdges(), o.getNodes());
   }
 };
 qt.prototype.createSubgraphs = function(t) {
-  for (var e = new x(), r = t.getNodes().iterator(); r.hasNext(); ) {
+  for (var e = new S(), r = t.getNodes().iterator(); r.hasNext(); ) {
     var i = r.next();
     if (!i.isVisited()) {
       var o = new Yt();
@@ -10854,7 +10854,7 @@ qt.depthDelta = function(t) {
   return e === y.INTERIOR && r === y.EXTERIOR ? 1 : e === y.EXTERIOR && r === y.INTERIOR ? -1 : 0;
 };
 qt.convertSegStrings = function(t) {
-  for (var e = new k(), r = new x(); t.hasNext(); ) {
+  for (var e = new k(), r = new S(); t.hasNext(); ) {
     var i = t.next(), o = e.createLineString(i.getCoordinates());
     r.add(o);
   }
@@ -10885,14 +10885,14 @@ Br.prototype.rescale = function() {
 Br.prototype.scale = function() {
   var t = this;
   if (T(arguments[0], _t)) {
-    for (var e = arguments[0], r = new x(), i = e.iterator(); i.hasNext(); ) {
+    for (var e = arguments[0], r = new S(), i = e.iterator(); i.hasNext(); ) {
       var o = i.next();
       r.add(new dt(t.scale(o.getCoordinates()), o.getData()));
     }
     return r;
   } else if (arguments[0] instanceof Array) {
     for (var s = arguments[0], a = new Array(s.length).fill(null), u = 0; u < s.length; u++)
-      a[u] = new d(Math.round((s[u].x - t._offsetX) * t._scaleFactor), Math.round((s[u].y - t._offsetY) * t._scaleFactor), s[u].z);
+      a[u] = new v(Math.round((s[u].x - t._offsetX) * t._scaleFactor), Math.round((s[u].y - t._offsetY) * t._scaleFactor), s[u].z);
     var l = z.removeRepeatedPoints(a);
     return l;
   }
@@ -10946,12 +10946,12 @@ We.prototype.checkInteriorIntersections = function() {
       for (var f = 0; f < l.length - 1; f++)
         t.checkInteriorIntersections(s, c, a, f);
   else if (arguments.length === 4) {
-    var h = arguments[0], g = arguments[1], p = arguments[2], v = arguments[3];
-    if (h === p && g === v)
+    var h = arguments[0], p = arguments[1], g = arguments[2], m = arguments[3];
+    if (h === g && p === m)
       return null;
-    var m = h.getCoordinates()[g], E = h.getCoordinates()[g + 1], I = p.getCoordinates()[v], C = p.getCoordinates()[v + 1];
-    if (this._li.computeIntersection(m, E, I, C), this._li.hasIntersection() && (this._li.isProper() || this.hasInteriorIntersection(this._li, m, E) || this.hasInteriorIntersection(this._li, I, C)))
-      throw new Er("found non-noded intersection at " + m + "-" + E + " and " + I + "-" + C);
+    var d = h.getCoordinates()[p], E = h.getCoordinates()[p + 1], I = g.getCoordinates()[m], C = g.getCoordinates()[m + 1];
+    if (this._li.computeIntersection(d, E, I, C), this._li.hasIntersection() && (this._li.isProper() || this.hasInteriorIntersection(this._li, d, E) || this.hasInteriorIntersection(this._li, I, C)))
+      throw new Er("found non-noded intersection at " + d + "-" + E + " and " + I + "-" + C);
   }
 };
 We.prototype.checkValid = function() {
@@ -10995,7 +10995,7 @@ var Jt = function() {
   var t = arguments[0], e = arguments[1], r = arguments[2];
   if (this._originalPt = t, this._pt = t, this._scaleFactor = e, this._li = r, e <= 0)
     throw new it("Scale factor must be non-zero");
-  e !== 1 && (this._pt = new d(this.scale(t.x), this.scale(t.y)), this._p0Scaled = new d(), this._p1Scaled = new d()), this.initCorners(this._pt);
+  e !== 1 && (this._pt = new v(this.scale(t.x), this.scale(t.y)), this._p0Scaled = new v(), this._p1Scaled = new v()), this.initCorners(this._pt);
 }, ya = { SAFE_ENV_EXPANSION_FACTOR: { configurable: !0 } };
 Jt.prototype.intersectsScaled = function(t, e) {
   var r = Math.min(t.x, e.x), i = Math.max(t.x, e.x), o = Math.min(t.y, e.y), s = Math.max(t.y, e.y), a = this._maxx < r || this._minx > i || this._maxy < o || this._miny > s;
@@ -11006,7 +11006,7 @@ Jt.prototype.intersectsScaled = function(t, e) {
 };
 Jt.prototype.initCorners = function(t) {
   var e = 0.5;
-  this._minx = t.x - e, this._maxx = t.x + e, this._miny = t.y - e, this._maxy = t.y + e, this._corner[0] = new d(this._maxx, this._maxy), this._corner[1] = new d(this._minx, this._maxy), this._corner[2] = new d(this._minx, this._miny), this._corner[3] = new d(this._maxx, this._miny);
+  this._minx = t.x - e, this._maxx = t.x + e, this._miny = t.y - e, this._maxy = t.y + e, this._corner[0] = new v(this._maxx, this._maxy), this._corner[1] = new v(this._minx, this._maxy), this._corner[2] = new v(this._minx, this._miny), this._corner[3] = new v(this._maxx, this._miny);
 };
 Jt.prototype.intersects = function(t, e) {
   return this._scaleFactor === 1 ? this.intersectsScaled(t, e) : (this.copyScaled(t, this._p0Scaled), this.copyScaled(e, this._p1Scaled), this.intersectsScaled(this._p0Scaled, this._p1Scaled));
@@ -11121,7 +11121,7 @@ var _a = function(n) {
 }(Ni), gn = function() {
   this._li = null, this._interiorIntersections = null;
   var t = arguments[0];
-  this._li = t, this._interiorIntersections = new x();
+  this._li = t, this._interiorIntersections = new S();
 };
 gn.prototype.processIntersections = function(t, e, r, i) {
   var o = this;
@@ -11275,20 +11275,20 @@ Pt.bufferOp = function() {
     var t = arguments[0], e = arguments[1], r = new Pt(t), i = r.getResultGeometry(e);
     return i;
   } else if (arguments.length === 3) {
-    if (Number.isInteger(arguments[2]) && arguments[0] instanceof O && typeof arguments[1] == "number") {
+    if (Number.isInteger(arguments[2]) && arguments[0] instanceof D && typeof arguments[1] == "number") {
       var o = arguments[0], s = arguments[1], a = arguments[2], u = new Pt(o);
       u.setQuadrantSegments(a);
       var l = u.getResultGeometry(s);
       return l;
-    } else if (arguments[2] instanceof H && arguments[0] instanceof O && typeof arguments[1] == "number") {
-      var c = arguments[0], f = arguments[1], h = arguments[2], g = new Pt(c, h), p = g.getResultGeometry(f);
-      return p;
+    } else if (arguments[2] instanceof H && arguments[0] instanceof D && typeof arguments[1] == "number") {
+      var c = arguments[0], f = arguments[1], h = arguments[2], p = new Pt(c, h), g = p.getResultGeometry(f);
+      return g;
     }
   } else if (arguments.length === 4) {
-    var v = arguments[0], m = arguments[1], E = arguments[2], I = arguments[3], C = new Pt(v);
+    var m = arguments[0], d = arguments[1], E = arguments[2], I = arguments[3], C = new Pt(m);
     C.setQuadrantSegments(E), C.setEndCapStyle(I);
-    var S = C.getResultGeometry(m);
-    return S;
+    var x = C.getResultGeometry(d);
+    return x;
   }
 };
 Pt.precisionScaleFactor = function(t, e, r) {
@@ -11312,7 +11312,7 @@ ri.MAX_PRECISION_DIGITS.get = function() {
 };
 Object.defineProperties(Pt, ri);
 var kt = function() {
-  this._pt = [new d(), new d()], this._distance = A.NaN, this._isNull = !0;
+  this._pt = [new v(), new v()], this._distance = A.NaN, this._isNull = !0;
 };
 kt.prototype.getCoordinates = function() {
   return this._pt;
@@ -11373,33 +11373,33 @@ $e.prototype.getClass = function() {
   return $e;
 };
 $e.computeDistance = function() {
-  if (arguments[2] instanceof kt && arguments[0] instanceof ut && arguments[1] instanceof d)
+  if (arguments[2] instanceof kt && arguments[0] instanceof ut && arguments[1] instanceof v)
     for (var t = arguments[0], e = arguments[1], r = arguments[2], i = t.getCoordinates(), o = new b(), s = 0; s < i.length - 1; s++) {
       o.setCoordinates(i[s], i[s + 1]);
       var a = o.closestPoint(e);
       r.setMinimum(a, e);
     }
-  else if (arguments[2] instanceof kt && arguments[0] instanceof Nt && arguments[1] instanceof d) {
+  else if (arguments[2] instanceof kt && arguments[0] instanceof Nt && arguments[1] instanceof v) {
     var u = arguments[0], l = arguments[1], c = arguments[2];
     $e.computeDistance(u.getExteriorRing(), l, c);
     for (var f = 0; f < u.getNumInteriorRing(); f++)
       $e.computeDistance(u.getInteriorRingN(f), l, c);
-  } else if (arguments[2] instanceof kt && arguments[0] instanceof O && arguments[1] instanceof d) {
-    var h = arguments[0], g = arguments[1], p = arguments[2];
+  } else if (arguments[2] instanceof kt && arguments[0] instanceof D && arguments[1] instanceof v) {
+    var h = arguments[0], p = arguments[1], g = arguments[2];
     if (h instanceof ut)
-      $e.computeDistance(h, g, p);
+      $e.computeDistance(h, p, g);
     else if (h instanceof Nt)
-      $e.computeDistance(h, g, p);
+      $e.computeDistance(h, p, g);
     else if (h instanceof Xt)
-      for (var v = h, m = 0; m < v.getNumGeometries(); m++) {
-        var E = v.getGeometryN(m);
-        $e.computeDistance(E, g, p);
+      for (var m = h, d = 0; d < m.getNumGeometries(); d++) {
+        var E = m.getGeometryN(d);
+        $e.computeDistance(E, p, g);
       }
     else
-      p.setMinimum(h.getCoordinate(), g);
-  } else if (arguments[2] instanceof kt && arguments[0] instanceof b && arguments[1] instanceof d) {
-    var I = arguments[0], C = arguments[1], S = arguments[2], D = I.closestPoint(C);
-    S.setMinimum(D, C);
+      g.setMinimum(h.getCoordinate(), p);
+  } else if (arguments[2] instanceof kt && arguments[0] instanceof b && arguments[1] instanceof v) {
+    var I = arguments[0], C = arguments[1], x = arguments[2], R = I.closestPoint(C);
+    x.setMinimum(R, C);
   }
 };
 var en = function(t) {
@@ -11453,7 +11453,7 @@ var Gr = function(t) {
 Gr.prototype.filter = function(t, e) {
   if (e === 0)
     return null;
-  var r = t.getCoordinate(e - 1), i = t.getCoordinate(e), o = new d((r.x + i.x) / 2, (r.y + i.y) / 2);
+  var r = t.getCoordinate(e - 1), i = t.getCoordinate(e), o = new v((r.x + i.x) / 2, (r.y + i.y) / 2);
   this._minPtDist.initialize(), $e.computeDistance(this._geom, o, this._minPtDist), this._maxPtDist.setMaximum(this._minPtDist);
 };
 Gr.prototype.isDone = function() {
@@ -11486,7 +11486,7 @@ _r.prototype.getClass = function() {
 _r.getPolygons = function() {
   if (arguments.length === 1) {
     var t = arguments[0];
-    return _r.getPolygons(t, new x());
+    return _r.getPolygons(t, new S());
   } else if (arguments.length === 2) {
     var e = arguments[0], r = arguments[1];
     return e instanceof Nt ? r.add(e) : e instanceof Xt && e.apply(new _r(r)), r;
@@ -11537,23 +11537,23 @@ wt.getLines = function() {
         wt.getLines(o, r);
       }
       return r;
-    } else if (arguments[0] instanceof O && typeof arguments[1] == "boolean") {
-      var s = arguments[0], a = arguments[1], u = new x();
+    } else if (arguments[0] instanceof D && typeof arguments[1] == "boolean") {
+      var s = arguments[0], a = arguments[1], u = new S();
       return s.apply(new wt(u, a)), u;
-    } else if (arguments[0] instanceof O && T(arguments[1], _t)) {
+    } else if (arguments[0] instanceof D && T(arguments[1], _t)) {
       var l = arguments[0], c = arguments[1];
       return l instanceof ut ? c.add(l) : l.apply(new wt(c)), c;
     }
   } else if (arguments.length === 3) {
     if (typeof arguments[2] == "boolean" && T(arguments[0], _t) && T(arguments[1], _t)) {
-      for (var f = arguments[0], h = arguments[1], g = arguments[2], p = f.iterator(); p.hasNext(); ) {
-        var v = p.next();
-        wt.getLines(v, h, g);
+      for (var f = arguments[0], h = arguments[1], p = arguments[2], g = f.iterator(); g.hasNext(); ) {
+        var m = g.next();
+        wt.getLines(m, h, p);
       }
       return h;
-    } else if (typeof arguments[2] == "boolean" && arguments[0] instanceof O && T(arguments[1], _t)) {
-      var m = arguments[0], E = arguments[1], I = arguments[2];
-      return m.apply(new wt(E, I)), E;
+    } else if (typeof arguments[2] == "boolean" && arguments[0] instanceof D && T(arguments[1], _t)) {
+      var d = arguments[0], E = arguments[1], I = arguments[2];
+      return d.apply(new wt(E, I)), E;
     }
   }
 };
@@ -11569,7 +11569,7 @@ var be = function() {
 };
 be.prototype.locateInternal = function() {
   var t = this;
-  if (arguments[0] instanceof d && arguments[1] instanceof Nt) {
+  if (arguments[0] instanceof v && arguments[1] instanceof Nt) {
     var e = arguments[0], r = arguments[1];
     if (r.isEmpty())
       return y.EXTERIOR;
@@ -11586,15 +11586,15 @@ be.prototype.locateInternal = function() {
         return y.BOUNDARY;
     }
     return y.INTERIOR;
-  } else if (arguments[0] instanceof d && arguments[1] instanceof ut) {
+  } else if (arguments[0] instanceof v && arguments[1] instanceof ut) {
     var l = arguments[0], c = arguments[1];
     if (!c.getEnvelopeInternal().intersects(l))
       return y.EXTERIOR;
     var f = c.getCoordinates();
     return !c.isClosed() && (l.equals(f[0]) || l.equals(f[f.length - 1])) ? y.BOUNDARY : L.isOnLine(l, f) ? y.INTERIOR : y.EXTERIOR;
-  } else if (arguments[0] instanceof d && arguments[1] instanceof te) {
-    var h = arguments[0], g = arguments[1], p = g.getCoordinate();
-    return p.equals2D(h) ? y.INTERIOR : y.EXTERIOR;
+  } else if (arguments[0] instanceof v && arguments[1] instanceof te) {
+    var h = arguments[0], p = arguments[1], g = p.getCoordinate();
+    return g.equals2D(h) ? y.INTERIOR : y.EXTERIOR;
   }
 };
 be.prototype.locateInPolygonRing = function(t, e) {
@@ -11683,7 +11683,7 @@ Or.prototype.getClass = function() {
 Or.getPoints = function() {
   if (arguments.length === 1) {
     var t = arguments[0];
-    return t instanceof te ? we.singletonList(t) : Or.getPoints(t, new x());
+    return t instanceof te ? we.singletonList(t) : Or.getPoints(t, new S());
   } else if (arguments.length === 2) {
     var e = arguments[0], r = arguments[1];
     return e instanceof te ? r.add(e) : e instanceof Xt && e.apply(new Or(r)), r;
@@ -11704,7 +11704,7 @@ vn.prototype.getClass = function() {
   return vn;
 };
 vn.getLocations = function(t) {
-  var e = new x();
+  var e = new S();
   return t.apply(new vn(e)), e;
 };
 var Ot = function() {
@@ -11733,13 +11733,13 @@ Ot.prototype.computeContainmentDistance = function() {
   } else if (arguments.length === 3) {
     if (arguments[2] instanceof Array && T(arguments[0], Ne) && T(arguments[1], Ne)) {
       for (var u = arguments[0], l = arguments[1], c = arguments[2], f = 0; f < u.size(); f++)
-        for (var h = u.get(f), g = 0; g < l.size(); g++)
-          if (t.computeContainmentDistance(h, l.get(g), c), t._minDistance <= t._terminateDistance)
+        for (var h = u.get(f), p = 0; p < l.size(); p++)
+          if (t.computeContainmentDistance(h, l.get(p), c), t._minDistance <= t._terminateDistance)
             return null;
     } else if (arguments[2] instanceof Array && arguments[0] instanceof zt && arguments[1] instanceof Nt) {
-      var p = arguments[0], v = arguments[1], m = arguments[2], E = p.getCoordinate();
-      if (y.EXTERIOR !== this._ptLocator.locate(E, v))
-        return this._minDistance = 0, m[0] = p, m[1] = new zt(v, E), null;
+      var g = arguments[0], m = arguments[1], d = arguments[2], E = g.getCoordinate();
+      if (y.EXTERIOR !== this._ptLocator.locate(E, m))
+        return this._minDistance = 0, d[0] = g, d[1] = new zt(m, E), null;
     }
   }
 };
@@ -11792,16 +11792,16 @@ Ot.prototype.computeMinDistance = function() {
           return null;
       }
     } else if (arguments[2] instanceof Array && arguments[0] instanceof ut && arguments[1] instanceof ut) {
-      var f = arguments[0], h = arguments[1], g = arguments[2];
+      var f = arguments[0], h = arguments[1], p = arguments[2];
       if (f.getEnvelopeInternal().distance(h.getEnvelopeInternal()) > this._minDistance)
         return null;
-      for (var p = f.getCoordinates(), v = h.getCoordinates(), m = 0; m < p.length - 1; m++)
-        for (var E = 0; E < v.length - 1; E++) {
-          var I = L.distanceLineLine(p[m], p[m + 1], v[E], v[E + 1]);
+      for (var g = f.getCoordinates(), m = h.getCoordinates(), d = 0; d < g.length - 1; d++)
+        for (var E = 0; E < m.length - 1; E++) {
+          var I = L.distanceLineLine(g[d], g[d + 1], m[E], m[E + 1]);
           if (I < t._minDistance) {
             t._minDistance = I;
-            var C = new b(p[m], p[m + 1]), S = new b(v[E], v[E + 1]), D = C.closestPoints(S);
-            g[0] = new zt(f, m, D[0]), g[1] = new zt(h, E, D[1]);
+            var C = new b(g[d], g[d + 1]), x = new b(m[E], m[E + 1]), R = C.closestPoints(x);
+            p[0] = new zt(f, d, R[0]), p[1] = new zt(h, E, R[1]);
           }
           if (t._minDistance <= t._terminateDistance)
             return null;
@@ -11849,7 +11849,7 @@ Ot.nearestPoints = function(t, e) {
   return r.nearestPoints();
 };
 var Mt = function() {
-  this._pt = [new d(), new d()], this._distance = A.NaN, this._isNull = !0;
+  this._pt = [new v(), new v()], this._distance = A.NaN, this._isNull = !0;
 };
 Mt.prototype.getCoordinates = function() {
   return this._pt;
@@ -11913,33 +11913,33 @@ Be.prototype.getClass = function() {
   return Be;
 };
 Be.computeDistance = function() {
-  if (arguments[2] instanceof Mt && arguments[0] instanceof ut && arguments[1] instanceof d)
+  if (arguments[2] instanceof Mt && arguments[0] instanceof ut && arguments[1] instanceof v)
     for (var t = arguments[0], e = arguments[1], r = arguments[2], i = new b(), o = t.getCoordinates(), s = 0; s < o.length - 1; s++) {
       i.setCoordinates(o[s], o[s + 1]);
       var a = i.closestPoint(e);
       r.setMinimum(a, e);
     }
-  else if (arguments[2] instanceof Mt && arguments[0] instanceof Nt && arguments[1] instanceof d) {
+  else if (arguments[2] instanceof Mt && arguments[0] instanceof Nt && arguments[1] instanceof v) {
     var u = arguments[0], l = arguments[1], c = arguments[2];
     Be.computeDistance(u.getExteriorRing(), l, c);
     for (var f = 0; f < u.getNumInteriorRing(); f++)
       Be.computeDistance(u.getInteriorRingN(f), l, c);
-  } else if (arguments[2] instanceof Mt && arguments[0] instanceof O && arguments[1] instanceof d) {
-    var h = arguments[0], g = arguments[1], p = arguments[2];
+  } else if (arguments[2] instanceof Mt && arguments[0] instanceof D && arguments[1] instanceof v) {
+    var h = arguments[0], p = arguments[1], g = arguments[2];
     if (h instanceof ut)
-      Be.computeDistance(h, g, p);
+      Be.computeDistance(h, p, g);
     else if (h instanceof Nt)
-      Be.computeDistance(h, g, p);
+      Be.computeDistance(h, p, g);
     else if (h instanceof Xt)
-      for (var v = h, m = 0; m < v.getNumGeometries(); m++) {
-        var E = v.getGeometryN(m);
-        Be.computeDistance(E, g, p);
+      for (var m = h, d = 0; d < m.getNumGeometries(); d++) {
+        var E = m.getGeometryN(d);
+        Be.computeDistance(E, p, g);
       }
     else
-      p.setMinimum(h.getCoordinate(), g);
-  } else if (arguments[2] instanceof Mt && arguments[0] instanceof b && arguments[1] instanceof d) {
-    var I = arguments[0], C = arguments[1], S = arguments[2], D = I.closestPoint(C);
-    S.setMinimum(D, C);
+      g.setMinimum(h.getCoordinate(), p);
+  } else if (arguments[2] instanceof Mt && arguments[0] instanceof b && arguments[1] instanceof v) {
+    var I = arguments[0], C = arguments[1], x = arguments[2], R = I.closestPoint(C);
+    x.setMinimum(R, C);
   }
 };
 var ve = function() {
@@ -12020,7 +12020,7 @@ Vr.prototype.filter = function(t, e) {
   if (e === 0)
     return null;
   for (var i = t.getCoordinate(e - 1), o = t.getCoordinate(e), s = (o.x - i.x) / this._numSubSegs, a = (o.y - i.y) / this._numSubSegs, u = 0; u < this._numSubSegs; u++) {
-    var l = i.x + u * s, c = i.y + u * a, f = new d(l, c);
+    var l = i.x + u * s, c = i.y + u * a, f = new v(l, c);
     r._minPtDist.initialize(), Be.computeDistance(r._geom, f, r._minPtDist), r._maxPtDist.setMaximum(r._minPtDist);
   }
 };
@@ -12083,7 +12083,7 @@ $t.prototype.getErrorLocation = function() {
   return this._errorLocation;
 };
 $t.prototype.getPolygonLines = function(t) {
-  for (var e = new x(), r = new wt(e), i = _r.getPolygons(t), o = i.iterator(); o.hasNext(); ) {
+  for (var e = new S(), r = new wt(e), i = _r.getPolygons(t), o = i.iterator(); o.hasNext(); ) {
     var s = o.next();
     s.apply(r);
   }
@@ -12208,7 +12208,7 @@ je.prototype.getClass = function() {
   return je;
 };
 var St = function() {
-  this._findAllIntersections = !1, this._isCheckEndSegmentsOnly = !1, this._li = null, this._interiorIntersection = null, this._intSegments = null, this._intersections = new x(), this._intersectionCount = 0, this._keepIntersections = !0;
+  this._findAllIntersections = !1, this._isCheckEndSegmentsOnly = !1, this._li = null, this._interiorIntersection = null, this._intSegments = null, this._intersections = new S(), this._intersectionCount = 0, this._keepIntersections = !0;
   var t = arguments[0];
   this._li = t, this._interiorIntersection = null;
 };
@@ -12330,7 +12330,7 @@ rn.prototype.getClass = function() {
   return rn;
 };
 rn.toSegmentStrings = function(t) {
-  for (var e = new x(), r = t.iterator(); r.hasNext(); ) {
+  for (var e = new S(), r = t.iterator(); r.hasNext(); ) {
     var i = r.next();
     e.add(new je(i.getCoordinates(), i));
   }
@@ -12344,7 +12344,7 @@ var mn = function(t) {
   this._mapOp = t;
 };
 mn.prototype.map = function(t) {
-  for (var e = this, r = new x(), i = 0; i < t.getNumGeometries(); i++) {
+  for (var e = this, r = new S(), i = 0; i < t.getNumGeometries(); i++) {
     var o = e._mapOp.map(t.getGeometryN(i));
     o.isEmpty() || r.add(o);
   }
@@ -12361,7 +12361,7 @@ mn.map = function(t, e) {
   return r.map(t);
 };
 var Ke = function() {
-  this._op = null, this._geometryFactory = null, this._ptLocator = null, this._lineEdgesList = new x(), this._resultLineList = new x();
+  this._op = null, this._geometryFactory = null, this._ptLocator = null, this._lineEdgesList = new S(), this._resultLineList = new S();
   var t = arguments[0], e = arguments[1], r = arguments[2];
   this._op = t, this._geometryFactory = e, this._ptLocator = r;
 };
@@ -12420,7 +12420,7 @@ Ke.prototype.getClass = function() {
   return Ke;
 };
 var _n = function() {
-  this._op = null, this._geometryFactory = null, this._resultPointList = new x();
+  this._op = null, this._geometryFactory = null, this._resultPointList = new S();
   var t = arguments[0], e = arguments[1];
   this._op = t, this._geometryFactory = e;
 };
@@ -12458,13 +12458,13 @@ Zt.prototype.transformPoint = function(t, e) {
 Zt.prototype.transformPolygon = function(t, e) {
   var r = this, i = !0, o = this.transformLinearRing(t.getExteriorRing(), t);
   (o === null || !(o instanceof ir) || o.isEmpty()) && (i = !1);
-  for (var s = new x(), a = 0; a < t.getNumInteriorRing(); a++) {
+  for (var s = new S(), a = 0; a < t.getNumInteriorRing(); a++) {
     var u = r.transformLinearRing(t.getInteriorRingN(a), t);
     u === null || u.isEmpty() || (u instanceof ir || (i = !1), s.add(u));
   }
   if (i)
     return this._factory.createPolygon(o, s.toArray([]));
-  var l = new x();
+  var l = new S();
   return o !== null && l.add(o), l.addAll(s), this._factory.buildGeometry(l);
 };
 Zt.prototype.createCoordinateSequence = function(t) {
@@ -12474,7 +12474,7 @@ Zt.prototype.getInputGeometry = function() {
   return this._inputGeom;
 };
 Zt.prototype.transformMultiLineString = function(t, e) {
-  for (var r = this, i = new x(), o = 0; o < t.getNumGeometries(); o++) {
+  for (var r = this, i = new S(), o = 0; o < t.getNumGeometries(); o++) {
     var s = r.transformLineString(t.getGeometryN(o), t);
     s !== null && (s.isEmpty() || i.add(s));
   }
@@ -12487,14 +12487,14 @@ Zt.prototype.transformLineString = function(t, e) {
   return this._factory.createLineString(this.transformCoordinates(t.getCoordinateSequence(), t));
 };
 Zt.prototype.transformMultiPoint = function(t, e) {
-  for (var r = this, i = new x(), o = 0; o < t.getNumGeometries(); o++) {
+  for (var r = this, i = new S(), o = 0; o < t.getNumGeometries(); o++) {
     var s = r.transformPoint(t.getGeometryN(o), t);
     s !== null && (s.isEmpty() || i.add(s));
   }
   return this._factory.buildGeometry(i);
 };
 Zt.prototype.transformMultiPolygon = function(t, e) {
-  for (var r = this, i = new x(), o = 0; o < t.getNumGeometries(); o++) {
+  for (var r = this, i = new S(), o = 0; o < t.getNumGeometries(); o++) {
     var s = r.transformPolygon(t.getGeometryN(o), t);
     s !== null && (s.isEmpty() || i.add(s));
   }
@@ -12504,7 +12504,7 @@ Zt.prototype.copy = function(t) {
   return t.copy();
 };
 Zt.prototype.transformGeometryCollection = function(t, e) {
-  for (var r = this, i = new x(), o = 0; o < t.getNumGeometries(); o++) {
+  for (var r = this, i = new S(), o = 0; o < t.getNumGeometries(); o++) {
     var s = r.transform(t.getGeometryN(o));
     s !== null && (r._pruneEmptyGeometry && s.isEmpty() || i.add(s));
   }
@@ -12554,7 +12554,7 @@ var lr = function n() {
 lr.prototype.snapVertices = function(t, e) {
   for (var r = this, i = this._isClosed ? t.size() - 1 : t.size(), o = 0; o < i; o++) {
     var s = t.get(o), a = r.findSnapForVertex(s, e);
-    a !== null && (t.set(o, new d(a)), o === 0 && r._isClosed && t.set(t.size() - 1, new d(a)));
+    a !== null && (t.set(o, new v(a)), o === 0 && r._isClosed && t.set(t.size() - 1, new v(a)));
   }
 };
 lr.prototype.findSnapForVertex = function(t, e) {
@@ -12580,7 +12580,7 @@ lr.prototype.snapSegments = function(t, e) {
   e[0].equals2D(e[e.length - 1]) && (i = e.length - 1);
   for (var o = 0; o < i; o++) {
     var s = e[o], a = r.findSegmentIndexToSnap(s, t);
-    a >= 0 && t.add(a + 1, new d(s), !1);
+    a >= 0 && t.add(a + 1, new v(s), !1);
   }
 };
 lr.prototype.findSegmentIndexToSnap = function(t, e) {
@@ -12742,7 +12742,7 @@ kr.prototype.addCommonBits = function(t) {
 kr.prototype.removeCommonBits = function(t) {
   if (this._commonCoord.x === 0 && this._commonCoord.y === 0)
     return t;
-  var e = new d(this._commonCoord);
+  var e = new v(this._commonCoord);
   e.x = -e.x, e.y = -e.y;
   var r = new zr(e);
   return t.apply(r), t.geometryChanged(), t;
@@ -12773,7 +12773,7 @@ En.prototype.filter = function(t) {
   this._commonBitsX.add(t.x), this._commonBitsY.add(t.y);
 };
 En.prototype.getCommonCoordinate = function() {
-  return new d(this._commonBitsX.getCommon(), this._commonBitsY.getCommon());
+  return new v(this._commonBitsX.getCommon(), this._commonBitsY.getCommon());
 };
 En.prototype.interfaces_ = function() {
   return [nr];
@@ -13036,7 +13036,7 @@ Tt.isAdjacentSegments = function(t, e) {
 };
 var Qu = function(n) {
   function t() {
-    n.call(this), this.events = new x(), this.nOverlaps = null;
+    n.call(this), this.events = new S(), this.nOverlaps = null;
   }
   return n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t, t.prototype.prepareEvents = function() {
     var r = this;
@@ -13107,7 +13107,7 @@ cr.prototype.getMax = function() {
   return this._max;
 };
 cr.prototype.toString = function() {
-  return xe.toLineString(new d(this._min, 0), new d(this._max, 0));
+  return xe.toLineString(new v(this._min, 0), new v(this._max, 0));
 };
 cr.prototype.interfaces_ = function() {
   return [];
@@ -13164,12 +13164,12 @@ var Ju = function(n) {
     return t;
   }, t;
 }(cr), fr = function() {
-  this._leaves = new x(), this._root = null, this._level = 0;
+  this._leaves = new S(), this._root = null, this._level = 0;
 };
 fr.prototype.buildTree = function() {
   var t = this;
   we.sort(this._leaves, new cr.NodeComparator());
-  for (var e = this._leaves, r = null, i = new x(); ; ) {
+  for (var e = this._leaves, r = null, i = new S(); ; ) {
     if (t.buildLevel(e, i), i.size() === 1)
       return i.get(0);
     r = e, e = i, i = r;
@@ -13189,7 +13189,7 @@ fr.prototype.buildRoot = function() {
   this._root = this.buildTree();
 };
 fr.prototype.printNode = function(t) {
-  Rt.out.println(xe.toLineString(new d(t._min, this._level), new d(t._max, this._level)));
+  Rt.out.println(xe.toLineString(new v(t._min, this._level), new v(t._max, this._level)));
 };
 fr.prototype.init = function() {
   if (this._root !== null)
@@ -13215,7 +13215,7 @@ fr.prototype.getClass = function() {
   return fr;
 };
 var Yn = function() {
-  this._items = new x();
+  this._items = new S();
 };
 Yn.prototype.visitItem = function(t) {
   this._items.add(t);
@@ -13345,7 +13345,7 @@ var si = function(n) {
     if (arguments[0] instanceof te) {
       var r = arguments[0], i = r.getCoordinate();
       this.insertPoint(this._argIndex, i, y.INTERIOR);
-    } else if (arguments[0] instanceof d) {
+    } else if (arguments[0] instanceof v) {
       var o = arguments[0];
       this.insertPoint(this._argIndex, o, y.INTERIOR);
     }
@@ -13477,14 +13477,14 @@ jr.prototype.getClass = function() {
   return jr;
 };
 jr.map = function() {
-  if (arguments[0] instanceof O && T(arguments[1], jr.MapOp)) {
-    for (var t = arguments[0], e = arguments[1], r = new x(), i = 0; i < t.getNumGeometries(); i++) {
+  if (arguments[0] instanceof D && T(arguments[1], jr.MapOp)) {
+    for (var t = arguments[0], e = arguments[1], r = new S(), i = 0; i < t.getNumGeometries(); i++) {
       var o = e.map(t.getGeometryN(i));
       o !== null && r.add(o);
     }
     return t.getFactory().buildGeometry(r);
   } else if (T(arguments[0], _t) && T(arguments[1], jr.MapOp)) {
-    for (var s = arguments[0], a = arguments[1], u = new x(), l = s.iterator(); l.hasNext(); ) {
+    for (var s = arguments[0], a = arguments[1], u = new S(), l = s.iterator(); l.hasNext(); ) {
       var c = l.next(), f = a.map(c);
       f !== null && u.add(f);
     }
@@ -13496,7 +13496,7 @@ jr.MapOp = function() {
 var B = function(n) {
   function t() {
     var e = arguments[0], r = arguments[1];
-    n.call(this, e, r), this._ptLocator = new be(), this._geomFact = null, this._resultGeom = null, this._graph = null, this._edgeList = new Pe(), this._resultPolyList = new x(), this._resultLineList = new x(), this._resultPointList = new x(), this._graph = new st(new ga()), this._geomFact = e.getFactory();
+    n.call(this, e, r), this._ptLocator = new be(), this._geomFact = null, this._resultGeom = null, this._graph = null, this._edgeList = new Pe(), this._resultPolyList = new S(), this._resultLineList = new S(), this._resultPointList = new S(), this._graph = new st(new ga()), this._geomFact = e.getFactory();
   }
   return n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t, t.prototype.insertUniqueEdge = function(r) {
     var i = this._edgeList.findEqualEdge(r);
@@ -13517,7 +13517,7 @@ var B = function(n) {
   }, t.prototype.isCoveredByLA = function(r) {
     return !!(this.isCovered(r, this._resultLineList) || this.isCovered(r, this._resultPolyList));
   }, t.prototype.computeGeometry = function(r, i, o, s) {
-    var a = new x();
+    var a = new S();
     return a.addAll(r), a.addAll(i), a.addAll(o), a.isEmpty() ? t.createEmptyResult(s, this._arg[0].getGeometry(), this._arg[1].getGeometry(), this._geomFact) : this._geomFact.buildGeometry(a);
   }, t.prototype.mergeSymLabels = function() {
     for (var r = this._graph.getNodes().iterator(); r.hasNext(); ) {
@@ -13532,7 +13532,7 @@ var B = function(n) {
     }
     return !1;
   }, t.prototype.replaceCollapsedEdges = function() {
-    for (var r = new x(), i = this._edgeList.iterator(); i.hasNext(); ) {
+    for (var r = new S(), i = this._edgeList.iterator(); i.hasNext(); ) {
       var o = i.next();
       o.isCollapsed() && (i.remove(), r.add(o.getCollapsedEdge()));
     }
@@ -13551,7 +13551,7 @@ var B = function(n) {
     }
   }, t.prototype.computeOverlay = function(r) {
     this.copyPoints(0), this.copyPoints(1), this._arg[0].computeSelfNodes(this._li, !1), this._arg[1].computeSelfNodes(this._li, !1), this._arg[0].computeEdgeIntersections(this._arg[1], this._li, !0);
-    var i = new x();
+    var i = new S();
     this._arg[0].computeSplitEdges(i), this._arg[1].computeSplitEdges(i), this.insertUniqueEdges(i), this.computeLabelsFromDepths(), this.replaceCollapsedEdges(), rn.checkValid(this._edgeList.getEdges()), this._graph.addEdges(this._edgeList.getEdges()), this.computeLabelling(), this.labelIncompleteNodes(), this.findResultAreaEdges(r), this.cancelDuplicateResultEdges();
     var o = new ee(this._geomFact);
     o.add(this._graph), this._resultPolyList = o.getPolygons();
@@ -13724,7 +13724,7 @@ Dr.prototype.getClass = function() {
   return Dr;
 };
 var Kn = function() {
-  this._linework = null, this._linework = new x();
+  this._linework = null, this._linework = new S();
 };
 Kn.prototype.getLinework = function() {
   return this._linework;
@@ -13757,7 +13757,7 @@ on.prototype.setSidesToGenerate = function(t, e) {
   this._doLeft = t, this._doRight = e;
 };
 on.prototype.getPoints = function(t) {
-  for (var e = this, r = new x(), i = wt.getLines(this._g), o = i.iterator(); o.hasNext(); ) {
+  for (var e = this, r = new S(), i = wt.getLines(this._g), o = i.iterator(); o.hasNext(); ) {
     var s = o.next();
     e.extractPoints(s, t, r);
   }
@@ -13766,12 +13766,12 @@ on.prototype.getPoints = function(t) {
 on.prototype.computeOffsetPoints = function(t, e, r, i) {
   var o = e.x - t.x, s = e.y - t.y, a = Math.sqrt(o * o + s * s), u = r * o / a, l = r * s / a, c = (e.x + t.x) / 2, f = (e.y + t.y) / 2;
   if (this._doLeft) {
-    var h = new d(c - l, f + u);
+    var h = new v(c - l, f + u);
     i.add(h);
   }
   if (this._doRight) {
-    var g = new d(c + l, f - u);
-    i.add(g);
+    var p = new v(c + l, f - u);
+    i.add(p);
   }
 };
 on.prototype.interfaces_ = function() {
@@ -13781,7 +13781,7 @@ on.prototype.getClass = function() {
   return on;
 };
 var he = function n() {
-  this._geom = null, this._locFinder = null, this._location = new Array(3).fill(null), this._invalidLocation = null, this._boundaryDistanceTolerance = n.TOLERANCE, this._testCoords = new x();
+  this._geom = null, this._locFinder = null, this._location = new Array(3).fill(null), this._invalidLocation = null, this._boundaryDistanceTolerance = n.TOLERANCE, this._testCoords = new S();
   var t = arguments[0], e = arguments[1], r = arguments[2];
   this._boundaryDistanceTolerance = n.computeBoundaryDistanceTolerance(t, e), this._geom = [t, e, r], this._locFinder = [new Dr(this._geom[0], this._boundaryDistanceTolerance), new Dr(this._geom[1], this._boundaryDistanceTolerance), new Dr(this._geom[2], this._boundaryDistanceTolerance)];
 }, xa = { TOLERANCE: { configurable: !0 } };
@@ -13854,7 +13854,7 @@ oe.prototype.extractElements = function(t, e) {
   }
 };
 oe.prototype.combine = function() {
-  for (var t = this, e = new x(), r = this._inputGeoms.iterator(); r.hasNext(); ) {
+  for (var t = this, e = new S(), r = this._inputGeoms.iterator(); r.hasNext(); ) {
     var i = r.next();
     t.extractElements(i, e);
   }
@@ -13883,27 +13883,27 @@ oe.extractFactory = function(t) {
 };
 oe.createList = function() {
   if (arguments.length === 2) {
-    var t = arguments[0], e = arguments[1], r = new x();
+    var t = arguments[0], e = arguments[1], r = new S();
     return r.add(t), r.add(e), r;
   } else if (arguments.length === 3) {
-    var i = arguments[0], o = arguments[1], s = arguments[2], a = new x();
+    var i = arguments[0], o = arguments[1], s = arguments[2], a = new S();
     return a.add(i), a.add(o), a.add(s), a;
   }
 };
 var yt = function() {
   this._inputPolys = null, this._geomFactory = null;
   var t = arguments[0];
-  this._inputPolys = t, this._inputPolys === null && (this._inputPolys = new x());
+  this._inputPolys = t, this._inputPolys === null && (this._inputPolys = new S());
 }, Sa = { STRTREE_NODE_CAPACITY: { configurable: !0 } };
 yt.prototype.reduceToGeometries = function(t) {
-  for (var e = this, r = new x(), i = t.iterator(); i.hasNext(); ) {
+  for (var e = this, r = new S(), i = t.iterator(); i.hasNext(); ) {
     var o = i.next(), s = null;
-    T(o, Ne) ? s = e.unionTree(o) : o instanceof O && (s = o), r.add(s);
+    T(o, Ne) ? s = e.unionTree(o) : o instanceof D && (s = o), r.add(s);
   }
   return r;
 };
 yt.prototype.extractByEnvelope = function(t, e, r) {
-  for (var i = new x(), o = 0; o < e.getNumGeometries(); o++) {
+  for (var i = new S(), o = 0; o < e.getNumGeometries(); o++) {
     var s = e.getGeometryN(o);
     s.getEnvelopeInternal().intersects(t) ? i.add(s) : r.add(s);
   }
@@ -13969,7 +13969,7 @@ yt.prototype.unionTree = function(t) {
   return r;
 };
 yt.prototype.unionUsingEnvelopeIntersection = function(t, e, r) {
-  var i = new x(), o = this.extractByEnvelope(r, t, i), s = this.extractByEnvelope(r, e, i), a = this.unionActual(o, s);
+  var i = new S(), o = this.extractByEnvelope(r, t, i), s = this.extractByEnvelope(r, e, i), a = this.unionActual(o, s);
   i.add(a);
   var u = oe.combine(i);
   return u;
@@ -14167,17 +14167,17 @@ function bs(n) {
 function Rs(n, t) {
   var e = Et(n), r = It(n), i = Et(t), o = It(t);
   function s(a, u) {
-    var l = Et(u), c = Et(a) * l, f = It(a) * l, h = It(u), g = h * e + c * r;
+    var l = Et(u), c = Et(a) * l, f = It(a) * l, h = It(u), p = h * e + c * r;
     return [
-      Qn(f * i - g * o, c * e - h * r),
-      In(g * i + f * o)
+      Qn(f * i - p * o, c * e - h * r),
+      In(p * i + f * o)
     ];
   }
   return s.invert = function(a, u) {
-    var l = Et(u), c = Et(a) * l, f = It(a) * l, h = It(u), g = h * i - f * o;
+    var l = Et(u), c = Et(a) * l, f = It(a) * l, h = It(u), p = h * i - f * o;
     return [
-      Qn(f * i + h * o, c * e + g * r),
-      In(g * e - c * r)
+      Qn(f * i + h * o, c * e + p * r),
+      In(p * e - c * r)
     ];
   }, s;
 }
@@ -14214,48 +14214,48 @@ function Pa() {
   };
 }
 function nl(n, t, e, r, i, o) {
-  var s = n[0], a = n[1], u = t[0], l = t[1], c = 0, f = 1, h = u - s, g = l - a, p;
-  if (p = e - s, !(!h && p > 0)) {
-    if (p /= h, h < 0) {
-      if (p < c)
+  var s = n[0], a = n[1], u = t[0], l = t[1], c = 0, f = 1, h = u - s, p = l - a, g;
+  if (g = e - s, !(!h && g > 0)) {
+    if (g /= h, h < 0) {
+      if (g < c)
         return;
-      p < f && (f = p);
+      g < f && (f = g);
     } else if (h > 0) {
-      if (p > f)
+      if (g > f)
         return;
-      p > c && (c = p);
+      g > c && (c = g);
     }
-    if (p = i - s, !(!h && p < 0)) {
-      if (p /= h, h < 0) {
-        if (p > f)
+    if (g = i - s, !(!h && g < 0)) {
+      if (g /= h, h < 0) {
+        if (g > f)
           return;
-        p > c && (c = p);
+        g > c && (c = g);
       } else if (h > 0) {
-        if (p < c)
+        if (g < c)
           return;
-        p < f && (f = p);
+        g < f && (f = g);
       }
-      if (p = r - a, !(!g && p > 0)) {
-        if (p /= g, g < 0) {
-          if (p < c)
+      if (g = r - a, !(!p && g > 0)) {
+        if (g /= p, p < 0) {
+          if (g < c)
             return;
-          p < f && (f = p);
-        } else if (g > 0) {
-          if (p > f)
+          g < f && (f = g);
+        } else if (p > 0) {
+          if (g > f)
             return;
-          p > c && (c = p);
+          g > c && (c = g);
         }
-        if (p = o - a, !(!g && p < 0)) {
-          if (p /= g, g < 0) {
-            if (p > f)
+        if (g = o - a, !(!p && g < 0)) {
+          if (g /= p, p < 0) {
+            if (g > f)
               return;
-            p > c && (c = p);
-          } else if (g > 0) {
-            if (p < c)
+            g > c && (c = g);
+          } else if (p > 0) {
+            if (g < c)
               return;
-            p < f && (f = p);
+            g < f && (f = g);
           }
-          return c > 0 && (n[0] = s + c * h, n[1] = a + c * g), f < 1 && (t[0] = s + f * h, t[1] = a + f * g), !0;
+          return c > 0 && (n[0] = s + c * h, n[1] = a + c * p), f < 1 && (t[0] = s + f * h, t[1] = a + f * p), !0;
         }
       }
     }
@@ -14269,42 +14269,42 @@ function Vi(n, t, e, r) {
 }
 function ba(n, t, e, r, i) {
   var o = [], s = [], a, u;
-  if (n.forEach(function(p) {
-    if (!((v = p.length - 1) <= 0)) {
-      var v, m = p[0], E = p[v], I;
-      if (zi(m, E)) {
-        for (i.lineStart(), a = 0; a < v; ++a)
-          i.point((m = p[a])[0], m[1]);
+  if (n.forEach(function(g) {
+    if (!((m = g.length - 1) <= 0)) {
+      var m, d = g[0], E = g[m], I;
+      if (zi(d, E)) {
+        for (i.lineStart(), a = 0; a < m; ++a)
+          i.point((d = g[a])[0], d[1]);
         i.lineEnd();
         return;
       }
-      o.push(I = new Vi(m, p, null, !0)), s.push(I.o = new Vi(m, null, I, !1)), o.push(I = new Vi(E, p, null, !1)), s.push(I.o = new Vi(E, null, I, !0));
+      o.push(I = new Vi(d, g, null, !0)), s.push(I.o = new Vi(d, null, I, !1)), o.push(I = new Vi(E, g, null, !1)), s.push(I.o = new Vi(E, null, I, !0));
     }
   }), !!o.length) {
     for (s.sort(t), Ds(o), Ds(s), a = 0, u = s.length; a < u; ++a)
       s[a].e = e = !e;
     for (var l = o[0], c, f; ; ) {
-      for (var h = l, g = !0; h.v; )
+      for (var h = l, p = !0; h.v; )
         if ((h = h.n) === l)
           return;
       c = h.z, i.lineStart();
       do {
         if (h.v = h.o.v = !0, h.e) {
-          if (g)
+          if (p)
             for (a = 0, u = c.length; a < u; ++a)
               i.point((f = c[a])[0], f[1]);
           else
             r(h.x, h.n.x, 1, i);
           h = h.n;
         } else {
-          if (g)
+          if (p)
             for (c = h.p.z, a = c.length - 1; a >= 0; --a)
               i.point((f = c[a])[0], f[1]);
           else
             r(h.x, h.p.x, -1, i);
           h = h.p;
         }
-        h = h.o, c = h.z, g = !g;
+        h = h.o, c = h.z, p = !p;
       } while (!h.v);
       i.lineEnd();
     }
@@ -14358,11 +14358,11 @@ function sl(n, t, e, r) {
     return n <= l && l <= e && t <= c && c <= r;
   }
   function o(l, c, f, h) {
-    var g = 0, p = 0;
-    if (l == null || (g = s(l, f)) !== (p = s(c, f)) || u(l, c) < 0 ^ f > 0)
+    var p = 0, g = 0;
+    if (l == null || (p = s(l, f)) !== (g = s(c, f)) || u(l, c) < 0 ^ f > 0)
       do
-        h.point(g === 0 || g === 3 ? n : e, g > 1 ? r : t);
-      while ((g = (g + f + 4) % 4) !== p);
+        h.point(p === 0 || p === 3 ? n : e, p > 1 ? r : t);
+      while ((p = (p + f + 4) % 4) !== g);
     else
       h.point(c[0], c[1]);
   }
@@ -14377,7 +14377,7 @@ function sl(n, t, e, r) {
     return f !== h ? f - h : f === 0 ? c[1] - l[1] : f === 1 ? l[0] - c[0] : f === 2 ? l[1] - c[1] : c[0] - l[0];
   }
   return function(l) {
-    var c = l, f = Pa(), h, g, p, v, m, E, I, C, S, D, R, F = {
+    var c = l, f = Pa(), h, p, g, m, d, E, I, C, x, R, O, F = {
       point: G,
       lineStart: nt,
       lineEnd: ct,
@@ -14388,35 +14388,35 @@ function sl(n, t, e, r) {
       i(X, ft) && c.point(X, ft);
     }
     function M() {
-      for (var X = 0, ft = 0, Gt = g.length; ft < Gt; ++ft)
-        for (var pe = g[ft], Te = 1, ii = pe.length, Pr = pe[0], un, br, Mi = Pr[0], wn = Pr[1]; Te < ii; ++Te)
+      for (var X = 0, ft = 0, Gt = p.length; ft < Gt; ++ft)
+        for (var pe = p[ft], Te = 1, ii = pe.length, Pr = pe[0], un, br, Mi = Pr[0], wn = Pr[1]; Te < ii; ++Te)
           un = Mi, br = wn, Pr = pe[Te], Mi = Pr[0], wn = Pr[1], br <= r ? wn > r && (Mi - un) * (r - br) > (wn - br) * (n - un) && ++X : wn <= r && (Mi - un) * (r - br) < (wn - br) * (n - un) && --X;
       return X;
     }
     function et() {
-      c = f, h = [], g = [], R = !0;
+      c = f, h = [], p = [], O = !0;
     }
     function K() {
-      var X = M(), ft = R && X, Gt = (h = Oa(h)).length;
-      (ft || Gt) && (l.polygonStart(), ft && (l.lineStart(), o(null, null, 1, l), l.lineEnd()), Gt && ba(h, a, X, o, l), l.polygonEnd()), c = l, h = g = p = null;
+      var X = M(), ft = O && X, Gt = (h = Oa(h)).length;
+      (ft || Gt) && (l.polygonStart(), ft && (l.lineStart(), o(null, null, 1, l), l.lineEnd()), Gt && ba(h, a, X, o, l), l.polygonEnd()), c = l, h = p = g = null;
     }
     function nt() {
-      F.point = w, g && g.push(p = []), D = !0, S = !1, I = C = NaN;
+      F.point = w, p && p.push(g = []), R = !0, x = !1, I = C = NaN;
     }
     function ct() {
-      h && (w(v, m), E && S && f.rejoin(), h.push(f.result())), F.point = G, S && c.lineEnd();
+      h && (w(m, d), E && x && f.rejoin(), h.push(f.result())), F.point = G, x && c.lineEnd();
     }
     function w(X, ft) {
       var Gt = i(X, ft);
-      if (g && p.push([X, ft]), D)
-        v = X, m = ft, E = Gt, D = !1, Gt && (c.lineStart(), c.point(X, ft));
-      else if (Gt && S)
+      if (p && g.push([X, ft]), R)
+        m = X, d = ft, E = Gt, R = !1, Gt && (c.lineStart(), c.point(X, ft));
+      else if (Gt && x)
         c.point(X, ft);
       else {
         var pe = [I = Math.max(ki, Math.min(ui, I)), C = Math.max(ki, Math.min(ui, C))], Te = [X = Math.max(ki, Math.min(ui, X)), ft = Math.max(ki, Math.min(ui, ft))];
-        nl(pe, Te, n, t, e, r) ? (S || (c.lineStart(), c.point(pe[0], pe[1])), c.point(Te[0], Te[1]), Gt || c.lineEnd(), R = !1) : Gt && (c.lineStart(), c.point(X, ft), R = !1);
+        nl(pe, Te, n, t, e, r) ? (x || (c.lineStart(), c.point(pe[0], pe[1])), c.point(Te[0], Te[1]), Gt || c.lineEnd(), O = !1) : Gt && (c.lineStart(), c.point(X, ft), O = !1);
       }
-      I = X, C = ft, S = Gt;
+      I = X, C = ft, x = Gt;
     }
     return F;
   };
@@ -14427,15 +14427,15 @@ function al(n, t) {
   Co.reset();
   for (var a = 0, u = n.length; a < u; ++a)
     if (c = (l = n[a]).length)
-      for (var l, c, f = l[c - 1], h = f[0], g = f[1] / 2 + xs, p = It(g), v = Et(g), m = 0; m < c; ++m, h = I, p = S, v = D, f = E) {
-        var E = l[m], I = E[0], C = E[1] / 2 + xs, S = It(C), D = Et(C), R = I - h, F = R >= 0 ? 1 : -1, G = F * R, M = G > Z, et = p * S;
-        if (Co.add(Qn(et * F * It(G), v * D + et * Et(G))), o += M ? R + F * Sr : R, M ^ h >= e ^ I >= e) {
+      for (var l, c, f = l[c - 1], h = f[0], p = f[1] / 2 + xs, g = It(p), m = Et(p), d = 0; d < c; ++d, h = I, g = x, m = R, f = E) {
+        var E = l[d], I = E[0], C = E[1] / 2 + xs, x = It(C), R = Et(C), O = I - h, F = O >= 0 ? 1 : -1, G = F * O, M = G > Z, et = g * x;
+        if (Co.add(Qn(et * F * It(G), m * R + et * Et(G))), o += M ? O + F * Sr : O, M ^ h >= e ^ I >= e) {
           var K = $i(Jn(f), Jn(E));
           Fo(K);
           var nt = $i(i, K);
           Fo(nt);
-          var ct = (M ^ R >= 0 ? -1 : 1) * In(nt[2]);
-          (r > ct || r === ct && (K[0] || K[1])) && (s += M ^ R >= 0 ? 1 : -1);
+          var ct = (M ^ O >= 0 ? -1 : 1) * In(nt[2]);
+          (r > ct || r === ct && (K[0] || K[1])) && (s += M ^ O >= 0 ? 1 : -1);
         }
       }
   return (o < -at || o < at && Co < -at) ^ s & 1;
@@ -14463,49 +14463,49 @@ function ul(n, t) {
 an();
 function Da(n, t, e, r) {
   return function(i, o) {
-    var s = t(o), a = i.invert(r[0], r[1]), u = Pa(), l = t(u), c = !1, f, h, g, p = {
-      point: v,
+    var s = t(o), a = i.invert(r[0], r[1]), u = Pa(), l = t(u), c = !1, f, h, p, g = {
+      point: m,
       lineStart: E,
       lineEnd: I,
       polygonStart: function() {
-        p.point = C, p.lineStart = S, p.lineEnd = D, h = [], f = [];
+        g.point = C, g.lineStart = x, g.lineEnd = R, h = [], f = [];
       },
       polygonEnd: function() {
-        p.point = v, p.lineStart = E, p.lineEnd = I, h = Oa(h);
-        var R = al(f, a);
-        h.length ? (c || (o.polygonStart(), c = !0), ba(h, cl, R, e, o)) : R && (c || (o.polygonStart(), c = !0), o.lineStart(), e(null, null, 1, o), o.lineEnd()), c && (o.polygonEnd(), c = !1), h = f = null;
+        g.point = m, g.lineStart = E, g.lineEnd = I, h = Oa(h);
+        var O = al(f, a);
+        h.length ? (c || (o.polygonStart(), c = !0), ba(h, cl, O, e, o)) : O && (c || (o.polygonStart(), c = !0), o.lineStart(), e(null, null, 1, o), o.lineEnd()), c && (o.polygonEnd(), c = !1), h = f = null;
       },
       sphere: function() {
         o.polygonStart(), o.lineStart(), e(null, null, 1, o), o.lineEnd(), o.polygonEnd();
       }
     };
-    function v(R, F) {
-      var G = i(R, F);
-      n(R = G[0], F = G[1]) && o.point(R, F);
+    function m(O, F) {
+      var G = i(O, F);
+      n(O = G[0], F = G[1]) && o.point(O, F);
     }
-    function m(R, F) {
-      var G = i(R, F);
+    function d(O, F) {
+      var G = i(O, F);
       s.point(G[0], G[1]);
     }
     function E() {
-      p.point = m, s.lineStart();
+      g.point = d, s.lineStart();
     }
     function I() {
-      p.point = v, s.lineEnd();
+      g.point = m, s.lineEnd();
     }
-    function C(R, F) {
-      g.push([R, F]);
-      var G = i(R, F);
+    function C(O, F) {
+      p.push([O, F]);
+      var G = i(O, F);
       l.point(G[0], G[1]);
     }
-    function S() {
-      l.lineStart(), g = [];
+    function x() {
+      l.lineStart(), p = [];
     }
-    function D() {
-      C(g[0][0], g[0][1]), l.lineEnd();
-      var R = l.clean(), F = u.result(), G, M = F.length, et, K, nt;
-      if (g.pop(), f.push(g), g = null, !!M) {
-        if (R & 1) {
+    function R() {
+      C(p[0][0], p[0][1]), l.lineEnd();
+      var O = l.clean(), F = u.result(), G, M = F.length, et, K, nt;
+      if (p.pop(), f.push(p), p = null, !!M) {
+        if (O & 1) {
           if (K = F[0], (et = K.length - 1) > 0) {
             for (c || (o.polygonStart(), c = !0), o.lineStart(), G = 0; G < et; ++G)
               o.point((nt = K[G])[0], nt[1]);
@@ -14513,10 +14513,10 @@ function Da(n, t, e, r) {
           }
           return;
         }
-        M > 1 && R & 2 && F.push(F.pop().concat(F.shift())), h.push(F.filter(ll));
+        M > 1 && O & 2 && F.push(F.pop().concat(F.shift())), h.push(F.filter(ll));
       }
     }
-    return p;
+    return g;
   };
 }
 function ll(n) {
@@ -14567,45 +14567,45 @@ function pl(n, t, e, r) {
 }
 function gl(n, t) {
   var e = Et(n), r = e > 0, i = Ut(e) > at;
-  function o(c, f, h, g) {
-    rl(g, n, t, h, c, f);
+  function o(c, f, h, p) {
+    rl(p, n, t, h, c, f);
   }
   function s(c, f) {
     return Et(c) * Et(f) > e;
   }
   function a(c) {
-    var f, h, g, p, v;
+    var f, h, p, g, m;
     return {
       lineStart: function() {
-        p = g = !1, v = 1;
+        g = p = !1, m = 1;
       },
-      point: function(m, E) {
-        var I = [m, E], C, S = s(m, E), D = r ? S ? 0 : l(m, E) : S ? l(m + (m < 0 ? Z : -Z), E) : 0;
-        if (!f && (p = g = S) && c.lineStart(), S !== g && (C = u(f, I), (!C || zi(f, C) || zi(I, C)) && (I[0] += at, I[1] += at, S = s(I[0], I[1]))), S !== g)
-          v = 0, S ? (c.lineStart(), C = u(I, f), c.point(C[0], C[1])) : (C = u(f, I), c.point(C[0], C[1]), c.lineEnd()), f = C;
-        else if (i && f && r ^ S) {
-          var R;
-          !(D & h) && (R = u(I, f, !0)) && (v = 0, r ? (c.lineStart(), c.point(R[0][0], R[0][1]), c.point(R[1][0], R[1][1]), c.lineEnd()) : (c.point(R[1][0], R[1][1]), c.lineEnd(), c.lineStart(), c.point(R[0][0], R[0][1])));
+      point: function(d, E) {
+        var I = [d, E], C, x = s(d, E), R = r ? x ? 0 : l(d, E) : x ? l(d + (d < 0 ? Z : -Z), E) : 0;
+        if (!f && (g = p = x) && c.lineStart(), x !== p && (C = u(f, I), (!C || zi(f, C) || zi(I, C)) && (I[0] += at, I[1] += at, x = s(I[0], I[1]))), x !== p)
+          m = 0, x ? (c.lineStart(), C = u(I, f), c.point(C[0], C[1])) : (C = u(f, I), c.point(C[0], C[1]), c.lineEnd()), f = C;
+        else if (i && f && r ^ x) {
+          var O;
+          !(R & h) && (O = u(I, f, !0)) && (m = 0, r ? (c.lineStart(), c.point(O[0][0], O[0][1]), c.point(O[1][0], O[1][1]), c.lineEnd()) : (c.point(O[1][0], O[1][1]), c.lineEnd(), c.lineStart(), c.point(O[0][0], O[0][1])));
         }
-        S && (!f || !zi(f, I)) && c.point(I[0], I[1]), f = I, g = S, h = D;
+        x && (!f || !zi(f, I)) && c.point(I[0], I[1]), f = I, p = x, h = R;
       },
       lineEnd: function() {
-        g && c.lineEnd(), f = null;
+        p && c.lineEnd(), f = null;
       },
       // Rejoin first and last segments if there were intersections and the first
       // and last points were visible.
       clean: function() {
-        return v | (p && g) << 1;
+        return m | (g && p) << 1;
       }
     };
   }
   function u(c, f, h) {
-    var g = Jn(c), p = Jn(f), v = [1, 0, 0], m = $i(g, p), E = Bi(m, m), I = m[0], C = E - I * I;
+    var p = Jn(c), g = Jn(f), m = [1, 0, 0], d = $i(p, g), E = Bi(d, d), I = d[0], C = E - I * I;
     if (!C)
       return !h && c;
-    var S = e * E / C, D = -e * I / C, R = $i(v, m), F = Gi(v, S), G = Gi(m, D);
+    var x = e * E / C, R = -e * I / C, O = $i(m, d), F = Gi(m, x), G = Gi(d, R);
     Io(F, G);
-    var M = R, et = Bi(F, M), K = Bi(M, M), nt = et * et - K * (Bi(F, F) - 1);
+    var M = O, et = Bi(F, M), K = Bi(M, M), nt = et * et - K * (Bi(F, F) - 1);
     if (!(nt < 0)) {
       var ct = ni(nt), w = Gi(M, (-et - ct) / K);
       if (Io(w, F), w = Ao(w), !h)
@@ -14620,8 +14620,8 @@ function gl(n, t) {
     }
   }
   function l(c, f) {
-    var h = r ? n : Z - n, g = 0;
-    return c < -h ? g |= 1 : c > h && (g |= 2), f < -h ? g |= 4 : f > h && (g |= 8), g;
+    var h = r ? n : Z - n, p = 0;
+    return c < -h ? p |= 1 : c > h && (p |= 2), f < -h ? p |= 4 : f > h && (p |= 8), p;
   }
   return Da(s, a, o, r ? [0, -n] : [-Z, n - Z]);
 }
@@ -14677,48 +14677,48 @@ function yl(n) {
   });
 }
 function ml(n, t) {
-  function e(r, i, o, s, a, u, l, c, f, h, g, p, v, m) {
+  function e(r, i, o, s, a, u, l, c, f, h, p, g, m, d) {
     var E = l - r, I = c - i, C = E * E + I * I;
-    if (C > 4 * t && v--) {
-      var S = s + h, D = a + g, R = u + p, F = ni(S * S + D * D + R * R), G = In(R /= F), M = Ut(Ut(R) - 1) < at || Ut(o - f) < at ? (o + f) / 2 : Qn(D, S), et = n(M, G), K = et[0], nt = et[1], ct = K - r, w = nt - i, X = I * ct - E * w;
-      (X * X / C > t || Ut((E * ct + I * w) / C - 0.5) > 0.3 || s * h + a * g + u * p < vl) && (e(r, i, o, s, a, u, K, nt, M, S /= F, D /= F, R, v, m), m.point(K, nt), e(K, nt, M, S, D, R, l, c, f, h, g, p, v, m));
+    if (C > 4 * t && m--) {
+      var x = s + h, R = a + p, O = u + g, F = ni(x * x + R * R + O * O), G = In(O /= F), M = Ut(Ut(O) - 1) < at || Ut(o - f) < at ? (o + f) / 2 : Qn(R, x), et = n(M, G), K = et[0], nt = et[1], ct = K - r, w = nt - i, X = I * ct - E * w;
+      (X * X / C > t || Ut((E * ct + I * w) / C - 0.5) > 0.3 || s * h + a * p + u * g < vl) && (e(r, i, o, s, a, u, K, nt, M, x /= F, R /= F, O, m, d), d.point(K, nt), e(K, nt, M, x, R, O, l, c, f, h, p, g, m, d));
     }
   }
   return function(r) {
-    var i, o, s, a, u, l, c, f, h, g, p, v, m = {
+    var i, o, s, a, u, l, c, f, h, p, g, m, d = {
       point: E,
       lineStart: I,
-      lineEnd: S,
+      lineEnd: x,
       polygonStart: function() {
-        r.polygonStart(), m.lineStart = D;
+        r.polygonStart(), d.lineStart = R;
       },
       polygonEnd: function() {
-        r.polygonEnd(), m.lineStart = I;
+        r.polygonEnd(), d.lineStart = I;
       }
     };
     function E(G, M) {
       G = n(G, M), r.point(G[0], G[1]);
     }
     function I() {
-      f = NaN, m.point = C, r.lineStart();
+      f = NaN, d.point = C, r.lineStart();
     }
     function C(G, M) {
       var et = Jn([G, M]), K = n(G, M);
-      e(f, h, c, g, p, v, f = K[0], h = K[1], c = G, g = et[0], p = et[1], v = et[2], Fs, r), r.point(f, h);
+      e(f, h, c, p, g, m, f = K[0], h = K[1], c = G, p = et[0], g = et[1], m = et[2], Fs, r), r.point(f, h);
     }
-    function S() {
-      m.point = E, r.lineEnd();
+    function x() {
+      d.point = E, r.lineEnd();
     }
-    function D() {
-      I(), m.point = R, m.lineEnd = F;
+    function R() {
+      I(), d.point = O, d.lineEnd = F;
     }
-    function R(G, M) {
-      C(i = G, M), o = f, s = h, a = g, u = p, l = v, m.point = C;
+    function O(G, M) {
+      C(i = G, M), o = f, s = h, a = p, u = g, l = m, d.point = C;
     }
     function F() {
-      e(f, h, c, g, p, v, o, s, i, a, u, l, Fs, r), m.lineEnd = S, S();
+      e(f, h, c, p, g, m, o, s, i, a, u, l, Fs, r), d.lineEnd = x, x();
     }
-    return m;
+    return d;
   };
 }
 var _l = Ta({
@@ -14732,22 +14732,22 @@ function El(n) {
   })();
 }
 function Il(n) {
-  var t, e = 150, r = 480, i = 250, o, s, a = 0, u = 0, l = 0, c = 0, f = 0, h, g, p = null, v = As, m = null, E, I, C, S = Ts, D = 0.5, R = Bs(K, D), F, G;
+  var t, e = 150, r = 480, i = 250, o, s, a = 0, u = 0, l = 0, c = 0, f = 0, h, p, g = null, m = As, d = null, E, I, C, x = Ts, R = 0.5, O = Bs(K, R), F, G;
   function M(w) {
-    return w = g(w[0] * Ae, w[1] * Ae), [w[0] * e + o, s - w[1] * e];
+    return w = p(w[0] * Ae, w[1] * Ae), [w[0] * e + o, s - w[1] * e];
   }
   function et(w) {
-    return w = g.invert((w[0] - o) / e, (s - w[1]) / e), w && [w[0] * Xr, w[1] * Xr];
+    return w = p.invert((w[0] - o) / e, (s - w[1]) / e), w && [w[0] * Xr, w[1] * Xr];
   }
   function K(w, X) {
     return w = t(w, X), [w[0] * e + o, s - w[1] * e];
   }
   M.stream = function(w) {
-    return F && G === w ? F : F = _l(v(h, R(S(G = w))));
+    return F && G === w ? F : F = _l(m(h, O(x(G = w))));
   }, M.clipAngle = function(w) {
-    return arguments.length ? (v = +w ? gl(p = w * Ae, 6 * Ae) : (p = null, As), ct()) : p * Xr;
+    return arguments.length ? (m = +w ? gl(g = w * Ae, 6 * Ae) : (g = null, As), ct()) : g * Xr;
   }, M.clipExtent = function(w) {
-    return arguments.length ? (S = w == null ? (m = E = I = C = null, Ts) : sl(m = +w[0][0], E = +w[0][1], I = +w[1][0], C = +w[1][1]), ct()) : m == null ? null : [[m, E], [I, C]];
+    return arguments.length ? (x = w == null ? (d = E = I = C = null, Ts) : sl(d = +w[0][0], E = +w[0][1], I = +w[1][0], C = +w[1][1]), ct()) : d == null ? null : [[d, E], [I, C]];
   }, M.scale = function(w) {
     return arguments.length ? (e = +w, nt()) : e;
   }, M.translate = function(w) {
@@ -14757,14 +14757,14 @@ function Il(n) {
   }, M.rotate = function(w) {
     return arguments.length ? (l = w[0] % 360 * Ae, c = w[1] % 360 * Ae, f = w.length > 2 ? w[2] % 360 * Ae : 0, nt()) : [l * Xr, c * Xr, f * Xr];
   }, M.precision = function(w) {
-    return arguments.length ? (R = Bs(K, D = w * w), ct()) : ni(D);
+    return arguments.length ? (O = Bs(K, R = w * w), ct()) : ni(R);
   }, M.fitExtent = function(w, X) {
     return Ma(M, w, X);
   }, M.fitSize = function(w, X) {
     return dl(M, w, X);
   };
   function nt() {
-    g = wa(h = el(l, c, f), t);
+    p = wa(h = el(l, c, f), t);
     var w = t(a, u);
     return o = r - w[0] * e, s = i + w[1] * e, ct();
   }
@@ -14844,21 +14844,21 @@ function Ui(n, t, e, r) {
   var i = n.properties || {}, o = n.type === "Feature" ? n.geometry : n;
   if (o.type === "GeometryCollection") {
     var s = [];
-    return Zs(n, function(v) {
-      var m = Ui(v, t, e, r);
-      m && s.push(m);
+    return Zs(n, function(m) {
+      var d = Ui(m, t, e, r);
+      d && s.push(d);
     }), bo(s);
   }
   var a = Sl(o), u = {
     type: o.type,
     coordinates: Va(o.coordinates, a)
-  }, l = new jo(), c = l.read(u), f = hu(pu(t, e), "meters"), h = Pt.bufferOp(c, f, r), g = new ua();
-  if (h = g.write(h), !Ga(h.coordinates)) {
-    var p = {
+  }, l = new jo(), c = l.read(u), f = hu(pu(t, e), "meters"), h = Pt.bufferOp(c, f, r), p = new ua();
+  if (h = p.write(h), !Ga(h.coordinates)) {
+    var g = {
       type: h.type,
       coordinates: ka(h.coordinates, a)
     };
-    return ro(p, i);
+    return ro(g, i);
   }
 }
 function Ga(n) {
@@ -14946,136 +14946,138 @@ function Pl(n, t, e = !0, r = !0, i = {}, o = {}, s = {
     filter: ["!", ["has", "isMask"]]
   }
 }) {
-  let a, u = [], l, c;
-  function f() {
-    (s != null && s.fill || s != null && s.line) && n.addSource("full-geom", {
+  let a, u = [], l, c, f;
+  function h() {
+    !n.getSource("full-geom") && (s != null && s.fill || s != null && s.line) && n.addSource("full-geom", {
       type: "geojson",
       data: zs
-    }), s != null && s.fill && n.addLayer({
+    }), !n.getLayer("full-geom-fill") && (s != null && s.fill) && n.addLayer({
       ...s == null ? void 0 : s.fill,
       id: "full-geom-fill",
       type: "fill",
       source: "full-geom"
-    }), s != null && s.line && n.addLayer({
+    }), !n.getLayer("full-geom-line") && (s != null && s.line) && n.addLayer({
       ...s == null ? void 0 : s.line,
       id: "full-geom-line",
       type: "line",
       source: "full-geom"
-    });
+    }), f && m(f);
   }
-  n.loaded() ? f() : n.once("load", () => {
-    f();
+  n.loaded() ? h() : n.once("load", () => {
+    h();
+  }), n.on("styledata", () => {
+    h();
   });
-  const h = (p) => {
+  const p = (d) => {
     a == null || a({
       type: "mapClick",
-      coordinates: [p.lngLat.lng, p.lngLat.lat]
+      coordinates: [d.lngLat.lng, d.lngLat.lat]
     });
   };
-  function g(p = !1) {
+  function g(d = !1) {
     if (!t)
       throw new Error();
-    const v = document.createElement("div");
-    return p && v.classList.add("marker-interactive"), new Mu({
+    const E = document.createElement("div");
+    return d && E.classList.add("marker-interactive"), new Mu({
       props: { displayIn: "maplibre" },
-      target: v
-    }), new t.Marker({ element: v, offset: [1, -13] });
+      target: E
+    }), new t.Marker({ element: E, offset: [1, -13] });
+  }
+  function m(d) {
+    var E;
+    f = d, (E = n.getSource("full-geom")) == null || E.setData(d);
   }
   return {
-    setEventHandler(p) {
-      p ? (a = p, n.on("click", h)) : (a = void 0, n.off("click", h));
+    setEventHandler(d) {
+      d ? (a = d, n.on("click", p)) : (a = void 0, n.off("click", p));
     },
-    flyTo(p, v) {
-      n.flyTo({ center: p, zoom: v, ...i });
+    flyTo(d, E) {
+      n.flyTo({ center: d, zoom: E, ...i });
     },
-    fitBounds(p, v, m) {
+    fitBounds(d, E, I) {
       n.fitBounds(
         [
-          [p[0], p[1]],
-          [p[2], p[3]]
+          [d[0], d[1]],
+          [d[2], d[3]]
         ],
-        { padding: v, maxZoom: m, ...o }
+        { padding: E, maxZoom: I, ...o }
       );
     },
-    indicateReverse(p) {
-      n.getCanvasContainer().style.cursor = p ? "crosshair" : "";
+    indicateReverse(d) {
+      n.getCanvasContainer().style.cursor = d ? "crosshair" : "";
     },
-    setReverseMarker(p) {
-      !t || !e || (c ? p ? c.setLngLat(p) : (c.remove(), c = void 0) : p && (c = (typeof e == "object" ? new t.Marker(e) : g()).setLngLat(p).addTo(n), c.getElement().classList.add("marker-reverse")));
+    setReverseMarker(d) {
+      !t || !e || (c ? d ? c.setLngLat(d) : (c.remove(), c = void 0) : d && (c = (typeof e == "object" ? new t.Marker(e) : g()).setLngLat(d).addTo(n), c.getElement().classList.add("marker-reverse")));
     },
-    setMarkers(p, v) {
-      if (!e)
-        return;
-      function m(E) {
-        var I;
-        (I = n.getSource("full-geom")) == null || I.setData(E);
-      }
-      for (const E of u)
-        E.remove();
-      if (u.length = 0, m(zs), !!t) {
-        if (v) {
-          let E = !1;
-          if (v.geometry.type === "GeometryCollection") {
-            const I = v.geometry.geometries.filter(
-              (C) => C.type === "Polygon" || C.type === "MultiPolygon"
-            );
-            if (I.length > 0) {
-              let C = I.pop();
-              for (const S of I)
-                C = gu(C, S);
-              ks({ ...v, geometry: C }, m), E = !0;
-            } else {
-              const C = v.geometry.geometries.filter(
-                (S) => S.type === "LineString" || S.type === "MultiLineString"
+    setMarkers(d, E) {
+      if (e) {
+        for (const I of u)
+          I.remove();
+        if (u.length = 0, m(zs), !!t) {
+          if (E) {
+            let I = !1;
+            if (E.geometry.type === "GeometryCollection") {
+              const C = E.geometry.geometries.filter(
+                (x) => x.type === "Polygon" || x.type === "MultiPolygon"
               );
-              C.length > 0 && (m({
-                ...v,
-                geometry: { type: "GeometryCollection", geometries: C }
-              }), E = !0);
+              if (C.length > 0) {
+                let x = C.pop();
+                for (const R of C)
+                  x = gu(x, R);
+                ks({ ...E, geometry: x }, m), I = !0;
+              } else {
+                const x = E.geometry.geometries.filter(
+                  (R) => R.type === "LineString" || R.type === "MultiLineString"
+                );
+                x.length > 0 && (m({
+                  ...E,
+                  geometry: { type: "GeometryCollection", geometries: x }
+                }), I = !0);
+              }
             }
-          }
-          if (!E) {
-            if (v.geometry.type === "Polygon" || v.geometry.type === "MultiPolygon")
-              ks(v, m);
-            else if (v.geometry.type === "LineString" || v.geometry.type === "MultiLineString") {
-              m(v);
-              return;
+            if (!I) {
+              if (E.geometry.type === "Polygon" || E.geometry.type === "MultiPolygon")
+                ks(E, m);
+              else if (E.geometry.type === "LineString" || E.geometry.type === "MultiLineString") {
+                m(E);
+                return;
+              }
             }
+            e && u.push(
+              (typeof e == "object" ? new t.Marker(e) : g()).setLngLat(E.center).addTo(n)
+            );
           }
-          e && u.push(
-            (typeof e == "object" ? new t.Marker(e) : g()).setLngLat(v.center).addTo(n)
-          );
+          if (r)
+            for (const I of d ?? []) {
+              if (I === E)
+                continue;
+              const C = (typeof r == "object" ? new t.Marker(r) : g(!0)).setLngLat(I.center).setPopup(
+                new t.Popup({
+                  offset: [1, -27],
+                  closeButton: !1,
+                  closeOnMove: !0,
+                  className: "maptiler-gc-popup"
+                }).setText(
+                  I.place_type[0] === "reverse" ? I.place_name : I.place_name.replace(/,.*/, "")
+                )
+              ).addTo(n), x = C.getElement();
+              x.addEventListener("click", (R) => {
+                R.stopPropagation(), a == null || a({ type: "markerClick", id: I.id });
+              }), x.addEventListener("mouseenter", () => {
+                a == null || a({ type: "markerMouseEnter", id: I.id }), C.togglePopup();
+              }), x.addEventListener("mouseleave", () => {
+                a == null || a({ type: "markerMouseLeave", id: I.id }), C.togglePopup();
+              }), u.push(C);
+            }
         }
-        if (r)
-          for (const E of p ?? []) {
-            if (E === v)
-              continue;
-            const I = (typeof r == "object" ? new t.Marker(r) : g(!0)).setLngLat(E.center).setPopup(
-              new t.Popup({
-                offset: [1, -27],
-                closeButton: !1,
-                closeOnMove: !0,
-                className: "maptiler-gc-popup"
-              }).setText(
-                E.place_type[0] === "reverse" ? E.place_name : E.place_name.replace(/,.*/, "")
-              )
-            ).addTo(n), C = I.getElement();
-            C.addEventListener("click", (S) => {
-              S.stopPropagation(), a == null || a({ type: "markerClick", id: E.id });
-            }), C.addEventListener("mouseenter", () => {
-              a == null || a({ type: "markerMouseEnter", id: E.id }), I.togglePopup();
-            }), C.addEventListener("mouseleave", () => {
-              a == null || a({ type: "markerMouseLeave", id: E.id }), I.togglePopup();
-            }), u.push(I);
-          }
       }
     },
-    setSelectedMarker(p) {
-      l && l.getElement().classList.toggle("marker-selected", !1), l = p > -1 ? u[p] : void 0, l == null || l.getElement().classList.toggle("marker-selected", !0);
+    setSelectedMarker(d) {
+      l && l.getElement().classList.toggle("marker-selected", !1), l = d > -1 ? u[d] : void 0, l == null || l.getElement().classList.toggle("marker-selected", !0);
     },
     getCenterAndZoom() {
-      const p = n.getCenter();
-      return [n.getZoom(), p.lng, p.lat];
+      const d = n.getCenter();
+      return [n.getZoom(), d.lng, d.lat];
     }
   };
 }