@local-logic/maps 0.0.12 → 0.0.13

package/dist/index-Bd7meO8V.js

@@ -1,783 +0,0 @@
-import { jsx as T } from "react/jsx-runtime";
-import * as D from "react";
-import at, { useContext as ct, useState as U, useMemo as P, lazy as A, useRef as H, useEffect as ut } from "react";
-const et = at.createContext({}), Z = () => ct(et), R = {
-  zoom: 14,
-  pitch: 0,
-  bearing: 0,
-  cooperativeGestures: !1
-}, J = {
-  maptiler: "600d69cb-288d-445e-9839-3dfe4d76b31a",
-  mapbox: "locallogic/cmb9nz9kb011501ru8drq8fqf",
-  google: "a7ff20eb973126bb"
-}, K = 13, ht = 22, lt = 30, pt = 60, ft = "w-full h-full relative overflow-hidden", dt = A(() => import("./index-aDlW4ps0.js")), gt = A(() => import("./index-CzBPD5Sw.js")), mt = A(() => import("./index-LKvWHhi6.js")), yt = A(() => import("./index-qqbvBkdn.js")), wt = ({ children: r }) => {
-  const {
-    mapProvider: t,
-    center: e,
-    zoom: n = R.zoom,
-    pitch: i = R.pitch,
-    bearing: o = R.bearing,
-    cooperativeGestures: a = R.cooperativeGestures,
-    zoomPosition: c
-  } = Z(), [s] = U(n), h = P(() => {
-    switch (t == null ? void 0 : t.name) {
-      case "maptiler":
-        return dt;
-      case "google":
-        return gt;
-      case "mapbox":
-        return mt;
-      default:
-        return yt;
-    }
-  }, [t]);
-  return /* @__PURE__ */ T(
-    "div",
-    {
-      className: ft,
-      "data-testid": "base-map",
-      "data-map-provider-name": t == null ? void 0 : t.name,
-      "data-map-provider-theme": (t == null ? void 0 : t.theme) || J[t == null ? void 0 : t.name] || J.maptiler,
-      "data-initial-zoom": s,
-      "data-pitch": i,
-      "data-bearing": o,
-      "data-cooperative-gestures": a,
-      "data-zoom-position": c,
-      "data-center-latitude": e.latitude,
-      "data-center-longitude": e.longitude,
-      children: /* @__PURE__ */ T(h, { children: r })
-    }
-  );
-}, Mt = A(() => import("./index-Do_dW76Q.js")), _t = A(() => import("./index-BCa658u4.js")), At = A(() => import("./index-CNxLnZ8O.js"));
-function Et(r) {
-  const { mapProvider: t } = Z(), e = P(() => {
-    switch (t == null ? void 0 : t.name) {
-      case "maptiler":
-        return Mt;
-      case "google":
-        return _t;
-      case "mapbox":
-        return At;
-      default:
-        return null;
-    }
-  }, [t]);
-  return e ? /* @__PURE__ */ T(e, { ...r }) : null;
-}
-function nt(r, t, e = {}) {
-  const n = { type: "Feature" };
-  return (e.id === 0 || e.id) && (n.id = e.id), e.bbox && (n.bbox = e.bbox), n.properties = t || {}, n.geometry = r, n;
-}
-function bt(r, t, e = {}) {
-  if (!r)
-    throw new Error("coordinates is required");
-  if (!Array.isArray(r))
-    throw new Error("coordinates must be an Array");
-  if (r.length < 2)
-    throw new Error("coordinates must be at least 2 numbers long");
-  if (!W(r[0]) || !W(r[1]))
-    throw new Error("coordinates must contain numbers");
-  return nt({
-    type: "Point",
-    coordinates: r
-  }, t, e);
-}
-function St(r, t, e = {}) {
-  return nt({
-    type: "MultiPoint",
-    coordinates: r
-  }, t, e);
-}
-function W(r) {
-  return !isNaN(r) && r !== null && !Array.isArray(r);
-}
-function rt(r, t, e) {
-  if (r !== null)
-    for (var n, i, o, a, c, s, h, l = 0, u = 0, p, d = r.type, g = d === "FeatureCollection", M = d === "Feature", w = g ? r.features.length : 1, y = 0; y < w; y++) {
-      h = g ? r.features[y].geometry : M ? r.geometry : r, p = h ? h.type === "GeometryCollection" : !1, c = p ? h.geometries.length : 1;
-      for (var f = 0; f < c; f++) {
-        var m = 0, _ = 0;
-        if (a = p ? h.geometries[f] : h, a !== null) {
-          s = a.coordinates;
-          var E = a.type;
-          switch (l = 0, E) {
-            case null:
-              break;
-            case "Point":
-              if (t(
-                s,
-                u,
-                y,
-                m,
-                _
-              ) === !1)
-                return !1;
-              u++, m++;
-              break;
-            case "LineString":
-            case "MultiPoint":
-              for (n = 0; n < s.length; n++) {
-                if (t(
-                  s[n],
-                  u,
-                  y,
-                  m,
-                  _
-                ) === !1)
-                  return !1;
-                u++, E === "MultiPoint" && m++;
-              }
-              E === "LineString" && m++;
-              break;
-            case "Polygon":
-            case "MultiLineString":
-              for (n = 0; n < s.length; n++) {
-                for (i = 0; i < s[n].length - l; i++) {
-                  if (t(
-                    s[n][i],
-                    u,
-                    y,
-                    m,
-                    _
-                  ) === !1)
-                    return !1;
-                  u++;
-                }
-                E === "MultiLineString" && m++, E === "Polygon" && _++;
-              }
-              E === "Polygon" && m++;
-              break;
-            case "MultiPolygon":
-              for (n = 0; n < s.length; n++) {
-                for (_ = 0, i = 0; i < s[n].length; i++) {
-                  for (o = 0; o < s[n][i].length - l; o++) {
-                    if (t(
-                      s[n][i][o],
-                      u,
-                      y,
-                      m,
-                      _
-                    ) === !1)
-                      return !1;
-                    u++;
-                  }
-                  _++;
-                }
-                m++;
-              }
-              break;
-            case "GeometryCollection":
-              for (n = 0; n < a.geometries.length; n++)
-                if (rt(a.geometries[n], t) === !1)
-                  return !1;
-              break;
-            default:
-              throw new Error("Unknown Geometry Type");
-          }
-        }
-      }
-    }
-}
-function Ot(r, t = {}) {
-  if (r.bbox != null && t.recompute !== !0)
-    return r.bbox;
-  const e = [1 / 0, 1 / 0, -1 / 0, -1 / 0];
-  return rt(r, (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;
-}
-const Y = [
-  Int8Array,
-  Uint8Array,
-  Uint8ClampedArray,
-  Int16Array,
-  Uint16Array,
-  Int32Array,
-  Uint32Array,
-  Float32Array,
-  Float64Array
-], G = 1, L = 8;
-class I {
-  /**
-   * Creates an index from raw `ArrayBuffer` data.
-   * @param {ArrayBuffer} data
-   */
-  static from(t) {
-    if (!(t instanceof ArrayBuffer))
-      throw new Error("Data must be an instance of ArrayBuffer.");
-    const [e, n] = new Uint8Array(t, 0, 2);
-    if (e !== 219)
-      throw new Error("Data does not appear to be in a KDBush format.");
-    const i = n >> 4;
-    if (i !== G)
-      throw new Error(`Got v${i} data when expected v${G}.`);
-    const o = Y[n & 15];
-    if (!o)
-      throw new Error("Unrecognized array type.");
-    const [a] = new Uint16Array(t, 2, 1), [c] = new Uint32Array(t, 4, 1);
-    return new I(c, a, o, t);
-  }
-  /**
-   * Creates an index that will hold a given number of items.
-   * @param {number} numItems
-   * @param {number} [nodeSize=64] Size of the KD-tree node (64 by default).
-   * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).
-   * @param {ArrayBuffer} [data] (For internal use only)
-   */
-  constructor(t, e = 64, n = Float64Array, i) {
-    if (isNaN(t) || t < 0) throw new Error(`Unpexpected numItems value: ${t}.`);
-    this.numItems = +t, this.nodeSize = Math.min(Math.max(+e, 2), 65535), this.ArrayType = n, this.IndexArrayType = t < 65536 ? Uint16Array : Uint32Array;
-    const o = Y.indexOf(this.ArrayType), a = t * 2 * this.ArrayType.BYTES_PER_ELEMENT, c = t * this.IndexArrayType.BYTES_PER_ELEMENT, s = (8 - c % 8) % 8;
-    if (o < 0)
-      throw new Error(`Unexpected typed array class: ${n}.`);
-    i && i instanceof ArrayBuffer ? (this.data = i, this.ids = new this.IndexArrayType(this.data, L, t), this.coords = new this.ArrayType(this.data, L + c + s, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(L + a + c + s), this.ids = new this.IndexArrayType(this.data, L, t), this.coords = new this.ArrayType(this.data, L + c + s, t * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (G << 4) + o]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = t);
-  }
-  /**
-   * Add a point to the index.
-   * @param {number} x
-   * @param {number} y
-   * @returns {number} An incremental index associated with the added item (starting from `0`).
-   */
-  add(t, e) {
-    const n = this._pos >> 1;
-    return this.ids[n] = n, this.coords[this._pos++] = t, this.coords[this._pos++] = e, n;
-  }
-  /**
-   * Perform indexing of the added points.
-   */
-  finish() {
-    const t = this._pos >> 1;
-    if (t !== this.numItems)
-      throw new Error(`Added ${t} items when expected ${this.numItems}.`);
-    return j(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0), this._finished = !0, this;
-  }
-  /**
-   * Search the index for items within a given bounding box.
-   * @param {number} minX
-   * @param {number} minY
-   * @param {number} maxX
-   * @param {number} maxY
-   * @returns {number[]} An array of indices correponding to the found items.
-   */
-  range(t, e, n, i) {
-    if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
-    const { ids: o, coords: a, nodeSize: c } = this, s = [0, o.length - 1, 0], h = [];
-    for (; s.length; ) {
-      const l = s.pop() || 0, u = s.pop() || 0, p = s.pop() || 0;
-      if (u - p <= c) {
-        for (let w = p; w <= u; w++) {
-          const y = a[2 * w], f = a[2 * w + 1];
-          y >= t && y <= n && f >= e && f <= i && h.push(o[w]);
-        }
-        continue;
-      }
-      const d = p + u >> 1, g = a[2 * d], M = a[2 * d + 1];
-      g >= t && g <= n && M >= e && M <= i && h.push(o[d]), (l === 0 ? t <= g : e <= M) && (s.push(p), s.push(d - 1), s.push(1 - l)), (l === 0 ? n >= g : i >= M) && (s.push(d + 1), s.push(u), s.push(1 - l));
-    }
-    return h;
-  }
-  /**
-   * Search the index for items within a given radius.
-   * @param {number} qx
-   * @param {number} qy
-   * @param {number} r Query radius.
-   * @returns {number[]} An array of indices correponding to the found items.
-   */
-  within(t, e, n) {
-    if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
-    const { ids: i, coords: o, nodeSize: a } = this, c = [0, i.length - 1, 0], s = [], h = n * n;
-    for (; c.length; ) {
-      const l = c.pop() || 0, u = c.pop() || 0, p = c.pop() || 0;
-      if (u - p <= a) {
-        for (let w = p; w <= u; w++)
-          q(o[2 * w], o[2 * w + 1], t, e) <= h && s.push(i[w]);
-        continue;
-      }
-      const d = p + u >> 1, g = o[2 * d], M = o[2 * d + 1];
-      q(g, M, t, e) <= h && s.push(i[d]), (l === 0 ? t - n <= g : e - n <= M) && (c.push(p), c.push(d - 1), c.push(1 - l)), (l === 0 ? t + n >= g : e + n >= M) && (c.push(d + 1), c.push(u), c.push(1 - l));
-    }
-    return s;
-  }
-}
-function j(r, t, e, n, i, o) {
-  if (i - n <= e) return;
-  const a = n + i >> 1;
-  st(r, t, a, n, i, o), j(r, t, e, n, a - 1, 1 - o), j(r, t, e, a + 1, i, 1 - o);
-}
-function st(r, t, e, n, i, o) {
-  for (; i > n; ) {
-    if (i - n > 600) {
-      const h = i - n + 1, l = e - n + 1, u = Math.log(h), p = 0.5 * Math.exp(2 * u / 3), d = 0.5 * Math.sqrt(u * p * (h - p) / h) * (l - h / 2 < 0 ? -1 : 1), g = Math.max(n, Math.floor(e - l * p / h + d)), M = Math.min(i, Math.floor(e + (h - l) * p / h + d));
-      st(r, t, e, g, M, o);
-    }
-    const a = t[2 * e + o];
-    let c = n, s = i;
-    for (C(r, t, n, e), t[2 * i + o] > a && C(r, t, n, i); c < s; ) {
-      for (C(r, t, c, s), c++, s--; t[2 * c + o] < a; ) c++;
-      for (; t[2 * s + o] > a; ) s--;
-    }
-    t[2 * n + o] === a ? C(r, t, n, s) : (s++, C(r, t, s, i)), s <= e && (n = s + 1), e <= s && (i = s - 1);
-  }
-}
-function C(r, t, e, n) {
-  N(r, e, n), N(t, 2 * e, 2 * n), N(t, 2 * e + 1, 2 * n + 1);
-}
-function N(r, t, e) {
-  const n = r[t];
-  r[t] = r[e], r[e] = n;
-}
-function q(r, t, e, n) {
-  const i = r - e, o = t - n;
-  return i * i + o * o;
-}
-const xt = {
-  minZoom: 0,
-  // min zoom to generate clusters on
-  maxZoom: 16,
-  // max zoom level to cluster the points on
-  minPoints: 2,
-  // minimum points to form a cluster
-  radius: 40,
-  // cluster radius in pixels
-  extent: 512,
-  // tile extent (radius is calculated relative to it)
-  nodeSize: 64,
-  // size of the KD-tree leaf node, affects performance
-  log: !1,
-  // whether to log timing info
-  // whether to generate numeric ids for input features (in vector tiles)
-  generateId: !1,
-  // a reduce function for calculating custom cluster properties
-  reduce: null,
-  // (accumulated, props) => { accumulated.sum += props.sum; }
-  // properties to use for individual points when running the reducer
-  map: (r) => r
-  // props => ({sum: props.my_value})
-}, Q = Math.fround || /* @__PURE__ */ ((r) => (t) => (r[0] = +t, r[0]))(new Float32Array(1)), x = 2, S = 3, $ = 4, b = 5, it = 6;
-class Pt {
-  constructor(t) {
-    this.options = Object.assign(Object.create(xt), t), this.trees = new Array(this.options.maxZoom + 1), this.stride = this.options.reduce ? 7 : 6, this.clusterProps = [];
-  }
-  load(t) {
-    const { log: e, minZoom: n, maxZoom: i } = this.options;
-    e && console.time("total time");
-    const o = `prepare ${t.length} points`;
-    e && console.time(o), this.points = t;
-    const a = [];
-    for (let s = 0; s < t.length; s++) {
-      const h = t[s];
-      if (!h.geometry) continue;
-      const [l, u] = h.geometry.coordinates, p = Q(z(l)), d = Q(B(u));
-      a.push(
-        p,
-        d,
-        // projected point coordinates
-        1 / 0,
-        // the last zoom the point was processed at
-        s,
-        // index of the source feature in the original input array
-        -1,
-        // parent cluster id
-        1
-        // number of points in a cluster
-      ), this.options.reduce && a.push(0);
-    }
-    let c = this.trees[i + 1] = this._createTree(a);
-    e && console.timeEnd(o);
-    for (let s = i; s >= n; s--) {
-      const h = +Date.now();
-      c = this.trees[s] = this._createTree(this._cluster(c, s)), e && console.log("z%d: %d clusters in %dms", s, c.numItems, +Date.now() - h);
-    }
-    return e && console.timeEnd("total time"), this;
-  }
-  getClusters(t, e) {
-    let n = ((t[0] + 180) % 360 + 360) % 360 - 180;
-    const i = Math.max(-90, Math.min(90, t[1]));
-    let o = t[2] === 180 ? 180 : ((t[2] + 180) % 360 + 360) % 360 - 180;
-    const a = Math.max(-90, Math.min(90, t[3]));
-    if (t[2] - t[0] >= 360)
-      n = -180, o = 180;
-    else if (n > o) {
-      const u = this.getClusters([n, i, 180, a], e), p = this.getClusters([-180, i, o, a], e);
-      return u.concat(p);
-    }
-    const c = this.trees[this._limitZoom(e)], s = c.range(z(n), B(a), z(o), B(i)), h = c.data, l = [];
-    for (const u of s) {
-      const p = this.stride * u;
-      l.push(h[p + b] > 1 ? k(h, p, this.clusterProps) : this.points[h[p + S]]);
-    }
-    return l;
-  }
-  getChildren(t) {
-    const e = this._getOriginId(t), n = this._getOriginZoom(t), i = "No cluster with the specified id.", o = this.trees[n];
-    if (!o) throw new Error(i);
-    const a = o.data;
-    if (e * this.stride >= a.length) throw new Error(i);
-    const c = this.options.radius / (this.options.extent * Math.pow(2, n - 1)), s = a[e * this.stride], h = a[e * this.stride + 1], l = o.within(s, h, c), u = [];
-    for (const p of l) {
-      const d = p * this.stride;
-      a[d + $] === t && u.push(a[d + b] > 1 ? k(a, d, this.clusterProps) : this.points[a[d + S]]);
-    }
-    if (u.length === 0) throw new Error(i);
-    return u;
-  }
-  getLeaves(t, e, n) {
-    e = e || 10, n = n || 0;
-    const i = [];
-    return this._appendLeaves(i, t, e, n, 0), i;
-  }
-  getTile(t, e, n) {
-    const i = this.trees[this._limitZoom(t)], o = Math.pow(2, t), { extent: a, radius: c } = this.options, s = c / a, h = (n - s) / o, l = (n + 1 + s) / o, u = {
-      features: []
-    };
-    return this._addTileFeatures(
-      i.range((e - s) / o, h, (e + 1 + s) / o, l),
-      i.data,
-      e,
-      n,
-      o,
-      u
-    ), e === 0 && this._addTileFeatures(
-      i.range(1 - s / o, h, 1, l),
-      i.data,
-      o,
-      n,
-      o,
-      u
-    ), e === o - 1 && this._addTileFeatures(
-      i.range(0, h, s / o, l),
-      i.data,
-      -1,
-      n,
-      o,
-      u
-    ), u.features.length ? u : null;
-  }
-  getClusterExpansionZoom(t) {
-    let e = this._getOriginZoom(t) - 1;
-    for (; e <= this.options.maxZoom; ) {
-      const n = this.getChildren(t);
-      if (e++, n.length !== 1) break;
-      t = n[0].properties.cluster_id;
-    }
-    return e;
-  }
-  _appendLeaves(t, e, n, i, o) {
-    const a = this.getChildren(e);
-    for (const c of a) {
-      const s = c.properties;
-      if (s && s.cluster ? o + s.point_count <= i ? o += s.point_count : o = this._appendLeaves(t, s.cluster_id, n, i, o) : o < i ? o++ : t.push(c), t.length === n) break;
-    }
-    return o;
-  }
-  _createTree(t) {
-    const e = new I(t.length / this.stride | 0, this.options.nodeSize, Float32Array);
-    for (let n = 0; n < t.length; n += this.stride) e.add(t[n], t[n + 1]);
-    return e.finish(), e.data = t, e;
-  }
-  _addTileFeatures(t, e, n, i, o, a) {
-    for (const c of t) {
-      const s = c * this.stride, h = e[s + b] > 1;
-      let l, u, p;
-      if (h)
-        l = ot(e, s, this.clusterProps), u = e[s], p = e[s + 1];
-      else {
-        const M = this.points[e[s + S]];
-        l = M.properties;
-        const [w, y] = M.geometry.coordinates;
-        u = z(w), p = B(y);
-      }
-      const d = {
-        type: 1,
-        geometry: [[
-          Math.round(this.options.extent * (u * o - n)),
-          Math.round(this.options.extent * (p * o - i))
-        ]],
-        tags: l
-      };
-      let g;
-      h || this.options.generateId ? g = e[s + S] : g = this.points[e[s + S]].id, g !== void 0 && (d.id = g), a.features.push(d);
-    }
-  }
-  _limitZoom(t) {
-    return Math.max(this.options.minZoom, Math.min(Math.floor(+t), this.options.maxZoom + 1));
-  }
-  _cluster(t, e) {
-    const { radius: n, extent: i, reduce: o, minPoints: a } = this.options, c = n / (i * Math.pow(2, e)), s = t.data, h = [], l = this.stride;
-    for (let u = 0; u < s.length; u += l) {
-      if (s[u + x] <= e) continue;
-      s[u + x] = e;
-      const p = s[u], d = s[u + 1], g = t.within(s[u], s[u + 1], c), M = s[u + b];
-      let w = M;
-      for (const y of g) {
-        const f = y * l;
-        s[f + x] > e && (w += s[f + b]);
-      }
-      if (w > M && w >= a) {
-        let y = p * M, f = d * M, m, _ = -1;
-        const E = ((u / l | 0) << 5) + (e + 1) + this.points.length;
-        for (const F of g) {
-          const O = F * l;
-          if (s[O + x] <= e) continue;
-          s[O + x] = e;
-          const V = s[O + b];
-          y += s[O] * V, f += s[O + 1] * V, s[O + $] = E, o && (m || (m = this._map(s, u, !0), _ = this.clusterProps.length, this.clusterProps.push(m)), o(m, this._map(s, O)));
-        }
-        s[u + $] = E, h.push(y / w, f / w, 1 / 0, E, -1, w), o && h.push(_);
-      } else {
-        for (let y = 0; y < l; y++) h.push(s[u + y]);
-        if (w > 1)
-          for (const y of g) {
-            const f = y * l;
-            if (!(s[f + x] <= e)) {
-              s[f + x] = e;
-              for (let m = 0; m < l; m++) h.push(s[f + m]);
-            }
-          }
-      }
-    }
-    return h;
-  }
-  // get index of the point from which the cluster originated
-  _getOriginId(t) {
-    return t - this.points.length >> 5;
-  }
-  // get zoom of the point from which the cluster originated
-  _getOriginZoom(t) {
-    return (t - this.points.length) % 32;
-  }
-  _map(t, e, n) {
-    if (t[e + b] > 1) {
-      const a = this.clusterProps[t[e + it]];
-      return n ? Object.assign({}, a) : a;
-    }
-    const i = this.points[t[e + S]].properties, o = this.options.map(i);
-    return n && o === i ? Object.assign({}, o) : o;
-  }
-}
-function k(r, t, e) {
-  return {
-    type: "Feature",
-    id: r[t + S],
-    properties: ot(r, t, e),
-    geometry: {
-      type: "Point",
-      coordinates: [vt(r[t]), Tt(r[t + 1])]
-    }
-  };
-}
-function ot(r, t, e) {
-  const n = r[t + b], i = n >= 1e4 ? `${Math.round(n / 1e3)}k` : n >= 1e3 ? `${Math.round(n / 100) / 10}k` : n, o = r[t + it], a = o === -1 ? {} : Object.assign({}, e[o]);
-  return Object.assign(a, {
-    cluster: !0,
-    cluster_id: r[t + S],
-    point_count: n,
-    point_count_abbreviated: i
-  });
-}
-function z(r) {
-  return r / 360 + 0.5;
-}
-function B(r) {
-  const t = Math.sin(r * Math.PI / 180), e = 0.5 - 0.25 * Math.log((1 + t) / (1 - t)) / Math.PI;
-  return e < 0 ? 0 : e > 1 ? 1 : e;
-}
-function vt(r) {
-  return (r - 0.5) * 360;
-}
-function Tt(r) {
-  const t = (180 - r * 360) * Math.PI / 180;
-  return 360 * Math.atan(Math.exp(t)) / Math.PI - 90;
-}
-var X = Object.prototype.hasOwnProperty;
-function tt(r, t, e) {
-  for (e of r.keys())
-    if (v(e, t)) return e;
-}
-function v(r, t) {
-  var e, n, i;
-  if (r === t) return !0;
-  if (r && t && (e = r.constructor) === t.constructor) {
-    if (e === Date) return r.getTime() === t.getTime();
-    if (e === RegExp) return r.toString() === t.toString();
-    if (e === Array) {
-      if ((n = r.length) === t.length)
-        for (; n-- && v(r[n], t[n]); ) ;
-      return n === -1;
-    }
-    if (e === Set) {
-      if (r.size !== t.size)
-        return !1;
-      for (n of r)
-        if (i = n, i && typeof i == "object" && (i = tt(t, i), !i) || !t.has(i)) return !1;
-      return !0;
-    }
-    if (e === Map) {
-      if (r.size !== t.size)
-        return !1;
-      for (n of r)
-        if (i = n[0], i && typeof i == "object" && (i = tt(t, i), !i) || !v(n[1], t.get(i)))
-          return !1;
-      return !0;
-    }
-    if (e === ArrayBuffer)
-      r = new Uint8Array(r), t = new Uint8Array(t);
-    else if (e === DataView) {
-      if ((n = r.byteLength) === t.byteLength)
-        for (; n-- && r.getInt8(n) === t.getInt8(n); ) ;
-      return n === -1;
-    }
-    if (ArrayBuffer.isView(r)) {
-      if ((n = r.byteLength) === t.byteLength)
-        for (; n-- && r[n] === t[n]; ) ;
-      return n === -1;
-    }
-    if (!e || typeof r == "object") {
-      n = 0;
-      for (e in r)
-        if (X.call(r, e) && ++n && !X.call(t, e) || !(e in t) || !v(r[e], t[e])) return !1;
-      return Object.keys(t).length === n;
-    }
-  }
-  return r !== r && t !== t;
-}
-function Lt(r) {
-  var t = D.useRef(r), e = D.useRef(0);
-  return v(r, t.current) || (t.current = r, e.current += 1), D.useMemo(function() {
-    return t.current;
-  }, [e.current]);
-}
-function Ct(r, t) {
-  return D.useEffect(r, Lt(t));
-}
-var Rt = function(t) {
-  var e = t.points, n = t.bounds, i = t.zoom, o = t.options, a = t.disableRefresh, c = H(), s = H(), h = U([]), l = h[0], u = h[1], p = Math.round(i);
-  return Ct(function() {
-    a !== !0 && ((!c.current || !v(s.current, e) || !v(c.current.options, o)) && (c.current = new Pt(o), c.current.load(e)), n && u(c.current.getClusters(n, p)), s.current = e);
-  }, [e, n, p, o, a]), {
-    clusters: l,
-    supercluster: c.current
-  };
-};
-const Ut = A(() => import("./index-Bu4XEiYU.js")), Zt = A(() => import("./index-DsrEcQq0.js")), zt = A(() => import("./index-BcpSqK0X.js"));
-function Bt({ markers: r, markerBoundsPadding: t = 1e-3, onClick: e, ...n }) {
-  const { mapProvider: i, activeMarker: o, center: a, bounds: c, zoom: s } = Z(), [h, l] = U(c);
-  ut(() => {
-    const f = r.length > 0 ? r.map((_) => [_.latitude, _.longitude]) : [[a.latitude, a.longitude]], m = Ot(St(f));
-    l(m);
-  }, [r, a]);
-  const u = P(() => typeof t == "number" ? {
-    top: t,
-    bottom: t,
-    left: t,
-    right: t
-  } : t, [t]), p = P(
-    () => ({
-      points: r.map((f) => bt([f.longitude, f.latitude], f)),
-      bounds: c,
-      zoom: s,
-      options: {
-        radius: i.name === "google" && s > K ? pt : lt,
-        minZoom: K,
-        maxZoom: ht
-      }
-    }),
-    [r, i, c, s]
-  ), { clusters: d, supercluster: g } = Rt(p), M = (f) => {
-    var m, _, E;
-    if (!("properties" in f))
-      throw new Error("Cluster does not have properties");
-    if ((m = f.properties) != null && m.cluster && typeof ((_ = f.properties) == null ? void 0 : _.cluster_id) == "number") {
-      e == null || e({
-        id: `${f.properties.cluster_id}`,
-        latitude: f.geometry.coordinates[1],
-        longitude: f.geometry.coordinates[0],
-        markers: ((E = g == null ? void 0 : g.getLeaves(f.properties.cluster_id)) == null ? void 0 : E.map((F) => F.properties)) ?? []
-      });
-      return;
-    }
-    e == null || e({
-      id: f.properties.id,
-      latitude: f.properties.latitude,
-      longitude: f.properties.longitude,
-      markers: [f.properties]
-    });
-  }, w = (f) => {
-    var m;
-    return !g || !o ? !1 : o.id === `${f}` ? !0 : ((m = g.getLeaves(f)) == null ? void 0 : m.find((_) => _.properties.id === o.id)) !== void 0;
-  }, y = P(() => {
-    switch (i == null ? void 0 : i.name) {
-      case "maptiler":
-        return Ut;
-      case "google":
-        return Zt;
-      case "mapbox":
-        return zt;
-      default:
-        return null;
-    }
-  }, [i]);
-  return y ? /* @__PURE__ */ T(
-    y,
-    {
-      clusters: d,
-      markerBounds: h,
-      markerBoundsPadding: u,
-      onClick: M,
-      doesSuperclusterContainActiveMarker: w,
-      ...n
-    }
-  ) : null;
-}
-const Dt = A(() => import("./index-BhldVNew.js")), Ft = A(() => import("./index-B9YXnLOH.js")), Gt = A(() => import("./index-DFdfOz0d.js"));
-function Nt({ children: r, ...t }) {
-  const { mapProvider: e } = Z(), n = P(() => {
-    switch (e == null ? void 0 : e.name) {
-      case "maptiler":
-        return Dt;
-      case "google":
-        return Ft;
-      case "mapbox":
-        return Gt;
-      default:
-        return null;
-    }
-  }, [e]);
-  return n ? /* @__PURE__ */ T(n, { ...t, children: r }) : null;
-}
-const $t = A(() => import("./index-CTk5bvm9.js")), jt = A(() => import("./index-UEadmVww.js")), It = A(() => import("./index-DVitM43i.js"));
-function Vt(r) {
-  const { mapProvider: t } = Z(), e = P(() => {
-    switch (t == null ? void 0 : t.name) {
-      case "maptiler":
-        return $t;
-      case "google":
-        return jt;
-      case "mapbox":
-        return It;
-      default:
-        return null;
-    }
-  }, [t]);
-  return e ? /* @__PURE__ */ T(e, { ...r }) : null;
-}
-function Ht(r) {
-  const [t, e] = U(r.zoom || R.zoom), [n, i] = U();
-  return /* @__PURE__ */ T(et.Provider, { value: { ...r, bounds: n, setBounds: i, zoom: t, setZoom: e }, children: r.children });
-}
-const Wt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  BaseMap: wt,
-  CenterPin: Et,
-  Layers: Vt,
-  Markers: Bt,
-  Popup: Nt,
-  Root: Ht
-}, Symbol.toStringTag, { value: "Module" }));
-export {
-  K as M,
-  J as a,
-  R as d,
-  Wt as i,
-  Z as u
-};