@local-logic/maps 0.1.2 → 0.1.4

package/dist/index-CNP-c5ZB.js

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