@undp/data-viz 1.4.16 → 1.5.0

package/dist/index-qfWCwobm.js

@@ -0,0 +1,682 @@
+import { a as Er, g as Sr } from "./_commonjsHelpers-ByX85dGu.js";
+function Xr(s, m, p = {}) {
+  const h = { type: "Feature" };
+  return (p.id === 0 || p.id) && (h.id = p.id), p.bbox && (h.bbox = p.bbox), h.properties = m || {}, h.geometry = s, h;
+}
+function lr(s, m, p = {}) {
+  if (!s)
+    throw new Error("coordinates is required");
+  if (!Array.isArray(s))
+    throw new Error("coordinates must be an Array");
+  if (s.length < 2)
+    throw new Error("coordinates must be at least 2 numbers long");
+  if (!mr(s[0]) || !mr(s[1]))
+    throw new Error("coordinates must contain numbers");
+  return Xr({
+    type: "Point",
+    coordinates: s
+  }, m, p);
+}
+function qr(s, m, p = {}) {
+  for (const d of s) {
+    if (d.length < 4)
+      throw new Error(
+        "Each LinearRing of a Polygon must have 4 or more Positions."
+      );
+    if (d[d.length - 1].length !== d[0].length)
+      throw new Error("First and last Position are not equivalent.");
+    for (let g = 0; g < d[d.length - 1].length; g++)
+      if (d[d.length - 1][g] !== d[0][g])
+        throw new Error("First and last Position are not equivalent.");
+  }
+  return Xr({
+    type: "Polygon",
+    coordinates: s
+  }, m, p);
+}
+function mr(s) {
+  return !isNaN(s) && s !== null && !Array.isArray(s);
+}
+function or(s, m, p) {
+  if (s !== null)
+    for (var h, d, g, Y, D, _, E, S = 0, $ = 0, G, z = s.type, B = z === "FeatureCollection", R = z === "Feature", F = B ? s.features.length : 1, L = 0; L < F; L++) {
+      E = B ? s.features[L].geometry : R ? s.geometry : s, G = E ? E.type === "GeometryCollection" : !1, D = G ? E.geometries.length : 1;
+      for (var e = 0; e < D; e++) {
+        var i = 0, r = 0;
+        if (Y = G ? E.geometries[e] : E, Y !== null) {
+          _ = Y.coordinates;
+          var t = Y.type;
+          switch (S = p && (t === "Polygon" || t === "MultiPolygon") ? 1 : 0, t) {
+            case null:
+              break;
+            case "Point":
+              if (m(
+                _,
+                $,
+                L,
+                i,
+                r
+              ) === !1)
+                return !1;
+              $++, i++;
+              break;
+            case "LineString":
+            case "MultiPoint":
+              for (h = 0; h < _.length; h++) {
+                if (m(
+                  _[h],
+                  $,
+                  L,
+                  i,
+                  r
+                ) === !1)
+                  return !1;
+                $++, t === "MultiPoint" && i++;
+              }
+              t === "LineString" && i++;
+              break;
+            case "Polygon":
+            case "MultiLineString":
+              for (h = 0; h < _.length; h++) {
+                for (d = 0; d < _[h].length - S; d++) {
+                  if (m(
+                    _[h][d],
+                    $,
+                    L,
+                    i,
+                    r
+                  ) === !1)
+                    return !1;
+                  $++;
+                }
+                t === "MultiLineString" && i++, t === "Polygon" && r++;
+              }
+              t === "Polygon" && i++;
+              break;
+            case "MultiPolygon":
+              for (h = 0; h < _.length; h++) {
+                for (r = 0, d = 0; d < _[h].length; d++) {
+                  for (g = 0; g < _[h][d].length - S; g++) {
+                    if (m(
+                      _[h][d][g],
+                      $,
+                      L,
+                      i,
+                      r
+                    ) === !1)
+                      return !1;
+                    $++;
+                  }
+                  r++;
+                }
+                i++;
+              }
+              break;
+            case "GeometryCollection":
+              for (h = 0; h < Y.geometries.length; h++)
+                if (or(Y.geometries[h], m, p) === !1)
+                  return !1;
+              break;
+            default:
+              throw new Error("Unknown Geometry Type");
+          }
+        }
+      }
+    }
+}
+var ir = { exports: {} }, ar = { exports: {} }, Ar = ar.exports, vr;
+function Cr() {
+  return vr || (vr = 1, function(s, m) {
+    (function(p, h) {
+      s.exports = h();
+    })(Ar, function() {
+      function p(e, i, r, t, n) {
+        (function a(o, u, f, l, v) {
+          for (; l > f; ) {
+            if (l - f > 600) {
+              var M = l - f + 1, P = u - f + 1, K = Math.log(M), X = 0.5 * Math.exp(2 * K / 3), q = 0.5 * Math.sqrt(K * X * (M - X) / M) * (P - M / 2 < 0 ? -1 : 1), A = Math.max(f, Math.floor(u - P * X / M + q)), k = Math.min(l, Math.floor(u + (M - P) * X / M + q));
+              a(o, u, A, k, v);
+            }
+            var c = o[u], x = f, y = l;
+            for (h(o, f, u), v(o[l], c) > 0 && h(o, f, l); x < y; ) {
+              for (h(o, x, y), x++, y--; v(o[x], c) < 0; ) x++;
+              for (; v(o[y], c) > 0; ) y--;
+            }
+            v(o[f], c) === 0 ? h(o, f, y) : h(o, ++y, l), y <= u && (f = y + 1), u <= y && (l = y - 1);
+          }
+        })(e, i, r || 0, t || e.length - 1, n || d);
+      }
+      function h(e, i, r) {
+        var t = e[i];
+        e[i] = e[r], e[r] = t;
+      }
+      function d(e, i) {
+        return e < i ? -1 : e > i ? 1 : 0;
+      }
+      var g = function(e) {
+        e === void 0 && (e = 9), this._maxEntries = Math.max(4, e), this._minEntries = Math.max(2, Math.ceil(0.4 * this._maxEntries)), this.clear();
+      };
+      function Y(e, i, r) {
+        if (!r) return i.indexOf(e);
+        for (var t = 0; t < i.length; t++) if (r(e, i[t])) return t;
+        return -1;
+      }
+      function D(e, i) {
+        _(e, 0, e.children.length, i, e);
+      }
+      function _(e, i, r, t, n) {
+        n || (n = F(null)), n.minX = 1 / 0, n.minY = 1 / 0, n.maxX = -1 / 0, n.maxY = -1 / 0;
+        for (var a = i; a < r; a++) {
+          var o = e.children[a];
+          E(n, e.leaf ? t(o) : o);
+        }
+        return n;
+      }
+      function E(e, i) {
+        return e.minX = Math.min(e.minX, i.minX), e.minY = Math.min(e.minY, i.minY), e.maxX = Math.max(e.maxX, i.maxX), e.maxY = Math.max(e.maxY, i.maxY), e;
+      }
+      function S(e, i) {
+        return e.minX - i.minX;
+      }
+      function $(e, i) {
+        return e.minY - i.minY;
+      }
+      function G(e) {
+        return (e.maxX - e.minX) * (e.maxY - e.minY);
+      }
+      function z(e) {
+        return e.maxX - e.minX + (e.maxY - e.minY);
+      }
+      function B(e, i) {
+        return e.minX <= i.minX && e.minY <= i.minY && i.maxX <= e.maxX && i.maxY <= e.maxY;
+      }
+      function R(e, i) {
+        return i.minX <= e.maxX && i.minY <= e.maxY && i.maxX >= e.minX && i.maxY >= e.minY;
+      }
+      function F(e) {
+        return { children: e, height: 1, leaf: !0, minX: 1 / 0, minY: 1 / 0, maxX: -1 / 0, maxY: -1 / 0 };
+      }
+      function L(e, i, r, t, n) {
+        for (var a = [i, r]; a.length; ) if (!((r = a.pop()) - (i = a.pop()) <= t)) {
+          var o = i + Math.ceil((r - i) / t / 2) * t;
+          p(e, o, i, r, n), a.push(i, o, o, r);
+        }
+      }
+      return g.prototype.all = function() {
+        return this._all(this.data, []);
+      }, g.prototype.search = function(e) {
+        var i = this.data, r = [];
+        if (!R(e, i)) return r;
+        for (var t = this.toBBox, n = []; i; ) {
+          for (var a = 0; a < i.children.length; a++) {
+            var o = i.children[a], u = i.leaf ? t(o) : o;
+            R(e, u) && (i.leaf ? r.push(o) : B(e, u) ? this._all(o, r) : n.push(o));
+          }
+          i = n.pop();
+        }
+        return r;
+      }, g.prototype.collides = function(e) {
+        var i = this.data;
+        if (!R(e, i)) return !1;
+        for (var r = []; i; ) {
+          for (var t = 0; t < i.children.length; t++) {
+            var n = i.children[t], a = i.leaf ? this.toBBox(n) : n;
+            if (R(e, a)) {
+              if (i.leaf || B(e, a)) return !0;
+              r.push(n);
+            }
+          }
+          i = r.pop();
+        }
+        return !1;
+      }, g.prototype.load = function(e) {
+        if (!e || !e.length) return this;
+        if (e.length < this._minEntries) {
+          for (var i = 0; i < e.length; i++) this.insert(e[i]);
+          return this;
+        }
+        var r = this._build(e.slice(), 0, e.length - 1, 0);
+        if (this.data.children.length) if (this.data.height === r.height) this._splitRoot(this.data, r);
+        else {
+          if (this.data.height < r.height) {
+            var t = this.data;
+            this.data = r, r = t;
+          }
+          this._insert(r, this.data.height - r.height - 1, !0);
+        }
+        else this.data = r;
+        return this;
+      }, g.prototype.insert = function(e) {
+        return e && this._insert(e, this.data.height - 1), this;
+      }, g.prototype.clear = function() {
+        return this.data = F([]), this;
+      }, g.prototype.remove = function(e, i) {
+        if (!e) return this;
+        for (var r, t, n, a = this.data, o = this.toBBox(e), u = [], f = []; a || u.length; ) {
+          if (a || (a = u.pop(), t = u[u.length - 1], r = f.pop(), n = !0), a.leaf) {
+            var l = Y(e, a.children, i);
+            if (l !== -1) return a.children.splice(l, 1), u.push(a), this._condense(u), this;
+          }
+          n || a.leaf || !B(a, o) ? t ? (r++, a = t.children[r], n = !1) : a = null : (u.push(a), f.push(r), r = 0, t = a, a = a.children[0]);
+        }
+        return this;
+      }, g.prototype.toBBox = function(e) {
+        return e;
+      }, g.prototype.compareMinX = function(e, i) {
+        return e.minX - i.minX;
+      }, g.prototype.compareMinY = function(e, i) {
+        return e.minY - i.minY;
+      }, g.prototype.toJSON = function() {
+        return this.data;
+      }, g.prototype.fromJSON = function(e) {
+        return this.data = e, this;
+      }, g.prototype._all = function(e, i) {
+        for (var r = []; e; ) e.leaf ? i.push.apply(i, e.children) : r.push.apply(r, e.children), e = r.pop();
+        return i;
+      }, g.prototype._build = function(e, i, r, t) {
+        var n, a = r - i + 1, o = this._maxEntries;
+        if (a <= o) return D(n = F(e.slice(i, r + 1)), this.toBBox), n;
+        t || (t = Math.ceil(Math.log(a) / Math.log(o)), o = Math.ceil(a / Math.pow(o, t - 1))), (n = F([])).leaf = !1, n.height = t;
+        var u = Math.ceil(a / o), f = u * Math.ceil(Math.sqrt(o));
+        L(e, i, r, f, this.compareMinX);
+        for (var l = i; l <= r; l += f) {
+          var v = Math.min(l + f - 1, r);
+          L(e, l, v, u, this.compareMinY);
+          for (var M = l; M <= v; M += u) {
+            var P = Math.min(M + u - 1, v);
+            n.children.push(this._build(e, M, P, t - 1));
+          }
+        }
+        return D(n, this.toBBox), n;
+      }, g.prototype._chooseSubtree = function(e, i, r, t) {
+        for (; t.push(i), !i.leaf && t.length - 1 !== r; ) {
+          for (var n = 1 / 0, a = 1 / 0, o = void 0, u = 0; u < i.children.length; u++) {
+            var f = i.children[u], l = G(f), v = (M = e, P = f, (Math.max(P.maxX, M.maxX) - Math.min(P.minX, M.minX)) * (Math.max(P.maxY, M.maxY) - Math.min(P.minY, M.minY)) - l);
+            v < a ? (a = v, n = l < n ? l : n, o = f) : v === a && l < n && (n = l, o = f);
+          }
+          i = o || i.children[0];
+        }
+        var M, P;
+        return i;
+      }, g.prototype._insert = function(e, i, r) {
+        var t = r ? e : this.toBBox(e), n = [], a = this._chooseSubtree(t, this.data, i, n);
+        for (a.children.push(e), E(a, t); i >= 0 && n[i].children.length > this._maxEntries; ) this._split(n, i), i--;
+        this._adjustParentBBoxes(t, n, i);
+      }, g.prototype._split = function(e, i) {
+        var r = e[i], t = r.children.length, n = this._minEntries;
+        this._chooseSplitAxis(r, n, t);
+        var a = this._chooseSplitIndex(r, n, t), o = F(r.children.splice(a, r.children.length - a));
+        o.height = r.height, o.leaf = r.leaf, D(r, this.toBBox), D(o, this.toBBox), i ? e[i - 1].children.push(o) : this._splitRoot(r, o);
+      }, g.prototype._splitRoot = function(e, i) {
+        this.data = F([e, i]), this.data.height = e.height + 1, this.data.leaf = !1, D(this.data, this.toBBox);
+      }, g.prototype._chooseSplitIndex = function(e, i, r) {
+        for (var t, n, a, o, u, f, l, v = 1 / 0, M = 1 / 0, P = i; P <= r - i; P++) {
+          var K = _(e, 0, P, this.toBBox), X = _(e, P, r, this.toBBox), q = (n = K, a = X, o = void 0, u = void 0, f = void 0, l = void 0, o = Math.max(n.minX, a.minX), u = Math.max(n.minY, a.minY), f = Math.min(n.maxX, a.maxX), l = Math.min(n.maxY, a.maxY), Math.max(0, f - o) * Math.max(0, l - u)), A = G(K) + G(X);
+          q < v ? (v = q, t = P, M = A < M ? A : M) : q === v && A < M && (M = A, t = P);
+        }
+        return t || r - i;
+      }, g.prototype._chooseSplitAxis = function(e, i, r) {
+        var t = e.leaf ? this.compareMinX : S, n = e.leaf ? this.compareMinY : $;
+        this._allDistMargin(e, i, r, t) < this._allDistMargin(e, i, r, n) && e.children.sort(t);
+      }, g.prototype._allDistMargin = function(e, i, r, t) {
+        e.children.sort(t);
+        for (var n = this.toBBox, a = _(e, 0, i, n), o = _(e, r - i, r, n), u = z(a) + z(o), f = i; f < r - i; f++) {
+          var l = e.children[f];
+          E(a, e.leaf ? n(l) : l), u += z(a);
+        }
+        for (var v = r - i - 1; v >= i; v--) {
+          var M = e.children[v];
+          E(o, e.leaf ? n(M) : M), u += z(o);
+        }
+        return u;
+      }, g.prototype._adjustParentBBoxes = function(e, i, r) {
+        for (var t = r; t >= 0; t--) E(i[t], e);
+      }, g.prototype._condense = function(e) {
+        for (var i = e.length - 1, r = void 0; i >= 0; i--) e[i].children.length === 0 ? i > 0 ? (r = e[i - 1].children).splice(r.indexOf(e[i]), 1) : this.clear() : D(e[i], this.toBBox);
+      }, g;
+    });
+  }(ar)), ar.exports;
+}
+class Nr {
+  constructor(m = [], p = Dr) {
+    if (this.data = m, this.length = this.data.length, this.compare = p, this.length > 0)
+      for (let h = (this.length >> 1) - 1; h >= 0; h--) this._down(h);
+  }
+  push(m) {
+    this.data.push(m), this.length++, this._up(this.length - 1);
+  }
+  pop() {
+    if (this.length === 0) return;
+    const m = this.data[0], p = this.data.pop();
+    return this.length--, this.length > 0 && (this.data[0] = p, this._down(0)), m;
+  }
+  peek() {
+    return this.data[0];
+  }
+  _up(m) {
+    const { data: p, compare: h } = this, d = p[m];
+    for (; m > 0; ) {
+      const g = m - 1 >> 1, Y = p[g];
+      if (h(d, Y) >= 0) break;
+      p[m] = Y, m = g;
+    }
+    p[m] = d;
+  }
+  _down(m) {
+    const { data: p, compare: h } = this, d = this.length >> 1, g = p[m];
+    for (; m < d; ) {
+      let Y = (m << 1) + 1, D = p[Y];
+      const _ = Y + 1;
+      if (_ < this.length && h(p[_], D) < 0 && (Y = _, D = p[_]), h(D, g) >= 0) break;
+      p[m] = D, m = Y;
+    }
+    p[m] = g;
+  }
+}
+function Dr(s, m) {
+  return s < m ? -1 : s > m ? 1 : 0;
+}
+const Rr = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  default: Nr
+}, Symbol.toStringTag, { value: "Module" })), Or = /* @__PURE__ */ Er(Rr);
+var er = { exports: {} }, fr, pr;
+function kr() {
+  return pr || (pr = 1, fr = function(m, p, h, d) {
+    var g = m[0], Y = m[1], D = !1;
+    h === void 0 && (h = 0), d === void 0 && (d = p.length);
+    for (var _ = (d - h) / 2, E = 0, S = _ - 1; E < _; S = E++) {
+      var $ = p[h + E * 2 + 0], G = p[h + E * 2 + 1], z = p[h + S * 2 + 0], B = p[h + S * 2 + 1], R = G > Y != B > Y && g < (z - $) * (Y - G) / (B - G) + $;
+      R && (D = !D);
+    }
+    return D;
+  }), fr;
+}
+var hr, gr;
+function Gr() {
+  return gr || (gr = 1, hr = function(m, p, h, d) {
+    var g = m[0], Y = m[1], D = !1;
+    h === void 0 && (h = 0), d === void 0 && (d = p.length);
+    for (var _ = d - h, E = 0, S = _ - 1; E < _; S = E++) {
+      var $ = p[E + h][0], G = p[E + h][1], z = p[S + h][0], B = p[S + h][1], R = G > Y != B > Y && g < (z - $) * (Y - G) / (B - G) + $;
+      R && (D = !D);
+    }
+    return D;
+  }), hr;
+}
+var dr;
+function Fr() {
+  if (dr) return er.exports;
+  dr = 1;
+  var s = kr(), m = Gr();
+  return er.exports = function(h, d, g, Y) {
+    return d.length > 0 && Array.isArray(d[0]) ? m(h, d, g, Y) : s(h, d, g, Y);
+  }, er.exports.nested = m, er.exports.flat = s, er.exports;
+}
+var nr = { exports: {} }, Lr = nr.exports, xr;
+function $r() {
+  return xr || (xr = 1, function(s, m) {
+    (function(p, h) {
+      h(m);
+    })(Lr, function(p) {
+      const d = 33306690738754706e-32;
+      function g(R, F, L, e, i) {
+        let r, t, n, a, o = F[0], u = e[0], f = 0, l = 0;
+        u > o == u > -o ? (r = o, o = F[++f]) : (r = u, u = e[++l]);
+        let v = 0;
+        if (f < R && l < L) for (u > o == u > -o ? (n = r - ((t = o + r) - o), o = F[++f]) : (n = r - ((t = u + r) - u), u = e[++l]), r = t, n !== 0 && (i[v++] = n); f < R && l < L; ) u > o == u > -o ? (n = r - ((t = r + o) - (a = t - r)) + (o - a), o = F[++f]) : (n = r - ((t = r + u) - (a = t - r)) + (u - a), u = e[++l]), r = t, n !== 0 && (i[v++] = n);
+        for (; f < R; ) n = r - ((t = r + o) - (a = t - r)) + (o - a), o = F[++f], r = t, n !== 0 && (i[v++] = n);
+        for (; l < L; ) n = r - ((t = r + u) - (a = t - r)) + (u - a), u = e[++l], r = t, n !== 0 && (i[v++] = n);
+        return r === 0 && v !== 0 || (i[v++] = r), v;
+      }
+      function Y(R) {
+        return new Float64Array(R);
+      }
+      const D = 33306690738754716e-32, _ = 22204460492503146e-32, E = 11093356479670487e-47, S = Y(4), $ = Y(8), G = Y(12), z = Y(16), B = Y(4);
+      p.orient2d = function(R, F, L, e, i, r) {
+        const t = (F - r) * (L - i), n = (R - i) * (e - r), a = t - n;
+        if (t === 0 || n === 0 || t > 0 != n > 0) return a;
+        const o = Math.abs(t + n);
+        return Math.abs(a) >= D * o ? a : -function(u, f, l, v, M, P, K) {
+          let X, q, A, k, c, x, y, H, O, C, w, N, Q, J, U, V, b, Z;
+          const W = u - M, T = l - M, I = f - P, j = v - P;
+          c = (U = (H = W - (y = (x = 134217729 * W) - (x - W))) * (C = j - (O = (x = 134217729 * j) - (x - j))) - ((J = W * j) - y * O - H * O - y * C)) - (w = U - (b = (H = I - (y = (x = 134217729 * I) - (x - I))) * (C = T - (O = (x = 134217729 * T) - (x - T))) - ((V = I * T) - y * O - H * O - y * C))), S[0] = U - (w + c) + (c - b), c = (Q = J - ((N = J + w) - (c = N - J)) + (w - c)) - (w = Q - V), S[1] = Q - (w + c) + (c - V), c = (Z = N + w) - N, S[2] = N - (Z - c) + (w - c), S[3] = Z;
+          let rr = function(Pr, sr) {
+            let cr = sr[0];
+            for (let ur = 1; ur < Pr; ur++) cr += sr[ur];
+            return cr;
+          }(4, S), tr = _ * K;
+          if (rr >= tr || -rr >= tr || (X = u - (W + (c = u - W)) + (c - M), A = l - (T + (c = l - T)) + (c - M), q = f - (I + (c = f - I)) + (c - P), k = v - (j + (c = v - j)) + (c - P), X === 0 && q === 0 && A === 0 && k === 0) || (tr = E * K + d * Math.abs(rr), (rr += W * k + j * X - (I * A + T * q)) >= tr || -rr >= tr)) return rr;
+          c = (U = (H = X - (y = (x = 134217729 * X) - (x - X))) * (C = j - (O = (x = 134217729 * j) - (x - j))) - ((J = X * j) - y * O - H * O - y * C)) - (w = U - (b = (H = q - (y = (x = 134217729 * q) - (x - q))) * (C = T - (O = (x = 134217729 * T) - (x - T))) - ((V = q * T) - y * O - H * O - y * C))), B[0] = U - (w + c) + (c - b), c = (Q = J - ((N = J + w) - (c = N - J)) + (w - c)) - (w = Q - V), B[1] = Q - (w + c) + (c - V), c = (Z = N + w) - N, B[2] = N - (Z - c) + (w - c), B[3] = Z;
+          const Yr = g(4, S, 4, B, $);
+          c = (U = (H = W - (y = (x = 134217729 * W) - (x - W))) * (C = k - (O = (x = 134217729 * k) - (x - k))) - ((J = W * k) - y * O - H * O - y * C)) - (w = U - (b = (H = I - (y = (x = 134217729 * I) - (x - I))) * (C = A - (O = (x = 134217729 * A) - (x - A))) - ((V = I * A) - y * O - H * O - y * C))), B[0] = U - (w + c) + (c - b), c = (Q = J - ((N = J + w) - (c = N - J)) + (w - c)) - (w = Q - V), B[1] = Q - (w + c) + (c - V), c = (Z = N + w) - N, B[2] = N - (Z - c) + (w - c), B[3] = Z;
+          const wr = g(Yr, $, 4, B, G);
+          c = (U = (H = X - (y = (x = 134217729 * X) - (x - X))) * (C = k - (O = (x = 134217729 * k) - (x - k))) - ((J = X * k) - y * O - H * O - y * C)) - (w = U - (b = (H = q - (y = (x = 134217729 * q) - (x - q))) * (C = A - (O = (x = 134217729 * A) - (x - A))) - ((V = q * A) - y * O - H * O - y * C))), B[0] = U - (w + c) + (c - b), c = (Q = J - ((N = J + w) - (c = N - J)) + (w - c)) - (w = Q - V), B[1] = Q - (w + c) + (c - V), c = (Z = N + w) - N, B[2] = N - (Z - c) + (w - c), B[3] = Z;
+          const Br = g(wr, G, 4, B, z);
+          return z[Br - 1];
+        }(R, F, L, e, i, r, o);
+      }, p.orient2dfast = function(R, F, L, e, i, r) {
+        return (F - r) * (L - i) - (R - i) * (e - r);
+      }, Object.defineProperty(p, "__esModule", { value: !0 });
+    });
+  }(nr, nr.exports)), nr.exports;
+}
+var yr;
+function Hr() {
+  if (yr) return ir.exports;
+  yr = 1;
+  var s = Cr(), m = Or, p = Fr(), h = $r().orient2d;
+  m.default && (m = m.default), ir.exports = d, ir.exports.default = d;
+  function d(r, t, n) {
+    t = Math.max(0, t === void 0 ? 2 : t), n = n || 0;
+    var a = z(r), o = new s(16);
+    o.toBBox = function(y) {
+      return {
+        minX: y[0],
+        minY: y[1],
+        maxX: y[0],
+        maxY: y[1]
+      };
+    }, o.compareMinX = function(y, H) {
+      return y[0] - H[0];
+    }, o.compareMinY = function(y, H) {
+      return y[1] - H[1];
+    }, o.load(r);
+    for (var u = [], f = 0, l; f < a.length; f++) {
+      var v = a[f];
+      o.remove(v), l = B(v, l), u.push(l);
+    }
+    var M = new s(16);
+    for (f = 0; f < u.length; f++) M.insert(G(u[f]));
+    for (var P = t * t, K = n * n; u.length; ) {
+      var X = u.shift(), q = X.p, A = X.next.p, k = R(q, A);
+      if (!(k < K)) {
+        var c = k / P;
+        v = g(o, X.prev.p, q, A, X.next.next.p, c, M), v && Math.min(R(v, q), R(v, A)) <= c && (u.push(X), u.push(B(v, X)), o.remove(v), M.remove(X), M.insert(G(X)), M.insert(G(X.next)));
+      }
+    }
+    X = l;
+    var x = [];
+    do
+      x.push(X.p), X = X.next;
+    while (X !== l);
+    return x.push(X.p), x;
+  }
+  function g(r, t, n, a, o, u, f) {
+    for (var l = new m([], Y), v = r.data; v; ) {
+      for (var M = 0; M < v.children.length; M++) {
+        var P = v.children[M], K = v.leaf ? F(P, n, a) : D(n, a, P);
+        K > u || l.push({
+          node: P,
+          dist: K
+        });
+      }
+      for (; l.length && !l.peek().node.children; ) {
+        var X = l.pop(), q = X.node, A = F(q, t, n), k = F(q, a, o);
+        if (X.dist < A && X.dist < k && E(n, q, f) && E(a, q, f)) return q;
+      }
+      v = l.pop(), v && (v = v.node);
+    }
+    return null;
+  }
+  function Y(r, t) {
+    return r.dist - t.dist;
+  }
+  function D(r, t, n) {
+    if (_(r, n) || _(t, n)) return 0;
+    var a = L(r[0], r[1], t[0], t[1], n.minX, n.minY, n.maxX, n.minY);
+    if (a === 0) return 0;
+    var o = L(r[0], r[1], t[0], t[1], n.minX, n.minY, n.minX, n.maxY);
+    if (o === 0) return 0;
+    var u = L(r[0], r[1], t[0], t[1], n.maxX, n.minY, n.maxX, n.maxY);
+    if (u === 0) return 0;
+    var f = L(r[0], r[1], t[0], t[1], n.minX, n.maxY, n.maxX, n.maxY);
+    return f === 0 ? 0 : Math.min(a, o, u, f);
+  }
+  function _(r, t) {
+    return r[0] >= t.minX && r[0] <= t.maxX && r[1] >= t.minY && r[1] <= t.maxY;
+  }
+  function E(r, t, n) {
+    for (var a = Math.min(r[0], t[0]), o = Math.min(r[1], t[1]), u = Math.max(r[0], t[0]), f = Math.max(r[1], t[1]), l = n.search({ minX: a, minY: o, maxX: u, maxY: f }), v = 0; v < l.length; v++)
+      if ($(l[v].p, l[v].next.p, r, t)) return !1;
+    return !0;
+  }
+  function S(r, t, n) {
+    return h(r[0], r[1], t[0], t[1], n[0], n[1]);
+  }
+  function $(r, t, n, a) {
+    return r !== a && t !== n && S(r, t, n) > 0 != S(r, t, a) > 0 && S(n, a, r) > 0 != S(n, a, t) > 0;
+  }
+  function G(r) {
+    var t = r.p, n = r.next.p;
+    return r.minX = Math.min(t[0], n[0]), r.minY = Math.min(t[1], n[1]), r.maxX = Math.max(t[0], n[0]), r.maxY = Math.max(t[1], n[1]), r;
+  }
+  function z(r) {
+    for (var t = r[0], n = r[0], a = r[0], o = r[0], u = 0; u < r.length; u++) {
+      var f = r[u];
+      f[0] < t[0] && (t = f), f[0] > a[0] && (a = f), f[1] < n[1] && (n = f), f[1] > o[1] && (o = f);
+    }
+    var l = [t, n, a, o], v = l.slice();
+    for (u = 0; u < r.length; u++)
+      p(r[u], l) || v.push(r[u]);
+    return i(v);
+  }
+  function B(r, t) {
+    var n = {
+      p: r,
+      prev: null,
+      next: null,
+      minX: 0,
+      minY: 0,
+      maxX: 0,
+      maxY: 0
+    };
+    return t ? (n.next = t.next, n.prev = t, t.next.prev = n, t.next = n) : (n.prev = n, n.next = n), n;
+  }
+  function R(r, t) {
+    var n = r[0] - t[0], a = r[1] - t[1];
+    return n * n + a * a;
+  }
+  function F(r, t, n) {
+    var a = t[0], o = t[1], u = n[0] - a, f = n[1] - o;
+    if (u !== 0 || f !== 0) {
+      var l = ((r[0] - a) * u + (r[1] - o) * f) / (u * u + f * f);
+      l > 1 ? (a = n[0], o = n[1]) : l > 0 && (a += u * l, o += f * l);
+    }
+    return u = r[0] - a, f = r[1] - o, u * u + f * f;
+  }
+  function L(r, t, n, a, o, u, f, l) {
+    var v = n - r, M = a - t, P = f - o, K = l - u, X = r - o, q = t - u, A = v * v + M * M, k = v * P + M * K, c = P * P + K * K, x = v * X + M * q, y = P * X + K * q, H = A * c - k * k, O, C, w, N, Q = H, J = H;
+    H === 0 ? (C = 0, Q = 1, N = y, J = c) : (C = k * y - c * x, N = A * y - k * x, C < 0 ? (C = 0, N = y, J = c) : C > Q && (C = Q, N = y + k, J = c)), N < 0 ? (N = 0, -x < 0 ? C = 0 : -x > A ? C = Q : (C = -x, Q = A)) : N > J && (N = J, -x + k < 0 ? C = 0 : -x + k > A ? C = Q : (C = -x + k, Q = A)), O = C === 0 ? 0 : C / Q, w = N === 0 ? 0 : N / J;
+    var U = (1 - O) * r + O * n, V = (1 - O) * t + O * a, b = (1 - w) * o + w * f, Z = (1 - w) * u + w * l, W = b - U, T = Z - V;
+    return W * W + T * T;
+  }
+  function e(r, t) {
+    return r[0] === t[0] ? r[1] - t[1] : r[0] - t[0];
+  }
+  function i(r) {
+    r.sort(e);
+    for (var t = [], n = 0; n < r.length; n++) {
+      for (; t.length >= 2 && S(t[t.length - 2], t[t.length - 1], r[n]) <= 0; )
+        t.pop();
+      t.push(r[n]);
+    }
+    for (var a = [], o = r.length - 1; o >= 0; o--) {
+      for (; a.length >= 2 && S(a[a.length - 2], a[a.length - 1], r[o]) <= 0; )
+        a.pop();
+      a.push(r[o]);
+    }
+    return a.pop(), t.pop(), t.concat(a);
+  }
+  return ir.exports;
+}
+var Jr = Hr();
+const Qr = /* @__PURE__ */ Sr(Jr);
+function zr(s, m = {}) {
+  m.concavity = m.concavity || 1 / 0;
+  const p = [];
+  if (or(s, (d) => {
+    p.push([d[0], d[1]]);
+  }), !p.length)
+    return null;
+  const h = Qr(p, m.concavity);
+  return h.length > 3 ? qr([h]) : null;
+}
+function Mr(s, m = {}) {
+  let p = 0, h = 0, d = 0;
+  return or(
+    s,
+    function(g) {
+      p += g[0], h += g[1], d++;
+    },
+    !0
+  ), lr([p / d, h / d], m.properties);
+}
+function Kr(s) {
+  if (!s)
+    throw new Error("coord is required");
+  if (!Array.isArray(s)) {
+    if (s.type === "Feature" && s.geometry !== null && s.geometry.type === "Point")
+      return [...s.geometry.coordinates];
+    if (s.type === "Point")
+      return [...s.coordinates];
+  }
+  if (Array.isArray(s) && s.length >= 2 && !Array.isArray(s[0]) && !Array.isArray(s[1]))
+    return [...s];
+  throw new Error("coord must be GeoJSON Point or an Array of numbers");
+}
+function Ur(s, m) {
+  return s.type === "FeatureCollection" ? "FeatureCollection" : s.type === "GeometryCollection" ? "GeometryCollection" : s.type === "Feature" && s.geometry !== null ? s.geometry.type : s.type;
+}
+function _r(s, m = {}) {
+  switch (Ur(s)) {
+    case "Point":
+      return lr(Kr(s), m.properties);
+    case "Polygon":
+      var p = [];
+      or(s, function(r) {
+        p.push(r);
+      });
+      var h = Mr(s, { properties: m.properties }), d = h.geometry.coordinates, g = 0, Y = 0, D = 0, _, E, S, $, G, z, B, R, F = p.map(function(r) {
+        return [r[0] - d[0], r[1] - d[1]];
+      });
+      for (_ = 0; _ < p.length - 1; _++)
+        E = F[_], $ = E[0], z = E[1], S = F[_ + 1], G = S[0], B = S[1], R = $ * B - G * z, D += R, g += ($ + G) * R, Y += (z + B) * R;
+      if (D === 0)
+        return h;
+      var L = D * 0.5, e = 1 / (6 * L);
+      return lr(
+        [d[0] + e * g, d[1] + e * Y],
+        m.properties
+      );
+    default:
+      var i = zr(s);
+      return i ? _r(i, { properties: m.properties }) : Mr(s, { properties: m.properties });
+  }
+}
+var Zr = _r;
+export {
+  or as c,
+  Zr as t
+};
+//# sourceMappingURL=index-qfWCwobm.js.map