@xiping/react-components 1.0.19 → 1.0.20

package/dist/es/node_modules/.pnpm/@tweenjs_tween.js@23.1.3/node_modules/@tweenjs/tween.js/dist/tween.esm.js

@@ -0,0 +1,379 @@
+var g = Object.freeze({
+  Linear: Object.freeze({
+    None: function(t) {
+      return t;
+    },
+    In: function(t) {
+      return t;
+    },
+    Out: function(t) {
+      return t;
+    },
+    InOut: function(t) {
+      return t;
+    }
+  }),
+  Quadratic: Object.freeze({
+    In: function(t) {
+      return t * t;
+    },
+    Out: function(t) {
+      return t * (2 - t);
+    },
+    InOut: function(t) {
+      return (t *= 2) < 1 ? 0.5 * t * t : -0.5 * (--t * (t - 2) - 1);
+    }
+  }),
+  Cubic: Object.freeze({
+    In: function(t) {
+      return t * t * t;
+    },
+    Out: function(t) {
+      return --t * t * t + 1;
+    },
+    InOut: function(t) {
+      return (t *= 2) < 1 ? 0.5 * t * t * t : 0.5 * ((t -= 2) * t * t + 2);
+    }
+  }),
+  Quartic: Object.freeze({
+    In: function(t) {
+      return t * t * t * t;
+    },
+    Out: function(t) {
+      return 1 - --t * t * t * t;
+    },
+    InOut: function(t) {
+      return (t *= 2) < 1 ? 0.5 * t * t * t * t : -0.5 * ((t -= 2) * t * t * t - 2);
+    }
+  }),
+  Quintic: Object.freeze({
+    In: function(t) {
+      return t * t * t * t * t;
+    },
+    Out: function(t) {
+      return --t * t * t * t * t + 1;
+    },
+    InOut: function(t) {
+      return (t *= 2) < 1 ? 0.5 * t * t * t * t * t : 0.5 * ((t -= 2) * t * t * t * t + 2);
+    }
+  }),
+  Sinusoidal: Object.freeze({
+    In: function(t) {
+      return 1 - Math.sin((1 - t) * Math.PI / 2);
+    },
+    Out: function(t) {
+      return Math.sin(t * Math.PI / 2);
+    },
+    InOut: function(t) {
+      return 0.5 * (1 - Math.sin(Math.PI * (0.5 - t)));
+    }
+  }),
+  Exponential: Object.freeze({
+    In: function(t) {
+      return t === 0 ? 0 : Math.pow(1024, t - 1);
+    },
+    Out: function(t) {
+      return t === 1 ? 1 : 1 - Math.pow(2, -10 * t);
+    },
+    InOut: function(t) {
+      return t === 0 ? 0 : t === 1 ? 1 : (t *= 2) < 1 ? 0.5 * Math.pow(1024, t - 1) : 0.5 * (-Math.pow(2, -10 * (t - 1)) + 2);
+    }
+  }),
+  Circular: Object.freeze({
+    In: function(t) {
+      return 1 - Math.sqrt(1 - t * t);
+    },
+    Out: function(t) {
+      return Math.sqrt(1 - --t * t);
+    },
+    InOut: function(t) {
+      return (t *= 2) < 1 ? -0.5 * (Math.sqrt(1 - t * t) - 1) : 0.5 * (Math.sqrt(1 - (t -= 2) * t) + 1);
+    }
+  }),
+  Elastic: Object.freeze({
+    In: function(t) {
+      return t === 0 ? 0 : t === 1 ? 1 : -Math.pow(2, 10 * (t - 1)) * Math.sin((t - 1.1) * 5 * Math.PI);
+    },
+    Out: function(t) {
+      return t === 0 ? 0 : t === 1 ? 1 : Math.pow(2, -10 * t) * Math.sin((t - 0.1) * 5 * Math.PI) + 1;
+    },
+    InOut: function(t) {
+      return t === 0 ? 0 : t === 1 ? 1 : (t *= 2, t < 1 ? -0.5 * Math.pow(2, 10 * (t - 1)) * Math.sin((t - 1.1) * 5 * Math.PI) : 0.5 * Math.pow(2, -10 * (t - 1)) * Math.sin((t - 1.1) * 5 * Math.PI) + 1);
+    }
+  }),
+  Back: Object.freeze({
+    In: function(t) {
+      var i = 1.70158;
+      return t === 1 ? 1 : t * t * ((i + 1) * t - i);
+    },
+    Out: function(t) {
+      var i = 1.70158;
+      return t === 0 ? 0 : --t * t * ((i + 1) * t + i) + 1;
+    },
+    InOut: function(t) {
+      var i = 2.5949095;
+      return (t *= 2) < 1 ? 0.5 * (t * t * ((i + 1) * t - i)) : 0.5 * ((t -= 2) * t * ((i + 1) * t + i) + 2);
+    }
+  }),
+  Bounce: Object.freeze({
+    In: function(t) {
+      return 1 - g.Bounce.Out(1 - t);
+    },
+    Out: function(t) {
+      return t < 0.36363636363636365 ? 7.5625 * t * t : t < 0.7272727272727273 ? 7.5625 * (t -= 0.5454545454545454) * t + 0.75 : t < 0.9090909090909091 ? 7.5625 * (t -= 0.8181818181818182) * t + 0.9375 : 7.5625 * (t -= 0.9545454545454546) * t + 0.984375;
+    },
+    InOut: function(t) {
+      return t < 0.5 ? g.Bounce.In(t * 2) * 0.5 : g.Bounce.Out(t * 2 - 1) * 0.5 + 0.5;
+    }
+  }),
+  generatePow: function(t) {
+    return t === void 0 && (t = 4), t = t < Number.EPSILON ? Number.EPSILON : t, t = t > 1e4 ? 1e4 : t, {
+      In: function(i) {
+        return Math.pow(i, t);
+      },
+      Out: function(i) {
+        return 1 - Math.pow(1 - i, t);
+      },
+      InOut: function(i) {
+        return i < 0.5 ? Math.pow(i * 2, t) / 2 : (1 - Math.pow(2 - i * 2, t)) / 2 + 0.5;
+      }
+    };
+  }
+}), b = function() {
+  return performance.now();
+}, w = (
+  /** @class */
+  function() {
+    function t() {
+      this._tweens = {}, this._tweensAddedDuringUpdate = {};
+    }
+    return t.prototype.getAll = function() {
+      var i = this;
+      return Object.keys(this._tweens).map(function(e) {
+        return i._tweens[e];
+      });
+    }, t.prototype.removeAll = function() {
+      this._tweens = {};
+    }, t.prototype.add = function(i) {
+      this._tweens[i.getId()] = i, this._tweensAddedDuringUpdate[i.getId()] = i;
+    }, t.prototype.remove = function(i) {
+      delete this._tweens[i.getId()], delete this._tweensAddedDuringUpdate[i.getId()];
+    }, t.prototype.update = function(i, e) {
+      i === void 0 && (i = b()), e === void 0 && (e = !1);
+      var r = Object.keys(this._tweens);
+      if (r.length === 0)
+        return !1;
+      for (; r.length > 0; ) {
+        this._tweensAddedDuringUpdate = {};
+        for (var h = 0; h < r.length; h++) {
+          var n = this._tweens[r[h]], s = !e;
+          n && n.update(i, s) === !1 && !e && delete this._tweens[r[h]];
+        }
+        r = Object.keys(this._tweensAddedDuringUpdate);
+      }
+      return !0;
+    }, t;
+  }()
+), O = {
+  Linear: function(t, i) {
+    var e = t.length - 1, r = e * i, h = Math.floor(r), n = O.Utils.Linear;
+    return i < 0 ? n(t[0], t[1], r) : i > 1 ? n(t[e], t[e - 1], e - r) : n(t[h], t[h + 1 > e ? e : h + 1], r - h);
+  },
+  Utils: {
+    Linear: function(t, i, e) {
+      return (i - t) * e + t;
+    }
+  }
+}, P = (
+  /** @class */
+  function() {
+    function t() {
+    }
+    return t.nextId = function() {
+      return t._nextId++;
+    }, t._nextId = 0, t;
+  }()
+), I = new w(), M = (
+  /** @class */
+  function() {
+    function t(i, e) {
+      e === void 0 && (e = I), this._object = i, this._group = e, this._isPaused = !1, this._pauseStart = 0, this._valuesStart = {}, this._valuesEnd = {}, this._valuesStartRepeat = {}, this._duration = 1e3, this._isDynamic = !1, this._initialRepeat = 0, this._repeat = 0, this._yoyo = !1, this._isPlaying = !1, this._reversed = !1, this._delayTime = 0, this._startTime = 0, this._easingFunction = g.Linear.None, this._interpolationFunction = O.Linear, this._chainedTweens = [], this._onStartCallbackFired = !1, this._onEveryStartCallbackFired = !1, this._id = P.nextId(), this._isChainStopped = !1, this._propertiesAreSetUp = !1, this._goToEnd = !1;
+    }
+    return t.prototype.getId = function() {
+      return this._id;
+    }, t.prototype.isPlaying = function() {
+      return this._isPlaying;
+    }, t.prototype.isPaused = function() {
+      return this._isPaused;
+    }, t.prototype.getDuration = function() {
+      return this._duration;
+    }, t.prototype.to = function(i, e) {
+      if (e === void 0 && (e = 1e3), this._isPlaying)
+        throw new Error("Can not call Tween.to() while Tween is already started or paused. Stop the Tween first.");
+      return this._valuesEnd = i, this._propertiesAreSetUp = !1, this._duration = e < 0 ? 0 : e, this;
+    }, t.prototype.duration = function(i) {
+      return i === void 0 && (i = 1e3), this._duration = i < 0 ? 0 : i, this;
+    }, t.prototype.dynamic = function(i) {
+      return i === void 0 && (i = !1), this._isDynamic = i, this;
+    }, t.prototype.start = function(i, e) {
+      if (i === void 0 && (i = b()), e === void 0 && (e = !1), this._isPlaying)
+        return this;
+      if (this._group && this._group.add(this), this._repeat = this._initialRepeat, this._reversed) {
+        this._reversed = !1;
+        for (var r in this._valuesStartRepeat)
+          this._swapEndStartRepeatValues(r), this._valuesStart[r] = this._valuesStartRepeat[r];
+      }
+      if (this._isPlaying = !0, this._isPaused = !1, this._onStartCallbackFired = !1, this._onEveryStartCallbackFired = !1, this._isChainStopped = !1, this._startTime = i, this._startTime += this._delayTime, !this._propertiesAreSetUp || e) {
+        if (this._propertiesAreSetUp = !0, !this._isDynamic) {
+          var h = {};
+          for (var n in this._valuesEnd)
+            h[n] = this._valuesEnd[n];
+          this._valuesEnd = h;
+        }
+        this._setupProperties(this._object, this._valuesStart, this._valuesEnd, this._valuesStartRepeat, e);
+      }
+      return this;
+    }, t.prototype.startFromCurrentValues = function(i) {
+      return this.start(i, !0);
+    }, t.prototype._setupProperties = function(i, e, r, h, n) {
+      for (var s in r) {
+        var a = i[s], f = Array.isArray(a), l = f ? "array" : typeof a, _ = !f && Array.isArray(r[s]);
+        if (!(l === "undefined" || l === "function")) {
+          if (_) {
+            var u = r[s];
+            if (u.length === 0)
+              continue;
+            for (var S = [a], d = 0, p = u.length; d < p; d += 1) {
+              var C = this._handleRelativeValue(a, u[d]);
+              if (isNaN(C)) {
+                _ = !1, console.warn("Found invalid interpolation list. Skipping.");
+                break;
+              }
+              S.push(C);
+            }
+            _ && (r[s] = S);
+          }
+          if ((l === "object" || f) && a && !_) {
+            e[s] = f ? [] : {};
+            var v = a;
+            for (var c in v)
+              e[s][c] = v[c];
+            h[s] = f ? [] : {};
+            var u = r[s];
+            if (!this._isDynamic) {
+              var y = {};
+              for (var c in u)
+                y[c] = u[c];
+              r[s] = u = y;
+            }
+            this._setupProperties(v, e[s], u, h[s], n);
+          } else
+            (typeof e[s] > "u" || n) && (e[s] = a), f || (e[s] *= 1), _ ? h[s] = r[s].slice().reverse() : h[s] = e[s] || 0;
+        }
+      }
+    }, t.prototype.stop = function() {
+      return this._isChainStopped || (this._isChainStopped = !0, this.stopChainedTweens()), this._isPlaying ? (this._group && this._group.remove(this), this._isPlaying = !1, this._isPaused = !1, this._onStopCallback && this._onStopCallback(this._object), this) : this;
+    }, t.prototype.end = function() {
+      return this._goToEnd = !0, this.update(1 / 0), this;
+    }, t.prototype.pause = function(i) {
+      return i === void 0 && (i = b()), this._isPaused || !this._isPlaying ? this : (this._isPaused = !0, this._pauseStart = i, this._group && this._group.remove(this), this);
+    }, t.prototype.resume = function(i) {
+      return i === void 0 && (i = b()), !this._isPaused || !this._isPlaying ? this : (this._isPaused = !1, this._startTime += i - this._pauseStart, this._pauseStart = 0, this._group && this._group.add(this), this);
+    }, t.prototype.stopChainedTweens = function() {
+      for (var i = 0, e = this._chainedTweens.length; i < e; i++)
+        this._chainedTweens[i].stop();
+      return this;
+    }, t.prototype.group = function(i) {
+      return i === void 0 && (i = I), this._group = i, this;
+    }, t.prototype.delay = function(i) {
+      return i === void 0 && (i = 0), this._delayTime = i, this;
+    }, t.prototype.repeat = function(i) {
+      return i === void 0 && (i = 0), this._initialRepeat = i, this._repeat = i, this;
+    }, t.prototype.repeatDelay = function(i) {
+      return this._repeatDelayTime = i, this;
+    }, t.prototype.yoyo = function(i) {
+      return i === void 0 && (i = !1), this._yoyo = i, this;
+    }, t.prototype.easing = function(i) {
+      return i === void 0 && (i = g.Linear.None), this._easingFunction = i, this;
+    }, t.prototype.interpolation = function(i) {
+      return i === void 0 && (i = O.Linear), this._interpolationFunction = i, this;
+    }, t.prototype.chain = function() {
+      for (var i = [], e = 0; e < arguments.length; e++)
+        i[e] = arguments[e];
+      return this._chainedTweens = i, this;
+    }, t.prototype.onStart = function(i) {
+      return this._onStartCallback = i, this;
+    }, t.prototype.onEveryStart = function(i) {
+      return this._onEveryStartCallback = i, this;
+    }, t.prototype.onUpdate = function(i) {
+      return this._onUpdateCallback = i, this;
+    }, t.prototype.onRepeat = function(i) {
+      return this._onRepeatCallback = i, this;
+    }, t.prototype.onComplete = function(i) {
+      return this._onCompleteCallback = i, this;
+    }, t.prototype.onStop = function(i) {
+      return this._onStopCallback = i, this;
+    }, t.prototype.update = function(i, e) {
+      var r = this, h;
+      if (i === void 0 && (i = b()), e === void 0 && (e = !0), this._isPaused)
+        return !0;
+      var n, s = this._startTime + this._duration;
+      if (!this._goToEnd && !this._isPlaying) {
+        if (i > s)
+          return !1;
+        e && this.start(i, !0);
+      }
+      if (this._goToEnd = !1, i < this._startTime)
+        return !0;
+      this._onStartCallbackFired === !1 && (this._onStartCallback && this._onStartCallback(this._object), this._onStartCallbackFired = !0), this._onEveryStartCallbackFired === !1 && (this._onEveryStartCallback && this._onEveryStartCallback(this._object), this._onEveryStartCallbackFired = !0);
+      var a = i - this._startTime, f = this._duration + ((h = this._repeatDelayTime) !== null && h !== void 0 ? h : this._delayTime), l = this._duration + this._repeat * f, _ = function() {
+        if (r._duration === 0 || a > l)
+          return 1;
+        var v = Math.trunc(a / f), c = a - v * f, y = Math.min(c / r._duration, 1);
+        return y === 0 && a === r._duration ? 1 : y;
+      }, u = _(), S = this._easingFunction(u);
+      if (this._updateProperties(this._object, this._valuesStart, this._valuesEnd, S), this._onUpdateCallback && this._onUpdateCallback(this._object, u), this._duration === 0 || a >= this._duration)
+        if (this._repeat > 0) {
+          var d = Math.min(Math.trunc((a - this._duration) / f) + 1, this._repeat);
+          isFinite(this._repeat) && (this._repeat -= d);
+          for (n in this._valuesStartRepeat)
+            !this._yoyo && typeof this._valuesEnd[n] == "string" && (this._valuesStartRepeat[n] = // eslint-disable-next-line
+            // @ts-ignore FIXME?
+            this._valuesStartRepeat[n] + parseFloat(this._valuesEnd[n])), this._yoyo && this._swapEndStartRepeatValues(n), this._valuesStart[n] = this._valuesStartRepeat[n];
+          return this._yoyo && (this._reversed = !this._reversed), this._startTime += f * d, this._onRepeatCallback && this._onRepeatCallback(this._object), this._onEveryStartCallbackFired = !1, !0;
+        } else {
+          this._onCompleteCallback && this._onCompleteCallback(this._object);
+          for (var p = 0, C = this._chainedTweens.length; p < C; p++)
+            this._chainedTweens[p].start(this._startTime + this._duration, !1);
+          return this._isPlaying = !1, !1;
+        }
+      return !0;
+    }, t.prototype._updateProperties = function(i, e, r, h) {
+      for (var n in r)
+        if (e[n] !== void 0) {
+          var s = e[n] || 0, a = r[n], f = Array.isArray(i[n]), l = Array.isArray(a), _ = !f && l;
+          _ ? i[n] = this._interpolationFunction(a, h) : typeof a == "object" && a ? this._updateProperties(i[n], s, a, h) : (a = this._handleRelativeValue(s, a), typeof a == "number" && (i[n] = s + (a - s) * h));
+        }
+    }, t.prototype._handleRelativeValue = function(i, e) {
+      return typeof e != "string" ? e : e.charAt(0) === "+" || e.charAt(0) === "-" ? i + parseFloat(e) : parseFloat(e);
+    }, t.prototype._swapEndStartRepeatValues = function(i) {
+      var e = this._valuesStartRepeat[i], r = this._valuesEnd[i];
+      typeof r == "string" ? this._valuesStartRepeat[i] = this._valuesStartRepeat[i] + parseFloat(r) : this._valuesStartRepeat[i] = this._valuesEnd[i], this._valuesEnd[i] = e;
+    }, t;
+  }()
+);
+P.nextId;
+var o = I;
+o.getAll.bind(o);
+o.removeAll.bind(o);
+o.add.bind(o);
+o.remove.bind(o);
+o.update.bind(o);
+export {
+  g as Easing,
+  w as Group,
+  O as Interpolation,
+  P as Sequence,
+  M as Tween,
+  b as now
+};

