@maptiler/geocoding-control 2.0.0-rc.6 → 2.0.0-rc.7

package/leaflet-controller.js

@@ -35,82 +35,82 @@ function Ut(r, t, e = {}) {
 }
 function Yt(r, t, e) {
   if (r !== null)
-    for (var n, i, o, f, s, c, u, g = 0, l = 0, h, a = r.type, x = a === "FeatureCollection", p = a === "Feature", y = x ? r.features.length : 1, d = 0; d < y; d++) {
-      u = x ? r.features[d].geometry : p ? r.geometry : r, h = u ? u.type === "GeometryCollection" : !1, s = h ? u.geometries.length : 1;
-      for (var v = 0; v < s; v++) {
-        var w = 0, m = 0;
-        if (f = h ? u.geometries[v] : u, f !== null) {
-          c = f.coordinates;
-          var E = f.type;
-          switch (g = 0, E) {
+    for (var n, i, o, u, l, c, f, p = 0, s = 0, a, h = r.type, g = h === "FeatureCollection", d = h === "Feature", w = g ? r.features.length : 1, y = 0; y < w; y++) {
+      f = g ? r.features[y].geometry : d ? r.geometry : r, a = f ? f.type === "GeometryCollection" : !1, l = a ? f.geometries.length : 1;
+      for (var v = 0; v < l; v++) {
+        var x = 0, m = 0;
+        if (u = a ? f.geometries[v] : f, u !== null) {
+          c = u.coordinates;
+          var E = u.type;
+          switch (p = 0, E) {
             case null:
               break;
             case "Point":
               if (t(
                 c,
-                l,
-                d,
-                w,
+                s,
+                y,
+                x,
                 m
               ) === !1)
                 return !1;
-              l++, w++;
+              s++, x++;
               break;
             case "LineString":
             case "MultiPoint":
               for (n = 0; n < c.length; n++) {
                 if (t(
                   c[n],
-                  l,
-                  d,
-                  w,
+                  s,
+                  y,
+                  x,
                   m
                 ) === !1)
                   return !1;
-                l++, E === "MultiPoint" && w++;
+                s++, E === "MultiPoint" && x++;
               }
-              E === "LineString" && w++;
+              E === "LineString" && x++;
               break;
             case "Polygon":
             case "MultiLineString":
               for (n = 0; n < c.length; n++) {
-                for (i = 0; i < c[n].length - g; i++) {
+                for (i = 0; i < c[n].length - p; i++) {
                   if (t(
                     c[n][i],
-                    l,
-                    d,
-                    w,
+                    s,
+                    y,
+                    x,
                     m
                   ) === !1)
                     return !1;
-                  l++;
+                  s++;
                 }
-                E === "MultiLineString" && w++, E === "Polygon" && m++;
+                E === "MultiLineString" && x++, E === "Polygon" && m++;
               }
-              E === "Polygon" && w++;
+              E === "Polygon" && x++;
               break;
             case "MultiPolygon":
               for (n = 0; n < c.length; n++) {
                 for (m = 0, i = 0; i < c[n].length; i++) {
-                  for (o = 0; o < c[n][i].length - g; o++) {
+                  for (o = 0; o < c[n][i].length - p; o++) {
                     if (t(
                       c[n][i][o],
-                      l,
-                      d,
-                      w,
+                      s,
+                      y,
+                      x,
                       m
                     ) === !1)
                       return !1;
-                    l++;
+                    s++;
                   }
                   m++;
                 }
-                w++;
+                x++;
               }
               break;
             case "GeometryCollection":
-              for (n = 0; n < f.geometries.length; n++)
-                if (Yt(f.geometries[n], t) === !1)
+              for (n = 0; n < u.geometries.length; n++)
+                if (Yt(u.geometries[n], t) === !1)
                   return !1;
               break;
             default:
@@ -121,16 +121,16 @@ function Yt(r, t, e) {
     }
 }
 function vt(r, t) {
-  var e, n, i, o, f, s, c, u, g, l, h = 0, a = r.type === "FeatureCollection", x = r.type === "Feature", p = a ? r.features.length : 1;
-  for (e = 0; e < p; e++) {
-    for (s = a ? r.features[e].geometry : x ? r.geometry : r, u = a ? r.features[e].properties : x ? r.properties : {}, g = a ? r.features[e].bbox : x ? r.bbox : void 0, l = a ? r.features[e].id : x ? r.id : void 0, c = s ? s.type === "GeometryCollection" : !1, f = c ? s.geometries.length : 1, i = 0; i < f; i++) {
-      if (o = c ? s.geometries[i] : s, o === null) {
+  var e, n, i, o, u, l, c, f, p, s, a = 0, h = r.type === "FeatureCollection", g = r.type === "Feature", d = h ? r.features.length : 1;
+  for (e = 0; e < d; e++) {
+    for (l = h ? r.features[e].geometry : g ? r.geometry : r, f = h ? r.features[e].properties : g ? r.properties : {}, p = h ? r.features[e].bbox : g ? r.bbox : void 0, s = h ? r.features[e].id : g ? r.id : void 0, c = l ? l.type === "GeometryCollection" : !1, u = c ? l.geometries.length : 1, i = 0; i < u; i++) {
+      if (o = c ? l.geometries[i] : l, o === null) {
         if (t(
           null,
-          h,
-          u,
-          g,
-          l
+          a,
+          f,
+          p,
+          s
         ) === !1)
           return !1;
         continue;
@@ -144,10 +144,10 @@ function vt(r, t) {
         case "MultiPolygon": {
           if (t(
             o,
-            h,
-            u,
-            g,
-            l
+            a,
+            f,
+            p,
+            s
           ) === !1)
             return !1;
           break;
@@ -156,10 +156,10 @@ function vt(r, t) {
           for (n = 0; n < o.geometries.length; n++)
             if (t(
               o.geometries[n],
-              h,
-              u,
-              g,
-              l
+              a,
+              f,
+              p,
+              s
             ) === !1)
               return !1;
           break;
@@ -168,25 +168,25 @@ function vt(r, t) {
           throw new Error("Unknown Geometry Type");
       }
     }
-    h++;
+    a++;
   }
 }
 function se(r, t) {
-  vt(r, function(e, n, i, o, f) {
-    var s = e === null ? null : e.type;
-    switch (s) {
+  vt(r, function(e, n, i, o, u) {
+    var l = e === null ? null : e.type;
+    switch (l) {
       case null:
       case "Point":
       case "LineString":
       case "Polygon":
         return t(
-          V(e, i, { bbox: o, id: f }),
+          V(e, i, { bbox: o, id: u }),
           n,
           0
         ) === !1 ? !1 : void 0;
     }
     var c;
-    switch (s) {
+    switch (l) {
       case "MultiPoint":
         c = "Point";
         break;
@@ -197,12 +197,12 @@ function se(r, t) {
         c = "Polygon";
         break;
     }
-    for (var u = 0; u < e.coordinates.length; u++) {
-      var g = e.coordinates[u], l = {
+    for (var f = 0; f < e.coordinates.length; f++) {
+      var p = e.coordinates[f], s = {
         type: c,
-        coordinates: g
+        coordinates: p
       };
-      if (t(V(l, i), n, u) === !1)
+      if (t(V(s, i), n, f) === !1)
         return !1;
     }
   });
@@ -303,60 +303,60 @@ function he(r, t) {
   var e = { label: 0, sent: function() {
     if (o[0] & 1) throw o[1];
     return o[1];
-  }, trys: [], ops: [] }, n, i, o, f;
-  return f = { next: s(0), throw: s(1), return: s(2) }, typeof Symbol == "function" && (f[Symbol.iterator] = function() {
+  }, trys: [], ops: [] }, n, i, o, u;
+  return u = { next: l(0), throw: l(1), return: l(2) }, typeof Symbol == "function" && (u[Symbol.iterator] = function() {
     return this;
-  }), f;
-  function s(u) {
-    return function(g) {
-      return c([u, g]);
+  }), u;
+  function l(f) {
+    return function(p) {
+      return c([f, p]);
     };
   }
-  function c(u) {
+  function c(f) {
     if (n) throw new TypeError("Generator is already executing.");
     for (; e; ) try {
-      if (n = 1, i && (o = u[0] & 2 ? i.return : u[0] ? i.throw || ((o = i.return) && o.call(i), 0) : i.next) && !(o = o.call(i, u[1])).done) return o;
-      switch (i = 0, o && (u = [u[0] & 2, o.value]), u[0]) {
+      if (n = 1, i && (o = f[0] & 2 ? i.return : f[0] ? i.throw || ((o = i.return) && o.call(i), 0) : i.next) && !(o = o.call(i, f[1])).done) return o;
+      switch (i = 0, o && (f = [f[0] & 2, o.value]), f[0]) {
         case 0:
         case 1:
-          o = u;
+          o = f;
           break;
         case 4:
-          return e.label++, { value: u[1], done: !1 };
+          return e.label++, { value: f[1], done: !1 };
         case 5:
-          e.label++, i = u[1], u = [0];
+          e.label++, i = f[1], f = [0];
           continue;
         case 7:
-          u = e.ops.pop(), e.trys.pop();
+          f = e.ops.pop(), e.trys.pop();
           continue;
         default:
-          if (o = e.trys, !(o = o.length > 0 && o[o.length - 1]) && (u[0] === 6 || u[0] === 2)) {
+          if (o = e.trys, !(o = o.length > 0 && o[o.length - 1]) && (f[0] === 6 || f[0] === 2)) {
             e = 0;
             continue;
           }
-          if (u[0] === 3 && (!o || u[1] > o[0] && u[1] < o[3])) {
-            e.label = u[1];
+          if (f[0] === 3 && (!o || f[1] > o[0] && f[1] < o[3])) {
+            e.label = f[1];
             break;
           }
-          if (u[0] === 6 && e.label < o[1]) {
-            e.label = o[1], o = u;
+          if (f[0] === 6 && e.label < o[1]) {
+            e.label = o[1], o = f;
             break;
           }
           if (o && e.label < o[2]) {
-            e.label = o[2], e.ops.push(u);
+            e.label = o[2], e.ops.push(f);
             break;
           }
           o[2] && e.ops.pop(), e.trys.pop();
           continue;
       }
-      u = t.call(r, e);
-    } catch (g) {
-      u = [6, g], i = 0;
+      f = t.call(r, e);
+    } catch (p) {
+      f = [6, p], i = 0;
     } finally {
       n = o = 0;
     }
-    if (u[0] & 5) throw u[1];
-    return { value: u[0] ? u[1] : void 0, done: !0 };
+    if (f[0] & 5) throw f[1];
+    return { value: f[0] ? f[1] : void 0, done: !0 };
   }
 }
 var F = (
@@ -373,22 +373,22 @@ function ae(r, t) {
 }
 function B(r, t, e) {
   for (var n = new F(null, null), i = n, o = n; ; ) {
-    var f = e(r, t.key);
-    if (f < 0) {
+    var u = e(r, t.key);
+    if (u < 0) {
       if (t.left === null)
         break;
       if (e(r, t.left.key) < 0) {
-        var s = t.left;
-        if (t.left = s.right, s.right = t, t = s, t.left === null)
+        var l = t.left;
+        if (t.left = l.right, l.right = t, t = l, t.left === null)
           break;
       }
       o.left = t, o = t, t = t.left;
-    } else if (f > 0) {
+    } else if (u > 0) {
       if (t.right === null)
         break;
       if (e(r, t.right.key) > 0) {
-        var s = t.right;
-        if (t.right = s.left, s.left = t, t = s, t.right === null)
+        var l = t.right;
+        if (t.right = l.left, l.left = t, t = l, t.right === null)
           break;
       }
       i.right = t, i = t, t = t.right;
@@ -414,7 +414,7 @@ function bt(r, t, e) {
   }
   return { left: n, right: i };
 }
-function ge(r, t, e) {
+function pe(r, t, e) {
   return t === null ? r : (r === null || (t = B(r.key, t, e), t.left = r), t);
 }
 function ft(r, t, e, n, i) {
@@ -436,8 +436,8 @@ var wt = (
     }, r.prototype.add = function(t, e) {
       var n = new F(t, e);
       this._root === null && (n.left = n.right = null, this._size++, this._root = n);
-      var i = this._comparator, o = B(t, this._root, i), f = i(t, o.key);
-      return f === 0 ? this._root = o : (f < 0 ? (n.left = o.left, n.right = o, o.left = null) : f > 0 && (n.right = o.right, n.left = o, o.right = null), this._size++, this._root = n), this._root;
+      var i = this._comparator, o = B(t, this._root, i), u = i(t, o.key);
+      return u === 0 ? this._root = o : (u < 0 ? (n.left = o.left, n.right = o, o.left = null) : u > 0 && (n.right = o.right, n.left = o, o.right = null), this._size++, this._root = n), this._root;
     }, r.prototype.remove = function(t) {
       this._root = this._remove(t, this._root, this._comparator);
     }, r.prototype._remove = function(t, e, n) {
@@ -478,15 +478,15 @@ var wt = (
         n !== null ? (i.push(n), n = n.left) : i.length !== 0 ? (n = i.pop(), t.call(e, n), n = n.right) : o = !0;
       return this;
     }, r.prototype.range = function(t, e, n, i) {
-      for (var o = [], f = this._comparator, s = this._root, c; o.length !== 0 || s; )
-        if (s)
-          o.push(s), s = s.left;
+      for (var o = [], u = this._comparator, l = this._root, c; o.length !== 0 || l; )
+        if (l)
+          o.push(l), l = l.left;
         else {
-          if (s = o.pop(), c = f(s.key, e), c > 0)
+          if (l = o.pop(), c = u(l.key, e), c > 0)
             break;
-          if (f(s.key, t) >= 0 && n.call(i, s))
+          if (u(l.key, t) >= 0 && n.call(i, l))
             return this;
-          s = s.right;
+          l = l.right;
         }
       return this;
     }, r.prototype.keys = function() {
@@ -564,8 +564,8 @@ var wt = (
       if (n && at(t, e, 0, i - 1, o), this._root === null)
         this._root = ct(t, e, 0, i), this._size = i;
       else {
-        var f = de(this.toList(), pe(t, e), o);
-        i = this._size + i, this._root = ht({ head: f }, 0, i);
+        var u = de(this.toList(), ge(t, e), o);
+        i = this._size + i, this._root = ht({ head: u }, 0, i);
       }
       return this;
     }, r.prototype.isEmpty = function() {
@@ -591,8 +591,8 @@ var wt = (
         return e.push(n);
       }, t), e.join("");
     }, r.prototype.update = function(t, e, n) {
-      var i = this._comparator, o = bt(t, this._root, i), f = o.left, s = o.right;
-      i(t, e) < 0 ? s = ot(e, n, s, i) : f = ot(e, n, f, i), this._root = ge(f, s, i);
+      var i = this._comparator, o = bt(t, this._root, i), u = o.left, l = o.right;
+      i(t, e) < 0 ? l = ot(e, n, l, i) : u = ot(e, n, u, i), this._root = pe(u, l, i);
     }, r.prototype.split = function(t) {
       return bt(t, this._root, this._comparator);
     }, r.prototype[Symbol.iterator] = function() {
@@ -624,12 +624,12 @@ var wt = (
 function ct(r, t, e, n) {
   var i = n - e;
   if (i > 0) {
-    var o = e + Math.floor(i / 2), f = r[o], s = t[o], c = new F(f, s);
+    var o = e + Math.floor(i / 2), u = r[o], l = t[o], c = new F(u, l);
     return c.left = ct(r, t, e, o), c.right = ct(r, t, o + 1, n), c;
   }
   return null;
 }
-function pe(r, t) {
+function ge(r, t) {
   for (var e = new F(null, null), n = e, i = 0; i < r.length; i++)
     n = n.next = new F(r[i], t[i]);
   return n.next = null, e.next;
@@ -642,46 +642,46 @@ function ye(r) {
 function ht(r, t, e) {
   var n = e - t;
   if (n > 0) {
-    var i = t + Math.floor(n / 2), o = ht(r, t, i), f = r.head;
-    return f.left = o, r.head = r.head.next, f.right = ht(r, i + 1, e), f;
+    var i = t + Math.floor(n / 2), o = ht(r, t, i), u = r.head;
+    return u.left = o, r.head = r.head.next, u.right = ht(r, i + 1, e), u;
   }
   return null;
 }
 function de(r, t, e) {
-  for (var n = new F(null, null), i = n, o = r, f = t; o !== null && f !== null; )
-    e(o.key, f.key) < 0 ? (i.next = o, o = o.next) : (i.next = f, f = f.next), i = i.next;
-  return o !== null ? i.next = o : f !== null && (i.next = f), n.next;
+  for (var n = new F(null, null), i = n, o = r, u = t; o !== null && u !== null; )
+    e(o.key, u.key) < 0 ? (i.next = o, o = o.next) : (i.next = u, u = u.next), i = i.next;
+  return o !== null ? i.next = o : u !== null && (i.next = u), n.next;
 }
 function at(r, t, e, n, i) {
   if (!(e >= n)) {
-    for (var o = r[e + n >> 1], f = e - 1, s = n + 1; ; ) {
+    for (var o = r[e + n >> 1], u = e - 1, l = n + 1; ; ) {
       do
-        f++;
-      while (i(r[f], o) < 0);
+        u++;
+      while (i(r[u], o) < 0);
       do
-        s--;
-      while (i(r[s], o) > 0);
-      if (f >= s)
+        l--;
+      while (i(r[l], o) > 0);
+      if (u >= l)
         break;
-      var c = r[f];
-      r[f] = r[s], r[s] = c, c = t[f], t[f] = t[s], t[s] = c;
+      var c = r[u];
+      r[u] = r[l], r[l] = c, c = t[u], t[u] = t[l], t[l] = c;
     }
-    at(r, t, e, s, i), at(r, t, s + 1, n, i);
+    at(r, t, e, l, i), at(r, t, l + 1, n, i);
   }
 }
 const O = 11102230246251565e-32, S = 134217729, xe = (3 + 8 * O) * O;
 function st(r, t, e, n, i) {
-  let o, f, s, c, u = t[0], g = n[0], l = 0, h = 0;
-  g > u == g > -u ? (o = u, u = t[++l]) : (o = g, g = n[++h]);
-  let a = 0;
-  if (l < r && h < e)
-    for (g > u == g > -u ? (f = u + o, s = o - (f - u), u = t[++l]) : (f = g + o, s = o - (f - g), g = n[++h]), o = f, s !== 0 && (i[a++] = s); l < r && h < e; )
-      g > u == g > -u ? (f = o + u, c = f - o, s = o - (f - c) + (u - c), u = t[++l]) : (f = o + g, c = f - o, s = o - (f - c) + (g - c), g = n[++h]), o = f, s !== 0 && (i[a++] = s);
-  for (; l < r; )
-    f = o + u, c = f - o, s = o - (f - c) + (u - c), u = t[++l], o = f, s !== 0 && (i[a++] = s);
-  for (; h < e; )
-    f = o + g, c = f - o, s = o - (f - c) + (g - c), g = n[++h], o = f, s !== 0 && (i[a++] = s);
-  return (o !== 0 || a === 0) && (i[a++] = o), a;
+  let o, u, l, c, f = t[0], p = n[0], s = 0, a = 0;
+  p > f == p > -f ? (o = f, f = t[++s]) : (o = p, p = n[++a]);
+  let h = 0;
+  if (s < r && a < e)
+    for (p > f == p > -f ? (u = f + o, l = o - (u - f), f = t[++s]) : (u = p + o, l = o - (u - p), p = n[++a]), o = u, l !== 0 && (i[h++] = l); s < r && a < e; )
+      p > f == p > -f ? (u = o + f, c = u - o, l = o - (u - c) + (f - c), f = t[++s]) : (u = o + p, c = u - o, l = o - (u - c) + (p - c), p = n[++a]), o = u, l !== 0 && (i[h++] = l);
+  for (; s < r; )
+    u = o + f, c = u - o, l = o - (u - c) + (f - c), f = t[++s], o = u, l !== 0 && (i[h++] = l);
+  for (; a < e; )
+    u = o + p, c = u - o, l = o - (u - c) + (p - c), p = n[++a], o = u, l !== 0 && (i[h++] = l);
+  return (o !== 0 || h === 0) && (i[h++] = o), h;
 }
 function ve(r, t) {
   let e = t[0];
@@ -692,25 +692,25 @@ function K(r) {
   return new Float64Array(r);
 }
 const me = (3 + 16 * O) * O, we = (2 + 12 * O) * O, Ee = (9 + 64 * O) * O * O, q = K(4), _t = K(8), St = K(12), Pt = K(16), P = K(4);
-function be(r, t, e, n, i, o, f) {
-  let s, c, u, g, l, h, a, x, p, y, d, v, w, m, E, b, M, _;
-  const C = r - i, R = e - i, I = t - o, k = n - o;
-  m = C * k, h = S * C, a = h - (h - C), x = C - a, h = S * k, p = h - (h - k), y = k - p, E = x * y - (m - a * p - x * p - a * y), b = I * R, h = S * I, a = h - (h - I), x = I - a, h = S * R, p = h - (h - R), y = R - p, M = x * y - (b - a * p - x * p - a * y), d = E - M, l = E - d, q[0] = E - (d + l) + (l - M), v = m + d, l = v - m, w = m - (v - l) + (d - l), d = w - b, l = w - d, q[1] = w - (d + l) + (l - b), _ = v + d, l = _ - v, q[2] = v - (_ - l) + (d - l), q[3] = _;
-  let A = ve(4, q), D = we * f;
-  if (A >= D || -A >= D || (l = r - C, s = r - (C + l) + (l - i), l = e - R, u = e - (R + l) + (l - i), l = t - I, c = t - (I + l) + (l - o), l = n - k, g = n - (k + l) + (l - o), s === 0 && c === 0 && u === 0 && g === 0) || (D = Ee * f + xe * Math.abs(A), A += C * g + k * s - (I * u + R * c), A >= D || -A >= D)) return A;
-  m = s * k, h = S * s, a = h - (h - s), x = s - a, h = S * k, p = h - (h - k), y = k - p, E = x * y - (m - a * p - x * p - a * y), b = c * R, h = S * c, a = h - (h - c), x = c - a, h = S * R, p = h - (h - R), y = R - p, M = x * y - (b - a * p - x * p - a * y), d = E - M, l = E - d, P[0] = E - (d + l) + (l - M), v = m + d, l = v - m, w = m - (v - l) + (d - l), d = w - b, l = w - d, P[1] = w - (d + l) + (l - b), _ = v + d, l = _ - v, P[2] = v - (_ - l) + (d - l), P[3] = _;
+function be(r, t, e, n, i, o, u) {
+  let l, c, f, p, s, a, h, g, d, w, y, v, x, m, E, b, M, _;
+  const C = r - i, R = e - i, I = t - o, $ = n - o;
+  m = C * $, a = S * C, h = a - (a - C), g = C - h, a = S * $, d = a - (a - $), w = $ - d, E = g * w - (m - h * d - g * d - h * w), b = I * R, a = S * I, h = a - (a - I), g = I - h, a = S * R, d = a - (a - R), w = R - d, M = g * w - (b - h * d - g * d - h * w), y = E - M, s = E - y, q[0] = E - (y + s) + (s - M), v = m + y, s = v - m, x = m - (v - s) + (y - s), y = x - b, s = x - y, q[1] = x - (y + s) + (s - b), _ = v + y, s = _ - v, q[2] = v - (_ - s) + (y - s), q[3] = _;
+  let A = ve(4, q), D = we * u;
+  if (A >= D || -A >= D || (s = r - C, l = r - (C + s) + (s - i), s = e - R, f = e - (R + s) + (s - i), s = t - I, c = t - (I + s) + (s - o), s = n - $, p = n - ($ + s) + (s - o), l === 0 && c === 0 && f === 0 && p === 0) || (D = Ee * u + xe * Math.abs(A), A += C * p + $ * l - (I * f + R * c), A >= D || -A >= D)) return A;
+  m = l * $, a = S * l, h = a - (a - l), g = l - h, a = S * $, d = a - (a - $), w = $ - d, E = g * w - (m - h * d - g * d - h * w), b = c * R, a = S * c, h = a - (a - c), g = c - h, a = S * R, d = a - (a - R), w = R - d, M = g * w - (b - h * d - g * d - h * w), y = E - M, s = E - y, P[0] = E - (y + s) + (s - M), v = m + y, s = v - m, x = m - (v - s) + (y - s), y = x - b, s = x - y, P[1] = x - (y + s) + (s - b), _ = v + y, s = _ - v, P[2] = v - (_ - s) + (y - s), P[3] = _;
   const ee = st(4, q, 4, P, _t);
-  m = C * g, h = S * C, a = h - (h - C), x = C - a, h = S * g, p = h - (h - g), y = g - p, E = x * y - (m - a * p - x * p - a * y), b = I * u, h = S * I, a = h - (h - I), x = I - a, h = S * u, p = h - (h - u), y = u - p, M = x * y - (b - a * p - x * p - a * y), d = E - M, l = E - d, P[0] = E - (d + l) + (l - M), v = m + d, l = v - m, w = m - (v - l) + (d - l), d = w - b, l = w - d, P[1] = w - (d + l) + (l - b), _ = v + d, l = _ - v, P[2] = v - (_ - l) + (d - l), P[3] = _;
+  m = C * p, a = S * C, h = a - (a - C), g = C - h, a = S * p, d = a - (a - p), w = p - d, E = g * w - (m - h * d - g * d - h * w), b = I * f, a = S * I, h = a - (a - I), g = I - h, a = S * f, d = a - (a - f), w = f - d, M = g * w - (b - h * d - g * d - h * w), y = E - M, s = E - y, P[0] = E - (y + s) + (s - M), v = m + y, s = v - m, x = m - (v - s) + (y - s), y = x - b, s = x - y, P[1] = x - (y + s) + (s - b), _ = v + y, s = _ - v, P[2] = v - (_ - s) + (y - s), P[3] = _;
   const ne = st(ee, _t, 4, P, St);
-  m = s * g, h = S * s, a = h - (h - s), x = s - a, h = S * g, p = h - (h - g), y = g - p, E = x * y - (m - a * p - x * p - a * y), b = c * u, h = S * c, a = h - (h - c), x = c - a, h = S * u, p = h - (h - u), y = u - p, M = x * y - (b - a * p - x * p - a * y), d = E - M, l = E - d, P[0] = E - (d + l) + (l - M), v = m + d, l = v - m, w = m - (v - l) + (d - l), d = w - b, l = w - d, P[1] = w - (d + l) + (l - b), _ = v + d, l = _ - v, P[2] = v - (_ - l) + (d - l), P[3] = _;
+  m = l * p, a = S * l, h = a - (a - l), g = l - h, a = S * p, d = a - (a - p), w = p - d, E = g * w - (m - h * d - g * d - h * w), b = c * f, a = S * c, h = a - (a - c), g = c - h, a = S * f, d = a - (a - f), w = f - d, M = g * w - (b - h * d - g * d - h * w), y = E - M, s = E - y, P[0] = E - (y + s) + (s - M), v = m + y, s = v - m, x = m - (v - s) + (y - s), y = x - b, s = x - y, P[1] = x - (y + s) + (s - b), _ = v + y, s = _ - v, P[2] = v - (_ - s) + (y - s), P[3] = _;
   const re = st(ne, St, 4, P, Pt);
   return Pt[re - 1];
 }
 function _e(r, t, e, n, i, o) {
-  const f = (t - o) * (e - i), s = (r - i) * (n - o), c = f - s, u = Math.abs(f + s);
-  return Math.abs(c) >= me * u ? c : -be(r, t, e, n, i, o, u);
+  const u = (t - o) * (e - i), l = (r - i) * (n - o), c = u - l, f = Math.abs(u + l);
+  return Math.abs(c) >= me * f ? c : -be(r, t, e, n, i, o, f);
 }
-const j = (r, t) => r.ll.x <= t.x && t.x <= r.ur.x && r.ll.y <= t.y && t.y <= r.ur.y, gt = (r, t) => {
+const j = (r, t) => r.ll.x <= t.x && t.x <= r.ur.x && r.ll.y <= t.y && t.y <= r.ur.y, pt = (r, t) => {
   if (t.ur.x < r.ll.x || r.ur.x < t.ll.x || t.ur.y < r.ll.y || r.ur.y < t.ll.y) return null;
   const e = r.ll.x < t.ll.x ? t.ll.x : r.ll.x, n = r.ur.x < t.ur.x ? r.ur.x : t.ur.x, i = r.ll.y < t.ll.y ? t.ll.y : r.ll.y, o = r.ur.y < t.ur.y ? r.ur.y : t.ur.y;
   return {
@@ -802,10 +802,10 @@ const J = new Pe(), tt = (r, t) => r.x * t.y - r.y * t.x, Vt = (r, t) => r.x * t
   const o = {
     x: e.x - r.x,
     y: e.y - r.y
-  }, f = tt(o, t) / i, s = tt(o, n) / i, c = r.x + s * t.x, u = e.x + f * n.x, g = r.y + s * t.y, l = e.y + f * n.y, h = (c + u) / 2, a = (g + l) / 2;
+  }, u = tt(o, t) / i, l = tt(o, n) / i, c = r.x + l * t.x, f = e.x + u * n.x, p = r.y + l * t.y, s = e.y + u * n.y, a = (c + f) / 2, h = (p + s) / 2;
   return {
-    x: h,
-    y: a
+    x: a,
+    y: h
   };
 };
 class L {
@@ -874,13 +874,13 @@ class L {
     return (i, o) => {
       e.has(i) || n(i), e.has(o) || n(o);
       const {
-        sine: f,
-        cosine: s
+        sine: u,
+        cosine: l
       } = e.get(i), {
         sine: c,
-        cosine: u
+        cosine: f
       } = e.get(o);
-      return f >= 0 && c >= 0 ? s < u ? 1 : s > u ? -1 : 0 : f < 0 && c < 0 ? s < u ? -1 : s > u ? 1 : 0 : c < f ? -1 : c > f ? 1 : 0;
+      return u >= 0 && c >= 0 ? l < f ? 1 : l > f ? -1 : 0 : u < 0 && c < 0 ? l < f ? -1 : l > f ? 1 : 0 : c < u ? -1 : c > u ? 1 : 0;
     };
   }
 }
@@ -900,44 +900,44 @@ class z {
    * is directly on the right-more of the two left inputs.
    */
   static compare(t, e) {
-    const n = t.leftSE.point.x, i = e.leftSE.point.x, o = t.rightSE.point.x, f = e.rightSE.point.x;
-    if (f < n) return 1;
+    const n = t.leftSE.point.x, i = e.leftSE.point.x, o = t.rightSE.point.x, u = e.rightSE.point.x;
+    if (u < n) return 1;
     if (o < i) return -1;
-    const s = t.leftSE.point.y, c = e.leftSE.point.y, u = t.rightSE.point.y, g = e.rightSE.point.y;
+    const l = t.leftSE.point.y, c = e.leftSE.point.y, f = t.rightSE.point.y, p = e.rightSE.point.y;
     if (n < i) {
-      if (c < s && c < u) return 1;
-      if (c > s && c > u) return -1;
-      const l = t.comparePoint(e.leftSE.point);
-      if (l < 0) return 1;
-      if (l > 0) return -1;
-      const h = e.comparePoint(t.rightSE.point);
-      return h !== 0 ? h : -1;
+      if (c < l && c < f) return 1;
+      if (c > l && c > f) return -1;
+      const s = t.comparePoint(e.leftSE.point);
+      if (s < 0) return 1;
+      if (s > 0) return -1;
+      const a = e.comparePoint(t.rightSE.point);
+      return a !== 0 ? a : -1;
     }
     if (n > i) {
-      if (s < c && s < g) return -1;
-      if (s > c && s > g) return 1;
-      const l = e.comparePoint(t.leftSE.point);
-      if (l !== 0) return l;
-      const h = t.comparePoint(e.rightSE.point);
-      return h < 0 ? 1 : h > 0 ? -1 : 1;
+      if (l < c && l < p) return -1;
+      if (l > c && l > p) return 1;
+      const s = e.comparePoint(t.leftSE.point);
+      if (s !== 0) return s;
+      const a = t.comparePoint(e.rightSE.point);
+      return a < 0 ? 1 : a > 0 ? -1 : 1;
     }
-    if (s < c) return -1;
-    if (s > c) return 1;
-    if (o < f) {
-      const l = e.comparePoint(t.rightSE.point);
-      if (l !== 0) return l;
+    if (l < c) return -1;
+    if (l > c) return 1;
+    if (o < u) {
+      const s = e.comparePoint(t.rightSE.point);
+      if (s !== 0) return s;
     }
-    if (o > f) {
-      const l = t.comparePoint(e.rightSE.point);
-      if (l < 0) return 1;
-      if (l > 0) return -1;
+    if (o > u) {
+      const s = t.comparePoint(e.rightSE.point);
+      if (s < 0) return 1;
+      if (s > 0) return -1;
     }
-    if (o !== f) {
-      const l = u - s, h = o - n, a = g - c, x = f - i;
-      if (l > h && a < x) return 1;
-      if (l < h && a > x) return -1;
+    if (o !== u) {
+      const s = f - l, a = o - n, h = p - c, g = u - i;
+      if (s > a && h < g) return 1;
+      if (s < a && h > g) return -1;
     }
-    return o > f ? 1 : o < f || u < g ? -1 : u > g ? 1 : t.id < e.id ? -1 : t.id > e.id ? 1 : 0;
+    return o > u ? 1 : o < u || f < p ? -1 : f > p ? 1 : t.id < e.id ? -1 : t.id > e.id ? 1 : 0;
   }
   /* Warning: a reference to ringWindings input will be stored,
    *  and possibly will be later modified */
@@ -945,15 +945,15 @@ class z {
     this.id = ++Re, this.leftSE = t, t.segment = this, t.otherSE = e, this.rightSE = e, e.segment = this, e.otherSE = t, this.rings = n, this.windings = i;
   }
   static fromRing(t, e, n) {
-    let i, o, f;
-    const s = L.comparePoints(t, e);
-    if (s < 0)
-      i = t, o = e, f = 1;
-    else if (s > 0)
-      i = e, o = t, f = -1;
+    let i, o, u;
+    const l = L.comparePoints(t, e);
+    if (l < 0)
+      i = t, o = e, u = 1;
+    else if (l > 0)
+      i = e, o = t, u = -1;
     else throw new Error(`Tried to create degenerate segment at [${t.x}, ${t.y}]`);
-    const c = new L(i, !0), u = new L(o, !1);
-    return new z(c, u, [n], [f]);
+    const c = new L(i, !0), f = new L(o, !1);
+    return new z(c, f, [n], [u]);
   }
   /* When a segment is split, the rightSE is replaced with a new sweep event */
   replaceRightSE(t) {
@@ -1000,9 +1000,9 @@ class z {
     const e = this.leftSE.point, n = this.rightSE.point, i = this.vector();
     if (e.x === n.x)
       return t.x === e.x ? 0 : t.x < e.x ? 1 : -1;
-    const o = (t.y - e.y) / i.y, f = e.x + o * i.x;
-    if (t.x === f) return 0;
-    const s = (t.x - e.x) / i.x, c = e.y + s * i.y;
+    const o = (t.y - e.y) / i.y, u = e.x + o * i.x;
+    if (t.x === u) return 0;
+    const l = (t.x - e.x) / i.x, c = e.y + l * i.y;
     return t.y === c ? 0 : t.y < c ? -1 : 1;
   }
   /**
@@ -1021,20 +1021,20 @@ class z {
    * Else, return null.
    */
   getIntersection(t) {
-    const e = this.bbox(), n = t.bbox(), i = gt(e, n);
+    const e = this.bbox(), n = t.bbox(), i = pt(e, n);
     if (i === null) return null;
-    const o = this.leftSE.point, f = this.rightSE.point, s = t.leftSE.point, c = t.rightSE.point, u = j(e, s) && this.comparePoint(s) === 0, g = j(n, o) && t.comparePoint(o) === 0, l = j(e, c) && this.comparePoint(c) === 0, h = j(n, f) && t.comparePoint(f) === 0;
-    if (g && u)
-      return h && !l ? f : !h && l ? c : null;
-    if (g)
-      return l && o.x === c.x && o.y === c.y ? null : o;
-    if (u)
-      return h && f.x === s.x && f.y === s.y ? null : s;
-    if (h && l) return null;
-    if (h) return f;
-    if (l) return c;
-    const a = Ce(o, this.vector(), s, t.vector());
-    return a === null || !j(i, a) ? null : J.round(a.x, a.y);
+    const o = this.leftSE.point, u = this.rightSE.point, l = t.leftSE.point, c = t.rightSE.point, f = j(e, l) && this.comparePoint(l) === 0, p = j(n, o) && t.comparePoint(o) === 0, s = j(e, c) && this.comparePoint(c) === 0, a = j(n, u) && t.comparePoint(u) === 0;
+    if (p && f)
+      return a && !s ? u : !a && s ? c : null;
+    if (p)
+      return s && o.x === c.x && o.y === c.y ? null : o;
+    if (f)
+      return a && u.x === l.x && u.y === l.y ? null : l;
+    if (a && s) return null;
+    if (a) return u;
+    if (s) return c;
+    const h = Ce(o, this.vector(), l, t.vector());
+    return h === null || !j(i, h) ? null : J.round(h.x, h.y);
   }
   /**
    * Split the given segment into multiple segments on the given points.
@@ -1049,10 +1049,10 @@ class z {
    * Warning: input array of points is modified
    */
   split(t) {
-    const e = [], n = t.events !== void 0, i = new L(t, !0), o = new L(t, !1), f = this.rightSE;
+    const e = [], n = t.events !== void 0, i = new L(t, !0), o = new L(t, !1), u = this.rightSE;
     this.replaceRightSE(o), e.push(o), e.push(i);
-    const s = new z(i, f, this.rings.slice(), this.windings.slice());
-    return L.comparePoints(s.leftSE.point, s.rightSE.point) > 0 && s.swapEvents(), L.comparePoints(this.leftSE.point, this.rightSE.point) > 0 && this.swapEvents(), n && (i.checkForConsuming(), o.checkForConsuming()), e;
+    const l = new z(i, u, this.rings.slice(), this.windings.slice());
+    return L.comparePoints(l.leftSE.point, l.rightSE.point) > 0 && l.swapEvents(), L.comparePoints(this.leftSE.point, this.rightSE.point) > 0 && this.swapEvents(), n && (i.checkForConsuming(), o.checkForConsuming()), e;
   }
   /* Swap which event is left and right */
   swapEvents() {
@@ -1077,9 +1077,9 @@ class z {
         const o = e;
         e = n, n = o;
       }
-      for (let o = 0, f = n.rings.length; o < f; o++) {
-        const s = n.rings[o], c = n.windings[o], u = e.rings.indexOf(s);
-        u === -1 ? (e.rings.push(s), e.windings.push(c)) : e.windings[u] += c;
+      for (let o = 0, u = n.rings.length; o < u; o++) {
+        const l = n.rings[o], c = n.windings[o], f = e.rings.indexOf(l);
+        f === -1 ? (e.rings.push(l), e.windings.push(c)) : e.windings[f] += c;
       }
       n.rings = null, n.windings = null, n.consumedBy = e, n.leftSE.consumedBy = e.leftSE, n.rightSE.consumedBy = e.rightSE;
     }
@@ -1110,25 +1110,25 @@ class z {
       multiPolys: []
     };
     const e = this._afterState.rings, n = this._afterState.windings, i = this._afterState.multiPolys;
-    for (let s = 0, c = this.rings.length; s < c; s++) {
-      const u = this.rings[s], g = this.windings[s], l = e.indexOf(u);
-      l === -1 ? (e.push(u), n.push(g)) : n[l] += g;
+    for (let l = 0, c = this.rings.length; l < c; l++) {
+      const f = this.rings[l], p = this.windings[l], s = e.indexOf(f);
+      s === -1 ? (e.push(f), n.push(p)) : n[s] += p;
     }
-    const o = [], f = [];
-    for (let s = 0, c = e.length; s < c; s++) {
-      if (n[s] === 0) continue;
-      const u = e[s], g = u.poly;
-      if (f.indexOf(g) === -1)
-        if (u.isExterior) o.push(g);
+    const o = [], u = [];
+    for (let l = 0, c = e.length; l < c; l++) {
+      if (n[l] === 0) continue;
+      const f = e[l], p = f.poly;
+      if (u.indexOf(p) === -1)
+        if (f.isExterior) o.push(p);
         else {
-          f.indexOf(g) === -1 && f.push(g);
-          const l = o.indexOf(u.poly);
-          l !== -1 && o.splice(l, 1);
+          u.indexOf(p) === -1 && u.push(p);
+          const s = o.indexOf(f.poly);
+          s !== -1 && o.splice(s, 1);
         }
     }
-    for (let s = 0, c = o.length; s < c; s++) {
-      const u = o[s].multiPoly;
-      i.indexOf(u) === -1 && i.push(u);
+    for (let l = 0, c = o.length; l < c; l++) {
+      const f = o[l].multiPoly;
+      i.indexOf(f) === -1 && i.push(f);
     }
     return this._afterState;
   }
@@ -1137,7 +1137,7 @@ class z {
     if (this.consumedBy) return !1;
     if (this._isInResult !== void 0) return this._isInResult;
     const t = this.beforeState().multiPolys, e = this.afterState().multiPolys;
-    switch ($.type) {
+    switch (k.type) {
       case "union": {
         const n = t.length === 0, i = e.length === 0;
         this._isInResult = n !== i;
@@ -1145,7 +1145,7 @@ class z {
       }
       case "intersection": {
         let n, i;
-        t.length < e.length ? (n = t.length, i = e.length) : (n = e.length, i = t.length), this._isInResult = i === $.numMultiPolys && n < i;
+        t.length < e.length ? (n = t.length, i = e.length) : (n = e.length, i = t.length), this._isInResult = i === k.numMultiPolys && n < i;
         break;
       }
       case "xor": {
@@ -1159,12 +1159,12 @@ class z {
         break;
       }
       default:
-        throw new Error(`Unrecognized operation type found ${$.type}`);
+        throw new Error(`Unrecognized operation type found ${k.type}`);
     }
     return this._isInResult;
   }
 }
-class kt {
+class $t {
   constructor(t, e, n) {
     if (!Array.isArray(t) || t.length === 0)
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
@@ -1182,10 +1182,10 @@ class kt {
       }
     };
     let o = i;
-    for (let f = 1, s = t.length; f < s; f++) {
-      if (typeof t[f][0] != "number" || typeof t[f][1] != "number")
+    for (let u = 1, l = t.length; u < l; u++) {
+      if (typeof t[u][0] != "number" || typeof t[u][1] != "number")
         throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
-      let c = J.round(t[f][0], t[f][1]);
+      let c = J.round(t[u][0], t[u][1]);
       c.x === o.x && c.y === o.y || (this.segments.push(z.fromRing(o, c, this)), c.x < this.bbox.ll.x && (this.bbox.ll.x = c.x), c.y < this.bbox.ll.y && (this.bbox.ll.y = c.y), c.x > this.bbox.ur.x && (this.bbox.ur.x = c.x), c.y > this.bbox.ur.y && (this.bbox.ur.y = c.y), o = c);
     }
     (i.x !== o.x || i.y !== o.y) && this.segments.push(z.fromRing(o, i, this));
@@ -1203,7 +1203,7 @@ class Ie {
   constructor(t, e) {
     if (!Array.isArray(t))
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
-    this.exteriorRing = new kt(t[0], this, !0), this.bbox = {
+    this.exteriorRing = new $t(t[0], this, !0), this.bbox = {
       ll: {
         x: this.exteriorRing.bbox.ll.x,
         y: this.exteriorRing.bbox.ll.y
@@ -1214,7 +1214,7 @@ class Ie {
       }
     }, this.interiorRings = [];
     for (let n = 1, i = t.length; n < i; n++) {
-      const o = new kt(t[n], this, !1);
+      const o = new $t(t[n], this, !1);
       o.bbox.ll.x < this.bbox.ll.x && (this.bbox.ll.x = o.bbox.ll.x), o.bbox.ll.y < this.bbox.ll.y && (this.bbox.ll.y = o.bbox.ll.y), o.bbox.ur.x > this.bbox.ur.x && (this.bbox.ur.x = o.bbox.ur.x), o.bbox.ur.y > this.bbox.ur.y && (this.bbox.ur.y = o.bbox.ur.y), this.interiorRings.push(o);
     }
     this.multiPoly = e;
@@ -1223,13 +1223,13 @@ class Ie {
     const t = this.exteriorRing.getSweepEvents();
     for (let e = 0, n = this.interiorRings.length; e < n; e++) {
       const i = this.interiorRings[e].getSweepEvents();
-      for (let o = 0, f = i.length; o < f; o++)
+      for (let o = 0, u = i.length; o < u; o++)
         t.push(i[o]);
     }
     return t;
   }
 }
-class $t {
+class kt {
   constructor(t, e) {
     if (!Array.isArray(t))
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
@@ -1257,7 +1257,7 @@ class $t {
     const t = [];
     for (let e = 0, n = this.polys.length; e < n; e++) {
       const i = this.polys[e].getSweepEvents();
-      for (let o = 0, f = i.length; o < f; o++)
+      for (let o = 0, u = i.length; o < u; o++)
         t.push(i[o]);
     }
     return t;
@@ -1271,39 +1271,39 @@ class nt {
     for (let n = 0, i = t.length; n < i; n++) {
       const o = t[n];
       if (!o.isInResult() || o.ringOut) continue;
-      let f = null, s = o.leftSE, c = o.rightSE;
-      const u = [s], g = s.point, l = [];
-      for (; f = s, s = c, u.push(s), s.point !== g; )
+      let u = null, l = o.leftSE, c = o.rightSE;
+      const f = [l], p = l.point, s = [];
+      for (; u = l, l = c, f.push(l), l.point !== p; )
         for (; ; ) {
-          const h = s.getAvailableLinkedEvents();
-          if (h.length === 0) {
-            const p = u[0].point, y = u[u.length - 1].point;
-            throw new Error(`Unable to complete output ring starting at [${p.x}, ${p.y}]. Last matching segment found ends at [${y.x}, ${y.y}].`);
+          const a = l.getAvailableLinkedEvents();
+          if (a.length === 0) {
+            const d = f[0].point, w = f[f.length - 1].point;
+            throw new Error(`Unable to complete output ring starting at [${d.x}, ${d.y}]. Last matching segment found ends at [${w.x}, ${w.y}].`);
           }
-          if (h.length === 1) {
-            c = h[0].otherSE;
+          if (a.length === 1) {
+            c = a[0].otherSE;
             break;
           }
-          let a = null;
-          for (let p = 0, y = l.length; p < y; p++)
-            if (l[p].point === s.point) {
-              a = p;
+          let h = null;
+          for (let d = 0, w = s.length; d < w; d++)
+            if (s[d].point === l.point) {
+              h = d;
               break;
             }
-          if (a !== null) {
-            const p = l.splice(a)[0], y = u.splice(p.index);
-            y.unshift(y[0].otherSE), e.push(new nt(y.reverse()));
+          if (h !== null) {
+            const d = s.splice(h)[0], w = f.splice(d.index);
+            w.unshift(w[0].otherSE), e.push(new nt(w.reverse()));
             continue;
           }
-          l.push({
-            index: u.length,
-            point: s.point
+          s.push({
+            index: f.length,
+            point: l.point
           });
-          const x = s.getLeftmostComparator(f);
-          c = h.sort(x)[0].otherSE;
+          const g = l.getLeftmostComparator(u);
+          c = a.sort(g)[0].otherSE;
           break;
         }
-      e.push(new nt(u));
+      e.push(new nt(f));
     }
     return e;
   }
@@ -1316,15 +1316,15 @@ class nt {
   getGeom() {
     let t = this.events[0].point;
     const e = [t];
-    for (let u = 1, g = this.events.length - 1; u < g; u++) {
-      const l = this.events[u].point, h = this.events[u + 1].point;
-      Ct(l, t, h) !== 0 && (e.push(l), t = l);
+    for (let f = 1, p = this.events.length - 1; f < p; f++) {
+      const s = this.events[f].point, a = this.events[f + 1].point;
+      Ct(s, t, a) !== 0 && (e.push(s), t = s);
     }
     if (e.length === 1) return null;
     const n = e[0], i = e[1];
     Ct(n, t, i) === 0 && e.shift(), e.push(e[0]);
-    const o = this.isExteriorRing() ? 1 : -1, f = this.isExteriorRing() ? 0 : e.length - 1, s = this.isExteriorRing() ? e.length : -1, c = [];
-    for (let u = f; u != s; u += o) c.push([e[u].x, e[u].y]);
+    const o = this.isExteriorRing() ? 1 : -1, u = this.isExteriorRing() ? 0 : e.length - 1, l = this.isExteriorRing() ? e.length : -1, c = [];
+    for (let f = u; f != l; f += o) c.push([e[f].x, e[f].y]);
     return c;
   }
   isExteriorRing() {
@@ -1341,8 +1341,8 @@ class nt {
   _calcEnclosingRing() {
     let t = this.events[0];
     for (let i = 1, o = this.events.length; i < o; i++) {
-      const f = this.events[i];
-      L.compare(t, f) > 0 && (t = f);
+      const u = this.events[i];
+      L.compare(t, u) > 0 && (t = u);
     }
     let e = t.segment.prevInResult(), n = e ? e.prevInResult() : null;
     for (; ; ) {
@@ -1371,7 +1371,7 @@ class At {
     return t;
   }
 }
-class ke {
+class $e {
   constructor(t) {
     this.rings = t, this.polys = this._composePolys(t);
   }
@@ -1390,14 +1390,14 @@ class ke {
       if (!o.poly)
         if (o.isExteriorRing()) e.push(new At(o));
         else {
-          const f = o.enclosingRing();
-          f.poly || e.push(new At(f)), f.poly.addInterior(o);
+          const u = o.enclosingRing();
+          u.poly || e.push(new At(u)), u.poly.addInterior(o);
         }
     }
     return e;
   }
 }
-class $e {
+class ke {
   constructor(t) {
     let e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : z.compare;
     this.queue = t, this.tree = new wt(e), this.segments = [];
@@ -1408,51 +1408,51 @@ class $e {
       return t.isLeft ? this.queue.remove(t.otherSE) : this.tree.remove(e), n;
     const i = t.isLeft ? this.tree.add(e) : this.tree.find(e);
     if (!i) throw new Error(`Unable to find segment #${e.id} [${e.leftSE.point.x}, ${e.leftSE.point.y}] -> [${e.rightSE.point.x}, ${e.rightSE.point.y}] in SweepLine tree.`);
-    let o = i, f = i, s, c;
-    for (; s === void 0; )
-      o = this.tree.prev(o), o === null ? s = null : o.key.consumedBy === void 0 && (s = o.key);
+    let o = i, u = i, l, c;
+    for (; l === void 0; )
+      o = this.tree.prev(o), o === null ? l = null : o.key.consumedBy === void 0 && (l = o.key);
     for (; c === void 0; )
-      f = this.tree.next(f), f === null ? c = null : f.key.consumedBy === void 0 && (c = f.key);
+      u = this.tree.next(u), u === null ? c = null : u.key.consumedBy === void 0 && (c = u.key);
     if (t.isLeft) {
-      let u = null;
-      if (s) {
-        const l = s.getIntersection(e);
-        if (l !== null && (e.isAnEndpoint(l) || (u = l), !s.isAnEndpoint(l))) {
-          const h = this._splitSafely(s, l);
-          for (let a = 0, x = h.length; a < x; a++)
-            n.push(h[a]);
+      let f = null;
+      if (l) {
+        const s = l.getIntersection(e);
+        if (s !== null && (e.isAnEndpoint(s) || (f = s), !l.isAnEndpoint(s))) {
+          const a = this._splitSafely(l, s);
+          for (let h = 0, g = a.length; h < g; h++)
+            n.push(a[h]);
         }
       }
-      let g = null;
+      let p = null;
       if (c) {
-        const l = c.getIntersection(e);
-        if (l !== null && (e.isAnEndpoint(l) || (g = l), !c.isAnEndpoint(l))) {
-          const h = this._splitSafely(c, l);
-          for (let a = 0, x = h.length; a < x; a++)
-            n.push(h[a]);
+        const s = c.getIntersection(e);
+        if (s !== null && (e.isAnEndpoint(s) || (p = s), !c.isAnEndpoint(s))) {
+          const a = this._splitSafely(c, s);
+          for (let h = 0, g = a.length; h < g; h++)
+            n.push(a[h]);
         }
       }
-      if (u !== null || g !== null) {
-        let l = null;
-        u === null ? l = g : g === null ? l = u : l = L.comparePoints(u, g) <= 0 ? u : g, this.queue.remove(e.rightSE), n.push(e.rightSE);
-        const h = e.split(l);
-        for (let a = 0, x = h.length; a < x; a++)
-          n.push(h[a]);
+      if (f !== null || p !== null) {
+        let s = null;
+        f === null ? s = p : p === null ? s = f : s = L.comparePoints(f, p) <= 0 ? f : p, this.queue.remove(e.rightSE), n.push(e.rightSE);
+        const a = e.split(s);
+        for (let h = 0, g = a.length; h < g; h++)
+          n.push(a[h]);
       }
-      n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = s);
+      n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = l);
     } else {
-      if (s && c) {
-        const u = s.getIntersection(c);
-        if (u !== null) {
-          if (!s.isAnEndpoint(u)) {
-            const g = this._splitSafely(s, u);
-            for (let l = 0, h = g.length; l < h; l++)
-              n.push(g[l]);
+      if (l && c) {
+        const f = l.getIntersection(c);
+        if (f !== null) {
+          if (!l.isAnEndpoint(f)) {
+            const p = this._splitSafely(l, f);
+            for (let s = 0, a = p.length; s < a; s++)
+              n.push(p[s]);
           }
-          if (!c.isAnEndpoint(u)) {
-            const g = this._splitSafely(c, u);
-            for (let l = 0, h = g.length; l < h; l++)
-              n.push(g[l]);
+          if (!c.isAnEndpoint(f)) {
+            const p = this._splitSafely(c, f);
+            for (let s = 0, a = p.length; s < a; s++)
+              n.push(p[s]);
           }
         }
       }
@@ -1473,69 +1473,69 @@ class $e {
 const Ot = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_QUEUE_SIZE || 1e6, Ae = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_SWEEPLINE_SEGMENTS || 1e6;
 class Oe {
   run(t, e, n) {
-    $.type = t, J.reset();
-    const i = [new $t(e, !0)];
-    for (let l = 0, h = n.length; l < h; l++)
-      i.push(new $t(n[l], !1));
-    if ($.numMultiPolys = i.length, $.type === "difference") {
-      const l = i[0];
-      let h = 1;
-      for (; h < i.length; )
-        gt(i[h].bbox, l.bbox) !== null ? h++ : i.splice(h, 1);
+    k.type = t, J.reset();
+    const i = [new kt(e, !0)];
+    for (let s = 0, a = n.length; s < a; s++)
+      i.push(new kt(n[s], !1));
+    if (k.numMultiPolys = i.length, k.type === "difference") {
+      const s = i[0];
+      let a = 1;
+      for (; a < i.length; )
+        pt(i[a].bbox, s.bbox) !== null ? a++ : i.splice(a, 1);
     }
-    if ($.type === "intersection")
-      for (let l = 0, h = i.length; l < h; l++) {
-        const a = i[l];
-        for (let x = l + 1, p = i.length; x < p; x++)
-          if (gt(a.bbox, i[x].bbox) === null) return [];
+    if (k.type === "intersection")
+      for (let s = 0, a = i.length; s < a; s++) {
+        const h = i[s];
+        for (let g = s + 1, d = i.length; g < d; g++)
+          if (pt(h.bbox, i[g].bbox) === null) return [];
       }
     const o = new wt(L.compare);
-    for (let l = 0, h = i.length; l < h; l++) {
-      const a = i[l].getSweepEvents();
-      for (let x = 0, p = a.length; x < p; x++)
-        if (o.insert(a[x]), o.size > Ot)
+    for (let s = 0, a = i.length; s < a; s++) {
+      const h = i[s].getSweepEvents();
+      for (let g = 0, d = h.length; g < d; g++)
+        if (o.insert(h[g]), o.size > Ot)
           throw new Error("Infinite loop when putting segment endpoints in a priority queue (queue size too big).");
     }
-    const f = new $e(o);
-    let s = o.size, c = o.pop();
+    const u = new ke(o);
+    let l = o.size, c = o.pop();
     for (; c; ) {
-      const l = c.key;
-      if (o.size === s) {
-        const a = l.segment;
-        throw new Error(`Unable to pop() ${l.isLeft ? "left" : "right"} SweepEvent [${l.point.x}, ${l.point.y}] from segment #${a.id} [${a.leftSE.point.x}, ${a.leftSE.point.y}] -> [${a.rightSE.point.x}, ${a.rightSE.point.y}] from queue.`);
+      const s = c.key;
+      if (o.size === l) {
+        const h = s.segment;
+        throw new Error(`Unable to pop() ${s.isLeft ? "left" : "right"} SweepEvent [${s.point.x}, ${s.point.y}] from segment #${h.id} [${h.leftSE.point.x}, ${h.leftSE.point.y}] -> [${h.rightSE.point.x}, ${h.rightSE.point.y}] from queue.`);
       }
       if (o.size > Ot)
         throw new Error("Infinite loop when passing sweep line over endpoints (queue size too big).");
-      if (f.segments.length > Ae)
+      if (u.segments.length > Ae)
         throw new Error("Infinite loop when passing sweep line over endpoints (too many sweep line segments).");
-      const h = f.process(l);
-      for (let a = 0, x = h.length; a < x; a++) {
-        const p = h[a];
-        p.consumedBy === void 0 && o.insert(p);
+      const a = u.process(s);
+      for (let h = 0, g = a.length; h < g; h++) {
+        const d = a[h];
+        d.consumedBy === void 0 && o.insert(d);
       }
-      s = o.size, c = o.pop();
+      l = o.size, c = o.pop();
     }
     J.reset();
-    const u = nt.factory(f.segments);
-    return new ke(u).getGeom();
+    const f = nt.factory(u.segments);
+    return new $e(f).getGeom();
   }
 }
-const $ = new Oe(), Ne = function(r) {
+const k = new Oe(), Ne = function(r) {
   for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
     e[n - 1] = arguments[n];
-  return $.run("union", r, e);
+  return k.run("union", r, e);
 }, Be = function(r) {
   for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
     e[n - 1] = arguments[n];
-  return $.run("intersection", r, e);
+  return k.run("intersection", r, e);
 }, Ge = function(r) {
   for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
     e[n - 1] = arguments[n];
-  return $.run("xor", r, e);
+  return k.run("xor", r, e);
 }, ze = function(r) {
   for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
     e[n - 1] = arguments[n];
-  return $.run("difference", r, e);
+  return k.run("difference", r, e);
 };
 var Zt = {
   union: Ne,
@@ -1553,7 +1553,7 @@ function Fe(r, t = {}) {
   return n.length === 0 ? null : n.length === 1 ? xt(n[0], t.properties) : Ut(n, t.properties);
 }
 var Jt = Fe;
-function pt(r) {
+function gt(r) {
   const t = [...r];
   return t[2] < t[0] && (Math.abs((t[0] + t[2] + 360) / 2) > Math.abs((t[0] - 360 + t[2]) / 2) ? t[0] -= 360 : t[2] += 360), t;
 }
@@ -1667,10 +1667,10 @@ function Ke(r, t) {
 function He(r, t) {
   r.$$.dirty[0] === -1 && (U.push(r), je(), r.$$.dirty.fill(0)), r.$$.dirty[t / 31 | 0] |= 1 << t % 31;
 }
-function tn(r, t, e, n, i, o, f = null, s = [-1]) {
+function tn(r, t, e, n, i, o, u = null, l = [-1]) {
   const c = Et;
   X(r);
-  const u = r.$$ = {
+  const f = r.$$ = {
     fragment: null,
     ctx: [],
     // state
@@ -1687,21 +1687,21 @@ function tn(r, t, e, n, i, o, f = null, s = [-1]) {
     context: new Map(t.context || (c ? c.$$.context : [])),
     // everything else
     callbacks: Nt(),
-    dirty: s,
+    dirty: l,
     skip_bound: !1,
     root: t.target || c.$$.root
   };
-  f && f(u.root);
-  let g = !1;
-  if (u.ctx = e ? e(r, t.props || {}, (l, h, ...a) => {
-    const x = a.length ? a[0] : h;
-    return u.ctx && i(u.ctx[l], u.ctx[l] = x) && (!u.skip_bound && u.bound[l] && u.bound[l](x), g && He(r, l)), h;
-  }) : [], u.update(), g = !0, rt(u.before_update), u.fragment = n ? n(u.ctx) : !1, t.target) {
+  u && u(f.root);
+  let p = !1;
+  if (f.ctx = e ? e(r, t.props || {}, (s, a, ...h) => {
+    const g = h.length ? h[0] : a;
+    return f.ctx && i(f.ctx[s], f.ctx[s] = g) && (!f.skip_bound && f.bound[s] && f.bound[s](g), p && He(r, s)), a;
+  }) : [], f.update(), p = !0, rt(f.before_update), f.fragment = n ? n(f.ctx) : !1, t.target) {
     if (t.hydrate) {
-      const l = Ye(t.target);
-      u.fragment && u.fragment.l(l), l.forEach(Ht);
+      const s = Ye(t.target);
+      f.fragment && f.fragment.l(s), s.forEach(Ht);
     } else
-      u.fragment && u.fragment.c();
+      f.fragment && f.fragment.c();
     t.intro && Je(r.$$.fragment), We(r, t.target, t.anchor), te();
   }
   X(c);
@@ -1846,22 +1846,22 @@ function Ft(r, t) {
   if (!e)
     return;
   e.properties = { isMask: !0 };
-  const n = pt(ut(r)), i = (n[2] - n[0]) / 360 / 1e3, o = n[0] < -180, f = n[2] > 180, s = cn(r);
-  if (s.features.length > 1 && (o || f))
-    for (const c of s.features) {
-      const u = pt(ut(c));
-      if (f && u[0] < -180 + i)
-        for (const g of c.geometry.coordinates)
-          for (const l of g)
-            l[0] += 360 - i;
-      if (o && u[2] > 180 - i)
-        for (const g of c.geometry.coordinates)
-          for (const l of g)
-            l[0] -= 360 - i;
+  const n = gt(ut(r)), i = (n[2] - n[0]) / 360 / 1e3, o = n[0] < -180, u = n[2] > 180, l = cn(r);
+  if (l.features.length > 1 && (o || u))
+    for (const c of l.features) {
+      const f = gt(ut(c));
+      if (u && f[0] < -180 + i)
+        for (const p of c.geometry.coordinates)
+          for (const s of p)
+            s[0] += 360 - i;
+      if (o && f[2] > 180 - i)
+        for (const p of c.geometry.coordinates)
+          for (const s of p)
+            s[0] -= 360 - i;
     }
   t(
     Z([
-      s.features.length < 2 ? r : Jt(s) ?? r,
+      l.features.length < 2 ? r : Jt(l) ?? r,
       e
     ])
   );
@@ -1878,23 +1878,23 @@ const Tt = (r) => {
     lineCap: "butt"
   };
 };
-function an(r, t = !0, e = !0, n = {}, i = {}, o = Tt, f = !1) {
-  let s;
-  const c = [];
-  let u, g, l = f;
-  const h = T.geoJSON(void 0, {
+function an(r, t = !0, e = !0, n = {}, i = {}, o = Tt) {
+  let u;
+  const l = [];
+  let c, f;
+  const p = T.geoJSON(void 0, {
     style: o === !0 ? Tt : o === !1 ? void 0 : o ?? void 0,
     interactive: !1
-  }).addTo(r), a = (p) => {
-    s == null || s({
+  }).addTo(r), s = (h) => {
+    u == null || u({
       type: "mapClick",
-      coordinates: [p.latlng.lng, p.latlng.lat]
+      coordinates: [h.latlng.lng, h.latlng.lat]
     });
   };
-  function x(p, y = !1) {
+  function a(h, g = !1) {
     const d = document.createElement("div");
-    return new sn({ props: { displayIn: "leaflet" }, target: d }), new T.Marker(p, {
-      interactive: y,
+    return new sn({ props: { displayIn: "leaflet" }, target: d }), new T.Marker(h, {
+      interactive: g,
       icon: new T.DivIcon({
         html: d,
         className: "",
@@ -1905,135 +1905,132 @@ function an(r, t = !0, e = !0, n = {}, i = {}, o = Tt, f = !1) {
     });
   }
   return {
-    setEventHandler(p) {
-      p ? (s = p, r.on("click", a)) : (s = void 0, r.off("click", a));
+    setEventHandler(h) {
+      h ? (u = h, r.on("click", s)) : (u = void 0, r.off("click", s));
     },
-    flyTo(p, y) {
-      r.flyTo([p[1], p[0]], y, { duration: 2, ...n });
+    flyTo(h, g) {
+      r.flyTo([h[1], h[0]], g, { duration: 2, ...n });
     },
-    fitBounds(p, y, d) {
+    fitBounds(h, g, d) {
       r.flyToBounds(
         [
-          [p[1], p[0]],
-          [p[3], p[2]]
+          [h[1], h[0]],
+          [h[3], h[2]]
         ],
         {
-          padding: [y, y],
+          padding: [g, g],
           duration: 2,
           ...d ? { maxZoom: d } : {},
           ...i
         }
       );
     },
-    indicateReverse(p) {
-      r.getContainer().style.cursor = p ? "crosshair" : "";
+    indicateReverse(h) {
+      r.getContainer().style.cursor = h ? "crosshair" : "";
     },
-    setReverseMarker(p) {
+    setReverseMarker(h) {
       var d;
       if (!t)
         return;
-      const y = p && [p[1], p[0]];
-      g ? y ? g.setLatLng(y) : (g.remove(), g = void 0) : y && (t instanceof Function ? g = t(r) ?? void 0 : (g = (typeof t == "object" ? new T.Marker(y, t) : x(y)).addTo(r), (d = g.getElement()) == null || d.classList.add("marker-reverse")));
+      const g = h && [h[1], h[0]];
+      f ? g ? f.setLatLng(g) : (f.remove(), f = void 0) : g && (t instanceof Function ? f = t(r) ?? void 0 : (f = (typeof t == "object" ? new T.Marker(g, t) : a(g)).addTo(r), (d = f.getElement()) == null || d.classList.add("marker-reverse")));
     },
-    setMarkers(p, y) {
-      function d(v) {
-        h.clearLayers(), v && h.addData(v);
+    setMarkers(h, g, d) {
+      function w(y) {
+        p.clearLayers(), y && p.addData(y);
       }
-      for (const v of c)
-        v.remove();
-      if (c.length = 0, d(), y) {
-        let v = !1;
-        if (y.geometry.type === "GeometryCollection") {
-          const w = y.geometry.geometries.filter(
-            (m) => m.type === "Polygon" || m.type === "MultiPolygon"
+      for (const y of l)
+        y.remove();
+      if (l.length = 0, w(), g) {
+        let y = !1;
+        if (g.geometry.type === "GeometryCollection") {
+          const v = g.geometry.geometries.filter(
+            (x) => x.type === "Polygon" || x.type === "MultiPolygon"
           );
-          t: if (w.length > 0) {
-            const m = Jt(
-              Z(w.map((E) => V(E)))
+          t: if (v.length > 0) {
+            const x = Jt(
+              Z(v.map((m) => V(m)))
             );
-            if (!m)
+            if (!x)
               break t;
             Ft(
               {
-                ...y,
-                geometry: m.geometry
+                ...g,
+                geometry: x.geometry
               },
-              d
-            ), v = !0;
+              w
+            ), y = !0;
           } else {
-            const m = y.geometry.geometries.filter(
-              (E) => E.type === "LineString" || E.type === "MultiLineString"
+            const x = g.geometry.geometries.filter(
+              (m) => m.type === "LineString" || m.type === "MultiLineString"
             );
-            m.length > 0 && (d({
-              ...y,
-              geometry: { type: "GeometryCollection", geometries: m }
-            }), v = !0);
+            x.length > 0 && (w({
+              ...g,
+              geometry: { type: "GeometryCollection", geometries: x }
+            }), y = !0);
           }
         }
-        if (!v) {
-          if (y.geometry.type === "Polygon" || y.geometry.type === "MultiPolygon")
-            Ft(y, (w) => {
-              if (!w)
+        if (!y) {
+          if (g.geometry.type === "Polygon" || g.geometry.type === "MultiPolygon")
+            Ft(g, (v) => {
+              if (!v)
                 return;
-              const m = [...w.features], E = pt(ut(y)), b = E[2] - E[0];
-              E[0] - b / 4 < -180 && m.push(...qt(w, -360).features), E[2] + b / 4 > 180 && m.push(...qt(w, 360).features), d(Z(m));
+              const x = [...v.features], m = gt(ut(g)), E = m[2] - m[0];
+              m[0] - E / 4 < -180 && x.push(...qt(v, -360).features), m[2] + E / 4 > 180 && x.push(...qt(v, 360).features), w(Z(x));
             });
-          else if (y.geometry.type === "LineString" || y.geometry.type === "MultiLineString") {
-            d(y);
+          else if (g.geometry.type === "LineString" || g.geometry.type === "MultiLineString") {
+            w(g);
             return;
           }
         }
-        if (!l && y.geometry.type !== "Point")
+        if (!d && g.geometry.type !== "Point")
           return;
         if (t instanceof Function) {
-          const w = t(r, y);
-          w && c.push(w.addTo(r));
+          const v = t(r, g);
+          v && l.push(v.addTo(r));
         } else if (t) {
-          const w = [y.center[1], y.center[0]];
-          c.push(
-            typeof t == "object" ? new T.Marker(w, t) : x(w).addTo(r)
+          const v = [g.center[1], g.center[0]];
+          l.push(
+            typeof t == "object" ? new T.Marker(v, t) : a(v).addTo(r)
           );
         }
       }
       if (e)
-        for (const v of p ?? []) {
-          if (v === y)
+        for (const y of h ?? []) {
+          if (y === g)
             continue;
-          const w = [
-            v.center[1],
-            v.center[0]
+          const v = [
+            y.center[1],
+            y.center[0]
           ];
-          let m;
+          let x;
           if (e instanceof Function) {
-            if (m = e(r, v), !m)
+            if (x = e(r, y), !x)
               continue;
           } else
-            m = (typeof e == "object" ? new T.Marker(w, e) : x(w, !0)).addTo(r).bindTooltip(
-              v.place_type[0] === "reverse" ? v.place_name : v.place_name.replace(/,.*/, ""),
+            x = (typeof e == "object" ? new T.Marker(v, e) : a(v, !0)).addTo(r).bindTooltip(
+              y.place_type[0] === "reverse" ? y.place_name : y.place_name.replace(/,.*/, ""),
               {
                 direction: "top"
               }
             );
-          const E = m.getElement();
-          E && (E.addEventListener("click", (b) => {
-            b.stopPropagation(), s == null || s({ type: "markerClick", id: v.id });
-          }), E.addEventListener("mouseenter", () => {
-            s == null || s({ type: "markerMouseEnter", id: v.id });
-          }), E.addEventListener("mouseleave", () => {
-            s == null || s({ type: "markerMouseLeave", id: v.id });
-          }), E.classList.toggle("marker-fuzzy", !!v.matching_text)), c.push(m);
+          const m = x.getElement();
+          m && (m.addEventListener("click", (E) => {
+            E.stopPropagation(), u == null || u({ type: "markerClick", id: y.id });
+          }), m.addEventListener("mouseenter", () => {
+            u == null || u({ type: "markerMouseEnter", id: y.id });
+          }), m.addEventListener("mouseleave", () => {
+            u == null || u({ type: "markerMouseLeave", id: y.id });
+          }), m.classList.toggle("marker-fuzzy", !!y.matching_text)), l.push(x);
         }
     },
-    setSelectedMarker(p) {
-      var y, d;
-      u && ((y = u.getElement()) == null || y.classList.toggle("marker-selected", !1)), u = p > -1 ? c[p] : void 0, (d = u == null ? void 0 : u.getElement()) == null || d.classList.toggle("marker-selected", !0);
+    setSelectedMarker(h) {
+      var g, d;
+      c && ((g = c.getElement()) == null || g.classList.toggle("marker-selected", !1)), c = h > -1 ? l[h] : void 0, (d = c == null ? void 0 : c.getElement()) == null || d.classList.toggle("marker-selected", !0);
     },
     getCenterAndZoom() {
-      const p = r.getCenter();
-      return [r.getZoom(), p.lng, p.lat];
-    },
-    setShowPolygonMarker(p) {
-      l = p;
+      const h = r.getCenter();
+      return [r.getZoom(), h.lng, h.lat];
     }
   };
 }