@maptiler/geocoding-control 1.4.2-dev.3 → 2.0.0-rc.1

package/openlayers-controller.js

@@ -1,7 +1,7 @@
 import { Feature as N } from "ol";
-import { Point as Z, Polygon as ut, MultiPolygon as ft, GeometryCollection as $t, LineString as ct, MultiLineString as ht } from "ol/geom";
+import { Polygon as ut, MultiPolygon as ft, GeometryCollection as $t, LineString as ct, MultiLineString as ht, Point as Z } from "ol/geom";
 import Tt from "ol/layer/Vector";
-import { fromLonLat as V, transformExtent as qt, toLonLat as at, getUserProjection as Qt } from "ol/proj";
+import { toLonLat as at, getUserProjection as qt, fromLonLat as V, transformExtent as Qt } from "ol/proj";
 import Ut from "ol/source/Vector";
 import gt from "ol/style/Fill";
 import Yt from "ol/style/Icon";
@@ -41,77 +41,77 @@ function At(o, t, e = {}) {
 }
 function Ot(o, t, e) {
   if (o !== null)
-    for (var n, r, i, u, l, c, f, a = 0, s = 0, h, g = o.type, y = g === "FeatureCollection", p = g === "Feature", d = y ? o.features.length : 1, x = 0; x < d; x++) {
-      f = y ? o.features[x].geometry : p ? o.geometry : o, h = f ? f.type === "GeometryCollection" : !1, l = h ? f.geometries.length : 1;
+    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 v = 0, w = 0;
-        if (u = h ? f.geometries[m] : f, u !== null) {
-          c = u.coordinates;
+        var w = 0, v = 0;
+        if (u = h ? c.geometries[m] : c, u !== null) {
+          f = u.coordinates;
           var E = u.type;
-          switch (a = 0, E) {
+          switch (g = 0, E) {
             case null:
               break;
             case "Point":
               if (t(
-                c,
+                f,
                 s,
                 x,
-                v,
-                w
+                w,
+                v
               ) === !1)
                 return !1;
-              s++, v++;
+              s++, w++;
               break;
             case "LineString":
             case "MultiPoint":
-              for (n = 0; n < c.length; n++) {
+              for (n = 0; n < f.length; n++) {
                 if (t(
-                  c[n],
+                  f[n],
                   s,
                   x,
-                  v,
-                  w
+                  w,
+                  v
                 ) === !1)
                   return !1;
-                s++, E === "MultiPoint" && v++;
+                s++, E === "MultiPoint" && w++;
               }
-              E === "LineString" && v++;
+              E === "LineString" && w++;
               break;
             case "Polygon":
             case "MultiLineString":
-              for (n = 0; n < c.length; n++) {
-                for (r = 0; r < c[n].length - a; r++) {
+              for (n = 0; n < f.length; n++) {
+                for (r = 0; r < f[n].length - g; r++) {
                   if (t(
-                    c[n][r],
+                    f[n][r],
                     s,
                     x,
-                    v,
-                    w
+                    w,
+                    v
                   ) === !1)
                     return !1;
                   s++;
                 }
-                E === "MultiLineString" && v++, E === "Polygon" && w++;
+                E === "MultiLineString" && w++, E === "Polygon" && v++;
               }
-              E === "Polygon" && v++;
+              E === "Polygon" && w++;
               break;
             case "MultiPolygon":
-              for (n = 0; n < c.length; n++) {
-                for (w = 0, r = 0; r < c[n].length; r++) {
-                  for (i = 0; i < c[n][r].length - a; i++) {
+              for (n = 0; n < f.length; n++) {
+                for (v = 0, r = 0; r < f[n].length; r++) {
+                  for (i = 0; i < f[n][r].length - g; i++) {
                     if (t(
-                      c[n][r][i],
+                      f[n][r][i],
                       s,
                       x,
-                      v,
-                      w
+                      w,
+                      v
                     ) === !1)
                       return !1;
                     s++;
                   }
-                  w++;
+                  v++;
                 }
-                v++;
+                w++;
               }
               break;
             case "GeometryCollection":
@@ -127,15 +127,15 @@ function Ot(o, t, e) {
     }
 }
 function st(o, t) {
-  var e, n, r, i, u, l, c, f, a, s, h = 0, g = o.type === "FeatureCollection", y = o.type === "Feature", p = g ? o.features.length : 1;
+  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 = g ? o.features[e].geometry : y ? o.geometry : o, f = g ? o.features[e].properties : y ? o.properties : {}, a = g ? o.features[e].bbox : y ? o.bbox : void 0, s = g ? o.features[e].id : y ? o.id : void 0, c = l ? l.type === "GeometryCollection" : !1, u = c ? l.geometries.length : 1, r = 0; r < u; r++) {
-      if (i = c ? l.geometries[r] : l, i === null) {
+    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) {
         if (t(
           null,
           h,
-          f,
-          a,
+          c,
+          g,
           s
         ) === !1)
           return !1;
@@ -151,8 +151,8 @@ function st(o, t) {
           if (t(
             i,
             h,
-            f,
-            a,
+            c,
+            g,
             s
           ) === !1)
             return !1;
@@ -163,8 +163,8 @@ function st(o, t) {
             if (t(
               i.geometries[n],
               h,
-              f,
-              a,
+              c,
+              g,
               s
             ) === !1)
               return !1;
@@ -191,24 +191,24 @@ function Dt(o, t) {
           0
         ) === !1 ? !1 : void 0;
     }
-    var c;
+    var f;
     switch (l) {
       case "MultiPoint":
-        c = "Point";
+        f = "Point";
         break;
       case "MultiLineString":
-        c = "LineString";
+        f = "LineString";
         break;
       case "MultiPolygon":
-        c = "Polygon";
+        f = "Polygon";
         break;
     }
-    for (var f = 0; f < e.coordinates.length; f++) {
-      var a = e.coordinates[f], s = {
-        type: c,
-        coordinates: a
+    for (var c = 0; c < e.coordinates.length; c++) {
+      var g = e.coordinates[c], s = {
+        type: f,
+        coordinates: g
       };
-      if (t(D(s, r), n, f) === !1)
+      if (t(D(s, r), n, c) === !1)
         return !1;
     }
   });
@@ -252,56 +252,56 @@ function Wt(o, t) {
   return u = { next: l(0), throw: l(1), return: l(2) }, typeof Symbol == "function" && (u[Symbol.iterator] = function() {
     return this;
   }), u;
-  function l(f) {
-    return function(a) {
-      return c([f, a]);
+  function l(c) {
+    return function(g) {
+      return f([c, g]);
     };
   }
-  function c(f) {
+  function f(c) {
     if (n) throw new TypeError("Generator is already executing.");
     for (; e; ) try {
-      if (n = 1, r && (i = f[0] & 2 ? r.return : f[0] ? r.throw || ((i = r.return) && i.call(r), 0) : r.next) && !(i = i.call(r, f[1])).done) return i;
-      switch (r = 0, i && (f = [f[0] & 2, i.value]), f[0]) {
+      if (n = 1, r && (i = c[0] & 2 ? r.return : c[0] ? r.throw || ((i = r.return) && i.call(r), 0) : r.next) && !(i = i.call(r, c[1])).done) return i;
+      switch (r = 0, i && (c = [c[0] & 2, i.value]), c[0]) {
         case 0:
         case 1:
-          i = f;
+          i = c;
           break;
         case 4:
-          return e.label++, { value: f[1], done: !1 };
+          return e.label++, { value: c[1], done: !1 };
         case 5:
-          e.label++, r = f[1], f = [0];
+          e.label++, r = c[1], c = [0];
           continue;
         case 7:
-          f = e.ops.pop(), e.trys.pop();
+          c = e.ops.pop(), e.trys.pop();
           continue;
         default:
-          if (i = e.trys, !(i = i.length > 0 && i[i.length - 1]) && (f[0] === 6 || f[0] === 2)) {
+          if (i = e.trys, !(i = i.length > 0 && i[i.length - 1]) && (c[0] === 6 || c[0] === 2)) {
             e = 0;
             continue;
           }
-          if (f[0] === 3 && (!i || f[1] > i[0] && f[1] < i[3])) {
-            e.label = f[1];
+          if (c[0] === 3 && (!i || c[1] > i[0] && c[1] < i[3])) {
+            e.label = c[1];
             break;
           }
-          if (f[0] === 6 && e.label < i[1]) {
-            e.label = i[1], i = f;
+          if (c[0] === 6 && e.label < i[1]) {
+            e.label = i[1], i = c;
             break;
           }
           if (i && e.label < i[2]) {
-            e.label = i[2], e.ops.push(f);
+            e.label = i[2], e.ops.push(c);
             break;
           }
           i[2] && e.ops.pop(), e.trys.pop();
           continue;
       }
-      f = t.call(o, e);
-    } catch (a) {
-      f = [6, a], r = 0;
+      c = t.call(o, e);
+    } catch (g) {
+      c = [6, g], r = 0;
     } finally {
       n = i = 0;
     }
-    if (f[0] & 5) throw f[1];
-    return { value: f[0] ? f[1] : void 0, done: !0 };
+    if (c[0] & 5) throw c[1];
+    return { value: c[0] ? c[1] : void 0, done: !0 };
   }
 }
 var $ = (
@@ -423,11 +423,11 @@ 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, c; i.length !== 0 || l; )
+      for (var i = [], u = this._comparator, l = this._root, f; i.length !== 0 || l; )
         if (l)
           i.push(l), l = l.left;
         else {
-          if (l = i.pop(), c = u(l.key, e), c > 0)
+          if (l = i.pop(), f = u(l.key, e), f > 0)
             break;
           if (u(l.key, t) >= 0 && n.call(r, l))
             return this;
@@ -569,8 +569,8 @@ 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], c = new $(u, l);
-    return c.left = et(o, t, e, i), c.right = et(o, t, i + 1, n), c;
+    var i = e + Math.floor(r / 2), u = o[i], l = t[i], f = new $(u, l);
+    return f.left = et(o, t, e, i), f.right = et(o, t, i + 1, n), f;
   }
   return null;
 }
@@ -608,25 +608,25 @@ function rt(o, t, e, n, r) {
       while (r(o[l], i) > 0);
       if (u >= l)
         break;
-      var c = o[u];
-      o[u] = o[l], o[l] = c, c = t[u], t[u] = t[l], t[l] = c;
+      var f = o[u];
+      o[u] = o[l], o[l] = f, f = t[u], t[u] = t[l], t[l] = f;
     }
     rt(o, t, e, l, r), rt(o, t, l + 1, n, r);
   }
 }
 const F = 11102230246251565e-32, _ = 134217729, ee = (3 + 8 * F) * F;
 function K(o, t, e, n, r) {
-  let i, u, l, c, f = t[0], a = n[0], s = 0, h = 0;
-  a > f == a > -f ? (i = f, f = t[++s]) : (i = a, a = n[++h]);
-  let g = 0;
+  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 a = 0;
   if (s < o && h < e)
-    for (a > f == a > -f ? (u = f + i, l = i - (u - f), f = t[++s]) : (u = a + i, l = i - (u - a), a = n[++h]), i = u, l !== 0 && (r[g++] = l); s < o && h < e; )
-      a > f == a > -f ? (u = i + f, c = u - i, l = i - (u - c) + (f - c), f = t[++s]) : (u = i + a, c = u - i, l = i - (u - c) + (a - c), a = n[++h]), i = u, l !== 0 && (r[g++] = l);
+    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 + f, c = u - i, l = i - (u - c) + (f - c), f = t[++s], i = u, l !== 0 && (r[g++] = l);
+    u = i + c, f = u - i, l = i - (u - f) + (c - f), c = t[++s], i = u, l !== 0 && (r[a++] = l);
   for (; h < e; )
-    u = i + a, c = u - i, l = i - (u - c) + (a - c), a = n[++h], i = u, l !== 0 && (r[g++] = l);
-  return (i !== 0 || g === 0) && (r[g++] = i), g;
+    u = i + g, f = u - i, l = i - (u - f) + (g - f), g = n[++h], i = u, l !== 0 && (r[a++] = l);
+  return (i !== 0 || a === 0) && (r[a++] = i), a;
 }
 function ne(o, t) {
   let e = t[0];
@@ -638,22 +638,22 @@ 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, c, f, a, s, h, g, y, p, d, x, m, v, w, E, b, M, S;
+  let l, f, c, g, s, h, a, d, p, y, x, m, w, v, E, b, M, S;
   const L = o - r, I = e - r, k = t - i, C = n - i;
-  w = L * C, h = _ * L, g = h - (h - L), y = L - g, h = _ * C, p = h - (h - C), d = C - p, E = y * d - (w - g * p - y * p - g * d), b = k * I, h = _ * k, g = h - (h - k), y = k - g, h = _ * I, p = h - (h - I), d = I - p, M = y * d - (b - g * p - y * p - g * d), x = E - M, s = E - x, T[0] = E - (x + s) + (s - M), m = w + x, s = m - w, v = w - (m - s) + (x - s), x = v - b, s = v - x, T[1] = v - (x + s) + (s - b), S = m + x, s = S - m, T[2] = m - (S - s) + (x - s), T[3] = S;
+  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;
   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, f = e - (I + s) + (s - r), s = t - k, c = t - (k + s) + (s - i), s = n - C, a = n - (C + s) + (s - i), l === 0 && c === 0 && f === 0 && a === 0) || (q = oe * u + ee * Math.abs(O), O += L * a + C * l - (k * f + I * c), O >= q || -O >= q)) return O;
-  w = l * C, h = _ * l, g = h - (h - l), y = l - g, h = _ * C, p = h - (h - C), d = C - p, E = y * d - (w - g * p - y * p - g * d), b = c * I, h = _ * c, g = h - (h - c), y = c - g, h = _ * I, p = h - (h - I), d = I - p, M = y * d - (b - g * p - y * p - g * d), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), m = w + x, s = m - w, v = w - (m - s) + (x - s), x = v - b, s = v - x, P[1] = v - (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 || (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;
   const Gt = K(4, T, 4, P, dt);
-  w = L * a, h = _ * L, g = h - (h - L), y = L - g, h = _ * a, p = h - (h - a), d = a - p, E = y * d - (w - g * p - y * p - g * d), b = k * f, h = _ * k, g = h - (h - k), y = k - g, h = _ * f, p = h - (h - f), d = f - p, M = y * d - (b - g * p - y * p - g * d), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), m = w + x, s = m - w, v = w - (m - s) + (x - s), x = v - b, s = v - x, P[1] = v - (x + s) + (s - b), S = m + x, s = S - m, P[2] = m - (S - s) + (x - s), P[3] = S;
+  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;
   const Bt = K(Gt, dt, 4, P, vt);
-  w = l * a, h = _ * l, g = h - (h - l), y = l - g, h = _ * a, p = h - (h - a), d = a - p, E = y * d - (w - g * p - y * p - g * d), b = c * f, h = _ * c, g = h - (h - c), y = c - g, h = _ * f, p = h - (h - f), d = f - p, M = y * d - (b - g * p - y * p - g * d), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), m = w + x, s = m - w, v = w - (m - s) + (x - s), x = v - b, s = v - x, P[1] = v - (x + s) + (s - b), S = m + x, s = S - m, P[2] = m - (S - s) + (x - s), P[3] = S;
+  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;
   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), c = u - l, f = Math.abs(u + l);
-  return Math.abs(c) >= re * f ? c : -se(o, t, e, n, r, i, f);
+  const u = (t - i) * (e - r), l = (o - r) * (n - i), f = u - l, c = Math.abs(u + l);
+  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) => {
   if (t.ur.x < o.ll.x || o.ur.x < t.ll.x || t.ur.y < o.ll.y || o.ur.y < t.ll.y) return null;
@@ -747,10 +747,10 @@ 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, c = o.x + l * t.x, f = e.x + u * n.x, a = o.y + l * t.y, s = e.y + u * n.y, h = (c + f) / 2, g = (a + s) / 2;
+  }, 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;
   return {
     x: h,
-    y: g
+    y: a
   };
 };
 class R {
@@ -822,10 +822,10 @@ class R {
         sine: u,
         cosine: l
       } = e.get(r), {
-        sine: c,
-        cosine: f
+        sine: f,
+        cosine: c
       } = e.get(i);
-      return u >= 0 && c >= 0 ? l < f ? 1 : l > f ? -1 : 0 : u < 0 && c < 0 ? l < f ? -1 : l > f ? 1 : 0 : c < u ? -1 : c > u ? 1 : 0;
+      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;
     };
   }
 }
@@ -848,10 +848,10 @@ 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, c = e.leftSE.point.y, f = t.rightSE.point.y, a = e.rightSE.point.y;
+    const l = t.leftSE.point.y, f = e.leftSE.point.y, c = t.rightSE.point.y, g = e.rightSE.point.y;
     if (n < r) {
-      if (c < l && c < f) return 1;
-      if (c > l && c > f) return -1;
+      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;
@@ -859,15 +859,15 @@ class z {
       return h !== 0 ? h : -1;
     }
     if (n > r) {
-      if (l < c && l < a) return -1;
-      if (l > c && l > a) return 1;
+      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;
       const h = t.comparePoint(e.rightSE.point);
       return h < 0 ? 1 : h > 0 ? -1 : 1;
     }
-    if (l < c) return -1;
-    if (l > c) return 1;
+    if (l < f) return -1;
+    if (l > f) return 1;
     if (i < u) {
       const s = e.comparePoint(t.rightSE.point);
       if (s !== 0) return s;
@@ -878,11 +878,11 @@ class z {
       if (s > 0) return -1;
     }
     if (i !== u) {
-      const s = f - l, h = i - n, g = a - c, y = u - r;
-      if (s > h && g < y) return 1;
-      if (s < h && g > y) return -1;
+      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;
     }
-    return i > u ? 1 : i < u || f < a ? -1 : f > a ? 1 : t.id < e.id ? -1 : t.id > e.id ? 1 : 0;
+    return i > u ? 1 : i < u || c < g ? -1 : c > 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 */
@@ -897,8 +897,8 @@ class z {
     else if (l > 0)
       r = e, i = t, u = -1;
     else throw new Error(`Tried to create degenerate segment at [${t.x}, ${t.y}]`);
-    const c = new R(r, !0), f = new R(i, !1);
-    return new z(c, f, [n], [u]);
+    const f = new R(r, !0), c = new R(i, !1);
+    return new z(f, c, [n], [u]);
   }
   /* When a segment is split, the rightSE is replaced with a new sweep event */
   replaceRightSE(t) {
@@ -947,8 +947,8 @@ 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, c = e.y + l * r.y;
-    return t.y === c ? 0 : t.y < c ? -1 : 1;
+    const l = (t.x - e.x) / r.x, f = e.y + l * r.y;
+    return t.y === f ? 0 : t.y < f ? -1 : 1;
   }
   /**
    * Given another segment, returns the first non-trivial intersection
@@ -968,18 +968,18 @@ 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, c = t.rightSE.point, f = Q(e, l) && this.comparePoint(l) === 0, a = Q(n, i) && t.comparePoint(i) === 0, s = Q(e, c) && this.comparePoint(c) === 0, h = Q(n, u) && t.comparePoint(u) === 0;
-    if (a && f)
-      return h && !s ? u : !h && s ? c : null;
-    if (a)
-      return s && i.x === c.x && i.y === c.y ? null : i;
-    if (f)
+    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;
+    if (g && c)
+      return h && !s ? u : !h && s ? f : null;
+    if (g)
+      return s && 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;
     if (h) return u;
-    if (s) return c;
-    const g = ae(i, this.vector(), l, t.vector());
-    return g === null || !Q(r, g) ? null : U.round(g.x, g.y);
+    if (s) return f;
+    const a = ae(i, this.vector(), l, t.vector());
+    return a === null || !Q(r, a) ? null : U.round(a.x, a.y);
   }
   /**
    * Split the given segment into multiple segments on the given points.
@@ -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], c = n.windings[i], f = e.rings.indexOf(l);
-        f === -1 ? (e.rings.push(l), e.windings.push(c)) : e.windings[f] += c;
+        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;
       }
       n.rings = null, n.windings = null, n.consumedBy = e, n.leftSE.consumedBy = e.leftSE, n.rightSE.consumedBy = e.rightSE;
     }
@@ -1055,25 +1055,25 @@ class z {
       multiPolys: []
     };
     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 f = this.rings[l], a = this.windings[l], s = e.indexOf(f);
-      s === -1 ? (e.push(f), n.push(a)) : n[s] += a;
+    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;
     }
     const i = [], u = [];
-    for (let l = 0, c = e.length; l < c; l++) {
+    for (let l = 0, f = e.length; l < f; l++) {
       if (n[l] === 0) continue;
-      const f = e[l], a = f.poly;
-      if (u.indexOf(a) === -1)
-        if (f.isExterior) i.push(a);
+      const c = e[l], g = c.poly;
+      if (u.indexOf(g) === -1)
+        if (c.isExterior) i.push(g);
         else {
-          u.indexOf(a) === -1 && u.push(a);
-          const s = i.indexOf(f.poly);
+          u.indexOf(g) === -1 && u.push(g);
+          const s = i.indexOf(c.poly);
           s !== -1 && i.splice(s, 1);
         }
     }
-    for (let l = 0, c = i.length; l < c; l++) {
-      const f = i[l].multiPoly;
-      r.indexOf(f) === -1 && r.push(f);
+    for (let l = 0, f = i.length; l < f; l++) {
+      const c = i[l].multiPoly;
+      r.indexOf(c) === -1 && r.push(c);
     }
     return this._afterState;
   }
@@ -1130,8 +1130,8 @@ class Pt {
     for (let u = 1, l = t.length; u < l; u++) {
       if (typeof t[u][0] != "number" || typeof t[u][1] != "number")
         throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
-      let c = U.round(t[u][0], t[u][1]);
-      c.x === i.x && c.y === i.y || (this.segments.push(z.fromRing(i, c, this)), c.x < this.bbox.ll.x && (this.bbox.ll.x = c.x), c.y < this.bbox.ll.y && (this.bbox.ll.y = c.y), c.x > this.bbox.ur.x && (this.bbox.ur.x = c.x), c.y > this.bbox.ur.y && (this.bbox.ur.y = c.y), i = c);
+      let f = U.round(t[u][0], t[u][1]);
+      f.x === i.x && f.y === i.y || (this.segments.push(z.fromRing(i, f, this)), f.x < this.bbox.ll.x && (this.bbox.ll.x = f.x), f.y < this.bbox.ll.y && (this.bbox.ll.y = f.y), f.x > this.bbox.ur.x && (this.bbox.ur.x = f.x), f.y > this.bbox.ur.y && (this.bbox.ur.y = f.y), i = f);
     }
     (r.x !== i.x || r.y !== i.y) && this.segments.push(z.fromRing(i, r, this));
   }
@@ -1216,39 +1216,39 @@ 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, c = i.rightSE;
-      const f = [l], a = l.point, s = [];
-      for (; u = l, l = c, f.push(l), l.point !== a; )
+      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; )
         for (; ; ) {
           const h = l.getAvailableLinkedEvents();
           if (h.length === 0) {
-            const p = f[0].point, d = f[f.length - 1].point;
-            throw new Error(`Unable to complete output ring starting at [${p.x}, ${p.y}]. Last matching segment found ends at [${d.x}, ${d.y}].`);
+            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}].`);
           }
           if (h.length === 1) {
-            c = h[0].otherSE;
+            f = h[0].otherSE;
             break;
           }
-          let g = null;
-          for (let p = 0, d = s.length; p < d; p++)
+          let a = null;
+          for (let p = 0, y = s.length; p < y; p++)
             if (s[p].point === l.point) {
-              g = p;
+              a = p;
               break;
             }
-          if (g !== null) {
-            const p = s.splice(g)[0], d = f.splice(p.index);
-            d.unshift(d[0].otherSE), e.push(new W(d.reverse()));
+          if (a !== null) {
+            const p = s.splice(a)[0], y = c.splice(p.index);
+            y.unshift(y[0].otherSE), e.push(new W(y.reverse()));
             continue;
           }
           s.push({
-            index: f.length,
+            index: c.length,
             point: l.point
           });
-          const y = l.getLeftmostComparator(u);
-          c = h.sort(y)[0].otherSE;
+          const d = l.getLeftmostComparator(u);
+          f = h.sort(d)[0].otherSE;
           break;
         }
-      e.push(new W(f));
+      e.push(new W(c));
     }
     return e;
   }
@@ -1261,16 +1261,16 @@ class W {
   getGeom() {
     let t = this.events[0].point;
     const e = [t];
-    for (let f = 1, a = this.events.length - 1; f < a; f++) {
-      const s = this.events[f].point, h = this.events[f + 1].point;
+    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);
     }
     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, c = [];
-    for (let f = u; f != l; f += i) c.push([e[f].x, e[f].y]);
-    return c;
+    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]);
+    return f;
   }
   isExteriorRing() {
     if (this._isExteriorRing === void 0) {
@@ -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, c;
+    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);
-    for (; c === void 0; )
-      u = this.tree.next(u), u === null ? c = null : u.key.consumedBy === void 0 && (c = u.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 f = null;
+      let c = null;
       if (l) {
         const s = l.getIntersection(e);
-        if (s !== null && (e.isAnEndpoint(s) || (f = s), !l.isAnEndpoint(s))) {
+        if (s !== null && (e.isAnEndpoint(s) || (c = 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, d = h.length; a < d; a++)
+            n.push(h[a]);
         }
       }
-      let a = null;
-      if (c) {
-        const s = c.getIntersection(e);
-        if (s !== null && (e.isAnEndpoint(s) || (a = s), !c.isAnEndpoint(s))) {
-          const h = this._splitSafely(c, s);
-          for (let g = 0, y = h.length; g < y; g++)
-            n.push(h[g]);
+      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++)
+            n.push(h[a]);
         }
       }
-      if (f !== null || a !== null) {
+      if (c !== null || g !== null) {
         let s = null;
-        f === null ? s = a : a === null ? s = f : s = R.comparePoints(f, a) <= 0 ? f : a, this.queue.remove(e.rightSE), n.push(e.rightSE);
+        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 g = 0, y = h.length; g < y; g++)
-          n.push(h[g]);
+        for (let a = 0, d = h.length; a < d; a++)
+          n.push(h[a]);
       }
       n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = l);
     } else {
-      if (l && c) {
-        const f = l.getIntersection(c);
-        if (f !== null) {
-          if (!l.isAnEndpoint(f)) {
-            const a = this._splitSafely(l, f);
-            for (let s = 0, h = a.length; s < h; s++)
-              n.push(a[s]);
+      if (l && f) {
+        const c = l.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 (!c.isAnEndpoint(f)) {
-            const a = this._splitSafely(c, f);
-            for (let s = 0, h = a.length; s < h; s++)
-              n.push(a[s]);
+          if (!f.isAnEndpoint(c)) {
+            const g = this._splitSafely(f, c);
+            for (let s = 0, h = g.length; s < h; s++)
+              n.push(g[s]);
           }
         }
       }
@@ -1430,39 +1430,39 @@ class ve {
     }
     if (A.type === "intersection")
       for (let s = 0, h = r.length; s < h; s++) {
-        const g = r[s];
-        for (let y = s + 1, p = r.length; y < p; y++)
-          if (it(g.bbox, r[y].bbox) === null) return [];
+        const a = r[s];
+        for (let d = s + 1, p = r.length; d < p; d++)
+          if (it(a.bbox, r[d].bbox) === null) return [];
       }
     const i = new lt(R.compare);
     for (let s = 0, h = r.length; s < h; s++) {
-      const g = r[s].getSweepEvents();
-      for (let y = 0, p = g.length; y < p; y++)
-        if (i.insert(g[y]), i.size > Lt)
+      const a = r[s].getSweepEvents();
+      for (let d = 0, p = a.length; d < p; d++)
+        if (i.insert(a[d]), 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, c = i.pop();
-    for (; c; ) {
-      const s = c.key;
+    let l = i.size, f = i.pop();
+    for (; f; ) {
+      const s = f.key;
       if (i.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 (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 g = 0, y = h.length; g < y; g++) {
-        const p = h[g];
+      for (let a = 0, d = h.length; a < d; a++) {
+        const p = h[a];
         p.consumedBy === void 0 && i.insert(p);
       }
-      l = i.size, c = i.pop();
+      l = i.size, f = i.pop();
     }
     U.reset();
-    const f = W.factory(u.segments);
-    return new ye(f).getGeom();
+    const c = W.factory(u.segments);
+    return new ye(c).getGeom();
   }
 }
 const A = new ve(), me = function(o) {
@@ -1541,15 +1541,15 @@ function kt(o, t) {
   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 c of l.features) {
-      const f = It(yt(c));
-      if (u && f[0] < -180 + r)
-        for (const a of c.geometry.coordinates)
-          for (const s of a)
+    for (const f of l.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;
-      if (i && f[2] > 180 - r)
-        for (const a of c.geometry.coordinates)
-          for (const s of a)
+      if (i && c[2] > 180 - r)
+        for (const g of f.geometry.coordinates)
+          for (const s of g)
             s[0] -= 360 - r;
     }
   t(
@@ -1591,155 +1591,157 @@ function Ie(o) {
     }) : void 0
   });
 }
-function Te(o, t = {}, e = {}, n = Ie) {
-  let r = -1, i, u, l, c = !1;
-  const f = new Tt({
+function Te(o, t = {}, e = {}, n = Ie, r = !1) {
+  let i = -1, u, l, f, c = !1;
+  const g = new Tt({
     updateWhileAnimating: !0
   });
-  o.addLayer(f);
-  const a = new Ut({});
-  f.setSource(a), f.setStyle(n), o.on("click", (y) => {
-    o.forEachFeatureAtPixel(y.pixel, (p) => {
-      const d = p.getId();
-      if (d)
-        return y.stopPropagation(), u == null || u({ type: "markerClick", id: d }), p;
+  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.on("pointermove", (y) => {
-    const p = o.forEachFeatureAtPixel(y.pixel, (d) => d.getId());
-    i !== p && (i && (u == null || u({
+  }), o.on("pointermove", (p) => {
+    const y = o.forEachFeatureAtPixel(p.pixel, (x) => x.getId());
+    u !== y && (u && (l == null || l({
       type: "markerMouseLeave",
-      id: i
-    })), p && (u == null || u({
+      id: u
+    })), y && (l == null || l({
       type: "markerMouseEnter",
-      id: p
-    })), o.getTargetElement().style.cursor = p ? "pointer" : c ? "crosshair" : "", i = p);
+      id: y
+    })), o.getTargetElement().style.cursor = y ? "pointer" : c ? "crosshair" : "", u = y);
   });
-  function s() {
-    return Qt() ?? o.getView().getProjection();
+  function h() {
+    return qt() ?? o.getView().getProjection();
   }
-  function h(y) {
-    return y.transform(Ct, s());
+  function a(p) {
+    return p.transform(Ct, h());
   }
-  const g = (y) => {
-    u == null || u({
+  const d = (p) => {
+    l == null || l({
       type: "mapClick",
-      coordinates: at(y.coordinate, s())
+      coordinates: at(p.coordinate, h())
     });
   };
   return {
-    setEventHandler(y) {
-      y ? (u = y, o.on("click", g)) : (u = void 0, o.un("click", g));
+    setEventHandler(p) {
+      p ? (l = p, o.on("click", d)) : (l = void 0, o.un("click", d));
     },
-    flyTo(y, p) {
+    flyTo(p, y) {
       o.getView().animate({
-        center: V(y, s()),
-        ...p ? { zoom: p } : {},
+        center: V(p, h()),
+        ...y ? { zoom: y } : {},
         duration: 2e3,
         ...t
       });
     },
-    fitBounds(y, p, d) {
-      o.getView().fit(qt(y, Ct, s()), {
-        padding: [p, p, p, p],
-        ...d ? { maxZoom: d } : {},
+    fitBounds(p, y, x) {
+      o.getView().fit(Qt(p, Ct, h()), {
+        padding: [y, y, y, y],
+        ...x ? { maxZoom: x } : {},
         duration: 2e3,
         ...e
       });
     },
-    indicateReverse(y) {
-      c = y, o.getTargetElement().style.cursor = y ? "crosshair" : "";
+    indicateReverse(p) {
+      c = p, o.getTargetElement().style.cursor = p ? "crosshair" : "";
     },
-    setReverseMarker(y) {
-      l ? y ? l.getGeometry().setCoordinates(
-        V(y, s())
-      ) : (a.removeFeature(l), l.dispose(), l = void 0) : y && (l = new N(
-        new Z(V(y, s()))
-      ), l.setProperties({ isReverse: !0 }), a.addFeature(l));
+    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));
     },
-    setMarkers(y, p) {
-      function d(x) {
-        var m;
-        if (x)
-          for (const v of x.features) {
-            const w = v.geometry.type === "Polygon" ? new ut(v.geometry.coordinates) : v.geometry.type === "MultiPolygon" ? new ft(v.geometry.coordinates) : null;
-            w && a.addFeature(
+    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(
               new N({
-                isMask: !!((m = v.properties) != null && m.isMask),
-                geometry: h(w)
+                isMask: !!((w = v.properties) != null && w.isMask),
+                geometry: a(E)
               })
             );
           }
       }
-      if (a.clear(), l && a.addFeature(l), p) {
-        let x = !1;
-        if (p.geometry.type === "GeometryCollection") {
-          const m = p.geometry.geometries.map(
+      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 (m.length > 0)
-            a.addFeature(
-              new N(h(new $t(m)))
-            ), x = !0;
+          if (w.length > 0)
+            s.addFeature(
+              new N(a(new $t(w)))
+            ), m = !0;
           else
-            for (const v of p.geometry.geometries)
-              v.type === "LineString" ? (a.addFeature(
+            for (const v of y.geometry.geometries)
+              v.type === "LineString" ? (s.addFeature(
                 new N(
-                  h(new ct(v.coordinates))
+                  a(new ct(v.coordinates))
                 )
-              ), x = !0) : v.type === "MultiLineString" && a.addFeature(
+              ), m = !0) : v.type === "MultiLineString" && s.addFeature(
                 new N(
-                  h(new ht(v.coordinates))
+                  a(new ht(v.coordinates))
                 )
-              ), x = !0;
+              ), m = !0;
         }
-        if (!x) {
-          if (p.geometry.type === "Polygon")
-            kt(p, d);
-          else if (p.geometry.type === "MultiPolygon")
-            kt(p, d);
-          else if (p.geometry.type === "LineString") {
-            a.addFeature(
+        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(
               new N(
-                h(new ct(p.geometry.coordinates))
+                a(new ct(y.geometry.coordinates))
               )
             );
             return;
-          } else if (p.geometry.type === "MultiLineString") {
-            a.addFeature(
+          } else if (y.geometry.type === "MultiLineString") {
+            s.addFeature(
               new N(
-                h(new ht(p.geometry.coordinates))
+                a(new ht(y.geometry.coordinates))
               )
             );
             return;
           }
         }
-        a.addFeature(new N(h(new Z(p.center))));
+        if (!r && y.geometry.type !== "Point")
+          return;
+        s.addFeature(new N(a(new Z(y.center))));
       }
-      for (const x of y ?? []) {
-        if (x === p)
+      for (const m of p ?? []) {
+        if (m === y)
           continue;
-        const m = new N(
-          new Z(V(x.center, s()))
+        const w = new N(
+          new Z(V(m.center, h()))
         );
-        m.setId(x.id), m.setProperties({
-          fuzzy: !!x.matching_text,
-          tooltip: x.place_type[0] === "reverse" ? x.place_name : x.place_name.replace(/,.*/, "")
-        }), a.addFeature(m);
+        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);
       }
     },
-    setSelectedMarker(y) {
-      var x, m, v;
-      const p = a.getFeatures(), d = (x = p[0]) != null && x.getProperties().isReverse ? 1 : 0;
-      r > -1 && ((m = p[r + d]) == null || m.setProperties({
+    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({
         isSelected: !1
-      })), y > -1 && ((v = p[y + d]) == null || v.setProperties({
+      })), p > -1 && ((v = y[p + x]) == null || v.setProperties({
         isSelected: !0
-      })), r = y;
+      })), i = p;
     },
     getCenterAndZoom() {
-      const y = o.getView(), p = y.getCenter(), d = y.getZoom();
-      if (!(!p || d === void 0))
-        return [d, ...at(p, s())];
+      const p = o.getView(), y = p.getCenter(), x = p.getZoom();
+      if (!(!y || x === void 0))
+        return [x, ...at(y, h())];
     }
   };
 }