@maptiler/geocoding-control 2.0.0-rc.3 → 2.0.0-rc.5

package/openlayers-controller.js

@@ -41,41 +41,41 @@ function At(o, t, e = {}) {
 }
 function Ot(o, t, e) {
   if (o !== null)
-    for (var n, r, i, u, l, f, c, g = 0, s = 0, h, a = o.type, d = a === "FeatureCollection", p = a === "Feature", y = d ? o.features.length : 1, x = 0; x < y; x++) {
-      c = d ? o.features[x].geometry : p ? o.geometry : o, h = c ? c.type === "GeometryCollection" : !1, l = h ? c.geometries.length : 1;
-      for (var m = 0; m < l; m++) {
-        var w = 0, v = 0;
+    for (var n, r, i, u, s, f, c, g = 0, l = 0, h, a = o.type, x = a === "FeatureCollection", d = a === "Feature", y = x ? o.features.length : 1, p = 0; p < y; p++) {
+      c = x ? o.features[p].geometry : d ? o.geometry : o, h = c ? c.type === "GeometryCollection" : !1, s = h ? c.geometries.length : 1;
+      for (var m = 0; m < s; m++) {
+        var v = 0, E = 0;
         if (u = h ? c.geometries[m] : c, u !== null) {
           f = u.coordinates;
-          var E = u.type;
-          switch (g = 0, E) {
+          var w = u.type;
+          switch (g = 0, w) {
             case null:
               break;
             case "Point":
               if (t(
                 f,
-                s,
-                x,
-                w,
-                v
+                l,
+                p,
+                v,
+                E
               ) === !1)
                 return !1;
-              s++, w++;
+              l++, v++;
               break;
             case "LineString":
             case "MultiPoint":
               for (n = 0; n < f.length; n++) {
                 if (t(
                   f[n],
-                  s,
-                  x,
-                  w,
-                  v
+                  l,
+                  p,
+                  v,
+                  E
                 ) === !1)
                   return !1;
-                s++, E === "MultiPoint" && w++;
+                l++, w === "MultiPoint" && v++;
               }
-              E === "LineString" && w++;
+              w === "LineString" && v++;
               break;
             case "Polygon":
             case "MultiLineString":
@@ -83,35 +83,35 @@ function Ot(o, t, e) {
                 for (r = 0; r < f[n].length - g; r++) {
                   if (t(
                     f[n][r],
-                    s,
-                    x,
-                    w,
-                    v
+                    l,
+                    p,
+                    v,
+                    E
                   ) === !1)
                     return !1;
-                  s++;
+                  l++;
                 }
-                E === "MultiLineString" && w++, E === "Polygon" && v++;
+                w === "MultiLineString" && v++, w === "Polygon" && E++;
               }
-              E === "Polygon" && w++;
+              w === "Polygon" && v++;
               break;
             case "MultiPolygon":
               for (n = 0; n < f.length; n++) {
-                for (v = 0, r = 0; r < f[n].length; r++) {
+                for (E = 0, r = 0; r < f[n].length; r++) {
                   for (i = 0; i < f[n][r].length - g; i++) {
                     if (t(
                       f[n][r][i],
-                      s,
-                      x,
-                      w,
-                      v
+                      l,
+                      p,
+                      v,
+                      E
                     ) === !1)
                       return !1;
-                    s++;
+                    l++;
                   }
-                  v++;
+                  E++;
                 }
-                w++;
+                v++;
               }
               break;
             case "GeometryCollection":
@@ -127,16 +127,16 @@ function Ot(o, t, e) {
     }
 }
 function st(o, t) {
-  var e, n, r, i, u, l, f, c, g, s, h = 0, a = o.type === "FeatureCollection", d = o.type === "Feature", p = a ? o.features.length : 1;
-  for (e = 0; e < p; e++) {
-    for (l = a ? o.features[e].geometry : d ? o.geometry : o, c = a ? o.features[e].properties : d ? o.properties : {}, g = a ? o.features[e].bbox : d ? o.bbox : void 0, s = a ? o.features[e].id : d ? o.id : void 0, f = l ? l.type === "GeometryCollection" : !1, u = f ? l.geometries.length : 1, r = 0; r < u; r++) {
-      if (i = f ? l.geometries[r] : l, i === null) {
+  var e, n, r, i, u, s, f, c, g, l, h = 0, a = o.type === "FeatureCollection", x = o.type === "Feature", d = a ? o.features.length : 1;
+  for (e = 0; e < d; e++) {
+    for (s = a ? o.features[e].geometry : x ? o.geometry : o, c = a ? o.features[e].properties : x ? o.properties : {}, g = a ? o.features[e].bbox : x ? o.bbox : void 0, l = a ? o.features[e].id : x ? o.id : void 0, f = s ? s.type === "GeometryCollection" : !1, u = f ? s.geometries.length : 1, r = 0; r < u; r++) {
+      if (i = f ? s.geometries[r] : s, i === null) {
         if (t(
           null,
           h,
           c,
           g,
-          s
+          l
         ) === !1)
           return !1;
         continue;
@@ -153,7 +153,7 @@ function st(o, t) {
             h,
             c,
             g,
-            s
+            l
           ) === !1)
             return !1;
           break;
@@ -165,7 +165,7 @@ function st(o, t) {
               h,
               c,
               g,
-              s
+              l
             ) === !1)
               return !1;
           break;
@@ -179,8 +179,8 @@ function st(o, t) {
 }
 function Dt(o, t) {
   st(o, function(e, n, r, i, u) {
-    var l = e === null ? null : e.type;
-    switch (l) {
+    var s = e === null ? null : e.type;
+    switch (s) {
       case null:
       case "Point":
       case "LineString":
@@ -192,7 +192,7 @@ function Dt(o, t) {
         ) === !1 ? !1 : void 0;
     }
     var f;
-    switch (l) {
+    switch (s) {
       case "MultiPoint":
         f = "Point";
         break;
@@ -204,11 +204,11 @@ function Dt(o, t) {
         break;
     }
     for (var c = 0; c < e.coordinates.length; c++) {
-      var g = e.coordinates[c], s = {
+      var g = e.coordinates[c], l = {
         type: f,
         coordinates: g
       };
-      if (t(D(s, r), n, c) === !1)
+      if (t(D(l, r), n, c) === !1)
         return !1;
     }
   });
@@ -249,10 +249,10 @@ function Wt(o, t) {
     if (i[0] & 1) throw i[1];
     return i[1];
   }, trys: [], ops: [] }, n, r, i, u;
-  return u = { next: l(0), throw: l(1), return: l(2) }, typeof Symbol == "function" && (u[Symbol.iterator] = function() {
+  return u = { next: s(0), throw: s(1), return: s(2) }, typeof Symbol == "function" && (u[Symbol.iterator] = function() {
     return this;
   }), u;
-  function l(c) {
+  function s(c) {
     return function(g) {
       return f([c, g]);
     };
@@ -323,8 +323,8 @@ function G(o, t, e) {
       if (t.left === null)
         break;
       if (e(o, t.left.key) < 0) {
-        var l = t.left;
-        if (t.left = l.right, l.right = t, t = l, t.left === null)
+        var s = t.left;
+        if (t.left = s.right, s.right = t, t = s, t.left === null)
           break;
       }
       i.left = t, i = t, t = t.left;
@@ -332,8 +332,8 @@ function G(o, t, e) {
       if (t.right === null)
         break;
       if (e(o, t.right.key) > 0) {
-        var l = t.right;
-        if (t.right = l.left, l.left = t, t = l, t.right === null)
+        var s = t.right;
+        if (t.right = s.left, s.left = t, t = s, t.right === null)
           break;
       }
       r.right = t, r = t, t = t.right;
@@ -423,15 +423,15 @@ var lt = (
         n !== null ? (r.push(n), n = n.left) : r.length !== 0 ? (n = r.pop(), t.call(e, n), n = n.right) : i = !0;
       return this;
     }, o.prototype.range = function(t, e, n, r) {
-      for (var i = [], u = this._comparator, l = this._root, f; i.length !== 0 || l; )
-        if (l)
-          i.push(l), l = l.left;
+      for (var i = [], u = this._comparator, s = this._root, f; i.length !== 0 || s; )
+        if (s)
+          i.push(s), s = s.left;
         else {
-          if (l = i.pop(), f = u(l.key, e), f > 0)
+          if (s = i.pop(), f = u(s.key, e), f > 0)
             break;
-          if (u(l.key, t) >= 0 && n.call(r, l))
+          if (u(s.key, t) >= 0 && n.call(r, s))
             return this;
-          l = l.right;
+          s = s.right;
         }
       return this;
     }, o.prototype.keys = function() {
@@ -536,8 +536,8 @@ var lt = (
         return e.push(n);
       }, t), e.join("");
     }, o.prototype.update = function(t, e, n) {
-      var r = this._comparator, i = xt(t, this._root, r), u = i.left, l = i.right;
-      r(t, e) < 0 ? l = J(e, n, l, r) : u = J(e, n, u, r), this._root = Jt(u, l, r);
+      var r = this._comparator, i = xt(t, this._root, r), u = i.left, s = i.right;
+      r(t, e) < 0 ? s = J(e, n, s, r) : u = J(e, n, u, r), this._root = Jt(u, s, r);
     }, o.prototype.split = function(t) {
       return xt(t, this._root, this._comparator);
     }, o.prototype[Symbol.iterator] = function() {
@@ -569,7 +569,7 @@ var lt = (
 function et(o, t, e, n) {
   var r = n - e;
   if (r > 0) {
-    var i = e + Math.floor(r / 2), u = o[i], l = t[i], f = new $(u, l);
+    var i = e + Math.floor(r / 2), u = o[i], s = t[i], f = new $(u, s);
     return f.left = et(o, t, e, i), f.right = et(o, t, i + 1, n), f;
   }
   return null;
@@ -599,33 +599,33 @@ function te(o, t, e) {
 }
 function rt(o, t, e, n, r) {
   if (!(e >= n)) {
-    for (var i = o[e + n >> 1], u = e - 1, l = n + 1; ; ) {
+    for (var i = o[e + n >> 1], u = e - 1, s = n + 1; ; ) {
       do
         u++;
       while (r(o[u], i) < 0);
       do
-        l--;
-      while (r(o[l], i) > 0);
-      if (u >= l)
+        s--;
+      while (r(o[s], i) > 0);
+      if (u >= s)
         break;
       var f = o[u];
-      o[u] = o[l], o[l] = f, f = t[u], t[u] = t[l], t[l] = f;
+      o[u] = o[s], o[s] = f, f = t[u], t[u] = t[s], t[s] = f;
     }
-    rt(o, t, e, l, r), rt(o, t, l + 1, n, r);
+    rt(o, t, e, s, r), rt(o, t, s + 1, n, r);
   }
 }
 const F = 11102230246251565e-32, _ = 134217729, ee = (3 + 8 * F) * F;
 function K(o, t, e, n, r) {
-  let i, u, l, f, c = t[0], g = n[0], s = 0, h = 0;
-  g > c == g > -c ? (i = c, c = t[++s]) : (i = g, g = n[++h]);
+  let i, u, s, f, c = t[0], g = n[0], l = 0, h = 0;
+  g > c == g > -c ? (i = c, c = t[++l]) : (i = g, g = n[++h]);
   let a = 0;
-  if (s < o && h < e)
-    for (g > c == g > -c ? (u = c + i, l = i - (u - c), c = t[++s]) : (u = g + i, l = i - (u - g), g = n[++h]), i = u, l !== 0 && (r[a++] = l); s < o && h < e; )
-      g > c == g > -c ? (u = i + c, f = u - i, l = i - (u - f) + (c - f), c = t[++s]) : (u = i + g, f = u - i, l = i - (u - f) + (g - f), g = n[++h]), i = u, l !== 0 && (r[a++] = l);
-  for (; s < o; )
-    u = i + c, f = u - i, l = i - (u - f) + (c - f), c = t[++s], i = u, l !== 0 && (r[a++] = l);
+  if (l < o && h < e)
+    for (g > c == g > -c ? (u = c + i, s = i - (u - c), c = t[++l]) : (u = g + i, s = i - (u - g), g = n[++h]), i = u, s !== 0 && (r[a++] = s); l < o && h < e; )
+      g > c == g > -c ? (u = i + c, f = u - i, s = i - (u - f) + (c - f), c = t[++l]) : (u = i + g, f = u - i, s = i - (u - f) + (g - f), g = n[++h]), i = u, s !== 0 && (r[a++] = s);
+  for (; l < o; )
+    u = i + c, f = u - i, s = i - (u - f) + (c - f), c = t[++l], i = u, s !== 0 && (r[a++] = s);
   for (; h < e; )
-    u = i + g, f = u - i, l = i - (u - f) + (g - f), g = n[++h], i = u, l !== 0 && (r[a++] = l);
+    u = i + g, f = u - i, s = i - (u - f) + (g - f), g = n[++h], i = u, s !== 0 && (r[a++] = s);
   return (i !== 0 || a === 0) && (r[a++] = i), a;
 }
 function ne(o, t) {
@@ -638,21 +638,21 @@ function Y(o) {
 }
 const re = (3 + 16 * F) * F, ie = (2 + 12 * F) * F, oe = (9 + 64 * F) * F * F, T = Y(4), dt = Y(8), vt = Y(12), mt = Y(16), P = Y(4);
 function se(o, t, e, n, r, i, u) {
-  let l, f, c, g, s, h, a, d, p, y, x, m, w, v, E, b, M, S;
+  let s, f, c, g, l, h, a, x, d, y, p, m, v, E, w, b, M, S;
   const L = o - r, I = e - r, k = t - i, C = n - i;
-  v = L * C, h = _ * L, a = h - (h - L), d = L - a, h = _ * C, p = h - (h - C), y = C - p, E = d * y - (v - a * p - d * p - a * y), b = k * I, h = _ * k, a = h - (h - k), d = k - a, h = _ * I, p = h - (h - I), y = I - p, M = d * y - (b - a * p - d * p - a * y), x = E - M, s = E - x, T[0] = E - (x + s) + (s - M), m = v + x, s = m - v, w = v - (m - s) + (x - s), x = w - b, s = w - x, T[1] = w - (x + s) + (s - b), S = m + x, s = S - m, T[2] = m - (S - s) + (x - s), T[3] = S;
+  E = L * C, h = _ * L, a = h - (h - L), x = L - a, h = _ * C, d = h - (h - C), y = C - d, w = x * y - (E - a * d - x * d - a * y), b = k * I, h = _ * k, a = h - (h - k), x = k - a, h = _ * I, d = h - (h - I), y = I - d, M = x * y - (b - a * d - x * d - a * y), p = w - M, l = w - p, T[0] = w - (p + l) + (l - M), m = E + p, l = m - E, v = E - (m - l) + (p - l), p = v - b, l = v - p, T[1] = v - (p + l) + (l - b), S = m + p, l = S - m, T[2] = m - (S - l) + (p - l), T[3] = S;
   let O = ne(4, T), q = ie * u;
-  if (O >= q || -O >= q || (s = o - L, l = o - (L + s) + (s - r), s = e - I, c = e - (I + s) + (s - r), s = t - k, f = t - (k + s) + (s - i), s = n - C, g = n - (C + s) + (s - i), l === 0 && f === 0 && c === 0 && g === 0) || (q = oe * u + ee * Math.abs(O), O += L * g + C * l - (k * c + I * f), O >= q || -O >= q)) return O;
-  v = l * C, h = _ * l, a = h - (h - l), d = l - a, h = _ * C, p = h - (h - C), y = C - p, E = d * y - (v - a * p - d * p - a * y), b = f * I, h = _ * f, a = h - (h - f), d = f - a, h = _ * I, p = h - (h - I), y = I - p, M = d * y - (b - a * p - d * p - a * y), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), m = v + x, s = m - v, w = v - (m - s) + (x - s), x = w - b, s = w - x, P[1] = w - (x + s) + (s - b), S = m + x, s = S - m, P[2] = m - (S - s) + (x - s), P[3] = S;
+  if (O >= q || -O >= q || (l = o - L, s = o - (L + l) + (l - r), l = e - I, c = e - (I + l) + (l - r), l = t - k, f = t - (k + l) + (l - i), l = n - C, g = n - (C + l) + (l - i), s === 0 && f === 0 && c === 0 && g === 0) || (q = oe * u + ee * Math.abs(O), O += L * g + C * s - (k * c + I * f), O >= q || -O >= q)) return O;
+  E = s * C, h = _ * s, a = h - (h - s), x = s - a, h = _ * C, d = h - (h - C), y = C - d, w = x * y - (E - a * d - x * d - a * y), b = f * I, h = _ * f, a = h - (h - f), x = f - a, h = _ * I, d = h - (h - I), y = I - d, M = x * y - (b - a * d - x * d - a * y), p = w - M, l = w - p, P[0] = w - (p + l) + (l - M), m = E + p, l = m - E, v = E - (m - l) + (p - l), p = v - b, l = v - p, P[1] = v - (p + l) + (l - b), S = m + p, l = S - m, P[2] = m - (S - l) + (p - l), P[3] = S;
   const Gt = K(4, T, 4, P, dt);
-  v = L * g, h = _ * L, a = h - (h - L), d = L - a, h = _ * g, p = h - (h - g), y = g - p, E = d * y - (v - a * p - d * p - a * y), b = k * c, h = _ * k, a = h - (h - k), d = k - a, h = _ * c, p = h - (h - c), y = c - p, M = d * y - (b - a * p - d * p - a * y), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), m = v + x, s = m - v, w = v - (m - s) + (x - s), x = w - b, s = w - x, P[1] = w - (x + s) + (s - b), S = m + x, s = S - m, P[2] = m - (S - s) + (x - s), P[3] = S;
+  E = L * g, h = _ * L, a = h - (h - L), x = L - a, h = _ * g, d = h - (h - g), y = g - d, w = x * y - (E - a * d - x * d - a * y), b = k * c, h = _ * k, a = h - (h - k), x = k - a, h = _ * c, d = h - (h - c), y = c - d, M = x * y - (b - a * d - x * d - a * y), p = w - M, l = w - p, P[0] = w - (p + l) + (l - M), m = E + p, l = m - E, v = E - (m - l) + (p - l), p = v - b, l = v - p, P[1] = v - (p + l) + (l - b), S = m + p, l = S - m, P[2] = m - (S - l) + (p - l), P[3] = S;
   const Bt = K(Gt, dt, 4, P, vt);
-  v = l * g, h = _ * l, a = h - (h - l), d = l - a, h = _ * g, p = h - (h - g), y = g - p, E = d * y - (v - a * p - d * p - a * y), b = f * c, h = _ * f, a = h - (h - f), d = f - a, h = _ * c, p = h - (h - c), y = c - p, M = d * y - (b - a * p - d * p - a * y), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), m = v + x, s = m - v, w = v - (m - s) + (x - s), x = w - b, s = w - x, P[1] = w - (x + s) + (s - b), S = m + x, s = S - m, P[2] = m - (S - s) + (x - s), P[3] = S;
+  E = s * g, h = _ * s, a = h - (h - s), x = s - a, h = _ * g, d = h - (h - g), y = g - d, w = x * y - (E - a * d - x * d - a * y), b = f * c, h = _ * f, a = h - (h - f), x = f - a, h = _ * c, d = h - (h - c), y = c - d, M = x * y - (b - a * d - x * d - a * y), p = w - M, l = w - p, P[0] = w - (p + l) + (l - M), m = E + p, l = m - E, v = E - (m - l) + (p - l), p = v - b, l = v - p, P[1] = v - (p + l) + (l - b), S = m + p, l = S - m, P[2] = m - (S - l) + (p - l), P[3] = S;
   const zt = K(Bt, vt, 4, P, mt);
   return mt[zt - 1];
 }
 function le(o, t, e, n, r, i) {
-  const u = (t - i) * (e - r), l = (o - r) * (n - i), f = u - l, c = Math.abs(u + l);
+  const u = (t - i) * (e - r), s = (o - r) * (n - i), f = u - s, c = Math.abs(u + s);
   return Math.abs(f) >= re * c ? f : -se(o, t, e, n, r, i, c);
 }
 const Q = (o, t) => o.ll.x <= t.x && t.x <= o.ur.x && o.ll.y <= t.y && t.y <= o.ur.y, it = (o, t) => {
@@ -747,7 +747,7 @@ const U = new fe(), j = (o, t) => o.x * t.y - o.y * t.x, Nt = (o, t) => o.x * t.
   const i = {
     x: e.x - o.x,
     y: e.y - o.y
-  }, u = j(i, t) / r, l = j(i, n) / r, f = o.x + l * t.x, c = e.x + u * n.x, g = o.y + l * t.y, s = e.y + u * n.y, h = (f + c) / 2, a = (g + s) / 2;
+  }, u = j(i, t) / r, s = j(i, n) / r, f = o.x + s * t.x, c = e.x + u * n.x, g = o.y + s * t.y, l = e.y + u * n.y, h = (f + c) / 2, a = (g + l) / 2;
   return {
     x: h,
     y: a
@@ -820,12 +820,12 @@ class R {
       e.has(r) || n(r), e.has(i) || n(i);
       const {
         sine: u,
-        cosine: l
+        cosine: s
       } = e.get(r), {
         sine: f,
         cosine: c
       } = e.get(i);
-      return u >= 0 && f >= 0 ? l < c ? 1 : l > c ? -1 : 0 : u < 0 && f < 0 ? l < c ? -1 : l > c ? 1 : 0 : f < u ? -1 : f > u ? 1 : 0;
+      return u >= 0 && f >= 0 ? s < c ? 1 : s > c ? -1 : 0 : u < 0 && f < 0 ? s < c ? -1 : s > c ? 1 : 0 : f < u ? -1 : f > u ? 1 : 0;
     };
   }
 }
@@ -848,39 +848,39 @@ class z {
     const n = t.leftSE.point.x, r = e.leftSE.point.x, i = t.rightSE.point.x, u = e.rightSE.point.x;
     if (u < n) return 1;
     if (i < r) return -1;
-    const l = t.leftSE.point.y, f = e.leftSE.point.y, c = t.rightSE.point.y, g = e.rightSE.point.y;
+    const s = t.leftSE.point.y, f = e.leftSE.point.y, c = t.rightSE.point.y, g = e.rightSE.point.y;
     if (n < r) {
-      if (f < l && f < c) return 1;
-      if (f > l && f > c) return -1;
-      const s = t.comparePoint(e.leftSE.point);
-      if (s < 0) return 1;
-      if (s > 0) return -1;
+      if (f < s && f < c) return 1;
+      if (f > s && f > c) 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 (n > r) {
-      if (l < f && l < g) return -1;
-      if (l > f && l > g) return 1;
-      const s = e.comparePoint(t.leftSE.point);
-      if (s !== 0) return s;
+      if (s < f && s < g) return -1;
+      if (s > f && 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 < f) return -1;
-    if (l > f) return 1;
+    if (s < f) return -1;
+    if (s > f) return 1;
     if (i < u) {
-      const s = e.comparePoint(t.rightSE.point);
-      if (s !== 0) return s;
+      const l = e.comparePoint(t.rightSE.point);
+      if (l !== 0) return l;
     }
     if (i > u) {
-      const s = t.comparePoint(e.rightSE.point);
-      if (s < 0) return 1;
-      if (s > 0) return -1;
+      const l = t.comparePoint(e.rightSE.point);
+      if (l < 0) return 1;
+      if (l > 0) return -1;
     }
     if (i !== u) {
-      const s = c - l, h = i - n, a = g - f, d = u - r;
-      if (s > h && a < d) return 1;
-      if (s < h && a > d) return -1;
+      const l = c - s, h = i - n, a = g - f, x = u - r;
+      if (l > h && a < x) return 1;
+      if (l < h && a > x) return -1;
     }
     return i > u ? 1 : i < u || c < g ? -1 : c > g ? 1 : t.id < e.id ? -1 : t.id > e.id ? 1 : 0;
   }
@@ -891,10 +891,10 @@ class z {
   }
   static fromRing(t, e, n) {
     let r, i, u;
-    const l = R.comparePoints(t, e);
-    if (l < 0)
+    const s = R.comparePoints(t, e);
+    if (s < 0)
       r = t, i = e, u = 1;
-    else if (l > 0)
+    else if (s > 0)
       r = e, i = t, u = -1;
     else throw new Error(`Tried to create degenerate segment at [${t.x}, ${t.y}]`);
     const f = new R(r, !0), c = new R(i, !1);
@@ -947,7 +947,7 @@ class z {
       return t.x === e.x ? 0 : t.x < e.x ? 1 : -1;
     const i = (t.y - e.y) / r.y, u = e.x + i * r.x;
     if (t.x === u) return 0;
-    const l = (t.x - e.x) / r.x, f = e.y + l * r.y;
+    const s = (t.x - e.x) / r.x, f = e.y + s * r.y;
     return t.y === f ? 0 : t.y < f ? -1 : 1;
   }
   /**
@@ -968,17 +968,17 @@ class z {
   getIntersection(t) {
     const e = this.bbox(), n = t.bbox(), r = it(e, n);
     if (r === null) return null;
-    const i = this.leftSE.point, u = this.rightSE.point, l = t.leftSE.point, f = t.rightSE.point, c = Q(e, l) && this.comparePoint(l) === 0, g = Q(n, i) && t.comparePoint(i) === 0, s = Q(e, f) && this.comparePoint(f) === 0, h = Q(n, u) && t.comparePoint(u) === 0;
+    const i = this.leftSE.point, u = this.rightSE.point, s = t.leftSE.point, f = t.rightSE.point, c = Q(e, s) && this.comparePoint(s) === 0, g = Q(n, i) && t.comparePoint(i) === 0, l = Q(e, f) && this.comparePoint(f) === 0, h = Q(n, u) && t.comparePoint(u) === 0;
     if (g && c)
-      return h && !s ? u : !h && s ? f : null;
+      return h && !l ? u : !h && l ? f : null;
     if (g)
-      return s && i.x === f.x && i.y === f.y ? null : i;
+      return l && i.x === f.x && i.y === f.y ? null : i;
     if (c)
-      return h && u.x === l.x && u.y === l.y ? null : l;
-    if (h && s) return null;
+      return h && u.x === s.x && u.y === s.y ? null : s;
+    if (h && l) return null;
     if (h) return u;
-    if (s) return f;
-    const a = ae(i, this.vector(), l, t.vector());
+    if (l) return f;
+    const a = ae(i, this.vector(), s, t.vector());
     return a === null || !Q(r, a) ? null : U.round(a.x, a.y);
   }
   /**
@@ -996,8 +996,8 @@ class z {
   split(t) {
     const e = [], n = t.events !== void 0, r = new R(t, !0), i = new R(t, !1), u = this.rightSE;
     this.replaceRightSE(i), e.push(i), e.push(r);
-    const l = new z(r, u, this.rings.slice(), this.windings.slice());
-    return R.comparePoints(l.leftSE.point, l.rightSE.point) > 0 && l.swapEvents(), R.comparePoints(this.leftSE.point, this.rightSE.point) > 0 && this.swapEvents(), n && (r.checkForConsuming(), i.checkForConsuming()), e;
+    const s = new z(r, u, this.rings.slice(), this.windings.slice());
+    return R.comparePoints(s.leftSE.point, s.rightSE.point) > 0 && s.swapEvents(), R.comparePoints(this.leftSE.point, this.rightSE.point) > 0 && this.swapEvents(), n && (r.checkForConsuming(), i.checkForConsuming()), e;
   }
   /* Swap which event is left and right */
   swapEvents() {
@@ -1023,8 +1023,8 @@ class z {
         e = n, n = i;
       }
       for (let i = 0, u = n.rings.length; i < u; i++) {
-        const l = n.rings[i], f = n.windings[i], c = e.rings.indexOf(l);
-        c === -1 ? (e.rings.push(l), e.windings.push(f)) : e.windings[c] += f;
+        const s = n.rings[i], f = n.windings[i], c = e.rings.indexOf(s);
+        c === -1 ? (e.rings.push(s), e.windings.push(f)) : e.windings[c] += f;
       }
       n.rings = null, n.windings = null, n.consumedBy = e, n.leftSE.consumedBy = e.leftSE, n.rightSE.consumedBy = e.rightSE;
     }
@@ -1055,24 +1055,24 @@ class z {
       multiPolys: []
     };
     const e = this._afterState.rings, n = this._afterState.windings, r = this._afterState.multiPolys;
-    for (let l = 0, f = this.rings.length; l < f; l++) {
-      const c = this.rings[l], g = this.windings[l], s = e.indexOf(c);
-      s === -1 ? (e.push(c), n.push(g)) : n[s] += g;
+    for (let s = 0, f = this.rings.length; s < f; s++) {
+      const c = this.rings[s], g = this.windings[s], l = e.indexOf(c);
+      l === -1 ? (e.push(c), n.push(g)) : n[l] += g;
     }
     const i = [], u = [];
-    for (let l = 0, f = e.length; l < f; l++) {
-      if (n[l] === 0) continue;
-      const c = e[l], g = c.poly;
+    for (let s = 0, f = e.length; s < f; s++) {
+      if (n[s] === 0) continue;
+      const c = e[s], g = c.poly;
       if (u.indexOf(g) === -1)
         if (c.isExterior) i.push(g);
         else {
           u.indexOf(g) === -1 && u.push(g);
-          const s = i.indexOf(c.poly);
-          s !== -1 && i.splice(s, 1);
+          const l = i.indexOf(c.poly);
+          l !== -1 && i.splice(l, 1);
         }
     }
-    for (let l = 0, f = i.length; l < f; l++) {
-      const c = i[l].multiPoly;
+    for (let s = 0, f = i.length; s < f; s++) {
+      const c = i[s].multiPoly;
       r.indexOf(c) === -1 && r.push(c);
     }
     return this._afterState;
@@ -1127,7 +1127,7 @@ class Pt {
       }
     };
     let i = r;
-    for (let u = 1, l = t.length; u < l; u++) {
+    for (let u = 1, s = t.length; u < s; 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 f = U.round(t[u][0], t[u][1]);
@@ -1216,36 +1216,36 @@ class W {
     for (let n = 0, r = t.length; n < r; n++) {
       const i = t[n];
       if (!i.isInResult() || i.ringOut) continue;
-      let u = null, l = i.leftSE, f = i.rightSE;
-      const c = [l], g = l.point, s = [];
-      for (; u = l, l = f, c.push(l), l.point !== g; )
+      let u = null, s = i.leftSE, f = i.rightSE;
+      const c = [s], g = s.point, l = [];
+      for (; u = s, s = f, c.push(s), s.point !== g; )
         for (; ; ) {
-          const h = l.getAvailableLinkedEvents();
+          const h = s.getAvailableLinkedEvents();
           if (h.length === 0) {
-            const p = c[0].point, y = c[c.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 d = c[0].point, y = c[c.length - 1].point;
+            throw new Error(`Unable to complete output ring starting at [${d.x}, ${d.y}]. Last matching segment found ends at [${y.x}, ${y.y}].`);
           }
           if (h.length === 1) {
             f = h[0].otherSE;
             break;
           }
           let a = null;
-          for (let p = 0, y = s.length; p < y; p++)
-            if (s[p].point === l.point) {
-              a = p;
+          for (let d = 0, y = l.length; d < y; d++)
+            if (l[d].point === s.point) {
+              a = d;
               break;
             }
           if (a !== null) {
-            const p = s.splice(a)[0], y = c.splice(p.index);
+            const d = l.splice(a)[0], y = c.splice(d.index);
             y.unshift(y[0].otherSE), e.push(new W(y.reverse()));
             continue;
           }
-          s.push({
+          l.push({
             index: c.length,
-            point: l.point
+            point: s.point
           });
-          const d = l.getLeftmostComparator(u);
-          f = h.sort(d)[0].otherSE;
+          const x = s.getLeftmostComparator(u);
+          f = h.sort(x)[0].otherSE;
           break;
         }
       e.push(new W(c));
@@ -1262,14 +1262,14 @@ class W {
     let t = this.events[0].point;
     const e = [t];
     for (let c = 1, g = this.events.length - 1; c < g; c++) {
-      const s = this.events[c].point, h = this.events[c + 1].point;
-      bt(s, t, h) !== 0 && (e.push(s), t = s);
+      const l = this.events[c].point, h = this.events[c + 1].point;
+      bt(l, t, h) !== 0 && (e.push(l), t = l);
     }
     if (e.length === 1) return null;
     const n = e[0], r = e[1];
     bt(n, t, r) === 0 && e.shift(), e.push(e[0]);
-    const i = this.isExteriorRing() ? 1 : -1, u = this.isExteriorRing() ? 0 : e.length - 1, l = this.isExteriorRing() ? e.length : -1, f = [];
-    for (let c = u; c != l; c += i) f.push([e[c].x, e[c].y]);
+    const i = this.isExteriorRing() ? 1 : -1, u = this.isExteriorRing() ? 0 : e.length - 1, s = this.isExteriorRing() ? e.length : -1, f = [];
+    for (let c = u; c != s; c += i) f.push([e[c].x, e[c].y]);
     return f;
   }
   isExteriorRing() {
@@ -1353,51 +1353,51 @@ class xe {
       return t.isLeft ? this.queue.remove(t.otherSE) : this.tree.remove(e), n;
     const r = t.isLeft ? this.tree.add(e) : this.tree.find(e);
     if (!r) 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 i = r, u = r, l, f;
-    for (; l === void 0; )
-      i = this.tree.prev(i), i === null ? l = null : i.key.consumedBy === void 0 && (l = i.key);
+    let i = r, u = r, s, f;
+    for (; s === void 0; )
+      i = this.tree.prev(i), i === null ? s = null : i.key.consumedBy === void 0 && (s = i.key);
     for (; f === void 0; )
       u = this.tree.next(u), u === null ? f = null : u.key.consumedBy === void 0 && (f = u.key);
     if (t.isLeft) {
       let c = null;
-      if (l) {
-        const s = l.getIntersection(e);
-        if (s !== null && (e.isAnEndpoint(s) || (c = s), !l.isAnEndpoint(s))) {
-          const h = this._splitSafely(l, s);
-          for (let a = 0, d = h.length; a < d; a++)
+      if (s) {
+        const l = s.getIntersection(e);
+        if (l !== null && (e.isAnEndpoint(l) || (c = 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 g = null;
       if (f) {
-        const s = f.getIntersection(e);
-        if (s !== null && (e.isAnEndpoint(s) || (g = s), !f.isAnEndpoint(s))) {
-          const h = this._splitSafely(f, s);
-          for (let a = 0, d = h.length; a < d; a++)
+        const l = f.getIntersection(e);
+        if (l !== null && (e.isAnEndpoint(l) || (g = l), !f.isAnEndpoint(l))) {
+          const h = this._splitSafely(f, l);
+          for (let a = 0, x = h.length; a < x; a++)
             n.push(h[a]);
         }
       }
       if (c !== null || g !== null) {
-        let s = null;
-        c === null ? s = g : g === null ? s = c : s = R.comparePoints(c, g) <= 0 ? c : g, this.queue.remove(e.rightSE), n.push(e.rightSE);
-        const h = e.split(s);
-        for (let a = 0, d = h.length; a < d; a++)
+        let l = null;
+        c === null ? l = g : g === null ? l = c : l = R.comparePoints(c, g) <= 0 ? c : 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]);
       }
-      n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = l);
+      n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = s);
     } else {
-      if (l && f) {
-        const c = l.getIntersection(f);
+      if (s && f) {
+        const c = s.getIntersection(f);
         if (c !== null) {
-          if (!l.isAnEndpoint(c)) {
-            const g = this._splitSafely(l, c);
-            for (let s = 0, h = g.length; s < h; s++)
-              n.push(g[s]);
+          if (!s.isAnEndpoint(c)) {
+            const g = this._splitSafely(s, c);
+            for (let l = 0, h = g.length; l < h; l++)
+              n.push(g[l]);
           }
           if (!f.isAnEndpoint(c)) {
             const g = this._splitSafely(f, c);
-            for (let s = 0, h = g.length; s < h; s++)
-              n.push(g[s]);
+            for (let l = 0, h = g.length; l < h; l++)
+              n.push(g[l]);
           }
         }
       }
@@ -1420,45 +1420,45 @@ class ve {
   run(t, e, n) {
     A.type = t, U.reset();
     const r = [new Mt(e, !0)];
-    for (let s = 0, h = n.length; s < h; s++)
-      r.push(new Mt(n[s], !1));
+    for (let l = 0, h = n.length; l < h; l++)
+      r.push(new Mt(n[l], !1));
     if (A.numMultiPolys = r.length, A.type === "difference") {
-      const s = r[0];
+      const l = r[0];
       let h = 1;
       for (; h < r.length; )
-        it(r[h].bbox, s.bbox) !== null ? h++ : r.splice(h, 1);
+        it(r[h].bbox, l.bbox) !== null ? h++ : r.splice(h, 1);
     }
     if (A.type === "intersection")
-      for (let s = 0, h = r.length; s < h; s++) {
-        const a = r[s];
-        for (let d = s + 1, p = r.length; d < p; d++)
-          if (it(a.bbox, r[d].bbox) === null) return [];
+      for (let l = 0, h = r.length; l < h; l++) {
+        const a = r[l];
+        for (let x = l + 1, d = r.length; x < d; x++)
+          if (it(a.bbox, r[x].bbox) === null) return [];
       }
     const i = new lt(R.compare);
-    for (let s = 0, h = r.length; s < h; s++) {
-      const a = r[s].getSweepEvents();
-      for (let d = 0, p = a.length; d < p; d++)
-        if (i.insert(a[d]), i.size > Lt)
+    for (let l = 0, h = r.length; l < h; l++) {
+      const a = r[l].getSweepEvents();
+      for (let x = 0, d = a.length; x < d; x++)
+        if (i.insert(a[x]), i.size > Lt)
           throw new Error("Infinite loop when putting segment endpoints in a priority queue (queue size too big).");
     }
     const u = new xe(i);
-    let l = i.size, f = i.pop();
+    let s = i.size, f = i.pop();
     for (; f; ) {
-      const s = f.key;
-      if (i.size === l) {
-        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.`);
+      const l = f.key;
+      if (i.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.`);
       }
       if (i.size > Lt)
         throw new Error("Infinite loop when passing sweep line over endpoints (queue size too big).");
       if (u.segments.length > de)
         throw new Error("Infinite loop when passing sweep line over endpoints (too many sweep line segments).");
-      const h = u.process(s);
-      for (let a = 0, d = h.length; a < d; a++) {
-        const p = h[a];
-        p.consumedBy === void 0 && i.insert(p);
+      const h = u.process(l);
+      for (let a = 0, x = h.length; a < x; a++) {
+        const d = h[a];
+        d.consumedBy === void 0 && i.insert(d);
       }
-      l = i.size, f = i.pop();
+      s = i.size, f = i.pop();
     }
     U.reset();
     const c = W.factory(u.segments);
@@ -1539,22 +1539,22 @@ function kt(o, t) {
   if (!e)
     return;
   e.properties = { isMask: !0 };
-  const n = It(yt(o)), r = (n[2] - n[0]) / 360 / 1e3, i = n[0] < -180, u = n[2] > 180, l = Me(o);
-  if (l.features.length > 1 && (i || u))
-    for (const f of l.features) {
+  const n = It(yt(o)), r = (n[2] - n[0]) / 360 / 1e3, i = n[0] < -180, u = n[2] > 180, s = Me(o);
+  if (s.features.length > 1 && (i || u))
+    for (const f of s.features) {
       const c = It(yt(f));
       if (u && c[0] < -180 + r)
         for (const g of f.geometry.coordinates)
-          for (const s of g)
-            s[0] += 360 - r;
+          for (const l of g)
+            l[0] += 360 - r;
       if (i && c[2] > 180 - r)
         for (const g of f.geometry.coordinates)
-          for (const s of g)
-            s[0] -= 360 - r;
+          for (const l of g)
+            l[0] -= 360 - r;
     }
   t(
     H([
-      l.features.length < 2 ? o : Le(l) ?? o,
+      s.features.length < 2 ? o : Le(s) ?? o,
       e
     ])
   );
@@ -1592,156 +1592,159 @@ function Ie(o) {
   });
 }
 function Te(o, t = {}, e = {}, n = Ie, r = !1) {
-  let i = -1, u, l, f, c = !1;
-  const g = new Tt({
+  let i = -1, u, s, f, c = !1, g = r;
+  const l = new Tt({
     updateWhileAnimating: !0
   });
-  o.addLayer(g);
-  const s = new Ut({});
-  g.setSource(s), g.setStyle(n), o.on("click", (p) => {
-    o.forEachFeatureAtPixel(p.pixel, (y) => {
-      const x = y.getId();
-      if (x)
-        return p.stopPropagation(), l == null || l({ type: "markerClick", id: x }), y;
+  o.addLayer(l);
+  const h = new Ut({});
+  l.setSource(h), l.setStyle(n), o.on("click", (y) => {
+    o.forEachFeatureAtPixel(y.pixel, (p) => {
+      const m = p.getId();
+      if (m)
+        return y.stopPropagation(), s == null || s({ type: "markerClick", id: m }), p;
     });
-  }), o.on("pointermove", (p) => {
-    const y = o.forEachFeatureAtPixel(p.pixel, (x) => x.getId());
-    u !== y && (u && (l == null || l({
+  }), o.on("pointermove", (y) => {
+    const p = o.forEachFeatureAtPixel(y.pixel, (m) => m.getId());
+    u !== p && (u && (s == null || s({
       type: "markerMouseLeave",
       id: u
-    })), y && (l == null || l({
+    })), p && (s == null || s({
       type: "markerMouseEnter",
-      id: y
-    })), o.getTargetElement().style.cursor = y ? "pointer" : c ? "crosshair" : "", u = y);
+      id: p
+    })), o.getTargetElement().style.cursor = p ? "pointer" : c ? "crosshair" : "", u = p);
   });
-  function h() {
+  function a() {
     return qt() ?? o.getView().getProjection();
   }
-  function a(p) {
-    return p.transform(Ct, h());
+  function x(y) {
+    return y.transform(Ct, a());
   }
-  const d = (p) => {
-    l == null || l({
+  const d = (y) => {
+    s == null || s({
       type: "mapClick",
-      coordinates: at(p.coordinate, h())
+      coordinates: at(y.coordinate, a())
     });
   };
   return {
-    setEventHandler(p) {
-      p ? (l = p, o.on("click", d)) : (l = void 0, o.un("click", d));
+    setEventHandler(y) {
+      y ? (s = y, o.on("click", d)) : (s = void 0, o.un("click", d));
     },
-    flyTo(p, y) {
+    flyTo(y, p) {
       o.getView().animate({
-        center: V(p, h()),
-        ...y ? { zoom: y } : {},
+        center: V(y, a()),
+        ...p ? { zoom: p } : {},
         duration: 2e3,
         ...t
       });
     },
-    fitBounds(p, y, x) {
-      o.getView().fit(Qt(p, Ct, h()), {
-        padding: [y, y, y, y],
-        ...x ? { maxZoom: x } : {},
+    fitBounds(y, p, m) {
+      o.getView().fit(Qt(y, Ct, a()), {
+        padding: [p, p, p, p],
+        ...m ? { maxZoom: m } : {},
         duration: 2e3,
         ...e
       });
     },
-    indicateReverse(p) {
-      c = p, o.getTargetElement().style.cursor = p ? "crosshair" : "";
+    indicateReverse(y) {
+      c = y, o.getTargetElement().style.cursor = y ? "crosshair" : "";
     },
-    setReverseMarker(p) {
-      f ? p ? f.getGeometry().setCoordinates(
-        V(p, h())
-      ) : (s.removeFeature(f), f.dispose(), f = void 0) : p && (f = new N(
-        new Z(V(p, h()))
-      ), f.setProperties({ isReverse: !0 }), s.addFeature(f));
+    setReverseMarker(y) {
+      f ? y ? f.getGeometry().setCoordinates(
+        V(y, a())
+      ) : (h.removeFeature(f), f.dispose(), f = void 0) : y && (f = new N(
+        new Z(V(y, a()))
+      ), f.setProperties({ isReverse: !0 }), h.addFeature(f));
     },
-    setMarkers(p, y) {
-      function x(m) {
-        var w;
-        if (m)
-          for (const v of m.features) {
-            const E = v.geometry.type === "Polygon" ? new ut(v.geometry.coordinates) : v.geometry.type === "MultiPolygon" ? new ft(v.geometry.coordinates) : null;
-            E && s.addFeature(
+    setMarkers(y, p) {
+      function m(v) {
+        var E;
+        if (v)
+          for (const w of v.features) {
+            const b = w.geometry.type === "Polygon" ? new ut(w.geometry.coordinates) : w.geometry.type === "MultiPolygon" ? new ft(w.geometry.coordinates) : null;
+            b && h.addFeature(
               new N({
-                isMask: !!((w = v.properties) != null && w.isMask),
-                geometry: a(E)
+                isMask: !!((E = w.properties) != null && E.isMask),
+                geometry: x(b)
               })
             );
           }
       }
-      if (s.clear(), f && s.addFeature(f), y) {
-        let m = !1;
-        if (y.geometry.type === "GeometryCollection") {
-          const w = y.geometry.geometries.map(
-            (v) => v.type === "Polygon" ? new ut(v.coordinates) : v.type === "MultiPolygon" ? new ft(v.coordinates) : null
-          ).filter((v) => !!v);
-          if (w.length > 0)
-            s.addFeature(
-              new N(a(new $t(w)))
-            ), m = !0;
+      if (h.clear(), f && h.addFeature(f), p) {
+        let v = !1;
+        if (p.geometry.type === "GeometryCollection") {
+          const E = p.geometry.geometries.map(
+            (w) => w.type === "Polygon" ? new ut(w.coordinates) : w.type === "MultiPolygon" ? new ft(w.coordinates) : null
+          ).filter((w) => !!w);
+          if (E.length > 0)
+            h.addFeature(
+              new N(x(new $t(E)))
+            ), v = !0;
           else
-            for (const v of y.geometry.geometries)
-              v.type === "LineString" ? (s.addFeature(
+            for (const w of p.geometry.geometries)
+              w.type === "LineString" ? (h.addFeature(
                 new N(
-                  a(new ct(v.coordinates))
+                  x(new ct(w.coordinates))
                 )
-              ), m = !0) : v.type === "MultiLineString" && s.addFeature(
+              ), v = !0) : w.type === "MultiLineString" && h.addFeature(
                 new N(
-                  a(new ht(v.coordinates))
+                  x(new ht(w.coordinates))
                 )
-              ), m = !0;
+              ), v = !0;
         }
-        if (!m) {
-          if (y.geometry.type === "Polygon")
-            kt(y, x);
-          else if (y.geometry.type === "MultiPolygon")
-            kt(y, x);
-          else if (y.geometry.type === "LineString") {
-            s.addFeature(
+        if (!v) {
+          if (p.geometry.type === "Polygon")
+            kt(p, m);
+          else if (p.geometry.type === "MultiPolygon")
+            kt(p, m);
+          else if (p.geometry.type === "LineString") {
+            h.addFeature(
               new N(
-                a(new ct(y.geometry.coordinates))
+                x(new ct(p.geometry.coordinates))
               )
             );
             return;
-          } else if (y.geometry.type === "MultiLineString") {
-            s.addFeature(
+          } else if (p.geometry.type === "MultiLineString") {
+            h.addFeature(
               new N(
-                a(new ht(y.geometry.coordinates))
+                x(new ht(p.geometry.coordinates))
               )
             );
             return;
           }
         }
-        if (!r && y.geometry.type !== "Point")
+        if (!g && p.geometry.type !== "Point")
           return;
-        s.addFeature(new N(a(new Z(y.center))));
+        h.addFeature(new N(x(new Z(p.center))));
       }
-      for (const m of p ?? []) {
-        if (m === y)
+      for (const v of y ?? []) {
+        if (v === p)
           continue;
-        const w = new N(
-          new Z(V(m.center, h()))
+        const E = new N(
+          new Z(V(v.center, a()))
         );
-        w.setId(m.id), w.setProperties({
-          fuzzy: !!m.matching_text,
-          tooltip: m.place_type[0] === "reverse" ? m.place_name : m.place_name.replace(/,.*/, "")
-        }), s.addFeature(w);
+        E.setId(v.id), E.setProperties({
+          fuzzy: !!v.matching_text,
+          tooltip: v.place_type[0] === "reverse" ? v.place_name : v.place_name.replace(/,.*/, "")
+        }), h.addFeature(E);
       }
     },
-    setSelectedMarker(p) {
-      var m, w, v;
-      const y = s.getFeatures(), x = (m = y[0]) != null && m.getProperties().isReverse ? 1 : 0;
-      i > -1 && ((w = y[i + x]) == null || w.setProperties({
+    setSelectedMarker(y) {
+      var v, E, w;
+      const p = h.getFeatures(), m = (v = p[0]) != null && v.getProperties().isReverse ? 1 : 0;
+      i > -1 && ((E = p[i + m]) == null || E.setProperties({
         isSelected: !1
-      })), p > -1 && ((v = y[p + x]) == null || v.setProperties({
+      })), y > -1 && ((w = p[y + m]) == null || w.setProperties({
         isSelected: !0
-      })), i = p;
+      })), i = y;
     },
     getCenterAndZoom() {
-      const p = o.getView(), y = p.getCenter(), x = p.getZoom();
-      if (!(!y || x === void 0))
-        return [x, ...at(y, h())];
+      const y = o.getView(), p = y.getCenter(), m = y.getZoom();
+      if (!(!p || m === void 0))
+        return [m, ...at(p, a())];
+    },
+    setShowPolygonMarker(y) {
+      g = y;
     }
   };
 }