@local-logic/maps 0.1.2 → 0.1.4

package/dist/index-D37STE_k.js

@@ -1,725 +0,0 @@
-import { jsx as O } from "react/jsx-runtime";
-import * as D from "react";
-import at, { useContext as ct, useState as L, useMemo as S, lazy as w, useRef as z, useEffect as H } from "react";
-const et = at.createContext({}), R = () => ct(et), C = {
-  zoom: 14,
-  pitch: 0,
-  bearing: 0,
-  cooperativeGestures: !1
-}, V = {
-  maptiler: "600d69cb-288d-445e-9839-3dfe4d76b31a",
-  mapbox: "locallogic/cmb9nz9kb011501ru8drq8fqf",
-  google: "a7ff20eb973126bb"
-}, ut = {
-  top: 10,
-  bottom: 10,
-  left: 10,
-  right: 10
-}, J = 10, pt = 22, Jt = 10, ht = 30, lt = 60, Wt = 15, ft = [-180, -85.0511, 180, 85.0511], dt = "w-full h-full relative overflow-hidden", mt = w(() => import("./index-CTWLtI5f.js")), gt = w(() => import("./index-BabQioiH.js")), yt = w(() => import("./index-xDS1OfMB.js")), wt = w(() => import("./index-qqbvBkdn.js")), Mt = ({ children: r }) => {
-  const {
-    mapProvider: t,
-    center: e,
-    zoom: n = C.zoom,
-    pitch: o = C.pitch,
-    bearing: i = C.bearing,
-    cooperativeGestures: a = C.cooperativeGestures,
-    zoomPosition: c
-  } = R(), [s] = L(n), p = S(() => {
-    switch (t?.name) {
-      case "maptiler":
-        return mt;
-      case "google":
-        return gt;
-      case "mapbox":
-        return yt;
-      default:
-        return wt;
-    }
-  }, [t]);
-  return /* @__PURE__ */ O(
-    "div",
-    {
-      className: dt,
-      "data-testid": "base-map",
-      "data-map-provider-name": t?.name,
-      "data-map-provider-theme": t?.theme || V[t?.name] || V.maptiler,
-      "data-initial-zoom": s,
-      "data-pitch": o,
-      "data-bearing": i,
-      "data-cooperative-gestures": a,
-      "data-zoom-position": c,
-      "data-center-latitude": e.latitude,
-      "data-center-longitude": e.longitude,
-      children: /* @__PURE__ */ O(p, { children: r })
-    }
-  );
-}, _t = w(() => import("./index-C3Tj3r2u.js")), Pt = w(() => import("./index-CUUravWc.js")), At = w(() => import("./index-eWv3le07.js"));
-function Et(r) {
-  const { mapProvider: t } = R(), e = S(() => {
-    switch (t?.name) {
-      case "maptiler":
-        return _t;
-      case "google":
-        return Pt;
-      case "mapbox":
-        return At;
-      default:
-        return null;
-    }
-  }, [t]);
-  return e ? /* @__PURE__ */ O(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 xt(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 Yt(r, t, e = {}) {
-  return nt({
-    type: "MultiPoint",
-    coordinates: r
-  }, t, e);
-}
-function W(r) {
-  return !isNaN(r) && r !== null && !Array.isArray(r);
-}
-const Y = [
-  Int8Array,
-  Uint8Array,
-  Uint8ClampedArray,
-  Int16Array,
-  Uint16Array,
-  Int32Array,
-  Uint32Array,
-  Float32Array,
-  Float64Array
-], B = 1, T = 8;
-class G {
-  /**
-   * 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 o = n >> 4;
-    if (o !== B)
-      throw new Error(`Got v${o} data when expected v${B}.`);
-    const i = Y[n & 15];
-    if (!i)
-      throw new Error("Unrecognized array type.");
-    const [a] = new Uint16Array(t, 2, 1), [c] = new Uint32Array(t, 4, 1);
-    return new G(c, a, i, 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, o) {
-    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 i = 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 (i < 0)
-      throw new Error(`Unexpected typed array class: ${n}.`);
-    o && o instanceof ArrayBuffer ? (this.data = o, this.ids = new this.IndexArrayType(this.data, T, t), this.coords = new this.ArrayType(this.data, T + c + s, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(T + a + c + s), this.ids = new this.IndexArrayType(this.data, T, t), this.coords = new this.ArrayType(this.data, T + c + s, t * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (B << 4) + i]), 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, o) {
-    if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
-    const { ids: i, coords: a, nodeSize: c } = this, s = [0, i.length - 1, 0], p = [];
-    for (; s.length; ) {
-      const l = s.pop() || 0, u = s.pop() || 0, f = s.pop() || 0;
-      if (u - f <= c) {
-        for (let h = f; h <= u; h++) {
-          const m = a[2 * h], M = a[2 * h + 1];
-          m >= t && m <= n && M >= e && M <= o && p.push(i[h]);
-        }
-        continue;
-      }
-      const d = f + u >> 1, g = a[2 * d], y = a[2 * d + 1];
-      g >= t && g <= n && y >= e && y <= o && p.push(i[d]), (l === 0 ? t <= g : e <= y) && (s.push(f), s.push(d - 1), s.push(1 - l)), (l === 0 ? n >= g : o >= y) && (s.push(d + 1), s.push(u), s.push(1 - l));
-    }
-    return p;
-  }
-  /**
-   * 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: o, coords: i, nodeSize: a } = this, c = [0, o.length - 1, 0], s = [], p = n * n;
-    for (; c.length; ) {
-      const l = c.pop() || 0, u = c.pop() || 0, f = c.pop() || 0;
-      if (u - f <= a) {
-        for (let h = f; h <= u; h++)
-          K(i[2 * h], i[2 * h + 1], t, e) <= p && s.push(o[h]);
-        continue;
-      }
-      const d = f + u >> 1, g = i[2 * d], y = i[2 * d + 1];
-      K(g, y, t, e) <= p && s.push(o[d]), (l === 0 ? t - n <= g : e - n <= y) && (c.push(f), c.push(d - 1), c.push(1 - l)), (l === 0 ? t + n >= g : e + n >= y) && (c.push(d + 1), c.push(u), c.push(1 - l));
-    }
-    return s;
-  }
-}
-function j(r, t, e, n, o, i) {
-  if (o - n <= e) return;
-  const a = n + o >> 1;
-  rt(r, t, a, n, o, i), j(r, t, e, n, a - 1, 1 - i), j(r, t, e, a + 1, o, 1 - i);
-}
-function rt(r, t, e, n, o, i) {
-  for (; o > n; ) {
-    if (o - n > 600) {
-      const p = o - n + 1, l = e - n + 1, u = Math.log(p), f = 0.5 * Math.exp(2 * u / 3), d = 0.5 * Math.sqrt(u * f * (p - f) / p) * (l - p / 2 < 0 ? -1 : 1), g = Math.max(n, Math.floor(e - l * f / p + d)), y = Math.min(o, Math.floor(e + (p - l) * f / p + d));
-      rt(r, t, e, g, y, i);
-    }
-    const a = t[2 * e + i];
-    let c = n, s = o;
-    for (b(r, t, n, e), t[2 * o + i] > a && b(r, t, n, o); c < s; ) {
-      for (b(r, t, c, s), c++, s--; t[2 * c + i] < a; ) c++;
-      for (; t[2 * s + i] > a; ) s--;
-    }
-    t[2 * n + i] === a ? b(r, t, n, s) : (s++, b(r, t, s, o)), s <= e && (n = s + 1), e <= s && (o = s - 1);
-  }
-}
-function b(r, t, e, n) {
-  F(r, e, n), F(t, 2 * e, 2 * n), F(t, 2 * e + 1, 2 * n + 1);
-}
-function F(r, t, e) {
-  const n = r[t];
-  r[t] = r[e], r[e] = n;
-}
-function K(r, t, e, n) {
-  const o = r - e, i = t - n;
-  return o * o + i * i;
-}
-const vt = {
-  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, A = 3, N = 4, P = 5, st = 6;
-class Ot {
-  constructor(t) {
-    this.options = Object.assign(Object.create(vt), 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: o } = this.options;
-    e && console.time("total time");
-    const i = `prepare ${t.length} points`;
-    e && console.time(i), this.points = t;
-    const a = [];
-    for (let s = 0; s < t.length; s++) {
-      const p = t[s];
-      if (!p.geometry) continue;
-      const [l, u] = p.geometry.coordinates, f = q(I(l)), d = q(U(u));
-      a.push(
-        f,
-        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[o + 1] = this._createTree(a);
-    e && console.timeEnd(i);
-    for (let s = o; s >= n; s--) {
-      const p = +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() - p);
-    }
-    return e && console.timeEnd("total time"), this;
-  }
-  getClusters(t, e) {
-    let n = ((t[0] + 180) % 360 + 360) % 360 - 180;
-    const o = Math.max(-90, Math.min(90, t[1]));
-    let i = 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, i = 180;
-    else if (n > i) {
-      const u = this.getClusters([n, o, 180, a], e), f = this.getClusters([-180, o, i, a], e);
-      return u.concat(f);
-    }
-    const c = this.trees[this._limitZoom(e)], s = c.range(I(n), U(a), I(i), U(o)), p = c.data, l = [];
-    for (const u of s) {
-      const f = this.stride * u;
-      l.push(p[f + P] > 1 ? Q(p, f, this.clusterProps) : this.points[p[f + A]]);
-    }
-    return l;
-  }
-  getChildren(t) {
-    const e = this._getOriginId(t), n = this._getOriginZoom(t), o = "No cluster with the specified id.", i = this.trees[n];
-    if (!i) throw new Error(o);
-    const a = i.data;
-    if (e * this.stride >= a.length) throw new Error(o);
-    const c = this.options.radius / (this.options.extent * Math.pow(2, n - 1)), s = a[e * this.stride], p = a[e * this.stride + 1], l = i.within(s, p, c), u = [];
-    for (const f of l) {
-      const d = f * this.stride;
-      a[d + N] === t && u.push(a[d + P] > 1 ? Q(a, d, this.clusterProps) : this.points[a[d + A]]);
-    }
-    if (u.length === 0) throw new Error(o);
-    return u;
-  }
-  getLeaves(t, e, n) {
-    e = e || 10, n = n || 0;
-    const o = [];
-    return this._appendLeaves(o, t, e, n, 0), o;
-  }
-  getTile(t, e, n) {
-    const o = this.trees[this._limitZoom(t)], i = Math.pow(2, t), { extent: a, radius: c } = this.options, s = c / a, p = (n - s) / i, l = (n + 1 + s) / i, u = {
-      features: []
-    };
-    return this._addTileFeatures(
-      o.range((e - s) / i, p, (e + 1 + s) / i, l),
-      o.data,
-      e,
-      n,
-      i,
-      u
-    ), e === 0 && this._addTileFeatures(
-      o.range(1 - s / i, p, 1, l),
-      o.data,
-      i,
-      n,
-      i,
-      u
-    ), e === i - 1 && this._addTileFeatures(
-      o.range(0, p, s / i, l),
-      o.data,
-      -1,
-      n,
-      i,
-      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, o, i) {
-    const a = this.getChildren(e);
-    for (const c of a) {
-      const s = c.properties;
-      if (s && s.cluster ? i + s.point_count <= o ? i += s.point_count : i = this._appendLeaves(t, s.cluster_id, n, o, i) : i < o ? i++ : t.push(c), t.length === n) break;
-    }
-    return i;
-  }
-  _createTree(t) {
-    const e = new G(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, o, i, a) {
-    for (const c of t) {
-      const s = c * this.stride, p = e[s + P] > 1;
-      let l, u, f;
-      if (p)
-        l = ot(e, s, this.clusterProps), u = e[s], f = e[s + 1];
-      else {
-        const y = this.points[e[s + A]];
-        l = y.properties;
-        const [h, m] = y.geometry.coordinates;
-        u = I(h), f = U(m);
-      }
-      const d = {
-        type: 1,
-        geometry: [[
-          Math.round(this.options.extent * (u * i - n)),
-          Math.round(this.options.extent * (f * i - o))
-        ]],
-        tags: l
-      };
-      let g;
-      p || this.options.generateId ? g = e[s + A] : g = this.points[e[s + A]].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: o, reduce: i, minPoints: a } = this.options, c = n / (o * Math.pow(2, e)), s = t.data, p = [], l = this.stride;
-    for (let u = 0; u < s.length; u += l) {
-      if (s[u + x] <= e) continue;
-      s[u + x] = e;
-      const f = s[u], d = s[u + 1], g = t.within(s[u], s[u + 1], c), y = s[u + P];
-      let h = y;
-      for (const m of g) {
-        const M = m * l;
-        s[M + x] > e && (h += s[M + P]);
-      }
-      if (h > y && h >= a) {
-        let m = f * y, M = d * y, _, $ = -1;
-        const Z = ((u / l | 0) << 5) + (e + 1) + this.points.length;
-        for (const it of g) {
-          const E = it * l;
-          if (s[E + x] <= e) continue;
-          s[E + x] = e;
-          const k = s[E + P];
-          m += s[E] * k, M += s[E + 1] * k, s[E + N] = Z, i && (_ || (_ = this._map(s, u, !0), $ = this.clusterProps.length, this.clusterProps.push(_)), i(_, this._map(s, E)));
-        }
-        s[u + N] = Z, p.push(m / h, M / h, 1 / 0, Z, -1, h), i && p.push($);
-      } else {
-        for (let m = 0; m < l; m++) p.push(s[u + m]);
-        if (h > 1)
-          for (const m of g) {
-            const M = m * l;
-            if (!(s[M + x] <= e)) {
-              s[M + x] = e;
-              for (let _ = 0; _ < l; _++) p.push(s[M + _]);
-            }
-          }
-      }
-    }
-    return p;
-  }
-  // 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 + P] > 1) {
-      const a = this.clusterProps[t[e + st]];
-      return n ? Object.assign({}, a) : a;
-    }
-    const o = this.points[t[e + A]].properties, i = this.options.map(o);
-    return n && i === o ? Object.assign({}, i) : i;
-  }
-}
-function Q(r, t, e) {
-  return {
-    type: "Feature",
-    id: r[t + A],
-    properties: ot(r, t, e),
-    geometry: {
-      type: "Point",
-      coordinates: [St(r[t]), Tt(r[t + 1])]
-    }
-  };
-}
-function ot(r, t, e) {
-  const n = r[t + P], o = n >= 1e4 ? `${Math.round(n / 1e3)}k` : n >= 1e3 ? `${Math.round(n / 100) / 10}k` : n, i = r[t + st], a = i === -1 ? {} : Object.assign({}, e[i]);
-  return Object.assign(a, {
-    cluster: !0,
-    cluster_id: r[t + A],
-    point_count: n,
-    point_count_abbreviated: o
-  });
-}
-function I(r) {
-  return r / 360 + 0.5;
-}
-function U(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 St(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, o;
-  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 (o = n, o && typeof o == "object" && (o = tt(t, o), !o) || !t.has(o)) return !1;
-      return !0;
-    }
-    if (e === Map) {
-      if (r.size !== t.size)
-        return !1;
-      for (n of r)
-        if (o = n[0], o && typeof o == "object" && (o = tt(t, o), !o) || !v(n[1], t.get(o)))
-          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 bt(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, bt(t));
-}
-var Lt = function(t) {
-  var e = t.points, n = t.bounds, o = t.zoom, i = t.options, a = t.disableRefresh, c = z(), s = z(), p = L([]), l = p[0], u = p[1], f = Math.round(o);
-  return Ct(function() {
-    a !== !0 && ((!c.current || !v(s.current, e) || !v(c.current.options, i)) && (c.current = new Ot(i), c.current.load(e)), n && u(c.current.getClusters(n, f)), s.current = e);
-  }, [e, n, f, i, a]), {
-    clusters: l,
-    supercluster: c.current
-  };
-};
-const Rt = w(() => import("./index-Dy0j33aN.js")), It = w(() => import("./index-BOJCRr60.js")), Ut = w(() => import("./index-vIYPnHrB.js"));
-function Dt({ isLoading: r, markers: t, onClick: e, ...n }) {
-  const { mapProvider: o, activeMarker: i, zoom: a, setMarkerPoints: c, setClusterPoints: s } = R();
-  H(() => {
-    if (r)
-      return;
-    const h = (t || []).map((m) => [m.longitude, m.latitude]);
-    c(h);
-  }, [t, c]);
-  const p = S(
-    () => ({
-      points: t.map((h) => xt([h.longitude, h.latitude], h)),
-      // Using world bounds to avoid issues with markers near the edges of the map
-      bounds: ft,
-      zoom: a,
-      options: {
-        radius: o.name === "google" && a > J ? lt : ht,
-        minZoom: J,
-        maxZoom: pt
-      }
-    }),
-    [t, o, a]
-  ), { clusters: l, supercluster: u } = Lt(p), f = z("");
-  H(() => {
-    const h = JSON.stringify(
-      l.map((m) => ({
-        coords: m.geometry.coordinates,
-        props: m.properties
-      }))
-    );
-    h !== f.current && (s(l), f.current = h);
-  }, [l, s]);
-  const d = (h) => {
-    if (!("properties" in h))
-      throw new Error("Cluster does not have properties");
-    if (h.properties?.cluster && typeof h.properties?.cluster_id == "number") {
-      e?.({
-        id: `${h.properties.cluster_id}`,
-        latitude: h.geometry.coordinates[1],
-        longitude: h.geometry.coordinates[0],
-        markers: u?.getLeaves(h.properties.cluster_id)?.map((m) => m.properties) ?? []
-      });
-      return;
-    }
-    e?.({
-      id: h.properties.id,
-      latitude: h.properties.latitude,
-      longitude: h.properties.longitude,
-      markers: [h.properties]
-    });
-  }, g = (h) => {
-    if (!u || !i) return !1;
-    if (i.id === `${h}`)
-      return !0;
-    try {
-      return u.getLeaves(h)?.find((m) => m.properties.id === i.id) !== void 0;
-    } catch {
-      return !1;
-    }
-  }, y = S(() => {
-    switch (o?.name) {
-      case "maptiler":
-        return Rt;
-      case "google":
-        return It;
-      case "mapbox":
-        return Ut;
-      default:
-        return null;
-    }
-  }, [o]);
-  return y ? /* @__PURE__ */ O(
-    y,
-    {
-      clusters: l,
-      onClick: d,
-      doesSuperclusterContainActiveMarker: g,
-      ...n
-    }
-  ) : null;
-}
-const Zt = w(() => import("./index-Ci9PQ3VM.js")), Bt = w(() => import("./index-DHOxmHER.js")), Ft = w(() => import("./index-CWXZA3V3.js"));
-function Nt({ children: r, anchor: t = "bottom", ...e }) {
-  const { mapProvider: n } = R(), o = S(() => {
-    switch (n?.name) {
-      case "maptiler":
-        return Zt;
-      case "google":
-        return Bt;
-      case "mapbox":
-        return Ft;
-      default:
-        return null;
-    }
-  }, [n]);
-  return o ? /* @__PURE__ */ O(o, { ...e, anchor: t, children: r }) : null;
-}
-const zt = w(() => import("./index-DKy2opdk.js")), jt = w(() => import("./index-k9UFzKZZ.js")), Gt = w(() => import("./index-D8-yY6UK.js"));
-function $t(r) {
-  const { mapProvider: t } = R(), e = S(() => {
-    switch (t?.name) {
-      case "maptiler":
-        return zt;
-      case "google":
-        return jt;
-      case "mapbox":
-        return Gt;
-      default:
-        return null;
-    }
-  }, [t]);
-  return e ? /* @__PURE__ */ O(e, { ...r }) : null;
-}
-function kt(r) {
-  const [t, e] = L([]), [n, o] = L([]), [i, a] = L(r.zoom || C.zoom);
-  return /* @__PURE__ */ O(
-    et.Provider,
-    {
-      value: {
-        ...r,
-        locale: r.locale || "en",
-        mapPadding: r.mapPadding || ut,
-        locationBoundary: r.locationBoundary ? r.locationBoundary : [[r.center.longitude, r.center.latitude]],
-        markerPoints: t,
-        setMarkerPoints: e,
-        clusterPoints: n,
-        setClusterPoints: o,
-        zoom: i,
-        setZoom: a
-      },
-      children: r.children
-    }
-  );
-}
-const Kt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  BaseMap: Mt,
-  CenterPin: Et,
-  Layers: $t,
-  Markers: Dt,
-  Popup: Nt,
-  Root: kt
-}, Symbol.toStringTag, { value: "Module" }));
-export {
-  C as D,
-  Jt as M,
-  Wt as P,
-  ft as W,
-  V as a,
-  ut as b,
-  Kt as i,
-  Yt as m,
-  R as u
-};