@xiping/react-components 1.0.19 → 1.0.21

package/dist/es/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/min.js

@@ -0,0 +1,15 @@
+function l(i, d) {
+  let n;
+  if (d === void 0)
+    for (const e of i)
+      e != null && (n > e || n === void 0 && e >= e) && (n = e);
+  else {
+    let e = -1;
+    for (let f of i)
+      (f = d(f, ++e, i)) != null && (n > f || n === void 0 && f >= f) && (n = f);
+  }
+  return n;
+}
+export {
+  l as default
+};

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/src/add.js

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

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/src/binarytree.js

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

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/src/cover.js

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

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/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-binarytree@1.0.2/node_modules/d3-binarytree/src/extent.js

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

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/src/find.js

@@ -0,0 +1,20 @@
+import r from "./half.js";
+function w(n, l) {
+  var _, i = this._x0, o, p, f = this._x1, e = [], t = this._root, h, s;
+  for (t && e.push(new r(t, i, f)), l == null ? l = 1 / 0 : (i = n - l, f = n + l); h = e.pop(); )
+    if (!(!(t = h.node) || (o = h.x0) > f || (p = h.x1) < i))
+      if (t.length) {
+        var g = (o + p) / 2;
+        e.push(
+          new r(t[1], g, p),
+          new r(t[0], o, g)
+        ), (s = +(n >= g)) && (h = e[e.length - 1], e[e.length - 1] = e[e.length - 1 - s], e[e.length - 1 - s] = h);
+      } else {
+        var a = Math.abs(n - +this._x.call(null, t.data));
+        a < l && (l = a, i = n - a, f = n + a, _ = t.data);
+      }
+  return _;
+}
+export {
+  w as default
+};

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/src/half.js

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

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/src/remove.js

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

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/src/root.js

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

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/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-binarytree@1.0.2/node_modules/d3-binarytree/src/visit.js

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

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/src/visitAfter.js

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

package/dist/es/node_modules/.pnpm/d3-binarytree@1.0.2/node_modules/d3-binarytree/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-dispatch@3.0.1/node_modules/d3-dispatch/src/dispatch.js

@@ -0,0 +1,64 @@
+var a = { value: () => {
+} };
+function l() {
+  for (var n = 0, t = arguments.length, r = {}, e; n < t; ++n) {
+    if (!(e = arguments[n] + "") || e in r || /[\s.]/.test(e)) throw new Error("illegal type: " + e);
+    r[e] = [];
+  }
+  return new f(r);
+}
+function f(n) {
+  this._ = n;
+}
+function h(n, t) {
+  return n.trim().split(/^|\s+/).map(function(r) {
+    var e = "", o = r.indexOf(".");
+    if (o >= 0 && (e = r.slice(o + 1), r = r.slice(0, o)), r && !t.hasOwnProperty(r)) throw new Error("unknown type: " + r);
+    return { type: r, name: e };
+  });
+}
+f.prototype = l.prototype = {
+  constructor: f,
+  on: function(n, t) {
+    var r = this._, e = h(n + "", r), o, u = -1, i = e.length;
+    if (arguments.length < 2) {
+      for (; ++u < i; ) if ((o = (n = e[u]).type) && (o = w(r[o], n.name))) return o;
+      return;
+    }
+    if (t != null && typeof t != "function") throw new Error("invalid callback: " + t);
+    for (; ++u < i; )
+      if (o = (n = e[u]).type) r[o] = s(r[o], n.name, t);
+      else if (t == null) for (o in r) r[o] = s(r[o], n.name, null);
+    return this;
+  },
+  copy: function() {
+    var n = {}, t = this._;
+    for (var r in t) n[r] = t[r].slice();
+    return new f(n);
+  },
+  call: function(n, t) {
+    if ((o = arguments.length - 2) > 0) for (var r = new Array(o), e = 0, o, u; e < o; ++e) r[e] = arguments[e + 2];
+    if (!this._.hasOwnProperty(n)) throw new Error("unknown type: " + n);
+    for (u = this._[n], e = 0, o = u.length; e < o; ++e) u[e].value.apply(t, r);
+  },
+  apply: function(n, t, r) {
+    if (!this._.hasOwnProperty(n)) throw new Error("unknown type: " + n);
+    for (var e = this._[n], o = 0, u = e.length; o < u; ++o) e[o].value.apply(t, r);
+  }
+};
+function w(n, t) {
+  for (var r = 0, e = n.length, o; r < e; ++r)
+    if ((o = n[r]).name === t)
+      return o.value;
+}
+function s(n, t, r) {
+  for (var e = 0, o = n.length; e < o; ++e)
+    if (n[e].name === t) {
+      n[e] = a, n = n.slice(0, e).concat(n.slice(e + 1));
+      break;
+    }
+  return r != null && n.push({ name: t, value: r }), n;
+}
+export {
+  l as default
+};