package/dist/es/node_modules/.pnpm/accessor-fn@1.5.3/node_modules/accessor-fn/dist/accessor-fn.js

@@ -0,0 +1,10 @@
+var r = function(n) {
+  return typeof n == "function" ? n : typeof n == "string" ? function(t) {
+    return t[n];
+  } : function(t) {
+    return n;
+  };
+};
+export {
+  r as default
+};

package/dist/es/node_modules/.pnpm/d3-array@1.2.4/node_modules/d3-array/src/ascending.js

@@ -0,0 +1,6 @@
+function t(n, e) {
+  return n < e ? -1 : n > e ? 1 : n >= e ? 0 : NaN;
+}
+export {
+  t as default
+};

package/dist/es/node_modules/.pnpm/d3-array@1.2.4/node_modules/d3-array/src/bisect.js

@@ -0,0 +1,3 @@
+import o from "./ascending.js";
+import r from "./bisector.js";
+r(o);

package/dist/es/node_modules/.pnpm/d3-array@1.2.4/node_modules/d3-array/src/bisector.js

@@ -0,0 +1,27 @@
+import i from "./ascending.js";
+function s(e) {
+  return e.length === 1 && (e = l(e)), {
+    left: function(f, u, n, t) {
+      for (n == null && (n = 0), t == null && (t = f.length); n < t; ) {
+        var r = n + t >>> 1;
+        e(f[r], u) < 0 ? n = r + 1 : t = r;
+      }
+      return n;
+    },
+    right: function(f, u, n, t) {
+      for (n == null && (n = 0), t == null && (t = f.length); n < t; ) {
+        var r = n + t >>> 1;
+        e(f[r], u) > 0 ? t = r : n = r + 1;
+      }
+      return n;
+    }
+  };
+}
+function l(e) {
+  return function(f, u) {
+    return i(e(f), u);
+  };
+}
+export {
+  s as default
+};

