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

package/leaflet-controller.js

@@ -35,14 +35,14 @@ function Ut(r, t, e = {}) {
 }
 function Yt(r, t, e) {
   if (r !== null)
-    for (var n, i, o, f, s, c, u, p = 0, l = 0, h, a = r.type, y = a === "FeatureCollection", g = a === "Feature", x = y ? r.features.length : 1, d = 0; d < x; d++) {
-      u = y ? r.features[d].geometry : g ? r.geometry : r, h = u ? u.type === "GeometryCollection" : !1, s = h ? u.geometries.length : 1;
-      for (var m = 0; m < s; m++) {
-        var v = 0, w = 0;
-        if (f = h ? u.geometries[m] : u, f !== 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 (p = 0, E) {
+          switch (g = 0, E) {
             case null:
               break;
             case "Point":
@@ -50,11 +50,11 @@ function Yt(r, t, e) {
                 c,
                 l,
                 d,
-                v,
-                w
+                w,
+                m
               ) === !1)
                 return !1;
-              l++, v++;
+              l++, w++;
               break;
             case "LineString":
             case "MultiPoint":
@@ -63,49 +63,49 @@ function Yt(r, t, e) {
                   c[n],
                   l,
                   d,
-                  v,
-                  w
+                  w,
+                  m
                 ) === !1)
                   return !1;
-                l++, E === "MultiPoint" && v++;
+                l++, E === "MultiPoint" && w++;
               }
-              E === "LineString" && v++;
+              E === "LineString" && w++;
               break;
             case "Polygon":
             case "MultiLineString":
               for (n = 0; n < c.length; n++) {
-                for (i = 0; i < c[n].length - p; i++) {
+                for (i = 0; i < c[n].length - g; i++) {
                   if (t(
                     c[n][i],
                     l,
                     d,
-                    v,
-                    w
+                    w,
+                    m
                   ) === !1)
                     return !1;
                   l++;
                 }
-                E === "MultiLineString" && v++, E === "Polygon" && w++;
+                E === "MultiLineString" && w++, E === "Polygon" && m++;
               }
-              E === "Polygon" && v++;
+              E === "Polygon" && w++;
               break;
             case "MultiPolygon":
               for (n = 0; n < c.length; n++) {
-                for (w = 0, i = 0; i < c[n].length; i++) {
-                  for (o = 0; o < c[n][i].length - p; o++) {
+                for (m = 0, i = 0; i < c[n].length; i++) {
+                  for (o = 0; o < c[n][i].length - g; o++) {
                     if (t(
                       c[n][i][o],
                       l,
                       d,
-                      v,
-                      w
+                      w,
+                      m
                     ) === !1)
                       return !1;
                     l++;
                   }
-                  w++;
+                  m++;
                 }
-                v++;
+                w++;
               }
               break;
             case "GeometryCollection":
@@ -121,15 +121,15 @@ function Yt(r, t, e) {
     }
 }
 function vt(r, t) {
-  var e, n, i, o, f, s, c, u, p, l, h = 0, a = r.type === "FeatureCollection", y = r.type === "Feature", g = a ? r.features.length : 1;
-  for (e = 0; e < g; e++) {
-    for (s = a ? r.features[e].geometry : y ? r.geometry : r, u = a ? r.features[e].properties : y ? r.properties : {}, p = a ? r.features[e].bbox : y ? r.bbox : void 0, l = a ? r.features[e].id : y ? r.id : void 0, c = s ? s.type === "GeometryCollection" : !1, f = c ? s.geometries.length : 1, i = 0; i < f; i++) {
+  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) {
         if (t(
           null,
           h,
           u,
-          p,
+          g,
           l
         ) === !1)
           return !1;
@@ -146,7 +146,7 @@ function vt(r, t) {
             o,
             h,
             u,
-            p,
+            g,
             l
           ) === !1)
             return !1;
@@ -158,7 +158,7 @@ function vt(r, t) {
               o.geometries[n],
               h,
               u,
-              p,
+              g,
               l
             ) === !1)
               return !1;
@@ -198,9 +198,9 @@ function se(r, t) {
         break;
     }
     for (var u = 0; u < e.coordinates.length; u++) {
-      var p = e.coordinates[u], l = {
+      var g = e.coordinates[u], l = {
         type: c,
-        coordinates: p
+        coordinates: g
       };
       if (t(V(l, i), n, u) === !1)
         return !1;
@@ -308,8 +308,8 @@ function he(r, t) {
     return this;
   }), f;
   function s(u) {
-    return function(p) {
-      return c([u, p]);
+    return function(g) {
+      return c([u, g]);
     };
   }
   function c(u) {
@@ -350,8 +350,8 @@ function he(r, t) {
           continue;
       }
       u = t.call(r, e);
-    } catch (p) {
-      u = [6, p], i = 0;
+    } catch (g) {
+      u = [6, g], i = 0;
     } finally {
       n = o = 0;
     }
@@ -414,7 +414,7 @@ function bt(r, t, e) {
   }
   return { left: n, right: i };
 }
-function pe(r, t, e) {
+function ge(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) {
@@ -564,7 +564,7 @@ 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(), ge(t, e), o);
+        var f = de(this.toList(), pe(t, e), o);
         i = this._size + i, this._root = ht({ head: f }, 0, i);
       }
       return this;
@@ -592,7 +592,7 @@ var wt = (
       }, 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 = pe(f, s, i);
+      i(t, e) < 0 ? s = ot(e, n, s, i) : f = ot(e, n, f, i), this._root = ge(f, s, i);
     }, r.prototype.split = function(t) {
       return bt(t, this._root, this._comparator);
     }, r.prototype[Symbol.iterator] = function() {
@@ -629,7 +629,7 @@ function ct(r, t, e, n) {
   }
   return null;
 }
-function ge(r, t) {
+function pe(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;
@@ -671,16 +671,16 @@ function at(r, t, e, 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], p = n[0], l = 0, h = 0;
-  p > u == p > -u ? (o = u, u = t[++l]) : (o = p, p = n[++h]);
+  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 (p > u == p > -u ? (f = u + o, s = o - (f - u), u = t[++l]) : (f = p + o, s = o - (f - p), p = n[++h]), o = f, s !== 0 && (i[a++] = s); l < r && h < e; )
-      p > u == p > -u ? (f = o + u, c = f - o, s = o - (f - c) + (u - c), u = t[++l]) : (f = o + p, c = f - o, s = o - (f - c) + (p - c), p = n[++h]), o = f, s !== 0 && (i[a++] = s);
+    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 + p, c = f - o, s = o - (f - c) + (p - c), p = n[++h], o = f, s !== 0 && (i[a++] = s);
+    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;
 }
 function ve(r, t) {
@@ -693,16 +693,16 @@ function K(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, p, l, h, a, y, g, x, d, m, v, w, E, b, M, _;
-  const C = r - i, R = e - i, I = t - o, $ = n - o;
-  w = C * $, h = S * C, a = h - (h - C), y = C - a, h = S * $, g = h - (h - $), x = $ - g, E = y * x - (w - a * g - y * g - a * x), b = I * R, h = S * I, a = h - (h - I), y = I - a, h = S * R, g = h - (h - R), x = R - g, M = y * x - (b - a * g - y * g - a * x), d = E - M, l = E - d, q[0] = E - (d + l) + (l - M), m = w + d, l = m - w, v = w - (m - l) + (d - l), d = v - b, l = v - d, q[1] = v - (d + l) + (l - b), _ = m + d, l = _ - m, q[2] = m - (_ - l) + (d - l), q[3] = _;
+  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 - $, p = n - ($ + l) + (l - o), s === 0 && c === 0 && u === 0 && p === 0) || (D = Ee * f + xe * Math.abs(A), A += C * p + $ * s - (I * u + R * c), A >= D || -A >= D)) return A;
-  w = s * $, h = S * s, a = h - (h - s), y = s - a, h = S * $, g = h - (h - $), x = $ - g, E = y * x - (w - a * g - y * g - a * x), b = c * R, h = S * c, a = h - (h - c), y = c - a, h = S * R, g = h - (h - R), x = R - g, M = y * x - (b - a * g - y * g - a * x), d = E - M, l = E - d, P[0] = E - (d + l) + (l - M), m = w + d, l = m - w, v = w - (m - l) + (d - l), d = v - b, l = v - d, P[1] = v - (d + l) + (l - b), _ = m + d, l = _ - m, P[2] = m - (_ - l) + (d - l), P[3] = _;
+  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] = _;
   const ee = st(4, q, 4, P, _t);
-  w = C * p, h = S * C, a = h - (h - C), y = C - a, h = S * p, g = h - (h - p), x = p - g, E = y * x - (w - a * g - y * g - a * x), b = I * u, h = S * I, a = h - (h - I), y = I - a, h = S * u, g = h - (h - u), x = u - g, M = y * x - (b - a * g - y * g - a * x), d = E - M, l = E - d, P[0] = E - (d + l) + (l - M), m = w + d, l = m - w, v = w - (m - l) + (d - l), d = v - b, l = v - d, P[1] = v - (d + l) + (l - b), _ = m + d, l = _ - m, P[2] = m - (_ - l) + (d - l), P[3] = _;
+  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] = _;
   const ne = st(ee, _t, 4, P, St);
-  w = s * p, h = S * s, a = h - (h - s), y = s - a, h = S * p, g = h - (h - p), x = p - g, E = y * x - (w - a * g - y * g - a * x), b = c * u, h = S * c, a = h - (h - c), y = c - a, h = S * u, g = h - (h - u), x = u - g, M = y * x - (b - a * g - y * g - a * x), d = E - M, l = E - d, P[0] = E - (d + l) + (l - M), m = w + d, l = m - w, v = w - (m - l) + (d - l), d = v - b, l = v - d, P[1] = v - (d + l) + (l - b), _ = m + d, l = _ - m, P[2] = m - (_ - l) + (d - l), P[3] = _;
+  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] = _;
   const re = st(ne, St, 4, P, Pt);
   return Pt[re - 1];
 }
@@ -710,7 +710,7 @@ 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 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) => {
+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) => {
   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,7 +802,7 @@ 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, p = r.y + s * t.y, l = e.y + f * n.y, h = (c + u) / 2, a = (p + l) / 2;
+  }, 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;
   return {
     x: h,
     y: a
@@ -903,7 +903,7 @@ class z {
     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;
     if (o < i) return -1;
-    const s = t.leftSE.point.y, c = e.leftSE.point.y, u = t.rightSE.point.y, p = e.rightSE.point.y;
+    const s = t.leftSE.point.y, c = e.leftSE.point.y, u = t.rightSE.point.y, g = e.rightSE.point.y;
     if (n < i) {
       if (c < s && c < u) return 1;
       if (c > s && c > u) return -1;
@@ -914,8 +914,8 @@ class z {
       return h !== 0 ? h : -1;
     }
     if (n > i) {
-      if (s < c && s < p) return -1;
-      if (s > c && s > p) return 1;
+      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);
@@ -933,11 +933,11 @@ class z {
       if (l > 0) return -1;
     }
     if (o !== f) {
-      const l = u - s, h = o - n, a = p - c, y = f - i;
-      if (l > h && a < y) return 1;
-      if (l < h && a > y) return -1;
+      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;
     }
-    return o > f ? 1 : o < f || u < p ? -1 : u > p ? 1 : t.id < e.id ? -1 : t.id > e.id ? 1 : 0;
+    return o > f ? 1 : o < f || u < g ? -1 : u > g ? 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 */
@@ -1021,12 +1021,12 @@ class z {
    * Else, return null.
    */
   getIntersection(t) {
-    const e = this.bbox(), n = t.bbox(), i = pt(e, n);
+    const e = this.bbox(), n = t.bbox(), i = gt(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, p = j(n, o) && t.comparePoint(o) === 0, l = j(e, c) && this.comparePoint(c) === 0, h = j(n, f) && t.comparePoint(f) === 0;
-    if (p && u)
+    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 (p)
+    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;
@@ -1111,17 +1111,17 @@ class z {
     };
     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], p = this.windings[s], l = e.indexOf(u);
-      l === -1 ? (e.push(u), n.push(p)) : n[l] += p;
+      const u = this.rings[s], g = this.windings[s], l = e.indexOf(u);
+      l === -1 ? (e.push(u), n.push(g)) : n[l] += g;
     }
     const o = [], f = [];
     for (let s = 0, c = e.length; s < c; s++) {
       if (n[s] === 0) continue;
-      const u = e[s], p = u.poly;
-      if (f.indexOf(p) === -1)
-        if (u.isExterior) o.push(p);
+      const u = e[s], g = u.poly;
+      if (f.indexOf(g) === -1)
+        if (u.isExterior) o.push(g);
         else {
-          f.indexOf(p) === -1 && f.push(p);
+          f.indexOf(g) === -1 && f.push(g);
           const l = o.indexOf(u.poly);
           l !== -1 && o.splice(l, 1);
         }
@@ -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 (k.type) {
+    switch ($.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 === k.numMultiPolys && n < i;
+        t.length < e.length ? (n = t.length, i = e.length) : (n = e.length, i = t.length), this._isInResult = i === $.numMultiPolys && n < i;
         break;
       }
       case "xor": {
@@ -1159,12 +1159,12 @@ class z {
         break;
       }
       default:
-        throw new Error(`Unrecognized operation type found ${k.type}`);
+        throw new Error(`Unrecognized operation type found ${$.type}`);
     }
     return this._isInResult;
   }
 }
-class $t {
+class kt {
   constructor(t, e, n) {
     if (!Array.isArray(t) || t.length === 0)
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
@@ -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 $t(t[0], this, !0), this.bbox = {
+    this.exteriorRing = new kt(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 $t(t[n], this, !1);
+      const o = new kt(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;
@@ -1229,7 +1229,7 @@ class Ie {
     return t;
   }
 }
-class kt {
+class $t {
   constructor(t, e) {
     if (!Array.isArray(t))
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
@@ -1272,35 +1272,35 @@ class nt {
       const o = t[n];
       if (!o.isInResult() || o.ringOut) continue;
       let f = null, s = o.leftSE, c = o.rightSE;
-      const u = [s], p = s.point, l = [];
-      for (; f = s, s = c, u.push(s), s.point !== p; )
+      const u = [s], g = s.point, l = [];
+      for (; f = s, s = c, u.push(s), s.point !== g; )
         for (; ; ) {
           const h = s.getAvailableLinkedEvents();
           if (h.length === 0) {
-            const g = u[0].point, x = u[u.length - 1].point;
-            throw new Error(`Unable to complete output ring starting at [${g.x}, ${g.y}]. Last matching segment found ends at [${x.x}, ${x.y}].`);
+            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}].`);
           }
           if (h.length === 1) {
             c = h[0].otherSE;
             break;
           }
           let a = null;
-          for (let g = 0, x = l.length; g < x; g++)
-            if (l[g].point === s.point) {
-              a = g;
+          for (let p = 0, y = l.length; p < y; p++)
+            if (l[p].point === s.point) {
+              a = p;
               break;
             }
           if (a !== null) {
-            const g = l.splice(a)[0], x = u.splice(g.index);
-            x.unshift(x[0].otherSE), e.push(new nt(x.reverse()));
+            const p = l.splice(a)[0], y = u.splice(p.index);
+            y.unshift(y[0].otherSE), e.push(new nt(y.reverse()));
             continue;
           }
           l.push({
             index: u.length,
             point: s.point
           });
-          const y = s.getLeftmostComparator(f);
-          c = h.sort(y)[0].otherSE;
+          const x = s.getLeftmostComparator(f);
+          c = h.sort(x)[0].otherSE;
           break;
         }
       e.push(new nt(u));
@@ -1316,7 +1316,7 @@ class nt {
   getGeom() {
     let t = this.events[0].point;
     const e = [t];
-    for (let u = 1, p = this.events.length - 1; u < p; u++) {
+    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);
     }
@@ -1371,7 +1371,7 @@ class At {
     return t;
   }
 }
-class $e {
+class ke {
   constructor(t) {
     this.rings = t, this.polys = this._composePolys(t);
   }
@@ -1397,7 +1397,7 @@ class $e {
     return e;
   }
 }
-class ke {
+class $e {
   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 = [];
@@ -1419,24 +1419,24 @@ class ke {
         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, y = h.length; a < y; a++)
+          for (let a = 0, x = h.length; a < x; a++)
             n.push(h[a]);
         }
       }
-      let p = null;
+      let g = null;
       if (c) {
         const l = c.getIntersection(e);
-        if (l !== null && (e.isAnEndpoint(l) || (p = l), !c.isAnEndpoint(l))) {
+        if (l !== null && (e.isAnEndpoint(l) || (g = l), !c.isAnEndpoint(l))) {
           const h = this._splitSafely(c, l);
-          for (let a = 0, y = h.length; a < y; a++)
+          for (let a = 0, x = h.length; a < x; a++)
             n.push(h[a]);
         }
       }
-      if (u !== null || p !== null) {
+      if (u !== null || g !== null) {
         let l = null;
-        u === null ? l = p : p === null ? l = u : l = L.comparePoints(u, p) <= 0 ? u : p, this.queue.remove(e.rightSE), n.push(e.rightSE);
+        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, y = h.length; a < y; a++)
+        for (let a = 0, x = h.length; a < x; a++)
           n.push(h[a]);
       }
       n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = s);
@@ -1445,14 +1445,14 @@ class ke {
         const u = s.getIntersection(c);
         if (u !== null) {
           if (!s.isAnEndpoint(u)) {
-            const p = this._splitSafely(s, u);
-            for (let l = 0, h = p.length; l < h; l++)
-              n.push(p[l]);
+            const g = this._splitSafely(s, u);
+            for (let l = 0, h = g.length; l < h; l++)
+              n.push(g[l]);
           }
           if (!c.isAnEndpoint(u)) {
-            const p = this._splitSafely(c, u);
-            for (let l = 0, h = p.length; l < h; l++)
-              n.push(p[l]);
+            const g = this._splitSafely(c, u);
+            for (let l = 0, h = g.length; l < h; l++)
+              n.push(g[l]);
           }
         }
       }
@@ -1473,30 +1473,30 @@ class ke {
 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) {
-    k.type = t, J.reset();
-    const i = [new kt(e, !0)];
+    $.type = t, J.reset();
+    const i = [new $t(e, !0)];
     for (let l = 0, h = n.length; l < h; l++)
-      i.push(new kt(n[l], !1));
-    if (k.numMultiPolys = i.length, k.type === "difference") {
+      i.push(new $t(n[l], !1));
+    if ($.numMultiPolys = i.length, $.type === "difference") {
       const l = i[0];
       let h = 1;
       for (; h < i.length; )
-        pt(i[h].bbox, l.bbox) !== null ? h++ : i.splice(h, 1);
+        gt(i[h].bbox, l.bbox) !== null ? h++ : i.splice(h, 1);
     }
-    if (k.type === "intersection")
+    if ($.type === "intersection")
       for (let l = 0, h = i.length; l < h; l++) {
         const a = i[l];
-        for (let y = l + 1, g = i.length; y < g; y++)
-          if (pt(a.bbox, i[y].bbox) === null) return [];
+        for (let x = l + 1, p = i.length; x < p; x++)
+          if (gt(a.bbox, i[x].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 y = 0, g = a.length; y < g; y++)
-        if (o.insert(a[y]), o.size > Ot)
+      for (let x = 0, p = a.length; x < p; x++)
+        if (o.insert(a[x]), o.size > Ot)
           throw new Error("Infinite loop when putting segment endpoints in a priority queue (queue size too big).");
     }
-    const f = new ke(o);
+    const f = new $e(o);
     let s = o.size, c = o.pop();
     for (; c; ) {
       const l = c.key;
@@ -1509,33 +1509,33 @@ class Oe {
       if (f.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, y = h.length; a < y; a++) {
-        const g = h[a];
-        g.consumedBy === void 0 && o.insert(g);
+      for (let a = 0, x = h.length; a < x; a++) {
+        const p = h[a];
+        p.consumedBy === void 0 && o.insert(p);
       }
       s = o.size, c = o.pop();
     }
     J.reset();
     const u = nt.factory(f.segments);
-    return new $e(u).getGeom();
+    return new ke(u).getGeom();
   }
 }
-const k = new Oe(), Ne = function(r) {
+const $ = 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 k.run("union", r, e);
+  return $.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 k.run("intersection", r, e);
+  return $.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 k.run("xor", r, e);
+  return $.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 k.run("difference", r, e);
+  return $.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 gt(r) {
+function pt(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;
 }
@@ -1692,11 +1692,11 @@ function tn(r, t, e, n, i, o, f = null, s = [-1]) {
     root: t.target || c.$$.root
   };
   f && f(u.root);
-  let p = !1;
+  let g = !1;
   if (u.ctx = e ? e(r, t.props || {}, (l, h, ...a) => {
-    const y = a.length ? a[0] : h;
-    return u.ctx && i(u.ctx[l], u.ctx[l] = y) && (!u.skip_bound && u.bound[l] && u.bound[l](y), p && He(r, l)), h;
-  }) : [], u.update(), p = !0, rt(u.before_update), u.fragment = n ? n(u.ctx) : !1, t.target) {
+    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) {
     if (t.hydrate) {
       const l = Ye(t.target);
       u.fragment && u.fragment.l(l), l.forEach(Ht);
@@ -1846,17 +1846,17 @@ function Ft(r, t) {
   if (!e)
     return;
   e.properties = { isMask: !0 };
-  const n = gt(ut(r)), i = (n[2] - n[0]) / 360 / 1e3, o = n[0] < -180, f = n[2] > 180, s = cn(r);
+  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 = gt(ut(c));
+      const u = pt(ut(c));
       if (f && u[0] < -180 + i)
-        for (const p of c.geometry.coordinates)
-          for (const l of p)
+        for (const g of c.geometry.coordinates)
+          for (const l of g)
             l[0] += 360 - i;
       if (o && u[2] > 180 - i)
-        for (const p of c.geometry.coordinates)
-          for (const l of p)
+        for (const g of c.geometry.coordinates)
+          for (const l of g)
             l[0] -= 360 - i;
     }
   t(
@@ -1881,22 +1881,22 @@ const Tt = (r) => {
 function an(r, t = !0, e = !0, n = {}, i = {}, o = Tt, f = !1) {
   let s;
   const c = [];
-  let u, p;
-  const l = T.geoJSON(void 0, {
+  let u, g, l = f;
+  const h = T.geoJSON(void 0, {
     style: o === !0 ? Tt : o === !1 ? void 0 : o ?? void 0,
     interactive: !1
-  }).addTo(r), h = (y) => {
+  }).addTo(r), a = (p) => {
     s == null || s({
       type: "mapClick",
-      coordinates: [y.latlng.lng, y.latlng.lat]
+      coordinates: [p.latlng.lng, p.latlng.lat]
     });
   };
-  function a(y, g = !1) {
-    const x = document.createElement("div");
-    return new sn({ props: { displayIn: "leaflet" }, target: x }), new T.Marker(y, {
-      interactive: g,
+  function x(p, y = !1) {
+    const d = document.createElement("div");
+    return new sn({ props: { displayIn: "leaflet" }, target: d }), new T.Marker(p, {
+      interactive: y,
       icon: new T.DivIcon({
-        html: x,
+        html: d,
         className: "",
         iconAnchor: [12, 26],
         iconSize: [25, 30],
@@ -1905,132 +1905,135 @@ function an(r, t = !0, e = !0, n = {}, i = {}, o = Tt, f = !1) {
     });
   }
   return {
-    setEventHandler(y) {
-      y ? (s = y, r.on("click", h)) : (s = void 0, r.off("click", h));
+    setEventHandler(p) {
+      p ? (s = p, r.on("click", a)) : (s = void 0, r.off("click", a));
     },
-    flyTo(y, g) {
-      r.flyTo([y[1], y[0]], g, { duration: 2, ...n });
+    flyTo(p, y) {
+      r.flyTo([p[1], p[0]], y, { duration: 2, ...n });
     },
-    fitBounds(y, g, x) {
+    fitBounds(p, y, d) {
       r.flyToBounds(
         [
-          [y[1], y[0]],
-          [y[3], y[2]]
+          [p[1], p[0]],
+          [p[3], p[2]]
         ],
         {
-          padding: [g, g],
+          padding: [y, y],
           duration: 2,
-          ...x ? { maxZoom: x } : {},
+          ...d ? { maxZoom: d } : {},
           ...i
         }
       );
     },
-    indicateReverse(y) {
-      r.getContainer().style.cursor = y ? "crosshair" : "";
+    indicateReverse(p) {
+      r.getContainer().style.cursor = p ? "crosshair" : "";
     },
-    setReverseMarker(y) {
-      var x;
+    setReverseMarker(p) {
+      var d;
       if (!t)
         return;
-      const g = y && [y[1], y[0]];
-      p ? g ? p.setLatLng(g) : (p.remove(), p = void 0) : g && (t instanceof Function ? p = t(r) ?? void 0 : (p = (typeof t == "object" ? new T.Marker(g, t) : a(g)).addTo(r), (x = p.getElement()) == null || x.classList.add("marker-reverse")));
+      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")));
     },
-    setMarkers(y, g) {
-      function x(d) {
-        l.clearLayers(), d && l.addData(d);
+    setMarkers(p, y) {
+      function d(v) {
+        h.clearLayers(), v && h.addData(v);
       }
-      for (const d of c)
-        d.remove();
-      if (c.length = 0, x(), g) {
-        let d = !1;
-        if (g.geometry.type === "GeometryCollection") {
-          const m = g.geometry.geometries.filter(
-            (v) => v.type === "Polygon" || v.type === "MultiPolygon"
+      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"
           );
-          t: if (m.length > 0) {
-            const v = Jt(
-              Z(m.map((w) => V(w)))
+          t: if (w.length > 0) {
+            const m = Jt(
+              Z(w.map((E) => V(E)))
             );
-            if (!v)
+            if (!m)
               break t;
             Ft(
               {
-                ...g,
-                geometry: v.geometry
+                ...y,
+                geometry: m.geometry
               },
-              x
-            ), d = !0;
+              d
+            ), v = !0;
           } else {
-            const v = g.geometry.geometries.filter(
-              (w) => w.type === "LineString" || w.type === "MultiLineString"
+            const m = y.geometry.geometries.filter(
+              (E) => E.type === "LineString" || E.type === "MultiLineString"
             );
-            v.length > 0 && (x({
-              ...g,
-              geometry: { type: "GeometryCollection", geometries: v }
-            }), d = !0);
+            m.length > 0 && (d({
+              ...y,
+              geometry: { type: "GeometryCollection", geometries: m }
+            }), v = !0);
           }
         }
-        if (!d) {
-          if (g.geometry.type === "Polygon" || g.geometry.type === "MultiPolygon")
-            Ft(g, (m) => {
-              if (!m)
+        if (!v) {
+          if (y.geometry.type === "Polygon" || y.geometry.type === "MultiPolygon")
+            Ft(y, (w) => {
+              if (!w)
                 return;
-              const v = [...m.features], w = gt(ut(g)), E = w[2] - w[0];
-              w[0] - E / 4 < -180 && v.push(...qt(m, -360).features), w[2] + E / 4 > 180 && v.push(...qt(m, 360).features), x(Z(v));
+              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));
             });
-          else if (g.geometry.type === "LineString" || g.geometry.type === "MultiLineString") {
-            x(g);
+          else if (y.geometry.type === "LineString" || y.geometry.type === "MultiLineString") {
+            d(y);
             return;
           }
         }
-        if (!f && g.geometry.type !== "Point")
+        if (!l && y.geometry.type !== "Point")
           return;
         if (t instanceof Function) {
-          const m = t(r, g);
-          m && c.push(m.addTo(r));
+          const w = t(r, y);
+          w && c.push(w.addTo(r));
         } else if (t) {
-          const m = [g.center[1], g.center[0]];
+          const w = [y.center[1], y.center[0]];
           c.push(
-            typeof t == "object" ? new T.Marker(m, t) : a(m).addTo(r)
+            typeof t == "object" ? new T.Marker(w, t) : x(w).addTo(r)
           );
         }
       }
       if (e)
-        for (const d of y ?? []) {
-          if (d === g)
+        for (const v of p ?? []) {
+          if (v === y)
             continue;
-          const m = [
-            d.center[1],
-            d.center[0]
+          const w = [
+            v.center[1],
+            v.center[0]
           ];
-          let v;
+          let m;
           if (e instanceof Function) {
-            if (v = e(r, d), !v)
+            if (m = e(r, v), !m)
               continue;
           } else
-            v = (typeof e == "object" ? new T.Marker(m, e) : a(m, !0)).addTo(r).bindTooltip(
-              d.place_type[0] === "reverse" ? d.place_name : d.place_name.replace(/,.*/, ""),
+            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(/,.*/, ""),
               {
                 direction: "top"
               }
             );
-          const w = v.getElement();
-          w && (w.addEventListener("click", (E) => {
-            E.stopPropagation(), s == null || s({ type: "markerClick", id: d.id });
-          }), w.addEventListener("mouseenter", () => {
-            s == null || s({ type: "markerMouseEnter", id: d.id });
-          }), w.addEventListener("mouseleave", () => {
-            s == null || s({ type: "markerMouseLeave", id: d.id });
-          }), w.classList.toggle("marker-fuzzy", !!d.matching_text)), c.push(v);
+          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);
         }
     },
-    setSelectedMarker(y) {
-      var g, x;
-      u && ((g = u.getElement()) == null || g.classList.toggle("marker-selected", !1)), u = y > -1 ? c[y] : void 0, (x = u == null ? void 0 : u.getElement()) == null || x.classList.toggle("marker-selected", !0);
+    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);
     },
     getCenterAndZoom() {
-      const y = r.getCenter();
-      return [r.getZoom(), y.lng, y.lat];
+      const p = r.getCenter();
+      return [r.getZoom(), p.lng, p.lat];
+    },
+    setShowPolygonMarker(p) {
+      l = p;
     }
   };
 }