package/dist/es/node_modules/.pnpm/d3-force-3d@3.0.6/node_modules/d3-force-3d/src/center.js

@@ -0,0 +1,25 @@
+function c(r, u, f) {
+  var a, i = 1;
+  r == null && (r = 0), u == null && (u = 0), f == null && (f = 0);
+  function t() {
+    var n, o = a.length, e, l = 0, g = 0, s = 0;
+    for (n = 0; n < o; ++n)
+      e = a[n], l += e.x || 0, g += e.y || 0, s += e.z || 0;
+    for (l = (l / o - r) * i, g = (g / o - u) * i, s = (s / o - f) * i, n = 0; n < o; ++n)
+      e = a[n], l && (e.x -= l), g && (e.y -= g), s && (e.z -= s);
+  }
+  return t.initialize = function(n) {
+    a = n;
+  }, t.x = function(n) {
+    return arguments.length ? (r = +n, t) : r;
+  }, t.y = function(n) {
+    return arguments.length ? (u = +n, t) : u;
+  }, t.z = function(n) {
+    return arguments.length ? (f = +n, t) : f;
+  }, t.strength = function(n) {
+    return arguments.length ? (i = +n, t) : i;
+  }, t;
+}
+export {
+  c as default
+};

package/dist/es/node_modules/.pnpm/d3-force-3d@3.0.6/node_modules/d3-force-3d/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-force-3d@3.0.6/node_modules/d3-force-3d/src/jiggle.js

@@ -0,0 +1,6 @@
+function t(e) {
+  return (e() - 0.5) * 1e-6;
+}
+export {
+  t as default
+};

package/dist/es/node_modules/.pnpm/d3-force-3d@3.0.6/node_modules/d3-force-3d/src/lcg.js

@@ -0,0 +1,7 @@
+function c() {
+  let t = 1;
+  return () => (t = (1664525 * t + 1013904223) % 4294967296) / 4294967296;
+}
+export {
+  c as default
+};

package/dist/es/node_modules/.pnpm/d3-force-3d@3.0.6/node_modules/d3-force-3d/src/link.js