package/dist/es/node_modules/.pnpm/d3-array@1.2.4/node_modules/d3-array/src/max.js

@@ -0,0 +1,17 @@
+function r(n, t) {
+  var h = n.length, l = -1, i, f;
+  if (t == null) {
+    for (; ++l < h; )
+      if ((i = n[l]) != null && i >= i)
+        for (f = i; ++l < h; )
+          (i = n[l]) != null && i > f && (f = i);
+  } else
+    for (; ++l < h; )
+      if ((i = t(n[l], l, n)) != null && i >= i)
+        for (f = i; ++l < h; )
+          (i = t(n[l], l, n)) != null && i > f && (f = i);
+  return f;
+}
+export {
+  r as default
+};

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

@@ -0,0 +1,17 @@
+function r(l, t) {
+  var h = l.length, n = -1, i, f;
+  if (t == null) {
+    for (; ++n < h; )
+      if ((i = l[n]) != null && i >= i)
+        for (f = i; ++n < h; )
+          (i = l[n]) != null && f > i && (f = i);
+  } else
+    for (; ++n < h; )
+      if ((i = t(l[n], n, l)) != null && i >= i)
+        for (f = i; ++n < h; )
+          (i = t(l[n], n, l)) != null && f > i && (f = i);
+  return f;
+}
+export {
+  r 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
+};