@xiping/react-components 1.0.19 → 1.0.21

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/cover.js

@@ -0,0 +1,40 @@
+function l(o, c, b) {
+  if (isNaN(o = +o) || isNaN(c = +c) || isNaN(b = +b)) return this;
+  var a = this._x0, i = this._y0, e = this._z0, h = this._x1, r = this._y1, _ = this._z1;
+  if (isNaN(a))
+    h = (a = Math.floor(o)) + 1, r = (i = Math.floor(c)) + 1, _ = (e = Math.floor(b)) + 1;
+  else {
+    for (var s = h - a || 1, f = this._root, k, N; a > o || o >= h || i > c || c >= r || e > b || b >= _; )
+      switch (N = (b < e) << 2 | (c < i) << 1 | o < a, k = new Array(8), k[N] = f, f = k, s *= 2, N) {
+        case 0:
+          h = a + s, r = i + s, _ = e + s;
+          break;
+        case 1:
+          a = h - s, r = i + s, _ = e + s;
+          break;
+        case 2:
+          h = a + s, i = r - s, _ = e + s;
+          break;
+        case 3:
+          a = h - s, i = r - s, _ = e + s;
+          break;
+        case 4:
+          h = a + s, r = i + s, e = _ - s;
+          break;
+        case 5:
+          a = h - s, r = i + s, e = _ - s;
+          break;
+        case 6:
+          h = a + s, i = r - s, e = _ - s;
+          break;
+        case 7:
+          a = h - s, i = r - s, e = _ - s;
+          break;
+      }
+    this._root && this._root.length && (this._root = f);
+  }
+  return this._x0 = a, this._y0 = i, this._z0 = e, this._x1 = h, this._y1 = r, this._z1 = _, this;
+}
+export {
+  l as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/data.js

@@ -0,0 +1,11 @@
+function i() {
+  var a = [];
+  return this.visit(function(t) {
+    if (!t.length) do
+      a.push(t.data);
+    while (t = t.next);
+  }), a;
+}
+export {
+  i as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/extent.js

@@ -0,0 +1,6 @@
+function e(t) {
+  return arguments.length ? this.cover(+t[0][0], +t[0][1], +t[0][2]).cover(+t[1][0], +t[1][1], +t[1][2]) : isNaN(this._x0) ? void 0 : [[this._x0, this._y0, this._z0], [this._x1, this._y1, this._z1]];
+}
+export {
+  e as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/find.js

@@ -0,0 +1,29 @@
+import o from "./octant.js";
+function H(_, a, w, n) {
+  var B, I = this._x0, M = this._y0, O = this._z0, c, p, s, g, v, q, b = this._x1, j = this._y1, k = this._z1, e = [], t = this._root, l, A;
+  for (t && e.push(new o(t, I, M, O, b, j, k)), n == null ? n = 1 / 0 : (I = _ - n, M = a - n, O = w - n, b = _ + n, j = a + n, k = w + n, n *= n); l = e.pop(); )
+    if (!(!(t = l.node) || (c = l.x0) > b || (p = l.y0) > j || (s = l.z0) > k || (g = l.x1) < I || (v = l.y1) < M || (q = l.z1) < O))
+      if (t.length) {
+        var h = (c + g) / 2, i = (p + v) / 2, f = (s + q) / 2;
+        e.push(
+          new o(t[7], h, i, f, g, v, q),
+          new o(t[6], c, i, f, h, v, q),
+          new o(t[5], h, p, f, g, i, q),
+          new o(t[4], c, p, f, h, i, q),
+          new o(t[3], h, i, s, g, v, f),
+          new o(t[2], c, i, s, h, v, f),
+          new o(t[1], h, p, s, g, i, f),
+          new o(t[0], c, p, s, h, i, f)
+        ), (A = (w >= f) << 2 | (a >= i) << 1 | _ >= h) && (l = e[e.length - 1], e[e.length - 1] = e[e.length - 1 - A], e[e.length - 1 - A] = l);
+      } else {
+        var C = _ - +this._x.call(null, t.data), D = a - +this._y.call(null, t.data), E = w - +this._z.call(null, t.data), F = C * C + D * D + E * E;
+        if (F < n) {
+          var r = Math.sqrt(n = F);
+          I = _ - r, M = a - r, O = w - r, b = _ + r, j = a + r, k = w + r, B = t.data;
+        }
+      }
+  return B;
+}
+export {
+  H as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/findAll.js

@@ -0,0 +1,15 @@
+const w = (n, s, i, t, c, M) => Math.sqrt((n - t) ** 2 + (s - c) ** 2 + (i - M) ** 2);
+function y(n, s, i, t) {
+  const c = [], M = n - t, x = s - t, e = i - t, l = n + t, f = s + t, _ = i + t;
+  return this.visit((h, a, p, g, q, r, v) => {
+    if (!h.length)
+      do {
+        const o = h.data;
+        w(n, s, i, this._x(o), this._y(o), this._z(o)) <= t && c.push(o);
+      } while (h = h.next);
+    return a > l || p > f || g > _ || q < M || r < x || v < e;
+  }), c;
+}
+export {
+  y as findAllWithinRadius
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/octant.js

@@ -0,0 +1,6 @@
+function o(t, i, s, h, n, a, e) {
+  this.node = t, this.x0 = i, this.y0 = s, this.z0 = h, this.x1 = n, this.y1 = a, this.z1 = e;
+}
+export {
+  o as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/octree.js

@@ -0,0 +1,54 @@
+import l, { addAll as h } from "./add.js";
+import p from "./cover.js";
+import u from "./data.js";
+import c from "./extent.js";
+import v from "./find.js";
+import { findAllWithinRadius as y } from "./findAll.js";
+import x, { removeAll as N } from "./remove.js";
+import A from "./root.js";
+import z from "./size.js";
+import g from "./visit.js";
+import w from "./visitAfter.js";
+import R, { defaultX as W } from "./x.js";
+import O, { defaultY as P } from "./y.js";
+import X, { defaultZ as Y } from "./z.js";
+function Z(e, r, o, a) {
+  var i = new n(r ?? W, o ?? P, a ?? Y, NaN, NaN, NaN, NaN, NaN, NaN);
+  return e == null ? i : i.addAll(e);
+}
+function n(e, r, o, a, i, s, f, m, d) {
+  this._x = e, this._y = r, this._z = o, this._x0 = a, this._y0 = i, this._z0 = s, this._x1 = f, this._y1 = m, this._z1 = d, this._root = void 0;
+}
+function _(e) {
+  for (var r = { data: e.data }, o = r; e = e.next; ) o = o.next = { data: e.data };
+  return r;
+}
+var t = Z.prototype = n.prototype;
+t.copy = function() {
+  var e = new n(this._x, this._y, this._z, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1), r = this._root, o, a;
+  if (!r) return e;
+  if (!r.length) return e._root = _(r), e;
+  for (o = [{ source: r, target: e._root = new Array(8) }]; r = o.pop(); )
+    for (var i = 0; i < 8; ++i)
+      (a = r.source[i]) && (a.length ? o.push({ source: a, target: r.target[i] = new Array(8) }) : r.target[i] = _(a));
+  return e;
+};
+t.add = l;
+t.addAll = h;
+t.cover = p;
+t.data = u;
+t.extent = c;
+t.find = v;
+t.findAllWithinRadius = y;
+t.remove = x;
+t.removeAll = N;
+t.root = A;
+t.size = z;
+t.visit = g;
+t.visitAfter = w;
+t.x = R;
+t.y = O;
+t.z = X;
+export {
+  Z as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/remove.js

@@ -0,0 +1,20 @@
+function b(r) {
+  if (isNaN(z = +this._x.call(null, r)) || isNaN(v = +this._y.call(null, r)) || isNaN(N = +this._z.call(null, r))) return this;
+  var e, t = this._root, l, h, s, u = this._x0, x = this._y0, a = this._z0, _ = this._x1, m = this._y1, y = this._z1, z, v, N, n, f, o, c, g, p, i, d;
+  if (!t) return this;
+  if (t.length) for (; ; ) {
+    if ((c = z >= (n = (u + _) / 2)) ? u = n : _ = n, (g = v >= (f = (x + m) / 2)) ? x = f : m = f, (p = N >= (o = (a + y) / 2)) ? a = o : y = o, e = t, !(t = t[i = p << 2 | g << 1 | c])) return this;
+    if (!t.length) break;
+    (e[i + 1 & 7] || e[i + 2 & 7] || e[i + 3 & 7] || e[i + 4 & 7] || e[i + 5 & 7] || e[i + 6 & 7] || e[i + 7 & 7]) && (l = e, d = i);
+  }
+  for (; t.data !== r; ) if (h = t, !(t = t.next)) return this;
+  return (s = t.next) && delete t.next, h ? (s ? h.next = s : delete h.next, this) : e ? (s ? e[i] = s : delete e[i], (t = e[0] || e[1] || e[2] || e[3] || e[4] || e[5] || e[6] || e[7]) && t === (e[7] || e[6] || e[5] || e[4] || e[3] || e[2] || e[1] || e[0]) && !t.length && (l ? l[d] = t : this._root = t), this) : (this._root = s, this);
+}
+function w(r) {
+  for (var e = 0, t = r.length; e < t; ++e) this.remove(r[e]);
+  return this;
+}
+export {
+  b as default,
+  w as removeAll
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/root.js

@@ -0,0 +1,6 @@
+function t() {
+  return this._root;
+}
+export {
+  t as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/size.js

@@ -0,0 +1,11 @@
+function e() {
+  var i = 0;
+  return this.visit(function(t) {
+    if (!t.length) do
+      ++i;
+    while (t = t.next);
+  }), i;
+}
+export {
+  e as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/visit.js

@@ -0,0 +1,13 @@
+import t from "./octant.js";
+function l(c) {
+  var s = [], e, h = this._root, i, u, o, w, r, _, a;
+  for (h && s.push(new t(h, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1)); e = s.pop(); )
+    if (!c(h = e.node, u = e.x0, o = e.y0, w = e.z0, r = e.x1, _ = e.y1, a = e.z1) && h.length) {
+      var n = (u + r) / 2, f = (o + _) / 2, p = (w + a) / 2;
+      (i = h[7]) && s.push(new t(i, n, f, p, r, _, a)), (i = h[6]) && s.push(new t(i, u, f, p, n, _, a)), (i = h[5]) && s.push(new t(i, n, o, p, r, f, a)), (i = h[4]) && s.push(new t(i, u, o, p, n, f, a)), (i = h[3]) && s.push(new t(i, n, f, w, r, _, p)), (i = h[2]) && s.push(new t(i, u, f, w, n, _, p)), (i = h[1]) && s.push(new t(i, n, o, w, r, f, p)), (i = h[0]) && s.push(new t(i, u, o, w, n, f, p));
+    }
+  return this;
+}
+export {
+  l as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/visitAfter.js

@@ -0,0 +1,18 @@
+import e from "./octant.js";
+function A(g) {
+  var p = [], v = [], t;
+  for (this._root && p.push(new e(this._root, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1)); t = p.pop(); ) {
+    var f = t.node;
+    if (f.length) {
+      var s, i = t.x0, n = t.y0, _ = t.z0, h = t.x1, a = t.y1, o = t.z1, u = (i + h) / 2, r = (n + a) / 2, w = (_ + o) / 2;
+      (s = f[0]) && p.push(new e(s, i, n, _, u, r, w)), (s = f[1]) && p.push(new e(s, u, n, _, h, r, w)), (s = f[2]) && p.push(new e(s, i, r, _, u, a, w)), (s = f[3]) && p.push(new e(s, u, r, _, h, a, w)), (s = f[4]) && p.push(new e(s, i, n, w, u, r, o)), (s = f[5]) && p.push(new e(s, u, n, w, h, r, o)), (s = f[6]) && p.push(new e(s, i, r, w, u, a, o)), (s = f[7]) && p.push(new e(s, u, r, w, h, a, o));
+    }
+    v.push(t);
+  }
+  for (; t = v.pop(); )
+    g(t.node, t.x0, t.y0, t.z0, t.x1, t.y1, t.z1);
+  return this;
+}
+export {
+  A as default
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/x.js

@@ -0,0 +1,10 @@
+function e(t) {
+  return t[0];
+}
+function n(t) {
+  return arguments.length ? (this._x = t, this) : this._x;
+}
+export {
+  n as default,
+  e as defaultX
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/y.js

@@ -0,0 +1,10 @@
+function e(t) {
+  return t[1];
+}
+function n(t) {
+  return arguments.length ? (this._y = t, this) : this._y;
+}
+export {
+  n as default,
+  e as defaultY
+};

package/dist/es/node_modules/.pnpm/d3-octree@1.1.0/node_modules/d3-octree/src/z.js

@@ -0,0 +1,10 @@
+function e(t) {
+  return t[2];
+}
+function n(t) {
+  return arguments.length ? (this._z = t, this) : this._z;
+}
+export {
+  n as default,
+  e as defaultZ
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/add.js

@@ -0,0 +1,29 @@
+function A(i) {
+  const f = +this._x.call(null, i), n = +this._y.call(null, i);
+  return v(this.cover(f, n), f, n, i);
+}
+function v(i, f, n, c) {
+  if (isNaN(f) || isNaN(n)) return i;
+  var l, t = i._root, r = { data: c }, y = i._x0, o = i._y0, s = i._x1, u = i._y1, a, _, e, N, x, d, h, w;
+  if (!t) return i._root = r, i;
+  for (; t.length; )
+    if ((x = f >= (a = (y + s) / 2)) ? y = a : s = a, (d = n >= (_ = (o + u) / 2)) ? o = _ : u = _, l = t, !(t = t[h = d << 1 | x])) return l[h] = r, i;
+  if (e = +i._x.call(null, t.data), N = +i._y.call(null, t.data), f === e && n === N) return r.next = t, l ? l[h] = r : i._root = r, i;
+  do
+    l = l ? l[h] = new Array(4) : i._root = new Array(4), (x = f >= (a = (y + s) / 2)) ? y = a : s = a, (d = n >= (_ = (o + u) / 2)) ? o = _ : u = _;
+  while ((h = d << 1 | x) === (w = (N >= _) << 1 | e >= a));
+  return l[w] = t, l[h] = r, i;
+}
+function p(i) {
+  var f, n, c = i.length, l, t, r = new Array(c), y = new Array(c), o = 1 / 0, s = 1 / 0, u = -1 / 0, a = -1 / 0;
+  for (n = 0; n < c; ++n)
+    isNaN(l = +this._x.call(null, f = i[n])) || isNaN(t = +this._y.call(null, f)) || (r[n] = l, y[n] = t, l < o && (o = l), l > u && (u = l), t < s && (s = t), t > a && (a = t));
+  if (o > u || s > a) return this;
+  for (this.cover(o, s).cover(u, a), n = 0; n < c; ++n)
+    v(this, r[n], y[n], i[n]);
+  return this;
+}
+export {
+  p as addAll,
+  A as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/cover.js

@@ -0,0 +1,28 @@
+function f(a, e) {
+  if (isNaN(a = +a) || isNaN(e = +e)) return this;
+  var t = this._x0, i = this._y0, h = this._x1, r = this._y1;
+  if (isNaN(t))
+    h = (t = Math.floor(a)) + 1, r = (i = Math.floor(e)) + 1;
+  else {
+    for (var s = h - t || 1, o = this._root, _, c; t > a || a >= h || i > e || e >= r; )
+      switch (c = (e < i) << 1 | a < t, _ = new Array(4), _[c] = o, o = _, s *= 2, c) {
+        case 0:
+          h = t + s, r = i + s;
+          break;
+        case 1:
+          t = h - s, r = i + s;
+          break;
+        case 2:
+          h = t + s, i = r - s;
+          break;
+        case 3:
+          t = h - s, i = r - s;
+          break;
+      }
+    this._root && this._root.length && (this._root = o);
+  }
+  return this._x0 = t, this._y0 = i, this._x1 = h, this._y1 = r, this;
+}
+export {
+  f as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/data.js

@@ -0,0 +1,11 @@
+function i() {
+  var a = [];
+  return this.visit(function(t) {
+    if (!t.length) do
+      a.push(t.data);
+    while (t = t.next);
+  }), a;
+}
+export {
+  i as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/extent.js

@@ -0,0 +1,6 @@
+function e(t) {
+  return arguments.length ? this.cover(+t[0][0], +t[0][1]).cover(+t[1][0], +t[1][1]) : isNaN(this._x0) ? void 0 : [[this._x0, this._y0], [this._x1, this._y1]];
+}
+export {
+  e as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/find.js

@@ -0,0 +1,25 @@
+import o from "./quad.js";
+function k(h, i, n) {
+  var I, _ = this._x0, p = this._y0, w, g, s, c, v = this._x1, q = this._y1, t = [], e = this._root, l, u;
+  for (e && t.push(new o(e, _, p, v, q)), n == null ? n = 1 / 0 : (_ = h - n, p = i - n, v = h + n, q = i + n, n *= n); l = t.pop(); )
+    if (!(!(e = l.node) || (w = l.x0) > v || (g = l.y0) > q || (s = l.x1) < _ || (c = l.y1) < p))
+      if (e.length) {
+        var f = (w + s) / 2, a = (g + c) / 2;
+        t.push(
+          new o(e[3], f, a, s, c),
+          new o(e[2], w, a, f, c),
+          new o(e[1], f, g, s, a),
+          new o(e[0], w, g, f, a)
+        ), (u = (i >= a) << 1 | h >= f) && (l = t[t.length - 1], t[t.length - 1] = t[t.length - 1 - u], t[t.length - 1 - u] = l);
+      } else {
+        var M = h - +this._x.call(null, e.data), Q = i - +this._y.call(null, e.data), b = M * M + Q * Q;
+        if (b < n) {
+          var r = Math.sqrt(n = b);
+          _ = h - r, p = i - r, v = h + r, q = i + r, I = e.data;
+        }
+      }
+  return I;
+}
+export {
+  k as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/quad.js

@@ -0,0 +1,6 @@
+function d(t, i, s, h, a) {
+  this.node = t, this.x0 = i, this.y0 = s, this.x1 = h, this.y1 = a;
+}
+export {
+  d as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/quadtree.js

@@ -0,0 +1,50 @@
+import d, { addAll as f } from "./add.js";
+import s from "./cover.js";
+import p from "./data.js";
+import l from "./extent.js";
+import u from "./find.js";
+import h, { removeAll as v } from "./remove.js";
+import y from "./root.js";
+import c from "./size.js";
+import x from "./visit.js";
+import A from "./visitAfter.js";
+import N, { defaultX as g } from "./x.js";
+import w, { defaultY as z } from "./y.js";
+function q(r, t, o) {
+  var i = new n(t ?? g, o ?? z, NaN, NaN, NaN, NaN);
+  return r == null ? i : i.addAll(r);
+}
+function n(r, t, o, i, a, m) {
+  this._x = r, this._y = t, this._x0 = o, this._y0 = i, this._x1 = a, this._y1 = m, this._root = void 0;
+}
+function _(r) {
+  for (var t = { data: r.data }, o = t; r = r.next; ) o = o.next = { data: r.data };
+  return t;
+}
+var e = q.prototype = n.prototype;
+e.copy = function() {
+  var r = new n(this._x, this._y, this._x0, this._y0, this._x1, this._y1), t = this._root, o, i;
+  if (!t) return r;
+  if (!t.length) return r._root = _(t), r;
+  for (o = [{ source: t, target: r._root = new Array(4) }]; t = o.pop(); )
+    for (var a = 0; a < 4; ++a)
+      (i = t.source[a]) && (i.length ? o.push({ source: i, target: t.target[a] = new Array(4) }) : t.target[a] = _(i));
+  return r;
+};
+e.add = d;
+e.addAll = f;
+e.cover = s;
+e.data = p;
+e.extent = l;
+e.find = u;
+e.remove = h;
+e.removeAll = v;
+e.root = y;
+e.size = c;
+e.visit = x;
+e.visitAfter = A;
+e.x = N;
+e.y = w;
+export {
+  q as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/remove.js

@@ -0,0 +1,20 @@
+function c(r) {
+  if (isNaN(_ = +this._x.call(null, r)) || isNaN(y = +this._y.call(null, r))) return this;
+  var t, e = this._root, s, h, n, o = this._x0, u = this._y0, x = this._x1, a = this._y1, _, y, l, f, m, v, i, g;
+  if (!e) return this;
+  if (e.length) for (; ; ) {
+    if ((m = _ >= (l = (o + x) / 2)) ? o = l : x = l, (v = y >= (f = (u + a) / 2)) ? u = f : a = f, t = e, !(e = e[i = v << 1 | m])) return this;
+    if (!e.length) break;
+    (t[i + 1 & 3] || t[i + 2 & 3] || t[i + 3 & 3]) && (s = t, g = i);
+  }
+  for (; e.data !== r; ) if (h = e, !(e = e.next)) return this;
+  return (n = e.next) && delete e.next, h ? (n ? h.next = n : delete h.next, this) : t ? (n ? t[i] = n : delete t[i], (e = t[0] || t[1] || t[2] || t[3]) && e === (t[3] || t[2] || t[1] || t[0]) && !e.length && (s ? s[g] = e : this._root = e), this) : (this._root = n, this);
+}
+function N(r) {
+  for (var t = 0, e = r.length; t < e; ++t) this.remove(r[t]);
+  return this;
+}
+export {
+  c as default,
+  N as removeAll
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/root.js

@@ -0,0 +1,6 @@
+function t() {
+  return this._root;
+}
+export {
+  t as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/size.js

@@ -0,0 +1,11 @@
+function e() {
+  var i = 0;
+  return this.visit(function(t) {
+    if (!t.length) do
+      ++i;
+    while (t = t.next);
+  }), i;
+}
+export {
+  e as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/visit.js

@@ -0,0 +1,13 @@
+import s from "./quad.js";
+function w(a) {
+  var e = [], h, i = this._root, t, n, u, f, o;
+  for (i && e.push(new s(i, this._x0, this._y0, this._x1, this._y1)); h = e.pop(); )
+    if (!a(i = h.node, n = h.x0, u = h.y0, f = h.x1, o = h.y1) && i.length) {
+      var p = (n + f) / 2, r = (u + o) / 2;
+      (t = i[3]) && e.push(new s(t, p, r, f, o)), (t = i[2]) && e.push(new s(t, n, r, p, o)), (t = i[1]) && e.push(new s(t, p, u, f, r)), (t = i[0]) && e.push(new s(t, n, u, p, r));
+    }
+  return this;
+}
+export {
+  w as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/visitAfter.js

@@ -0,0 +1,18 @@
+import p from "./quad.js";
+function v(w) {
+  var e = [], a = [], t;
+  for (this._root && e.push(new p(this._root, this._x0, this._y0, this._x1, this._y1)); t = e.pop(); ) {
+    var i = t.node;
+    if (i.length) {
+      var s, f = t.x0, h = t.y0, n = t.x1, o = t.y1, r = (f + n) / 2, u = (h + o) / 2;
+      (s = i[0]) && e.push(new p(s, f, h, r, u)), (s = i[1]) && e.push(new p(s, r, h, n, u)), (s = i[2]) && e.push(new p(s, f, u, r, o)), (s = i[3]) && e.push(new p(s, r, u, n, o));
+    }
+    a.push(t);
+  }
+  for (; t = a.pop(); )
+    w(t.node, t.x0, t.y0, t.x1, t.y1);
+  return this;
+}
+export {
+  v as default
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/x.js

@@ -0,0 +1,10 @@
+function e(t) {
+  return t[0];
+}
+function n(t) {
+  return arguments.length ? (this._x = t, this) : this._x;
+}
+export {
+  n as default,
+  e as defaultX
+};

package/dist/es/node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/y.js

@@ -0,0 +1,10 @@
+function e(t) {
+  return t[1];
+}
+function n(t) {
+  return arguments.length ? (this._y = t, this) : this._y;
+}
+export {
+  n as default,
+  e as defaultY
+};

package/dist/es/node_modules/.pnpm/d3-scale-chromatic@3.1.0/node_modules/d3-scale-chromatic/src/categorical/Paired.js

@@ -0,0 +1,5 @@
+import f from "../colors.js";
+const e = f("a6cee31f78b4b2df8a33a02cfb9a99e31a1cfdbf6fff7f00cab2d66a3d9affff99b15928");
+export {
+  e as default
+};

package/dist/es/node_modules/.pnpm/d3-scale-chromatic@3.1.0/node_modules/d3-scale-chromatic/src/colors.js

@@ -0,0 +1,7 @@
+function e(l) {
+  for (var n = l.length / 6 | 0, o = new Array(n), r = 0; r < n; ) o[r] = "#" + l.slice(r * 6, ++r * 6);
+  return o;
+}
+export {
+  e as default
+};

package/dist/es/node_modules/.pnpm/d3-scale@4.0.2/node_modules/d3-scale/src/init.js

@@ -0,0 +1,16 @@
+function a(e, t) {
+  switch (arguments.length) {
+    case 0:
+      break;
+    case 1:
+      this.range(e);
+      break;
+    default:
+      this.range(t).domain(e);
+      break;
+  }
+  return this;
+}
+export {
+  a as initRange
+};

package/dist/es/node_modules/.pnpm/d3-scale@4.0.2/node_modules/d3-scale/src/ordinal.js

@@ -0,0 +1,31 @@
+import { initRange as c } from "./init.js";
+import { InternMap as a } from "../../../../internmap@2.0.3/node_modules/internmap/src/index.js";
+const f = Symbol("implicit");
+function l() {
+  var r = new a(), i = [], u = [], o = f;
+  function n(t) {
+    let e = r.get(t);
+    if (e === void 0) {
+      if (o !== f) return o;
+      r.set(t, e = i.push(t) - 1);
+    }
+    return u[e % u.length];
+  }
+  return n.domain = function(t) {
+    if (!arguments.length) return i.slice();
+    i = [], r = new a();
+    for (const e of t)
+      r.has(e) || r.set(e, i.push(e) - 1);
+    return n;
+  }, n.range = function(t) {
+    return arguments.length ? (u = Array.from(t), n) : u.slice();
+  }, n.unknown = function(t) {
+    return arguments.length ? (o = t, n) : o;
+  }, n.copy = function() {
+    return l(i, u).unknown(o);
+  }, c.apply(n, arguments), n;
+}
+export {
+  l as default,
+  f as implicit
+};

package/dist/es/node_modules/.pnpm/d3-selection@3.0.0/node_modules/d3-selection/src/array.js

@@ -0,0 +1,6 @@
+function a(r) {
+  return r == null ? [] : Array.isArray(r) ? r : Array.from(r);
+}
+export {
+  a as default
+};

package/dist/es/node_modules/.pnpm/d3-selection@3.0.0/node_modules/d3-selection/src/constant.js

@@ -0,0 +1,8 @@
+function t(n) {
+  return function() {
+    return n;
+  };
+}
+export {
+  t as default
+};

package/dist/es/node_modules/.pnpm/d3-selection@3.0.0/node_modules/d3-selection/src/creator.js

@@ -0,0 +1,20 @@
+import c from "./namespace.js";
+import { xhtml as n } from "./namespaces.js";
+function o(e) {
+  return function() {
+    var t = this.ownerDocument, r = this.namespaceURI;
+    return r === n && t.documentElement.namespaceURI === n ? t.createElement(e) : t.createElementNS(r, e);
+  };
+}
+function a(e) {
+  return function() {
+    return this.ownerDocument.createElementNS(e.space, e.local);
+  };
+}
+function i(e) {
+  var t = c(e);
+  return (t.local ? a : o)(t);
+}
+export {
+  i as default
+};