@@ -0,0 +1,58 @@
+import S from "./constant.js";
+import q from "./jiggle.js";
+function G(e) {
+  return e.index;
+}
+function C(e, m) {
+  var x = e.get(m);
+  if (!x) throw new Error("node not found: " + m);
+  return x;
+}
+function J(e) {
+  var m = G, x = F, z, A = S(30), M, d, g, a, j, w, D = 1;
+  e == null && (e = []);
+  function F(n) {
+    return 1 / Math.min(a[n.source.index], a[n.target.index]);
+  }
+  function i(n) {
+    for (var o = 0, u = e.length; o < D; ++o)
+      for (var c = 0, t, r, f, y = 0, p = 0, s = 0, h, v; c < u; ++c)
+        t = e[c], r = t.source, f = t.target, y = f.x + f.vx - r.x - r.vx || q(w), g > 1 && (p = f.y + f.vy - r.y - r.vy || q(w)), g > 2 && (s = f.z + f.vz - r.z - r.vz || q(w)), h = Math.sqrt(y * y + p * p + s * s), h = (h - M[c]) / h * n * z[c], y *= h, p *= h, s *= h, f.vx -= y * (v = j[c]), g > 1 && (f.vy -= p * v), g > 2 && (f.vz -= s * v), r.vx += y * (v = 1 - v), g > 1 && (r.vy += p * v), g > 2 && (r.vz += s * v);
+  }
+  function B() {
+    if (d) {
+      var n, o = d.length, u = e.length, c = new Map(d.map((r, f) => [m(r, f, d), r])), t;
+      for (n = 0, a = new Array(o); n < u; ++n)
+        t = e[n], t.index = n, typeof t.source != "object" && (t.source = C(c, t.source)), typeof t.target != "object" && (t.target = C(c, t.target)), a[t.source.index] = (a[t.source.index] || 0) + 1, a[t.target.index] = (a[t.target.index] || 0) + 1;
+      for (n = 0, j = new Array(u); n < u; ++n)
+        t = e[n], j[n] = a[t.source.index] / (a[t.source.index] + a[t.target.index]);
+      z = new Array(u), E(), M = new Array(u), L();
+    }
+  }
+  function E() {
+    if (d)
+      for (var n = 0, o = e.length; n < o; ++n)
+        z[n] = +x(e[n], n, e);
+  }
+  function L() {
+    if (d)
+      for (var n = 0, o = e.length; n < o; ++n)
+        M[n] = +A(e[n], n, e);
+  }
+  return i.initialize = function(n, ...o) {
+    d = n, w = o.find((u) => typeof u == "function") || Math.random, g = o.find((u) => [1, 2, 3].includes(u)) || 2, B();
+  }, i.links = function(n) {
+    return arguments.length ? (e = n, B(), i) : e;
+  }, i.id = function(n) {
+    return arguments.length ? (m = n, i) : m;
+  }, i.iterations = function(n) {
+    return arguments.length ? (D = +n, i) : D;
+  }, i.strength = function(n) {
+    return arguments.length ? (x = typeof n == "function" ? n : S(+n), E(), i) : x;
+  }, i.distance = function(n) {
+    return arguments.length ? (A = typeof n == "function" ? n : S(+n), L(), i) : A;
+  }, i;
+}
+export {
+  J as default
+};

package/dist/es/node_modules/.pnpm/d3-force-3d@3.0.6/node_modules/d3-force-3d/src/manyBody.js

@@ -0,0 +1,58 @@
+import A from "./constant.js";
+import y from "./jiggle.js";
+import { x as w, y as j, z as D } from "./simulation.js";
+import I from "../../../../d3-binarytree@1.0.2/node_modules/d3-binarytree/src/binarytree.js";
+import k from "../../../../d3-quadtree@3.0.1/node_modules/d3-quadtree/src/quadtree.js";
+import E from "../../../../d3-octree@1.1.0/node_modules/d3-octree/src/octree.js";
+function O() {
+  var s, i, h, e, g, d = A(-30), M, m = 1, p = 1 / 0, q = 0.81;
+  function c(n) {
+    var f, t = s.length, v = (i === 1 ? I(s, w) : i === 2 ? k(s, w, j) : i === 3 ? E(s, w, j, D) : null).visitAfter(B);
+    for (g = n, f = 0; f < t; ++f) h = s[f], v.visit(C);
+  }
+  function b() {
+    if (s) {
+      var n, f = s.length, t;
+      for (M = new Array(f), n = 0; n < f; ++n) t = s[n], M[t.index] = +d(t, n, s);
+    }
+  }
+  function B(n) {
+    var f = 0, t, v, x = 0, z, u, l, r, o = n.length;
+    if (o) {
+      for (z = u = l = r = 0; r < o; ++r)
+        (t = n[r]) && (v = Math.abs(t.value)) && (f += t.value, x += v, z += v * (t.x || 0), u += v * (t.y || 0), l += v * (t.z || 0));
+      f *= Math.sqrt(4 / o), n.x = z / x, i > 1 && (n.y = u / x), i > 2 && (n.z = l / x);
+    } else {
+      t = n, t.x = t.data.x, i > 1 && (t.y = t.data.y), i > 2 && (t.z = t.data.z);
+      do
+        f += M[t.data.index];
+      while (t = t.next);
+    }
+    n.value = f;
+  }
+  function C(n, f, t, v, x) {
+    if (!n.value) return !0;
+    var z = [t, v, x][i - 1], u = n.x - h.x, l = i > 1 ? n.y - h.y : 0, r = i > 2 ? n.z - h.z : 0, o = z - f, a = u * u + l * l + r * r;
+    if (o * o / q < a)
+      return a < p && (u === 0 && (u = y(e), a += u * u), i > 1 && l === 0 && (l = y(e), a += l * l), i > 2 && r === 0 && (r = y(e), a += r * r), a < m && (a = Math.sqrt(m * a)), h.vx += u * n.value * g / a, i > 1 && (h.vy += l * n.value * g / a), i > 2 && (h.vz += r * n.value * g / a)), !0;
+    if (n.length || a >= p) return;
+    (n.data !== h || n.next) && (u === 0 && (u = y(e), a += u * u), i > 1 && l === 0 && (l = y(e), a += l * l), i > 2 && r === 0 && (r = y(e), a += r * r), a < m && (a = Math.sqrt(m * a)));
+    do
+      n.data !== h && (o = M[n.data.index] * g / a, h.vx += u * o, i > 1 && (h.vy += l * o), i > 2 && (h.vz += r * o));
+    while (n = n.next);
+  }
+  return c.initialize = function(n, ...f) {
+    s = n, e = f.find((t) => typeof t == "function") || Math.random, i = f.find((t) => [1, 2, 3].includes(t)) || 2, b();
+  }, c.strength = function(n) {
+    return arguments.length ? (d = typeof n == "function" ? n : A(+n), b(), c) : d;
+  }, c.distanceMin = function(n) {
+    return arguments.length ? (m = n * n, c) : Math.sqrt(m);
+  }, c.distanceMax = function(n) {
+    return arguments.length ? (p = n * n, c) : Math.sqrt(p);
+  }, c.theta = function(n) {
+    return arguments.length ? (q = n * n, c) : Math.sqrt(q);
+  }, c;
+}
+export {
+  O as default
+};

