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

package/maplibregl-controller.js

@@ -63,8 +63,8 @@ function ne(i, t) {
     return this;
   }), f;
   function l(u) {
-    return function(p) {
-      return c([u, p]);
+    return function(g) {
+      return c([u, g]);
     };
   }
   function c(u) {
@@ -105,8 +105,8 @@ function ne(i, t) {
           continue;
       }
       u = t.call(i, e);
-    } catch (p) {
-      u = [6, p], r = 0;
+    } catch (g) {
+      u = [6, g], r = 0;
     } finally {
       n = o = 0;
     }
@@ -424,19 +424,19 @@ function ht(i, t, e, n, r) {
     ht(i, t, e, l, r), ht(i, t, l + 1, n, r);
   }
 }
-const O = 11102230246251565e-32, S = 134217729, ue = (3 + 8 * O) * O;
+const O = 11102230246251565e-32, P = 134217729, ue = (3 + 8 * O) * O;
 function st(i, t, e, n, r) {
-  let o, f, l, c, u = t[0], p = n[0], s = 0, h = 0;
-  p > u == p > -u ? (o = u, u = t[++s]) : (o = p, p = n[++h]);
-  let g = 0;
+  let o, f, l, c, u = t[0], g = n[0], s = 0, h = 0;
+  g > u == g > -u ? (o = u, u = t[++s]) : (o = g, g = n[++h]);
+  let a = 0;
   if (s < i && h < e)
-    for (p > u == p > -u ? (f = u + o, l = o - (f - u), u = t[++s]) : (f = p + o, l = o - (f - p), p = n[++h]), o = f, l !== 0 && (r[g++] = l); s < i && h < e; )
-      p > u == p > -u ? (f = o + u, c = f - o, l = o - (f - c) + (u - c), u = t[++s]) : (f = o + p, c = f - o, l = o - (f - c) + (p - c), p = n[++h]), o = f, l !== 0 && (r[g++] = l);
+    for (g > u == g > -u ? (f = u + o, l = o - (f - u), u = t[++s]) : (f = g + o, l = o - (f - g), g = n[++h]), o = f, l !== 0 && (r[a++] = l); s < i && h < e; )
+      g > u == g > -u ? (f = o + u, c = f - o, l = o - (f - c) + (u - c), u = t[++s]) : (f = o + g, c = f - o, l = o - (f - c) + (g - c), g = n[++h]), o = f, l !== 0 && (r[a++] = l);
   for (; s < i; )
-    f = o + u, c = f - o, l = o - (f - c) + (u - c), u = t[++s], o = f, l !== 0 && (r[g++] = l);
+    f = o + u, c = f - o, l = o - (f - c) + (u - c), u = t[++s], o = f, l !== 0 && (r[a++] = l);
   for (; h < e; )
-    f = o + p, c = f - o, l = o - (f - c) + (p - c), p = n[++h], o = f, l !== 0 && (r[g++] = l);
-  return (o !== 0 || g === 0) && (r[g++] = o), g;
+    f = o + g, c = f - o, l = o - (f - c) + (g - c), g = n[++h], o = f, l !== 0 && (r[a++] = l);
+  return (o !== 0 || a === 0) && (r[a++] = o), a;
 }
 function fe(i, t) {
   let e = t[0];
@@ -446,19 +446,19 @@ function fe(i, t) {
 function J(i) {
   return new Float64Array(i);
 }
-const ce = (3 + 16 * O) * O, he = (2 + 12 * O) * O, ae = (9 + 64 * O) * O * O, U = J(4), mt = J(8), wt = J(12), bt = J(16), P = J(4);
+const ce = (3 + 16 * O) * O, he = (2 + 12 * O) * O, ae = (9 + 64 * O) * O * O, U = J(4), mt = J(8), wt = J(12), bt = J(16), M = J(4);
 function ge(i, t, e, n, r, o, f) {
-  let l, c, u, p, s, h, g, y, x, m, a, d, v, E, w, b, M, _;
-  const R = i - r, I = e - r, C = t - o, k = n - o;
-  E = R * k, h = S * R, g = h - (h - R), y = R - g, h = S * k, x = h - (h - k), m = k - x, w = y * m - (E - g * x - y * x - g * m), b = C * I, h = S * C, g = h - (h - C), y = C - g, h = S * I, x = h - (h - I), m = I - x, M = y * m - (b - g * x - y * x - g * m), a = w - M, s = w - a, U[0] = w - (a + s) + (s - M), d = E + a, s = d - E, v = E - (d - s) + (a - s), a = v - b, s = v - a, U[1] = v - (a + s) + (s - b), _ = d + a, s = _ - d, U[2] = d - (_ - s) + (a - s), U[3] = _;
+  let l, c, u, g, s, h, a, y, d, m, v, p, x, E, w, b, _, S;
+  const R = i - r, I = e - r, k = t - o, C = n - o;
+  E = R * C, h = P * R, a = h - (h - R), y = R - a, h = P * C, d = h - (h - C), m = C - d, w = y * m - (E - a * d - y * d - a * m), b = k * I, h = P * k, a = h - (h - k), y = k - a, h = P * I, d = h - (h - I), m = I - d, _ = y * m - (b - a * d - y * d - a * m), v = w - _, s = w - v, U[0] = w - (v + s) + (s - _), p = E + v, s = p - E, x = E - (p - s) + (v - s), v = x - b, s = x - v, U[1] = x - (v + s) + (s - b), S = p + v, s = S - p, U[2] = p - (S - s) + (v - s), U[3] = S;
   let A = fe(4, U), Q = he * f;
-  if (A >= Q || -A >= Q || (s = i - R, l = i - (R + s) + (s - r), s = e - I, u = e - (I + s) + (s - r), s = t - C, c = t - (C + s) + (s - o), s = n - k, p = n - (k + s) + (s - o), l === 0 && c === 0 && u === 0 && p === 0) || (Q = ae * f + ue * Math.abs(A), A += R * p + k * l - (C * u + I * c), A >= Q || -A >= Q)) return A;
-  E = l * k, h = S * l, g = h - (h - l), y = l - g, h = S * k, x = h - (h - k), m = k - x, w = y * m - (E - g * x - y * x - g * m), b = c * I, h = S * c, g = h - (h - c), y = c - g, h = S * I, x = h - (h - I), m = I - x, M = y * m - (b - g * x - y * x - g * m), a = w - M, s = w - a, P[0] = w - (a + s) + (s - M), d = E + a, s = d - E, v = E - (d - s) + (a - s), a = v - b, s = v - a, P[1] = v - (a + s) + (s - b), _ = d + a, s = _ - d, P[2] = d - (_ - s) + (a - s), P[3] = _;
-  const Jt = st(4, U, 4, P, mt);
-  E = R * p, h = S * R, g = h - (h - R), y = R - g, h = S * p, x = h - (h - p), m = p - x, w = y * m - (E - g * x - y * x - g * m), b = C * u, h = S * C, g = h - (h - C), y = C - g, h = S * u, x = h - (h - u), m = u - x, M = y * m - (b - g * x - y * x - g * m), a = w - M, s = w - a, P[0] = w - (a + s) + (s - M), d = E + a, s = d - E, v = E - (d - s) + (a - s), a = v - b, s = v - a, P[1] = v - (a + s) + (s - b), _ = d + a, s = _ - d, P[2] = d - (_ - s) + (a - s), P[3] = _;
-  const Kt = st(Jt, mt, 4, P, wt);
-  E = l * p, h = S * l, g = h - (h - l), y = l - g, h = S * p, x = h - (h - p), m = p - x, w = y * m - (E - g * x - y * x - g * m), b = c * u, h = S * c, g = h - (h - c), y = c - g, h = S * u, x = h - (h - u), m = u - x, M = y * m - (b - g * x - y * x - g * m), a = w - M, s = w - a, P[0] = w - (a + s) + (s - M), d = E + a, s = d - E, v = E - (d - s) + (a - s), a = v - b, s = v - a, P[1] = v - (a + s) + (s - b), _ = d + a, s = _ - d, P[2] = d - (_ - s) + (a - s), P[3] = _;
-  const Ht = st(Kt, wt, 4, P, bt);
+  if (A >= Q || -A >= Q || (s = i - R, l = i - (R + s) + (s - r), s = e - I, u = e - (I + s) + (s - r), s = t - k, c = t - (k + s) + (s - o), s = n - C, g = n - (C + s) + (s - o), l === 0 && c === 0 && u === 0 && g === 0) || (Q = ae * f + ue * Math.abs(A), A += R * g + C * l - (k * u + I * c), A >= Q || -A >= Q)) return A;
+  E = l * C, h = P * l, a = h - (h - l), y = l - a, h = P * C, d = h - (h - C), m = C - d, w = y * m - (E - a * d - y * d - a * m), b = c * I, h = P * c, a = h - (h - c), y = c - a, h = P * I, d = h - (h - I), m = I - d, _ = y * m - (b - a * d - y * d - a * m), v = w - _, s = w - v, M[0] = w - (v + s) + (s - _), p = E + v, s = p - E, x = E - (p - s) + (v - s), v = x - b, s = x - v, M[1] = x - (v + s) + (s - b), S = p + v, s = S - p, M[2] = p - (S - s) + (v - s), M[3] = S;
+  const Jt = st(4, U, 4, M, mt);
+  E = R * g, h = P * R, a = h - (h - R), y = R - a, h = P * g, d = h - (h - g), m = g - d, w = y * m - (E - a * d - y * d - a * m), b = k * u, h = P * k, a = h - (h - k), y = k - a, h = P * u, d = h - (h - u), m = u - d, _ = y * m - (b - a * d - y * d - a * m), v = w - _, s = w - v, M[0] = w - (v + s) + (s - _), p = E + v, s = p - E, x = E - (p - s) + (v - s), v = x - b, s = x - v, M[1] = x - (v + s) + (s - b), S = p + v, s = S - p, M[2] = p - (S - s) + (v - s), M[3] = S;
+  const Kt = st(Jt, mt, 4, M, wt);
+  E = l * g, h = P * l, a = h - (h - l), y = l - a, h = P * g, d = h - (h - g), m = g - d, w = y * m - (E - a * d - y * d - a * m), b = c * u, h = P * c, a = h - (h - c), y = c - a, h = P * u, d = h - (h - u), m = u - d, _ = y * m - (b - a * d - y * d - a * m), v = w - _, s = w - v, M[0] = w - (v + s) + (s - _), p = E + v, s = p - E, x = E - (p - s) + (v - s), v = x - b, s = x - v, M[1] = x - (v + s) + (s - b), S = p + v, s = S - p, M[2] = p - (S - s) + (v - s), M[3] = S;
+  const Ht = st(Kt, wt, 4, M, bt);
   return bt[Ht - 1];
 }
 function pe(i, t, e, n, r, o) {
@@ -557,10 +557,10 @@ const Z = new de(), tt = (i, t) => i.x * t.y - i.y * t.x, Yt = (i, t) => i.x * t
   const o = {
     x: e.x - i.x,
     y: e.y - i.y
-  }, f = tt(o, t) / r, l = tt(o, n) / r, c = i.x + l * t.x, u = e.x + f * n.x, p = i.y + l * t.y, s = e.y + f * n.y, h = (c + u) / 2, g = (p + s) / 2;
+  }, f = tt(o, t) / r, l = tt(o, n) / r, c = i.x + l * t.x, u = e.x + f * n.x, g = i.y + l * t.y, s = e.y + f * n.y, h = (c + u) / 2, a = (g + s) / 2;
   return {
     x: h,
-    y: g
+    y: a
   };
 };
 class L {
@@ -658,7 +658,7 @@ class z {
     const n = t.leftSE.point.x, r = e.leftSE.point.x, o = t.rightSE.point.x, f = e.rightSE.point.x;
     if (f < n) return 1;
     if (o < r) return -1;
-    const l = t.leftSE.point.y, c = e.leftSE.point.y, u = t.rightSE.point.y, p = e.rightSE.point.y;
+    const l = t.leftSE.point.y, c = e.leftSE.point.y, u = t.rightSE.point.y, g = e.rightSE.point.y;
     if (n < r) {
       if (c < l && c < u) return 1;
       if (c > l && c > u) return -1;
@@ -669,8 +669,8 @@ class z {
       return h !== 0 ? h : -1;
     }
     if (n > r) {
-      if (l < c && l < p) return -1;
-      if (l > c && l > p) return 1;
+      if (l < c && l < g) return -1;
+      if (l > c && l > g) return 1;
       const s = e.comparePoint(t.leftSE.point);
       if (s !== 0) return s;
       const h = t.comparePoint(e.rightSE.point);
@@ -688,11 +688,11 @@ class z {
       if (s > 0) return -1;
     }
     if (o !== f) {
-      const s = u - l, h = o - n, g = p - c, y = f - r;
-      if (s > h && g < y) return 1;
-      if (s < h && g > y) return -1;
+      const s = u - l, h = o - n, a = g - c, y = f - r;
+      if (s > h && a < y) return 1;
+      if (s < h && a > y) 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 */
@@ -778,18 +778,18 @@ class z {
   getIntersection(t) {
     const e = this.bbox(), n = t.bbox(), r = at(e, n);
     if (r === null) return null;
-    const o = this.leftSE.point, f = this.rightSE.point, l = t.leftSE.point, c = t.rightSE.point, u = F(e, l) && this.comparePoint(l) === 0, p = F(n, o) && t.comparePoint(o) === 0, s = F(e, c) && this.comparePoint(c) === 0, h = F(n, f) && t.comparePoint(f) === 0;
-    if (p && u)
+    const o = this.leftSE.point, f = this.rightSE.point, l = t.leftSE.point, c = t.rightSE.point, u = F(e, l) && this.comparePoint(l) === 0, g = F(n, o) && t.comparePoint(o) === 0, s = F(e, c) && this.comparePoint(c) === 0, h = F(n, f) && t.comparePoint(f) === 0;
+    if (g && u)
       return h && !s ? f : !h && s ? c : null;
-    if (p)
+    if (g)
       return s && o.x === c.x && o.y === c.y ? null : o;
     if (u)
       return h && f.x === l.x && f.y === l.y ? null : l;
     if (h && s) return null;
     if (h) return f;
     if (s) return c;
-    const g = Ee(o, this.vector(), l, t.vector());
-    return g === null || !F(r, g) ? null : Z.round(g.x, g.y);
+    const a = Ee(o, this.vector(), l, t.vector());
+    return a === null || !F(r, a) ? null : Z.round(a.x, a.y);
   }
   /**
    * Split the given segment into multiple segments on the given points.
@@ -866,17 +866,17 @@ class z {
     };
     const e = this._afterState.rings, n = this._afterState.windings, r = this._afterState.multiPolys;
     for (let l = 0, c = this.rings.length; l < c; l++) {
-      const u = this.rings[l], p = this.windings[l], s = e.indexOf(u);
-      s === -1 ? (e.push(u), n.push(p)) : n[s] += p;
+      const u = this.rings[l], g = this.windings[l], s = e.indexOf(u);
+      s === -1 ? (e.push(u), n.push(g)) : n[s] += g;
     }
     const o = [], f = [];
     for (let l = 0, c = e.length; l < c; l++) {
       if (n[l] === 0) continue;
-      const u = e[l], p = u.poly;
-      if (f.indexOf(p) === -1)
-        if (u.isExterior) o.push(p);
+      const u = e[l], 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 s = o.indexOf(u.poly);
           s !== -1 && o.splice(s, 1);
         }
@@ -1027,26 +1027,26 @@ class nt {
       const o = t[n];
       if (!o.isInResult() || o.ringOut) continue;
       let f = null, l = o.leftSE, c = o.rightSE;
-      const u = [l], p = l.point, s = [];
-      for (; f = l, l = c, u.push(l), l.point !== p; )
+      const u = [l], g = l.point, s = [];
+      for (; f = l, l = c, u.push(l), l.point !== g; )
         for (; ; ) {
           const h = l.getAvailableLinkedEvents();
           if (h.length === 0) {
-            const x = u[0].point, m = u[u.length - 1].point;
-            throw new Error(`Unable to complete output ring starting at [${x.x}, ${x.y}]. Last matching segment found ends at [${m.x}, ${m.y}].`);
+            const d = u[0].point, m = u[u.length - 1].point;
+            throw new Error(`Unable to complete output ring starting at [${d.x}, ${d.y}]. Last matching segment found ends at [${m.x}, ${m.y}].`);
           }
           if (h.length === 1) {
             c = h[0].otherSE;
             break;
           }
-          let g = null;
-          for (let x = 0, m = s.length; x < m; x++)
-            if (s[x].point === l.point) {
-              g = x;
+          let a = null;
+          for (let d = 0, m = s.length; d < m; d++)
+            if (s[d].point === l.point) {
+              a = d;
               break;
             }
-          if (g !== null) {
-            const x = s.splice(g)[0], m = u.splice(x.index);
+          if (a !== null) {
+            const d = s.splice(a)[0], m = u.splice(d.index);
             m.unshift(m[0].otherSE), e.push(new nt(m.reverse()));
             continue;
           }
@@ -1071,7 +1071,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 s = this.events[u].point, h = this.events[u + 1].point;
       Pt(s, t, h) !== 0 && (e.push(s), t = s);
     }
@@ -1109,7 +1109,7 @@ class nt {
     }
   }
 }
-class Ct {
+class kt {
   constructor(t) {
     this.exteriorRing = t, t.poly = this, this.interiorRings = [];
   }
@@ -1143,10 +1143,10 @@ class be {
     for (let n = 0, r = t.length; n < r; n++) {
       const o = t[n];
       if (!o.poly)
-        if (o.isExteriorRing()) e.push(new Ct(o));
+        if (o.isExteriorRing()) e.push(new kt(o));
         else {
           const f = o.enclosingRing();
-          f.poly || e.push(new Ct(f)), f.poly.addInterior(o);
+          f.poly || e.push(new kt(f)), f.poly.addInterior(o);
         }
     }
     return e;
@@ -1174,25 +1174,25 @@ class _e {
         const s = l.getIntersection(e);
         if (s !== null && (e.isAnEndpoint(s) || (u = s), !l.isAnEndpoint(s))) {
           const h = this._splitSafely(l, s);
-          for (let g = 0, y = h.length; g < y; g++)
-            n.push(h[g]);
+          for (let a = 0, y = h.length; a < y; a++)
+            n.push(h[a]);
         }
       }
-      let p = null;
+      let g = null;
       if (c) {
         const s = c.getIntersection(e);
-        if (s !== null && (e.isAnEndpoint(s) || (p = s), !c.isAnEndpoint(s))) {
+        if (s !== null && (e.isAnEndpoint(s) || (g = s), !c.isAnEndpoint(s))) {
           const h = this._splitSafely(c, s);
-          for (let g = 0, y = h.length; g < y; g++)
-            n.push(h[g]);
+          for (let a = 0, y = h.length; a < y; a++)
+            n.push(h[a]);
         }
       }
-      if (u !== null || p !== null) {
+      if (u !== null || g !== null) {
         let s = null;
-        u === null ? s = p : p === null ? s = u : s = L.comparePoints(u, p) <= 0 ? u : p, this.queue.remove(e.rightSE), n.push(e.rightSE);
+        u === null ? s = g : g === null ? s = u : s = L.comparePoints(u, g) <= 0 ? u : g, this.queue.remove(e.rightSE), n.push(e.rightSE);
         const h = e.split(s);
-        for (let g = 0, y = h.length; g < y; g++)
-          n.push(h[g]);
+        for (let a = 0, y = h.length; a < y; a++)
+          n.push(h[a]);
       }
       n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = l);
     } else {
@@ -1200,14 +1200,14 @@ class _e {
         const u = l.getIntersection(c);
         if (u !== null) {
           if (!l.isAnEndpoint(u)) {
-            const p = this._splitSafely(l, u);
-            for (let s = 0, h = p.length; s < h; s++)
-              n.push(p[s]);
+            const g = this._splitSafely(l, u);
+            for (let s = 0, h = g.length; s < h; s++)
+              n.push(g[s]);
           }
           if (!c.isAnEndpoint(u)) {
-            const p = this._splitSafely(c, u);
-            for (let s = 0, h = p.length; s < h; s++)
-              n.push(p[s]);
+            const g = this._splitSafely(c, u);
+            for (let s = 0, h = g.length; s < h; s++)
+              n.push(g[s]);
           }
         }
       }
@@ -1225,7 +1225,7 @@ class _e {
     return r.push(n), t.consumedBy === void 0 && this.tree.add(t), r;
   }
 }
-const kt = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_QUEUE_SIZE || 1e6, Se = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_SWEEPLINE_SEGMENTS || 1e6;
+const Ct = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_QUEUE_SIZE || 1e6, Se = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_SWEEPLINE_SEGMENTS || 1e6;
 class Pe {
   run(t, e, n) {
     $.type = t, Z.reset();
@@ -1240,15 +1240,15 @@ class Pe {
     }
     if ($.type === "intersection")
       for (let s = 0, h = r.length; s < h; s++) {
-        const g = r[s];
-        for (let y = s + 1, x = r.length; y < x; y++)
-          if (at(g.bbox, r[y].bbox) === null) return [];
+        const a = r[s];
+        for (let y = s + 1, d = r.length; y < d; y++)
+          if (at(a.bbox, r[y].bbox) === null) return [];
       }
     const o = new dt(L.compare);
     for (let s = 0, h = r.length; s < h; s++) {
-      const g = r[s].getSweepEvents();
-      for (let y = 0, x = g.length; y < x; y++)
-        if (o.insert(g[y]), o.size > kt)
+      const a = r[s].getSweepEvents();
+      for (let y = 0, d = a.length; y < d; y++)
+        if (o.insert(a[y]), o.size > Ct)
           throw new Error("Infinite loop when putting segment endpoints in a priority queue (queue size too big).");
     }
     const f = new _e(o);
@@ -1256,17 +1256,17 @@ class Pe {
     for (; c; ) {
       const s = c.key;
       if (o.size === l) {
-        const g = s.segment;
-        throw new Error(`Unable to pop() ${s.isLeft ? "left" : "right"} SweepEvent [${s.point.x}, ${s.point.y}] from segment #${g.id} [${g.leftSE.point.x}, ${g.leftSE.point.y}] -> [${g.rightSE.point.x}, ${g.rightSE.point.y}] from queue.`);
+        const a = s.segment;
+        throw new Error(`Unable to pop() ${s.isLeft ? "left" : "right"} SweepEvent [${s.point.x}, ${s.point.y}] from segment #${a.id} [${a.leftSE.point.x}, ${a.leftSE.point.y}] -> [${a.rightSE.point.x}, ${a.rightSE.point.y}] from queue.`);
       }
-      if (o.size > kt)
+      if (o.size > Ct)
         throw new Error("Infinite loop when passing sweep line over endpoints (queue size too big).");
       if (f.segments.length > Se)
         throw new Error("Infinite loop when passing sweep line over endpoints (too many sweep line segments).");
       const h = f.process(s);
-      for (let g = 0, y = h.length; g < y; g++) {
-        const x = h[g];
-        x.consumedBy === void 0 && o.insert(x);
+      for (let a = 0, y = h.length; a < y; a++) {
+        const d = h[a];
+        d.consumedBy === void 0 && o.insert(d);
       }
       l = o.size, c = o.pop();
     }
@@ -1300,26 +1300,26 @@ var Qt = {
 };
 function Ft(i, t, e) {
   if (i !== null)
-    for (var n, r, o, f, l, c, u, p = 0, s = 0, h, g = i.type, y = g === "FeatureCollection", x = g === "Feature", m = y ? i.features.length : 1, a = 0; a < m; a++) {
-      u = y ? i.features[a].geometry : x ? i.geometry : i, h = u ? u.type === "GeometryCollection" : !1, l = h ? u.geometries.length : 1;
-      for (var d = 0; d < l; d++) {
-        var v = 0, E = 0;
-        if (f = h ? u.geometries[d] : u, f !== null) {
+    for (var n, r, o, f, l, c, u, g = 0, s = 0, h, a = i.type, y = a === "FeatureCollection", d = a === "Feature", m = y ? i.features.length : 1, v = 0; v < m; v++) {
+      u = y ? i.features[v].geometry : d ? i.geometry : i, h = u ? u.type === "GeometryCollection" : !1, l = h ? u.geometries.length : 1;
+      for (var p = 0; p < l; p++) {
+        var x = 0, E = 0;
+        if (f = h ? u.geometries[p] : u, f !== null) {
           c = f.coordinates;
           var w = f.type;
-          switch (p = 0, w) {
+          switch (g = 0, w) {
             case null:
               break;
             case "Point":
               if (t(
                 c,
                 s,
-                a,
                 v,
+                x,
                 E
               ) === !1)
                 return !1;
-              s++, v++;
+              s++, x++;
               break;
             case "LineString":
             case "MultiPoint":
@@ -1327,42 +1327,42 @@ function Ft(i, t, e) {
                 if (t(
                   c[n],
                   s,
-                  a,
                   v,
+                  x,
                   E
                 ) === !1)
                   return !1;
-                s++, w === "MultiPoint" && v++;
+                s++, w === "MultiPoint" && x++;
               }
-              w === "LineString" && v++;
+              w === "LineString" && x++;
               break;
             case "Polygon":
             case "MultiLineString":
               for (n = 0; n < c.length; n++) {
-                for (r = 0; r < c[n].length - p; r++) {
+                for (r = 0; r < c[n].length - g; r++) {
                   if (t(
                     c[n][r],
                     s,
-                    a,
                     v,
+                    x,
                     E
                   ) === !1)
                     return !1;
                   s++;
                 }
-                w === "MultiLineString" && v++, w === "Polygon" && E++;
+                w === "MultiLineString" && x++, w === "Polygon" && E++;
               }
-              w === "Polygon" && v++;
+              w === "Polygon" && x++;
               break;
             case "MultiPolygon":
               for (n = 0; n < c.length; n++) {
                 for (E = 0, r = 0; r < c[n].length; r++) {
-                  for (o = 0; o < c[n][r].length - p; o++) {
+                  for (o = 0; o < c[n][r].length - g; o++) {
                     if (t(
                       c[n][r][o],
                       s,
-                      a,
                       v,
+                      x,
                       E
                     ) === !1)
                       return !1;
@@ -1370,7 +1370,7 @@ function Ft(i, t, e) {
                   }
                   E++;
                 }
-                v++;
+                x++;
               }
               break;
             case "GeometryCollection":
@@ -1386,15 +1386,15 @@ function Ft(i, t, e) {
     }
 }
 function xt(i, t) {
-  var e, n, r, o, f, l, c, u, p, s, h = 0, g = i.type === "FeatureCollection", y = i.type === "Feature", x = g ? i.features.length : 1;
-  for (e = 0; e < x; e++) {
-    for (l = g ? i.features[e].geometry : y ? i.geometry : i, u = g ? i.features[e].properties : y ? i.properties : {}, p = g ? i.features[e].bbox : y ? i.bbox : void 0, s = g ? i.features[e].id : y ? i.id : void 0, c = l ? l.type === "GeometryCollection" : !1, f = c ? l.geometries.length : 1, r = 0; r < f; r++) {
+  var e, n, r, o, f, l, c, u, g, s, h = 0, a = i.type === "FeatureCollection", y = i.type === "Feature", d = a ? i.features.length : 1;
+  for (e = 0; e < d; e++) {
+    for (l = a ? i.features[e].geometry : y ? i.geometry : i, u = a ? i.features[e].properties : y ? i.properties : {}, g = a ? i.features[e].bbox : y ? i.bbox : void 0, s = a ? i.features[e].id : y ? i.id : void 0, c = l ? l.type === "GeometryCollection" : !1, f = c ? l.geometries.length : 1, r = 0; r < f; r++) {
       if (o = c ? l.geometries[r] : l, o === null) {
         if (t(
           null,
           h,
           u,
-          p,
+          g,
           s
         ) === !1)
           return !1;
@@ -1411,7 +1411,7 @@ function xt(i, t) {
             o,
             h,
             u,
-            p,
+            g,
             s
           ) === !1)
             return !1;
@@ -1423,7 +1423,7 @@ function xt(i, t) {
               o.geometries[n],
               h,
               u,
-              p,
+              g,
               s
             ) === !1)
               return !1;
@@ -1436,7 +1436,7 @@ function xt(i, t) {
     h++;
   }
 }
-function Ce(i, t) {
+function ke(i, t) {
   xt(i, function(e, n, r, o, f) {
     var l = e === null ? null : e.type;
     switch (l) {
@@ -1463,16 +1463,16 @@ function Ce(i, t) {
         break;
     }
     for (var u = 0; u < e.coordinates.length; u++) {
-      var p = e.coordinates[u], s = {
+      var g = e.coordinates[u], s = {
         type: c,
-        coordinates: p
+        coordinates: g
       };
       if (t(X(s, r), n, u) === !1)
         return !1;
     }
   });
 }
-function ke(i, t = {}) {
+function Ce(i, t = {}) {
   const e = [];
   if (xt(i, (r) => {
     e.push(r.coordinates);
@@ -1481,7 +1481,7 @@ function ke(i, t = {}) {
   const n = Qt.union(e[0], ...e.slice(1));
   return n.length === 0 ? null : n.length === 1 ? yt(n[0], t.properties) : jt(n, t.properties);
 }
-var Dt = ke;
+var Dt = Ce;
 function W() {
 }
 function Xt(i) {
@@ -1617,11 +1617,11 @@ function De(i, t, e, n, r, o, f = null, l = [-1]) {
     root: t.target || c.$$.root
   };
   f && f(u.root);
-  let p = !1;
-  if (u.ctx = e ? e(i, t.props || {}, (s, h, ...g) => {
-    const y = g.length ? g[0] : h;
-    return u.ctx && r(u.ctx[s], u.ctx[s] = y) && (!u.skip_bound && u.bound[s] && u.bound[s](y), p && Fe(i, s)), h;
-  }) : [], u.update(), p = !0, it(u.before_update), u.fragment = n ? n(u.ctx) : !1, t.target) {
+  let g = !1;
+  if (u.ctx = e ? e(i, t.props || {}, (s, h, ...a) => {
+    const y = a.length ? a[0] : h;
+    return u.ctx && r(u.ctx[s], u.ctx[s] = y) && (!u.skip_bound && u.bound[s] && u.bound[s](y), g && Fe(i, s)), h;
+  }) : [], u.update(), g = !0, it(u.before_update), u.fragment = n ? n(u.ctx) : !1, t.target) {
     if (t.hydrate) {
       const s = Be(t.target);
       u.fragment && u.fragment.l(s), s.forEach(Zt);
@@ -1757,7 +1757,7 @@ function en(i) {
   if (!i)
     throw new Error("geojson is required");
   var t = [];
-  return Ce(i, function(e) {
+  return ke(i, function(e) {
     t.push(e);
   }), V(t);
 }
@@ -1789,12 +1789,12 @@ function zt(i, t) {
     for (const c of l.features) {
       const u = Tt(Bt(c));
       if (f && u[0] < -180 + r)
-        for (const p of c.geometry.coordinates)
-          for (const s of p)
+        for (const g of c.geometry.coordinates)
+          for (const s of g)
             s[0] += 360 - r;
       if (o && u[2] > 180 - r)
-        for (const p of c.geometry.coordinates)
-          for (const s of p)
+        for (const g of c.geometry.coordinates)
+          for (const s of g)
             s[0] -= 360 - r;
     }
   t(
@@ -1827,18 +1827,18 @@ const Gt = {
 function on(i, t, e = !0, n = !0, r = {}, o = {}, f = Gt, l = !1) {
   let c;
   const u = [];
-  let p, s, h;
-  function g() {
+  let g, s, h, a = l;
+  function y() {
     if (!i.loaded) {
-      i.once("load", g);
+      i.once("load", y);
       return;
     }
-    const a = f ? f === !0 ? Gt : f : void 0;
-    if (!(a != null && a.fill) && !(a != null && a.line))
+    const p = f ? f === !0 ? Gt : f : void 0;
+    if (!(p != null && p.fill) && !(p != null && p.line))
       return;
-    const d = i.getSource(H);
-    if (d)
-      d.setData(h ?? V([]));
+    const x = i.getSource(H);
+    if (x)
+      x.setData(h ?? V([]));
     else if (h)
       i.addSource(H, {
         type: "geojson",
@@ -1846,149 +1846,152 @@ function on(i, t, e = !0, n = !0, r = {}, o = {}, f = Gt, l = !1) {
       });
     else
       return;
-    !i.getLayer(Ut) && (a != null && a.fill) && i.addLayer({
-      ...a == null ? void 0 : a.fill,
+    !i.getLayer(Ut) && (p != null && p.fill) && i.addLayer({
+      ...p == null ? void 0 : p.fill,
       id: Ut,
       type: "fill",
       source: H
-    }), !i.getLayer(qt) && (a != null && a.line) && i.addLayer({
-      ...a == null ? void 0 : a.line,
+    }), !i.getLayer(qt) && (p != null && p.line) && i.addLayer({
+      ...p == null ? void 0 : p.line,
       id: qt,
       type: "line",
       source: H
     });
   }
-  function y(a) {
-    h = a, g();
+  function d(p) {
+    h = p, y();
   }
   i.on("styledata", () => {
     setTimeout(() => {
-      h && g();
+      h && y();
     });
   });
-  const x = (a) => {
+  const m = (p) => {
     c == null || c({
       type: "mapClick",
-      coordinates: [a.lngLat.lng, a.lngLat.lat]
+      coordinates: [p.lngLat.lng, p.lngLat.lat]
     });
   };
-  function m(a = !1) {
+  function v(p = !1) {
     if (!t)
       throw new Error();
-    const d = document.createElement("div");
-    return a && d.classList.add("marker-interactive"), new Je({
+    const x = document.createElement("div");
+    return p && x.classList.add("marker-interactive"), new Je({
       props: { displayIn: "maplibre" },
-      target: d
-    }), new t.Marker({ element: d, offset: [1, -13] });
+      target: x
+    }), new t.Marker({ element: x, offset: [1, -13] });
   }
   return {
-    setEventHandler(a) {
-      a ? (c = a, i.on("click", x)) : (c = void 0, i.off("click", x));
+    setEventHandler(p) {
+      p ? (c = p, i.on("click", m)) : (c = void 0, i.off("click", m));
     },
-    flyTo(a, d) {
-      i.flyTo({ center: a, ...d ? { zoom: d } : {}, ...r });
+    flyTo(p, x) {
+      i.flyTo({ center: p, ...x ? { zoom: x } : {}, ...r });
     },
-    fitBounds(a, d, v) {
+    fitBounds(p, x, E) {
       i.fitBounds(
         [
-          [a[0], a[1]],
-          [a[2], a[3]]
+          [p[0], p[1]],
+          [p[2], p[3]]
         ],
-        { padding: d, ...v ? { maxZoom: v } : {}, ...o }
+        { padding: x, ...E ? { maxZoom: E } : {}, ...o }
       );
     },
-    indicateReverse(a) {
-      i.getCanvasContainer().style.cursor = a ? "crosshair" : "";
+    indicateReverse(p) {
+      i.getCanvasContainer().style.cursor = p ? "crosshair" : "";
     },
-    setReverseMarker(a) {
-      !t || !e || (s ? a ? s.setLngLat(a) : (s.remove(), s = void 0) : a && (e instanceof Function ? s = e(i) ?? void 0 : (s = (typeof e == "object" ? new t.Marker(e) : m()).setLngLat(a).addTo(i), s.getElement().classList.add("marker-reverse"))));
+    setReverseMarker(p) {
+      !t || !e || (s ? p ? s.setLngLat(p) : (s.remove(), s = void 0) : p && (e instanceof Function ? s = e(i) ?? void 0 : (s = (typeof e == "object" ? new t.Marker(e) : v()).setLngLat(p).addTo(i), s.getElement().classList.add("marker-reverse"))));
     },
-    setMarkers(a, d) {
-      for (const v of u)
-        v.remove();
-      if (u.length = 0, y(void 0), !!t) {
-        if (d) {
-          let v = !1;
-          if (d.geometry.type === "GeometryCollection") {
-            const E = d.geometry.geometries.filter(
-              (w) => w.type === "Polygon" || w.type === "MultiPolygon"
+    setMarkers(p, x) {
+      for (const E of u)
+        E.remove();
+      if (u.length = 0, d(void 0), !!t) {
+        if (x) {
+          let E = !1;
+          if (x.geometry.type === "GeometryCollection") {
+            const w = x.geometry.geometries.filter(
+              (b) => b.type === "Polygon" || b.type === "MultiPolygon"
             );
-            t: if (E.length > 0) {
-              const w = Dt(
-                V(E.map((b) => X(b)))
+            t: if (w.length > 0) {
+              const b = Dt(
+                V(w.map((_) => X(_)))
               );
-              if (!w)
+              if (!b)
                 break t;
               zt(
                 {
-                  ...d,
-                  geometry: w.geometry
+                  ...x,
+                  geometry: b.geometry
                 },
-                y
-              ), v = !0;
+                d
+              ), E = !0;
             } else {
-              const w = d.geometry.geometries.filter(
-                (b) => b.type === "LineString" || b.type === "MultiLineString"
+              const b = x.geometry.geometries.filter(
+                (_) => _.type === "LineString" || _.type === "MultiLineString"
               );
-              w.length > 0 && (y({
-                ...d,
-                geometry: { type: "GeometryCollection", geometries: w }
-              }), v = !0);
+              b.length > 0 && (d({
+                ...x,
+                geometry: { type: "GeometryCollection", geometries: b }
+              }), E = !0);
             }
           }
-          if (!v) {
-            if (d.geometry.type === "Polygon" || d.geometry.type === "MultiPolygon")
-              zt(d, y);
-            else if (d.geometry.type === "LineString" || d.geometry.type === "MultiLineString") {
-              y(d);
+          if (!E) {
+            if (x.geometry.type === "Polygon" || x.geometry.type === "MultiPolygon")
+              zt(x, d);
+            else if (x.geometry.type === "LineString" || x.geometry.type === "MultiLineString") {
+              d(x);
               return;
             }
           }
-          if (!l && d.geometry.type !== "Point")
+          if (!a && x.geometry.type !== "Point")
             return;
           if (e instanceof Function) {
-            const E = e(i, d);
-            E && u.push(E);
+            const w = e(i, x);
+            w && u.push(w);
           } else e && u.push(
-            typeof e == "object" ? new t.Marker(e) : m().setLngLat(d.center).addTo(i)
+            typeof e == "object" ? new t.Marker(e) : v().setLngLat(x.center).addTo(i)
           );
         }
         if (n)
-          for (const v of a ?? []) {
-            if (v === d)
+          for (const E of p ?? []) {
+            if (E === x)
               continue;
-            let E;
+            let w;
             if (n instanceof Function) {
-              if (E = n(i, v), !E)
+              if (w = n(i, E), !w)
                 continue;
             } else
-              E = (typeof n == "object" ? new t.Marker(n) : m(!0)).setLngLat(v.center).setPopup(
+              w = (typeof n == "object" ? new t.Marker(n) : v(!0)).setLngLat(E.center).setPopup(
                 new t.Popup({
                   offset: [1, -27],
                   closeButton: !1,
                   closeOnMove: !0,
                   className: "maptiler-gc-popup"
                 }).setText(
-                  v.place_type[0] === "reverse" ? v.place_name : v.place_name.replace(/,.*/, "")
+                  E.place_type[0] === "reverse" ? E.place_name : E.place_name.replace(/,.*/, "")
                 )
               ).addTo(i);
-            const w = E.getElement();
-            w.addEventListener("click", (b) => {
-              b.stopPropagation(), c == null || c({ type: "markerClick", id: v.id });
-            }), w.addEventListener("mouseenter", () => {
-              c == null || c({ type: "markerMouseEnter", id: v.id }), E.togglePopup();
-            }), w.addEventListener("mouseleave", () => {
-              c == null || c({ type: "markerMouseLeave", id: v.id }), E.togglePopup();
-            }), u.push(E);
+            const b = w.getElement();
+            b.addEventListener("click", (_) => {
+              _.stopPropagation(), c == null || c({ type: "markerClick", id: E.id });
+            }), b.addEventListener("mouseenter", () => {
+              c == null || c({ type: "markerMouseEnter", id: E.id }), w.togglePopup();
+            }), b.addEventListener("mouseleave", () => {
+              c == null || c({ type: "markerMouseLeave", id: E.id }), w.togglePopup();
+            }), u.push(w);
           }
       }
     },
-    setSelectedMarker(a) {
-      p && p.getElement().classList.toggle("marker-selected", !1), p = a > -1 ? u[a] : void 0, p == null || p.getElement().classList.toggle("marker-selected", !0);
+    setSelectedMarker(p) {
+      g && g.getElement().classList.toggle("marker-selected", !1), g = p > -1 ? u[p] : void 0, g == null || g.getElement().classList.toggle("marker-selected", !0);
     },
     getCenterAndZoom() {
-      const a = i.getCenter();
-      return [i.getZoom(), a.lng, a.lat];
+      const p = i.getCenter();
+      return [i.getZoom(), p.lng, p.lat];
+    },
+    setShowPolygonMarker(p) {
+      a = p;
     }
   };
 }