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

package/maplibregl-controller.d.ts

@@ -13,7 +13,7 @@ export declare function createMapLibreGlMapController(map: Map, maplibregl?: Map
     fitBounds(bbox: BBox, padding: number, maxZoom?: number): void;
     indicateReverse(reverse: boolean): void;
     setReverseMarker(coordinates?: Position): void;
-    setMarkers(markedFeatures: Feature[] | undefined, picked: Feature | undefined, showPolygonMarker: boolean): void;
+    setFeatures(markedFeatures: Feature[] | undefined, picked: Feature | undefined, showPolygonMarker: boolean): void;
     setSelectedMarker(index: number): void;
     getCenterAndZoom(): [number, number, number];
 };

package/maplibregl-controller.js

@@ -451,8 +451,8 @@ function ge(i, t, e, n, r, o, f) {
   let l, c, u, g, s, h, a, d, x, p, y, w, v, E, m, b, M, _;
   const R = i - r, I = e - r, C = t - o, k = n - o;
   E = R * k, h = S * R, a = h - (h - R), d = R - a, h = S * k, x = h - (h - k), p = k - x, m = d * p - (E - a * x - d * x - a * p), b = C * I, h = S * C, a = h - (h - C), d = C - a, h = S * I, x = h - (h - I), p = I - x, M = d * p - (b - a * x - d * x - a * p), y = m - M, s = m - y, U[0] = m - (y + s) + (s - M), w = E + y, s = w - E, v = E - (w - s) + (y - s), y = v - b, s = v - y, U[1] = v - (y + s) + (s - b), _ = w + y, s = _ - w, U[2] = w - (_ - s) + (y - s), U[3] = _;
-  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, g = n - (k + s) + (s - o), l === 0 && c === 0 && u === 0 && g === 0) || (Q = ae * f + ue * Math.abs(A), A += R * g + k * l - (C * u + I * c), A >= Q || -A >= Q)) return A;
+  let A = fe(4, U), F = he * f;
+  if (A >= F || -A >= F || (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, g = n - (k + s) + (s - o), l === 0 && c === 0 && u === 0 && g === 0) || (F = ae * f + ue * Math.abs(A), A += R * g + k * l - (C * u + I * c), A >= F || -A >= F)) return A;
   E = l * k, h = S * l, a = h - (h - l), d = l - a, h = S * k, x = h - (h - k), p = k - x, m = d * p - (E - a * x - d * x - a * p), b = c * I, h = S * c, a = h - (h - c), d = c - a, h = S * I, x = h - (h - I), p = I - x, M = d * p - (b - a * x - d * x - a * p), y = m - M, s = m - y, P[0] = m - (y + s) + (s - M), w = E + y, s = w - E, v = E - (w - s) + (y - s), y = v - b, s = v - y, P[1] = v - (y + s) + (s - b), _ = w + y, s = _ - w, P[2] = w - (_ - s) + (y - s), P[3] = _;
   const Jt = st(4, U, 4, P, mt);
   E = R * g, h = S * R, a = h - (h - R), d = R - a, h = S * g, x = h - (h - g), p = g - x, m = d * p - (E - a * x - d * x - a * p), b = C * u, h = S * C, a = h - (h - C), d = C - a, h = S * u, x = h - (h - u), p = u - x, M = d * p - (b - a * x - d * x - a * p), y = m - M, s = m - y, P[0] = m - (y + s) + (s - M), w = E + y, s = w - E, v = E - (w - s) + (y - s), y = v - b, s = v - y, P[1] = v - (y + s) + (s - b), _ = w + y, s = _ - w, P[2] = w - (_ - s) + (y - s), P[3] = _;
@@ -465,7 +465,7 @@ function pe(i, t, e, n, r, o) {
   const f = (t - o) * (e - r), l = (i - r) * (n - o), c = f - l, u = Math.abs(f + l);
   return Math.abs(c) >= ce * u ? c : -ge(i, t, e, n, r, o, u);
 }