package/dist/es/node_modules/.pnpm/d3-force-3d@3.0.6/node_modules/d3-force-3d/src/radial.js

@@ -0,0 +1,34 @@
+import c from "./constant.js";
+function D(f, u, o, l) {
+  var r, g, s = c(0.1), h, a;
+  typeof f != "function" && (f = c(+f)), u == null && (u = 0), o == null && (o = 0), l == null && (l = 0);
+  function t(n) {
+    for (var e = 0, v = r.length; e < v; ++e) {
+      var i = r[e], p = i.x - u || 1e-6, w = (i.y || 0) - o || 1e-6, y = (i.z || 0) - l || 1e-6, N = Math.sqrt(p * p + w * w + y * y), A = (a[e] - N) * h[e] * n / N;
+      i.vx += p * A, g > 1 && (i.vy += w * A), g > 2 && (i.vz += y * A);
+    }
+  }
+  function m() {
+    if (r) {
+      var n, e = r.length;
+      for (h = new Array(e), a = new Array(e), n = 0; n < e; ++n)
+        a[n] = +f(r[n], n, r), h[n] = isNaN(a[n]) ? 0 : +s(r[n], n, r);
+    }
+  }
+  return t.initialize = function(n, ...e) {
+    r = n, g = e.find((v) => [1, 2, 3].includes(v)) || 2, m();
+  }, t.strength = function(n) {
+    return arguments.length ? (s = typeof n == "function" ? n : c(+n), m(), t) : s;
+  }, t.radius = function(n) {
+    return arguments.length ? (f = typeof n == "function" ? n : c(+n), m(), t) : f;
+  }, t.x = function(n) {
+    return arguments.length ? (u = +n, t) : u;
+  }, t.y = function(n) {
+    return arguments.length ? (o = +n, t) : o;
+  }, t.z = function(n) {
+    return arguments.length ? (l = +n, t) : l;
+  }, t;
+}
+export {
+  D as default
+};

package/dist/es/node_modules/.pnpm/d3-force-3d@3.0.6/node_modules/d3-force-3d/src/simulation.js

@@ -0,0 +1,95 @@
+import T from "./lcg.js";
+import { timer as b } from "../../../../d3-timer@3.0.1/node_modules/d3-timer/src/timer.js";
+import F from "../../../../d3-dispatch@3.0.1/node_modules/d3-dispatch/src/dispatch.js";
+var P = 3;
+function G(a) {
+  return a.x;
+}
+function H(a) {
+  return a.y;
+}
+function J(a) {
+  return a.z;
+}
+var O = 10, X = Math.PI * (3 - Math.sqrt(5)), Y = Math.PI * 20 / (9 + Math.sqrt(221));
+function K(a, o) {
+  o = o || 2;
+  var r = Math.min(P, Math.max(1, Math.round(o))), f, h = 1, g = 1e-3, x = 1 - Math.pow(g, 1 / 300), p = 0, s = 0.6, c = /* @__PURE__ */ new Map(), m = b(S), v = F("tick", "end"), z = T();
+  a == null && (a = []);
+  function S() {
+    k(), v.call("tick", f), h < g && (m.stop(), v.call("end", f));
+  }
+  function k(t) {
+    var u, i = a.length, n;
+    t === void 0 && (t = 1);
+    for (var l = 0; l < t; ++l)
+      for (h += (p - h) * x, c.forEach(function(e) {
+        e(h);
+      }), u = 0; u < i; ++u)
+        n = a[u], n.fx == null ? n.x += n.vx *= s : (n.x = n.fx, n.vx = 0), r > 1 && (n.fy == null ? n.y += n.vy *= s : (n.y = n.fy, n.vy = 0)), r > 2 && (n.fz == null ? n.z += n.vz *= s : (n.z = n.fz, n.vz = 0));
+    return f;
+  }
+  function q() {
+    for (var t = 0, u = a.length, i; t < u; ++t) {
+      if (i = a[t], i.index = t, i.fx != null && (i.x = i.fx), i.fy != null && (i.y = i.fy), i.fz != null && (i.z = i.fz), isNaN(i.x) || r > 1 && isNaN(i.y) || r > 2 && isNaN(i.z)) {
+        var n = O * (r > 2 ? Math.cbrt(0.5 + t) : r > 1 ? Math.sqrt(0.5 + t) : t), l = t * X, e = t * Y;
+        r === 1 ? i.x = n : r === 2 ? (i.x = n * Math.cos(l), i.y = n * Math.sin(l)) : (i.x = n * Math.sin(l) * Math.cos(e), i.y = n * Math.cos(l), i.z = n * Math.sin(l) * Math.sin(e));
+      }
+      (isNaN(i.vx) || r > 1 && isNaN(i.vy) || r > 2 && isNaN(i.vz)) && (i.vx = 0, r > 1 && (i.vy = 0), r > 2 && (i.vz = 0));
+    }
+  }
+  function M(t) {
+    return t.initialize && t.initialize(a, z, r), t;
+  }
+  return q(), f = {
+    tick: k,
+    restart: function() {
+      return m.restart(S), f;
+    },
+    stop: function() {
+      return m.stop(), f;
+    },
+    numDimensions: function(t) {
+      return arguments.length ? (r = Math.min(P, Math.max(1, Math.round(t))), c.forEach(M), f) : r;
+    },
+    nodes: function(t) {
+      return arguments.length ? (a = t, q(), c.forEach(M), f) : a;
+    },
+    alpha: function(t) {
+      return arguments.length ? (h = +t, f) : h;
+    },
+    alphaMin: function(t) {
+      return arguments.length ? (g = +t, f) : g;
+    },
+    alphaDecay: function(t) {
+      return arguments.length ? (x = +t, f) : +x;
+    },
+    alphaTarget: function(t) {
+      return arguments.length ? (p = +t, f) : p;
+    },
+    velocityDecay: function(t) {
+      return arguments.length ? (s = 1 - t, f) : 1 - s;
+    },
+    randomSource: function(t) {
+      return arguments.length ? (z = t, c.forEach(M), f) : z;
+    },
+    force: function(t, u) {
+      return arguments.length > 1 ? (u == null ? c.delete(t) : c.set(t, M(u)), f) : c.get(t);
+    },
+    find: function() {
+      var t = Array.prototype.slice.call(arguments), u = t.shift() || 0, i = (r > 1 ? t.shift() : null) || 0, n = (r > 2 ? t.shift() : null) || 0, l = t.shift() || 1 / 0, e = 0, R = a.length, N, D, E, I, y, w;
+      for (l *= l, e = 0; e < R; ++e)
+        y = a[e], N = u - y.x, D = i - (y.y || 0), E = n - (y.z || 0), I = N * N + D * D + E * E, I < l && (w = y, l = I);
+      return w;
+    },
+    on: function(t, u) {
+      return arguments.length > 1 ? (v.on(t, u), f) : v.on(t);
+    }
+  };
+}
+export {
+  K as default,
+  G as x,
+  H as y,
+  J as z
+};

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

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