-const F = (i, t) => i.ll.x <= t.x && t.x <= i.ur.x && i.ll.y <= t.y && t.y <= i.ur.y, at = (i, t) => {
+const Q = (i, t) => i.ll.x <= t.x && t.x <= i.ur.x && i.ll.y <= t.y && t.y <= i.ur.y, at = (i, t) => {
   if (t.ur.x < i.ll.x || i.ur.x < t.ll.x || t.ur.y < i.ll.y || i.ur.y < t.ll.y) return null;
   const e = i.ll.x < t.ll.x ? t.ll.x : i.ll.x, n = i.ur.x < t.ur.x ? i.ur.x : t.ur.x, r = i.ll.y < t.ll.y ? t.ll.y : i.ll.y, o = i.ur.y < t.ur.y ? i.ur.y : t.ur.y;
   return {
@@ -778,7 +778,7 @@ 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, g = F(n, o) && t.comparePoint(o) === 0, s = F(e, c) && this.comparePoint(c) === 0, h = F(n, f) && t.comparePoint(f) === 0;
+    const o = this.leftSE.point, f = this.rightSE.point, l = t.leftSE.point, c = t.rightSE.point, u = Q(e, l) && this.comparePoint(l) === 0, g = Q(n, o) && t.comparePoint(o) === 0, s = Q(e, c) && this.comparePoint(c) === 0, h = Q(n, f) && t.comparePoint(f) === 0;
     if (g && u)
       return h && !s ? f : !h && s ? c : null;
     if (g)
@@ -789,7 +789,7 @@ class z {
     if (h) return f;
     if (s) return c;
     const a = Ee(o, this.vector(), l, t.vector());
-    return a === null || !F(r, a) ? null : Z.round(a.x, a.y);
+    return a === null || !Q(r, a) ? null : Z.round(a.x, a.y);
   }
   /**
    * Split the given segment into multiple segments on the given points.
@@ -1292,13 +1292,13 @@ const $ = new Pe(), Me = function(i) {
     e[n - 1] = arguments[n];
   return $.run("difference", i, e);
 };
-var Qt = {
+var Ft = {
   union: Me,
   intersection: Le,
   xor: Re,
   difference: Ie
 };
-function Ft(i, t, e) {
+function Qt(i, t, e) {
   if (i !== null)
     for (var n, r, o, f, l, c, u, g = 0, s = 0, h, a = i.type, d = a === "FeatureCollection", x = a === "Feature", p = d ? i.features.length : 1, y = 0; y < p; y++) {
       u = d ? i.features[y].geometry : x ? i.geometry : i, h = u ? u.type === "GeometryCollection" : !1, l = h ? u.geometries.length : 1;
@@ -1375,7 +1375,7 @@ function Ft(i, t, e) {
               break;
             case "GeometryCollection":
               for (n = 0; n < f.geometries.length; n++)
-                if (Ft(f.geometries[n], t) === !1)
+                if (Qt(f.geometries[n], t) === !1)
                   return !1;
               break;
             default:
@@ -1478,7 +1478,7 @@ function ke(i, t = {}) {
     e.push(r.coordinates);
   }), e.length < 2)
     throw new Error("Must have at least 2 geometries");
-  const n = Qt.union(e[0], ...e.slice(1));
+  const n = Ft.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;
@@ -1585,11 +1585,11 @@ function Ye(i, t, e) {
     i.$$.on_destroy ? i.$$.on_destroy.push(...o) : it(o), i.$$.on_mount = [];
   }), r.forEach(pt);
 }
-function Qe(i, t) {
+function Fe(i, t) {
   const e = i.$$;
   e.fragment !== null && (Ue(e.after_update), it(e.on_destroy), e.fragment && e.fragment.d(t), e.on_destroy = e.fragment = null, e.ctx = []);
 }
-function Fe(i, t) {
+function Qe(i, t) {
   i.$$.dirty[0] === -1 && (j.push(i), ze(), i.$$.dirty.fill(0)), i.$$.dirty[t / 31 | 0] |= 1 << t % 31;
 }
 function De(i, t, e, n, r, o, f = null, l = [-1]) {
@@ -1620,7 +1620,7 @@ function De(i, t, e, n, r, o, f = null, l = [-1]) {
   let g = !1;
   if (u.ctx = e ? e(i, t.props || {}, (s, h, ...a) => {
     const d = a.length ? a[0] : h;
-    return u.ctx && r(u.ctx[s], u.ctx[s] = d) && (!u.skip_bound && u.bound[s] && u.bound[s](d), g && Fe(i, s)), h;
+    return u.ctx && r(u.ctx[s], u.ctx[s] = d) && (!u.skip_bound && u.bound[s] && u.bound[s](d), g && Qe(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);
@@ -1652,7 +1652,7 @@ class Xe {
   }
   /** @returns {void} */
   $destroy() {
-    Qe(this, 1), this.$destroy = W;
+    Fe(this, 1), this.$destroy = W;
   }
   /**
    * @template {Extract<keyof Events, string>} K
@@ -1738,7 +1738,7 @@ function Ke(i, t = {}) {
   if (i.bbox != null && t.recompute !== !0)
     return i.bbox;
   const e = [1 / 0, 1 / 0, -1 / 0, -1 / 0];
-  return Ft(i, (n) => {
+  return Qt(i, (n) => {
     e[0] > n[0] && (e[0] = n[0]), e[1] > n[1] && (e[1] = n[1]), e[2] < n[0] && (e[2] = n[0]), e[3] < n[1] && (e[3] = n[1]);
   }), e;
 }
@@ -1749,7 +1749,7 @@ function He(i) {
     t.push(r.coordinates);
   }), t.length < 2)
     throw new Error("Must have at least two features");
-  const e = i.features[0].properties || {}, n = Qt.difference(t[0], ...t.slice(1));
+  const e = i.features[0].properties || {}, n = Ft.difference(t[0], ...t.slice(1));
   return n.length === 0 ? null : n.length === 1 ? yt(n[0], e) : jt(n, e);
 }
 var tn = He;
@@ -1903,7 +1903,7 @@ function on(i, t, e = !0, n = !0, r = {}, o = {}, f = Gt) {
     setReverseMarker(p) {
       !t || !e || (g ? p ? g.setLngLat(p) : (g.remove(), g = void 0) : p && (e instanceof Function ? g = e(i) ?? void 0 : (g = (typeof e == "object" ? new t.Marker(e) : x()).setLngLat(p).addTo(i), g.getElement().classList.add("marker-reverse"))));
     },
-    setMarkers(p, y, w) {
+    setFeatures(p, y, w) {
       for (const v of c)
         v.remove();
       if (c.length = 0, a(void 0), !!t) {