@undp/data-viz 1.2.8 → 1.3.1

package/dist/y-D0sAaVii.js

@@ -0,0 +1,421 @@
+import { t as B, d as C } from "./timer-B39XOBYL.js";
+function F(t) {
+  const n = +this._x.call(null, t), i = +this._y.call(null, t);
+  return $(this.cover(n, i), n, i, t);
+}
+function $(t, n, i, a) {
+  if (isNaN(n) || isNaN(i)) return t;
+  var f, o = t._root, u = { data: a }, e = t._x0, l = t._y0, r = t._x1, y = t._y1, p, _, h, x, s, g, c, v;
+  if (!o) return t._root = u, t;
+  for (; o.length; )
+    if ((s = n >= (p = (e + r) / 2)) ? e = p : r = p, (g = i >= (_ = (l + y) / 2)) ? l = _ : y = _, f = o, !(o = o[c = g << 1 | s])) return f[c] = u, t;
+  if (h = +t._x.call(null, o.data), x = +t._y.call(null, o.data), n === h && i === x) return u.next = o, f ? f[c] = u : t._root = u, t;
+  do
+    f = f ? f[c] = new Array(4) : t._root = new Array(4), (s = n >= (p = (e + r) / 2)) ? e = p : r = p, (g = i >= (_ = (l + y) / 2)) ? l = _ : y = _;
+  while ((c = g << 1 | s) === (v = (x >= _) << 1 | h >= p));
+  return f[v] = o, f[c] = u, t;
+}
+function R(t) {
+  var n, i, a = t.length, f, o, u = new Array(a), e = new Array(a), l = 1 / 0, r = 1 / 0, y = -1 / 0, p = -1 / 0;
+  for (i = 0; i < a; ++i)
+    isNaN(f = +this._x.call(null, n = t[i])) || isNaN(o = +this._y.call(null, n)) || (u[i] = f, e[i] = o, f < l && (l = f), f > y && (y = f), o < r && (r = o), o > p && (p = o));
+  if (l > y || r > p) return this;
+  for (this.cover(l, r).cover(y, p), i = 0; i < a; ++i)
+    $(this, u[i], e[i], t[i]);
+  return this;
+}
+function G(t, n) {
+  if (isNaN(t = +t) || isNaN(n = +n)) return this;
+  var i = this._x0, a = this._y0, f = this._x1, o = this._y1;
+  if (isNaN(i))
+    f = (i = Math.floor(t)) + 1, o = (a = Math.floor(n)) + 1;
+  else {
+    for (var u = f - i || 1, e = this._root, l, r; i > t || t >= f || a > n || n >= o; )
+      switch (r = (n < a) << 1 | t < i, l = new Array(4), l[r] = e, e = l, u *= 2, r) {
+        case 0:
+          f = i + u, o = a + u;
+          break;
+        case 1:
+          i = f - u, o = a + u;
+          break;
+        case 2:
+          f = i + u, a = o - u;
+          break;
+        case 3:
+          i = f - u, a = o - u;
+          break;
+      }
+    this._root && this._root.length && (this._root = e);
+  }
+  return this._x0 = i, this._y0 = a, this._x1 = f, this._y1 = o, this;
+}
+function H() {
+  var t = [];
+  return this.visit(function(n) {
+    if (!n.length) do
+      t.push(n.data);
+    while (n = n.next);
+  }), t;
+}
+function J(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]];
+}
+function M(t, n, i, a, f) {
+  this.node = t, this.x0 = n, this.y0 = i, this.x1 = a, this.y1 = f;
+}
+function K(t, n, i) {
+  var a, f = this._x0, o = this._y0, u, e, l, r, y = this._x1, p = this._y1, _ = [], h = this._root, x, s;
+  for (h && _.push(new M(h, f, o, y, p)), i == null ? i = 1 / 0 : (f = t - i, o = n - i, y = t + i, p = n + i, i *= i); x = _.pop(); )
+    if (!(!(h = x.node) || (u = x.x0) > y || (e = x.y0) > p || (l = x.x1) < f || (r = x.y1) < o))
+      if (h.length) {
+        var g = (u + l) / 2, c = (e + r) / 2;
+        _.push(
+          new M(h[3], g, c, l, r),
+          new M(h[2], u, c, g, r),
+          new M(h[1], g, e, l, c),
+          new M(h[0], u, e, g, c)
+        ), (s = (n >= c) << 1 | t >= g) && (x = _[_.length - 1], _[_.length - 1] = _[_.length - 1 - s], _[_.length - 1 - s] = x);
+      } else {
+        var v = t - +this._x.call(null, h.data), N = n - +this._y.call(null, h.data), w = v * v + N * N;
+        if (w < i) {
+          var b = Math.sqrt(i = w);
+          f = t - b, o = n - b, y = t + b, p = n + b, a = h.data;
+        }
+      }
+  return a;
+}
+function L(t) {
+  if (isNaN(y = +this._x.call(null, t)) || isNaN(p = +this._y.call(null, t))) return this;
+  var n, i = this._root, a, f, o, u = this._x0, e = this._y0, l = this._x1, r = this._y1, y, p, _, h, x, s, g, c;
+  if (!i) return this;
+  if (i.length) for (; ; ) {
+    if ((x = y >= (_ = (u + l) / 2)) ? u = _ : l = _, (s = p >= (h = (e + r) / 2)) ? e = h : r = h, n = i, !(i = i[g = s << 1 | x])) return this;
+    if (!i.length) break;
+    (n[g + 1 & 3] || n[g + 2 & 3] || n[g + 3 & 3]) && (a = n, c = g);
+  }
+  for (; i.data !== t; ) if (f = i, !(i = i.next)) return this;
+  return (o = i.next) && delete i.next, f ? (o ? f.next = o : delete f.next, this) : n ? (o ? n[g] = o : delete n[g], (i = n[0] || n[1] || n[2] || n[3]) && i === (n[3] || n[2] || n[1] || n[0]) && !i.length && (a ? a[c] = i : this._root = i), this) : (this._root = o, this);
+}
+function O(t) {
+  for (var n = 0, i = t.length; n < i; ++n) this.remove(t[n]);
+  return this;
+}
+function U() {
+  return this._root;
+}
+function V() {
+  var t = 0;
+  return this.visit(function(n) {
+    if (!n.length) do
+      ++t;
+    while (n = n.next);
+  }), t;
+}
+function W(t) {
+  var n = [], i, a = this._root, f, o, u, e, l;
+  for (a && n.push(new M(a, this._x0, this._y0, this._x1, this._y1)); i = n.pop(); )
+    if (!t(a = i.node, o = i.x0, u = i.y0, e = i.x1, l = i.y1) && a.length) {
+      var r = (o + e) / 2, y = (u + l) / 2;
+      (f = a[3]) && n.push(new M(f, r, y, e, l)), (f = a[2]) && n.push(new M(f, o, y, r, l)), (f = a[1]) && n.push(new M(f, r, u, e, y)), (f = a[0]) && n.push(new M(f, o, u, r, y));
+    }
+  return this;
+}
+function Z(t) {
+  var n = [], i = [], a;
+  for (this._root && n.push(new M(this._root, this._x0, this._y0, this._x1, this._y1)); a = n.pop(); ) {
+    var f = a.node;
+    if (f.length) {
+      var o, u = a.x0, e = a.y0, l = a.x1, r = a.y1, y = (u + l) / 2, p = (e + r) / 2;
+      (o = f[0]) && n.push(new M(o, u, e, y, p)), (o = f[1]) && n.push(new M(o, y, e, l, p)), (o = f[2]) && n.push(new M(o, u, p, y, r)), (o = f[3]) && n.push(new M(o, y, p, l, r));
+    }
+    i.push(a);
+  }
+  for (; a = i.pop(); )
+    t(a.node, a.x0, a.y0, a.x1, a.y1);
+  return this;
+}
+function q(t) {
+  return t[0];
+}
+function tt(t) {
+  return arguments.length ? (this._x = t, this) : this._x;
+}
+function nt(t) {
+  return t[1];
+}
+function it(t) {
+  return arguments.length ? (this._y = t, this) : this._y;
+}
+function S(t, n, i) {
+  var a = new T(n ?? q, i ?? nt, NaN, NaN, NaN, NaN);
+  return t == null ? a : a.addAll(t);
+}
+function T(t, n, i, a, f, o) {
+  this._x = t, this._y = n, this._x0 = i, this._y0 = a, this._x1 = f, this._y1 = o, this._root = void 0;
+}
+function X(t) {
+  for (var n = { data: t.data }, i = n; t = t.next; ) i = i.next = { data: t.data };
+  return n;
+}
+var A = S.prototype = T.prototype;
+A.copy = function() {
+  var t = new T(this._x, this._y, this._x0, this._y0, this._x1, this._y1), n = this._root, i, a;
+  if (!n) return t;
+  if (!n.length) return t._root = X(n), t;
+  for (i = [{ source: n, target: t._root = new Array(4) }]; n = i.pop(); )
+    for (var f = 0; f < 4; ++f)
+      (a = n.source[f]) && (a.length ? i.push({ source: a, target: n.target[f] = new Array(4) }) : n.target[f] = X(a));
+  return t;
+};
+A.add = F;
+A.addAll = R;
+A.cover = G;
+A.data = H;
+A.extent = J;
+A.find = K;
+A.remove = L;
+A.removeAll = O;
+A.root = U;
+A.size = V;
+A.visit = W;
+A.visitAfter = Z;
+A.x = tt;
+A.y = it;
+function d(t) {
+  return function() {
+    return t;
+  };
+}
+function E(t) {
+  return (t() - 0.5) * 1e-6;
+}
+function et(t) {
+  return t.x + t.vx;
+}
+function rt(t) {
+  return t.y + t.vy;
+}
+function yt(t) {
+  var n, i, a, f = 1, o = 1;
+  typeof t != "function" && (t = d(t == null ? 1 : +t));
+  function u() {
+    for (var r, y = n.length, p, _, h, x, s, g, c = 0; c < o; ++c)
+      for (p = S(n, et, rt).visitAfter(e), r = 0; r < y; ++r)
+        _ = n[r], s = i[_.index], g = s * s, h = _.x + _.vx, x = _.y + _.vy, p.visit(v);
+    function v(N, w, b, P, D) {
+      var z = N.data, Q = N.r, m = s + Q;
+      if (z) {
+        if (z.index > _.index) {
+          var k = h - z.x - z.vx, j = x - z.y - z.vy, I = k * k + j * j;
+          I < m * m && (k === 0 && (k = E(a), I += k * k), j === 0 && (j = E(a), I += j * j), I = (m - (I = Math.sqrt(I))) / I * f, _.vx += (k *= I) * (m = (Q *= Q) / (g + Q)), _.vy += (j *= I) * m, z.vx -= k * (m = 1 - m), z.vy -= j * m);
+        }
+        return;
+      }
+      return w > h + m || P < h - m || b > x + m || D < x - m;
+    }
+  }
+  function e(r) {
+    if (r.data) return r.r = i[r.data.index];
+    for (var y = r.r = 0; y < 4; ++y)
+      r[y] && r[y].r > r.r && (r.r = r[y].r);
+  }
+  function l() {
+    if (n) {
+      var r, y = n.length, p;
+      for (i = new Array(y), r = 0; r < y; ++r) p = n[r], i[p.index] = +t(p, r, n);
+    }
+  }
+  return u.initialize = function(r, y) {
+    n = r, a = y, l();
+  }, u.iterations = function(r) {
+    return arguments.length ? (o = +r, u) : o;
+  }, u.strength = function(r) {
+    return arguments.length ? (f = +r, u) : f;
+  }, u.radius = function(r) {
+    return arguments.length ? (t = typeof r == "function" ? r : d(+r), l(), u) : t;
+  }, u;
+}
+const ft = 1664525, at = 1013904223, Y = 4294967296;
+function ot() {
+  let t = 1;
+  return () => (t = (ft * t + at) % Y) / Y;
+}
+function st(t) {
+  return t.x;
+}
+function ht(t) {
+  return t.y;
+}
+var ut = 10, lt = Math.PI * (3 - Math.sqrt(5));
+function vt(t) {
+  var n, i = 1, a = 1e-3, f = 1 - Math.pow(a, 1 / 300), o = 0, u = 0.6, e = /* @__PURE__ */ new Map(), l = B(p), r = C("tick", "end"), y = ot();
+  t == null && (t = []);
+  function p() {
+    _(), r.call("tick", n), i < a && (l.stop(), r.call("end", n));
+  }
+  function _(s) {
+    var g, c = t.length, v;
+    s === void 0 && (s = 1);
+    for (var N = 0; N < s; ++N)
+      for (i += (o - i) * f, e.forEach(function(w) {
+        w(i);
+      }), g = 0; g < c; ++g)
+        v = t[g], v.fx == null ? v.x += v.vx *= u : (v.x = v.fx, v.vx = 0), v.fy == null ? v.y += v.vy *= u : (v.y = v.fy, v.vy = 0);
+    return n;
+  }
+  function h() {
+    for (var s = 0, g = t.length, c; s < g; ++s) {
+      if (c = t[s], c.index = s, c.fx != null && (c.x = c.fx), c.fy != null && (c.y = c.fy), isNaN(c.x) || isNaN(c.y)) {
+        var v = ut * Math.sqrt(0.5 + s), N = s * lt;
+        c.x = v * Math.cos(N), c.y = v * Math.sin(N);
+      }
+      (isNaN(c.vx) || isNaN(c.vy)) && (c.vx = c.vy = 0);
+    }
+  }
+  function x(s) {
+    return s.initialize && s.initialize(t, y), s;
+  }
+  return h(), n = {
+    tick: _,
+    restart: function() {
+      return l.restart(p), n;
+    },
+    stop: function() {
+      return l.stop(), n;
+    },
+    nodes: function(s) {
+      return arguments.length ? (t = s, h(), e.forEach(x), n) : t;
+    },
+    alpha: function(s) {
+      return arguments.length ? (i = +s, n) : i;
+    },
+    alphaMin: function(s) {
+      return arguments.length ? (a = +s, n) : a;
+    },
+    alphaDecay: function(s) {
+      return arguments.length ? (f = +s, n) : +f;
+    },
+    alphaTarget: function(s) {
+      return arguments.length ? (o = +s, n) : o;
+    },
+    velocityDecay: function(s) {
+      return arguments.length ? (u = 1 - s, n) : 1 - u;
+    },
+    randomSource: function(s) {
+      return arguments.length ? (y = s, e.forEach(x), n) : y;
+    },
+    force: function(s, g) {
+      return arguments.length > 1 ? (g == null ? e.delete(s) : e.set(s, x(g)), n) : e.get(s);
+    },
+    find: function(s, g, c) {
+      var v = 0, N = t.length, w, b, P, D, z;
+      for (c == null ? c = 1 / 0 : c *= c, v = 0; v < N; ++v)
+        D = t[v], w = s - D.x, b = g - D.y, P = w * w + b * b, P < c && (z = D, c = P);
+      return z;
+    },
+    on: function(s, g) {
+      return arguments.length > 1 ? (r.on(s, g), n) : r.on(s);
+    }
+  };
+}
+function gt() {
+  var t, n, i, a, f = d(-30), o, u = 1, e = 1 / 0, l = 0.81;
+  function r(h) {
+    var x, s = t.length, g = S(t, st, ht).visitAfter(p);
+    for (a = h, x = 0; x < s; ++x) n = t[x], g.visit(_);
+  }
+  function y() {
+    if (t) {
+      var h, x = t.length, s;
+      for (o = new Array(x), h = 0; h < x; ++h) s = t[h], o[s.index] = +f(s, h, t);
+    }
+  }
+  function p(h) {
+    var x = 0, s, g, c = 0, v, N, w;
+    if (h.length) {
+      for (v = N = w = 0; w < 4; ++w)
+        (s = h[w]) && (g = Math.abs(s.value)) && (x += s.value, c += g, v += g * s.x, N += g * s.y);
+      h.x = v / c, h.y = N / c;
+    } else {
+      s = h, s.x = s.data.x, s.y = s.data.y;
+      do
+        x += o[s.data.index];
+      while (s = s.next);
+    }
+    h.value = x;
+  }
+  function _(h, x, s, g) {
+    if (!h.value) return !0;
+    var c = h.x - n.x, v = h.y - n.y, N = g - x, w = c * c + v * v;
+    if (N * N / l < w)
+      return w < e && (c === 0 && (c = E(i), w += c * c), v === 0 && (v = E(i), w += v * v), w < u && (w = Math.sqrt(u * w)), n.vx += c * h.value * a / w, n.vy += v * h.value * a / w), !0;
+    if (h.length || w >= e) return;
+    (h.data !== n || h.next) && (c === 0 && (c = E(i), w += c * c), v === 0 && (v = E(i), w += v * v), w < u && (w = Math.sqrt(u * w)));
+    do
+      h.data !== n && (N = o[h.data.index] * a / w, n.vx += c * N, n.vy += v * N);
+    while (h = h.next);
+  }
+  return r.initialize = function(h, x) {
+    t = h, i = x, y();
+  }, r.strength = function(h) {
+    return arguments.length ? (f = typeof h == "function" ? h : d(+h), y(), r) : f;
+  }, r.distanceMin = function(h) {
+    return arguments.length ? (u = h * h, r) : Math.sqrt(u);
+  }, r.distanceMax = function(h) {
+    return arguments.length ? (e = h * h, r) : Math.sqrt(e);
+  }, r.theta = function(h) {
+    return arguments.length ? (l = h * h, r) : Math.sqrt(l);
+  }, r;
+}
+function xt(t) {
+  var n = d(0.1), i, a, f;
+  typeof t != "function" && (t = d(t == null ? 0 : +t));
+  function o(e) {
+    for (var l = 0, r = i.length, y; l < r; ++l)
+      y = i[l], y.vx += (f[l] - y.x) * a[l] * e;
+  }
+  function u() {
+    if (i) {
+      var e, l = i.length;
+      for (a = new Array(l), f = new Array(l), e = 0; e < l; ++e)
+        a[e] = isNaN(f[e] = +t(i[e], e, i)) ? 0 : +n(i[e], e, i);
+    }
+  }
+  return o.initialize = function(e) {
+    i = e, u();
+  }, o.strength = function(e) {
+    return arguments.length ? (n = typeof e == "function" ? e : d(+e), u(), o) : n;
+  }, o.x = function(e) {
+    return arguments.length ? (t = typeof e == "function" ? e : d(+e), u(), o) : t;
+  }, o;
+}
+function _t(t) {
+  var n = d(0.1), i, a, f;
+  typeof t != "function" && (t = d(t == null ? 0 : +t));
+  function o(e) {
+    for (var l = 0, r = i.length, y; l < r; ++l)
+      y = i[l], y.vy += (f[l] - y.y) * a[l] * e;
+  }
+  function u() {
+    if (i) {
+      var e, l = i.length;
+      for (a = new Array(l), f = new Array(l), e = 0; e < l; ++e)
+        a[e] = isNaN(f[e] = +t(i[e], e, i)) ? 0 : +n(i[e], e, i);
+    }
+  }
+  return o.initialize = function(e) {
+    i = e, u();
+  }, o.strength = function(e) {
+    return arguments.length ? (n = typeof e == "function" ? e : d(+e), u(), o) : n;
+  }, o.y = function(e) {
+    return arguments.length ? (t = typeof e == "function" ? e : d(+e), u(), o) : t;
+  }, o;
+}
+export {
+  _t as a,
+  xt as b,
+  yt as c,
+  gt as d,
+  vt as f
+};
+//# sourceMappingURL=y-D0sAaVii.js.map

package/dist/y-D0sAaVii.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"y-D0sAaVii.js","sources":["../node_modules/d3-quadtree/src/add.js","../node_modules/d3-quadtree/src/cover.js","../node_modules/d3-quadtree/src/data.js","../node_modules/d3-quadtree/src/extent.js","../node_modules/d3-quadtree/src/quad.js","../node_modules/d3-quadtree/src/find.js","../node_modules/d3-quadtree/src/remove.js","../node_modules/d3-quadtree/src/root.js","../node_modules/d3-quadtree/src/size.js","../node_modules/d3-quadtree/src/visit.js","../node_modules/d3-quadtree/src/visitAfter.js","../node_modules/d3-quadtree/src/x.js","../node_modules/d3-quadtree/src/y.js","../node_modules/d3-quadtree/src/quadtree.js","../node_modules/d3-force/src/constant.js","../node_modules/d3-force/src/jiggle.js","../node_modules/d3-force/src/collide.js","../node_modules/d3-force/src/lcg.js","../node_modules/d3-force/src/simulation.js","../node_modules/d3-force/src/manyBody.js","../node_modules/d3-force/src/x.js","../node_modules/d3-force/src/y.js"],"sourcesContent":["export default function(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d);\n  return add(this.cover(x, y), x, y, d);\n}\n\nfunction add(tree, x, y, d) {\n  if (isNaN(x) || isNaN(y)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      xm,\n      ym,\n      xp,\n      yp,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (parent = node, !(node = node[i = bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  if (x === xp && y === yp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(4) : tree._root = new Array(4);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n  } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n  var d, i, n = data.length,\n      x,\n      y,\n      xz = new Array(n),\n      yz = new Array(n),\n      x0 = Infinity,\n      y0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (i = 0; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0).cover(x1, y1);\n\n  // Add the new points.\n  for (i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], data[i]);\n  }\n\n  return this;\n}\n","export default function(x, y) {\n  if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1;\n\n  // If the quadtree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing quadrant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var z = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1) {\n      i = (y < y0) << 1 | (x < x0);\n      parent = new Array(4), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z, y1 = y0 + z; break;\n        case 1: x0 = x1 - z, y1 = y0 + z; break;\n        case 2: x1 = x0 + z, y0 = y1 - z; break;\n        case 3: x0 = x1 - z, y0 = y1 - z; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  return this;\n}\n","export default function() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n","export default function(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];\n}\n","export default function(node, x0, y0, x1, y1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.x1 = x1;\n  this.y1 = y1;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(x, y, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1,\n      y1,\n      x2,\n      y2,\n      x3 = this._x1,\n      y3 = this._y1,\n      quads = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) quads.push(new Quad(node, x0, y0, x3, y3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius;\n    x3 = x + radius, y3 = y + radius;\n    radius *= radius;\n  }\n\n  while (q = quads.pop()) {\n\n    // Stop searching if this quadrant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0) continue;\n\n    // Bisect the current quadrant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2;\n\n      quads.push(\n        new Quad(node[3], xm, ym, x2, y2),\n        new Quad(node[2], x1, ym, xm, y2),\n        new Quad(node[1], xm, y1, x2, ym),\n        new Quad(node[0], x1, y1, xm, ym)\n      );\n\n      // Visit the closest quadrant first.\n      if (i = (y >= ym) << 1 | (x >= xm)) {\n        q = quads[quads.length - 1];\n        quads[quads.length - 1] = quads[quads.length - 1 - i];\n        quads[quads.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          d2 = dx * dx + dy * dy;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d;\n        x3 = x + d, y3 = y + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n","export default function(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1,\n      x,\n      y,\n      xm,\n      ym,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (!(parent = node, node = node[i = bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3])\n      && node === (parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nexport function removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n","export default function() {\n  return this._root;\n}\n","export default function() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], q, node = this._root, child, x0, y0, x1, y1;\n  if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n    }\n  }\n  return this;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], next = [], q;\n  if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.x1, q.y1);\n  }\n  return this;\n}\n","export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\n\nexport default function quadtree(nodes, x, y) {\n  var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Quadtree(x, y, x0, y0, x1, y1) {\n  this._x = x;\n  this._y = y;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = quadtree.prototype = Quadtree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(4)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 4; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\n","export default function(x) {\n  return function() {\n    return x;\n  };\n}\n","export default function(random) {\n  return (random() - 0.5) * 1e-6;\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction x(d) {\n  return d.x + d.vx;\n}\n\nfunction y(d) {\n  return d.y + d.vy;\n}\n\nexport default function(radius) {\n  var nodes,\n      radii,\n      random,\n      strength = 1,\n      iterations = 1;\n\n  if (typeof radius !== \"function\") radius = constant(radius == null ? 1 : +radius);\n\n  function force() {\n    var i, n = nodes.length,\n        tree,\n        node,\n        xi,\n        yi,\n        ri,\n        ri2;\n\n    for (var k = 0; k < iterations; ++k) {\n      tree = quadtree(nodes, x, y).visitAfter(prepare);\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        ri = radii[node.index], ri2 = ri * ri;\n        xi = node.x + node.vx;\n        yi = node.y + node.vy;\n        tree.visit(apply);\n      }\n    }\n\n    function apply(quad, x0, y0, x1, y1) {\n      var data = quad.data, rj = quad.r, r = ri + rj;\n      if (data) {\n        if (data.index > node.index) {\n          var x = xi - data.x - data.vx,\n              y = yi - data.y - data.vy,\n              l = x * x + y * y;\n          if (l < r * r) {\n            if (x === 0) x = jiggle(random), l += x * x;\n            if (y === 0) y = jiggle(random), l += y * y;\n            l = (r - (l = Math.sqrt(l))) / l * strength;\n            node.vx += (x *= l) * (r = (rj *= rj) / (ri2 + rj));\n            node.vy += (y *= l) * r;\n            data.vx -= x * (r = 1 - r);\n            data.vy -= y * r;\n          }\n        }\n        return;\n      }\n      return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r;\n    }\n  }\n\n  function prepare(quad) {\n    if (quad.data) return quad.r = radii[quad.data.index];\n    for (var i = quad.r = 0; i < 4; ++i) {\n      if (quad[i] && quad[i].r > quad.r) {\n        quad.r = quad[i].r;\n      }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    radii = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], radii[node.index] = +radius(node, i, nodes);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.iterations = function(_) {\n    return arguments.length ? (iterations = +_, force) : iterations;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  force.radius = function(_) {\n    return arguments.length ? (radius = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : radius;\n  };\n\n  return force;\n}\n","// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport default function() {\n  let s = 1;\n  return () => (s = (a * s + c) % m) / m;\n}\n","import {dispatch} from \"d3-dispatch\";\nimport {timer} from \"d3-timer\";\nimport lcg from \"./lcg.js\";\n\nexport function x(d) {\n  return d.x;\n}\n\nexport function y(d) {\n  return d.y;\n}\n\nvar initialRadius = 10,\n    initialAngle = Math.PI * (3 - Math.sqrt(5));\n\nexport default function(nodes) {\n  var simulation,\n      alpha = 1,\n      alphaMin = 0.001,\n      alphaDecay = 1 - Math.pow(alphaMin, 1 / 300),\n      alphaTarget = 0,\n      velocityDecay = 0.6,\n      forces = new Map(),\n      stepper = timer(step),\n      event = dispatch(\"tick\", \"end\"),\n      random = lcg();\n\n  if (nodes == null) nodes = [];\n\n  function step() {\n    tick();\n    event.call(\"tick\", simulation);\n    if (alpha < alphaMin) {\n      stepper.stop();\n      event.call(\"end\", simulation);\n    }\n  }\n\n  function tick(iterations) {\n    var i, n = nodes.length, node;\n\n    if (iterations === undefined) iterations = 1;\n\n    for (var k = 0; k < iterations; ++k) {\n      alpha += (alphaTarget - alpha) * alphaDecay;\n\n      forces.forEach(function(force) {\n        force(alpha);\n      });\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        if (node.fx == null) node.x += node.vx *= velocityDecay;\n        else node.x = node.fx, node.vx = 0;\n        if (node.fy == null) node.y += node.vy *= velocityDecay;\n        else node.y = node.fy, node.vy = 0;\n      }\n    }\n\n    return simulation;\n  }\n\n  function initializeNodes() {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.index = i;\n      if (node.fx != null) node.x = node.fx;\n      if (node.fy != null) node.y = node.fy;\n      if (isNaN(node.x) || isNaN(node.y)) {\n        var radius = initialRadius * Math.sqrt(0.5 + i), angle = i * initialAngle;\n        node.x = radius * Math.cos(angle);\n        node.y = radius * Math.sin(angle);\n      }\n      if (isNaN(node.vx) || isNaN(node.vy)) {\n        node.vx = node.vy = 0;\n      }\n    }\n  }\n\n  function initializeForce(force) {\n    if (force.initialize) force.initialize(nodes, random);\n    return force;\n  }\n\n  initializeNodes();\n\n  return simulation = {\n    tick: tick,\n\n    restart: function() {\n      return stepper.restart(step), simulation;\n    },\n\n    stop: function() {\n      return stepper.stop(), simulation;\n    },\n\n    nodes: function(_) {\n      return arguments.length ? (nodes = _, initializeNodes(), forces.forEach(initializeForce), simulation) : nodes;\n    },\n\n    alpha: function(_) {\n      return arguments.length ? (alpha = +_, simulation) : alpha;\n    },\n\n    alphaMin: function(_) {\n      return arguments.length ? (alphaMin = +_, simulation) : alphaMin;\n    },\n\n    alphaDecay: function(_) {\n      return arguments.length ? (alphaDecay = +_, simulation) : +alphaDecay;\n    },\n\n    alphaTarget: function(_) {\n      return arguments.length ? (alphaTarget = +_, simulation) : alphaTarget;\n    },\n\n    velocityDecay: function(_) {\n      return arguments.length ? (velocityDecay = 1 - _, simulation) : 1 - velocityDecay;\n    },\n\n    randomSource: function(_) {\n      return arguments.length ? (random = _, forces.forEach(initializeForce), simulation) : random;\n    },\n\n    force: function(name, _) {\n      return arguments.length > 1 ? ((_ == null ? forces.delete(name) : forces.set(name, initializeForce(_))), simulation) : forces.get(name);\n    },\n\n    find: function(x, y, radius) {\n      var i = 0,\n          n = nodes.length,\n          dx,\n          dy,\n          d2,\n          node,\n          closest;\n\n      if (radius == null) radius = Infinity;\n      else radius *= radius;\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        dx = x - node.x;\n        dy = y - node.y;\n        d2 = dx * dx + dy * dy;\n        if (d2 < radius) closest = node, radius = d2;\n      }\n\n      return closest;\n    },\n\n    on: function(name, _) {\n      return arguments.length > 1 ? (event.on(name, _), simulation) : event.on(name);\n    }\n  };\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\nimport {x, y} from \"./simulation.js\";\n\nexport default function() {\n  var nodes,\n      node,\n      random,\n      alpha,\n      strength = constant(-30),\n      strengths,\n      distanceMin2 = 1,\n      distanceMax2 = Infinity,\n      theta2 = 0.81;\n\n  function force(_) {\n    var i, n = nodes.length, tree = quadtree(nodes, x, y).visitAfter(accumulate);\n    for (alpha = _, i = 0; i < n; ++i) node = nodes[i], tree.visit(apply);\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    strengths = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], strengths[node.index] = +strength(node, i, nodes);\n  }\n\n  function accumulate(quad) {\n    var strength = 0, q, c, weight = 0, x, y, i;\n\n    // For internal nodes, accumulate forces from child quadrants.\n    if (quad.length) {\n      for (x = y = i = 0; i < 4; ++i) {\n        if ((q = quad[i]) && (c = Math.abs(q.value))) {\n          strength += q.value, weight += c, x += c * q.x, y += c * q.y;\n        }\n      }\n      quad.x = x / weight;\n      quad.y = y / weight;\n    }\n\n    // For leaf nodes, accumulate forces from coincident quadrants.\n    else {\n      q = quad;\n      q.x = q.data.x;\n      q.y = q.data.y;\n      do strength += strengths[q.data.index];\n      while (q = q.next);\n    }\n\n    quad.value = strength;\n  }\n\n  function apply(quad, x1, _, x2) {\n    if (!quad.value) return true;\n\n    var x = quad.x - node.x,\n        y = quad.y - node.y,\n        w = x2 - x1,\n        l = x * x + y * y;\n\n    // Apply the Barnes-Hut approximation if possible.\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (w * w / theta2 < l) {\n      if (l < distanceMax2) {\n        if (x === 0) x = jiggle(random), l += x * x;\n        if (y === 0) y = jiggle(random), l += y * y;\n        if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n        node.vx += x * quad.value * alpha / l;\n        node.vy += y * quad.value * alpha / l;\n      }\n      return true;\n    }\n\n    // Otherwise, process points directly.\n    else if (quad.length || l >= distanceMax2) return;\n\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (quad.data !== node || quad.next) {\n      if (x === 0) x = jiggle(random), l += x * x;\n      if (y === 0) y = jiggle(random), l += y * y;\n      if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n    }\n\n    do if (quad.data !== node) {\n      w = strengths[quad.data.index] * alpha / l;\n      node.vx += x * w;\n      node.vy += y * w;\n    } while (quad = quad.next);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.distanceMin = function(_) {\n    return arguments.length ? (distanceMin2 = _ * _, force) : Math.sqrt(distanceMin2);\n  };\n\n  force.distanceMax = function(_) {\n    return arguments.length ? (distanceMax2 = _ * _, force) : Math.sqrt(distanceMax2);\n  };\n\n  force.theta = function(_) {\n    return arguments.length ? (theta2 = _ * _, force) : Math.sqrt(theta2);\n  };\n\n  return force;\n}\n","import constant from \"./constant.js\";\n\nexport default function(x) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      xz;\n\n  if (typeof x !== \"function\") x = constant(x == null ? 0 : +x);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vx += (xz[i] - node.x) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    xz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(xz[i] = +x(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : x;\n  };\n\n  return force;\n}\n","import constant from \"./constant.js\";\n\nexport default function(y) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      yz;\n\n  if (typeof y !== \"function\") y = constant(y == null ? 0 : +y);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vy += (yz[i] - node.y) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    yz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(yz[i] = +y(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : y;\n  };\n\n  return force;\n}\n"],"names":["tree_add","d","x","y","add","tree","parent","node","leaf","x0","y0","x1","y1","xm","ym","xp","yp","right","bottom","i","j","addAll","data","n","xz","yz","tree_cover","z","tree_data","tree_extent","_","Quad","tree_find","radius","x2","y2","x3","y3","quads","q","dx","dy","d2","tree_remove","retainer","previous","next","removeAll","tree_root","tree_size","size","tree_visit","callback","child","tree_visitAfter","defaultX","tree_x","defaultY","tree_y","quadtree","nodes","Quadtree","leaf_copy","copy","treeProto","tree_addAll","tree_removeAll","constant","jiggle","random","forceCollide","radii","strength","iterations","force","xi","yi","ri","ri2","k","prepare","apply","quad","rj","r","l","initialize","_nodes","_random","a","c","m","lcg","s","initialRadius","initialAngle","forceSimulation","simulation","alpha","alphaMin","alphaDecay","alphaTarget","velocityDecay","forces","stepper","timer","step","event","dispatch","tick","initializeNodes","angle","initializeForce","name","closest","forceManyBody","strengths","distanceMin2","distanceMax2","theta2","accumulate","weight","w","forceX","forceY"],"mappings":";AAAe,SAAAA,EAASC,GAAG;AACzB,QAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,GAC3BE,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC;AAC7B,SAAOG,EAAI,KAAK,MAAMF,GAAGC,CAAC,GAAGD,GAAGC,GAAGF,CAAC;AACtC;AAEA,SAASG,EAAIC,GAAMH,GAAGC,GAAGF,GAAG;AAC1B,MAAI,MAAMC,CAAC,KAAK,MAAMC,CAAC,EAAG,QAAOE;AAEjC,MAAIC,GACAC,IAAOF,EAAK,OACZG,IAAO,EAAC,MAAMP,EAAC,GACfQ,IAAKJ,EAAK,KACVK,IAAKL,EAAK,KACVM,IAAKN,EAAK,KACVO,IAAKP,EAAK,KACVQ,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,MAAI,CAACb,EAAM,QAAOF,EAAK,QAAQG,GAAMH;AAGrC,SAAOE,EAAK;AAGV,SAFIU,IAAQf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDK,IAASf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,GACvDR,IAASC,GAAM,EAAEA,IAAOA,EAAKY,IAAID,KAAU,IAAID,CAAK,GAAI,QAAOX,EAAOa,CAAC,IAAIX,GAAMH;AAMvF,MAFAU,IAAK,CAACV,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAClCS,IAAK,CAACX,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAC9BL,MAAMa,KAAMZ,MAAMa,EAAI,QAAOR,EAAK,OAAOD,GAAMD,IAASA,EAAOa,CAAC,IAAIX,IAAOH,EAAK,QAAQG,GAAMH;AAGlG;AACE,IAAAC,IAASA,IAASA,EAAOa,CAAC,IAAI,IAAI,MAAM,CAAC,IAAId,EAAK,QAAQ,IAAI,MAAM,CAAC,IACjEY,IAAQf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDK,IAASf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE;AAAA,UACnDK,IAAID,KAAU,IAAID,QAAYG,KAAKJ,KAAMF,MAAO,IAAKC,KAAMF;AACrE,SAAOP,EAAOc,CAAC,IAAIb,GAAMD,EAAOa,CAAC,IAAIX,GAAMH;AAC7C;AAEO,SAASgB,EAAOC,GAAM;AAC3B,MAAIrB,GAAG,GAAGsB,IAAID,EAAK,QACfpB,GACAC,GACAqB,IAAK,IAAI,MAAMD,CAAC,GAChBE,IAAK,IAAI,MAAMF,CAAC,GAChBd,IAAK,OACLC,IAAK,OACLC,IAAK,QACLC,IAAK;AAGT,OAAK,IAAI,GAAG,IAAIW,GAAG,EAAE;AACnB,IAAI,MAAMrB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,IAAIqB,EAAK,CAAC,CAAC,CAAC,KAAK,MAAMnB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC,CAAC,MACnFuB,EAAG,CAAC,IAAItB,GACRuB,EAAG,CAAC,IAAItB,GACJD,IAAIO,MAAIA,IAAKP,IACbA,IAAIS,MAAIA,IAAKT,IACbC,IAAIO,MAAIA,IAAKP,IACbA,IAAIS,MAAIA,IAAKT;AAInB,MAAIM,IAAKE,KAAMD,IAAKE,EAAI,QAAO;AAM/B,OAHA,KAAK,MAAMH,GAAIC,CAAE,EAAE,MAAMC,GAAIC,CAAE,GAG1B,IAAI,GAAG,IAAIW,GAAG,EAAE;AACnB,IAAAnB,EAAI,MAAMoB,EAAG,CAAC,GAAGC,EAAG,CAAC,GAAGH,EAAK,CAAC,CAAC;AAGjC,SAAO;AACT;ACnFe,SAAAI,EAASxB,GAAGC,GAAG;AAC5B,MAAI,MAAMD,IAAI,CAACA,CAAC,KAAK,MAAMC,IAAI,CAACA,CAAC,EAAG,QAAO;AAE3C,MAAIM,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK;AAKd,MAAI,MAAMH,CAAE;AACV,IAAAE,KAAMF,IAAK,KAAK,MAAMP,CAAC,KAAK,GAC5BU,KAAMF,IAAK,KAAK,MAAMP,CAAC,KAAK;AAAA,OAIzB;AAMH,aALIwB,IAAIhB,IAAKF,KAAM,GACfF,IAAO,KAAK,OACZD,GACAa,GAEGV,IAAKP,KAAKA,KAAKS,KAAMD,IAAKP,KAAKA,KAAKS;AAGzC,cAFAO,KAAKhB,IAAIO,MAAO,IAAKR,IAAIO,GACzBH,IAAS,IAAI,MAAM,CAAC,GAAGA,EAAOa,CAAC,IAAIZ,GAAMA,IAAOD,GAAQqB,KAAK,GACrDR,GAAC;AAAA,QACP,KAAK;AAAG,UAAAR,IAAKF,IAAKkB,GAAGf,IAAKF,IAAKiB;AAAG;AAAA,QAClC,KAAK;AAAG,UAAAlB,IAAKE,IAAKgB,GAAGf,IAAKF,IAAKiB;AAAG;AAAA,QAClC,KAAK;AAAG,UAAAhB,IAAKF,IAAKkB,GAAGjB,IAAKE,IAAKe;AAAG;AAAA,QAClC,KAAK;AAAG,UAAAlB,IAAKE,IAAKgB,GAAGjB,IAAKE,IAAKe;AAAG;AAAA,MAC1C;AAGI,IAAI,KAAK,SAAS,KAAK,MAAM,WAAQ,KAAK,QAAQpB;AAAA,EACpD;AAEA,cAAK,MAAME,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACJ;AACT;AC1Ce,SAAAgB,IAAW;AACxB,MAAIN,IAAO,CAAA;AACX,cAAK,MAAM,SAASf,GAAM;AACxB,QAAI,CAACA,EAAK,OAAQ;AAAG,MAAAe,EAAK,KAAKf,EAAK,IAAI;AAAA,WAAUA,IAAOA,EAAK;AAAA,EAChE,CAAC,GACMe;AACT;ACNe,SAAAO,EAASC,GAAG;AACzB,SAAO,UAAU,SACX,KAAK,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,IACvD,MAAM,KAAK,GAAG,IAAI,SAAY,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AACjF;ACJe,SAAAC,EAASxB,GAAME,GAAIC,GAAIC,GAAIC,GAAI;AAC5C,OAAK,OAAOL,GACZ,KAAK,KAAKE,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC;AACZ;ACJe,SAAAoB,EAAS9B,GAAGC,GAAG8B,GAAQ;AACpC,MAAIX,GACAb,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,GACAC,GACAsB,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAQ,CAAA,GACR/B,IAAO,KAAK,OACZgC,GACApB;AAUJ,OARIZ,KAAM+B,EAAM,KAAK,IAAIP,EAAKxB,GAAME,GAAIC,GAAI0B,GAAIC,CAAE,CAAC,GAC/CJ,KAAU,OAAMA,IAAS,SAE3BxB,IAAKP,IAAI+B,GAAQvB,IAAKP,IAAI8B,GAC1BG,IAAKlC,IAAI+B,GAAQI,IAAKlC,IAAI8B,GAC1BA,KAAUA,IAGLM,IAAID,EAAM;AAGf,QAAI,IAAE/B,IAAOgC,EAAE,UACP5B,IAAK4B,EAAE,MAAMH,MACbxB,IAAK2B,EAAE,MAAMF,MACbH,IAAKK,EAAE,MAAM9B,MACb0B,IAAKI,EAAE,MAAM7B;AAGrB,UAAIH,EAAK,QAAQ;AACf,YAAIM,KAAMF,IAAKuB,KAAM,GACjBpB,KAAMF,IAAKuB,KAAM;AAErB,QAAAG,EAAM;AAAA,UACJ,IAAIP,EAAKxB,EAAK,CAAC,GAAGM,GAAIC,GAAIoB,GAAIC,CAAE;AAAA,UAChC,IAAIJ,EAAKxB,EAAK,CAAC,GAAGI,GAAIG,GAAID,GAAIsB,CAAE;AAAA,UAChC,IAAIJ,EAAKxB,EAAK,CAAC,GAAGM,GAAID,GAAIsB,GAAIpB,CAAE;AAAA,UAChC,IAAIiB,EAAKxB,EAAK,CAAC,GAAGI,GAAIC,GAAIC,GAAIC,CAAE;AAAA,QACxC,IAGUK,KAAKhB,KAAKW,MAAO,IAAKZ,KAAKW,OAC7B0B,IAAID,EAAMA,EAAM,SAAS,CAAC,GAC1BA,EAAMA,EAAM,SAAS,CAAC,IAAIA,EAAMA,EAAM,SAAS,IAAInB,CAAC,GACpDmB,EAAMA,EAAM,SAAS,IAAInB,CAAC,IAAIoB;AAAA,MAElC,OAGK;AACH,YAAIC,IAAKtC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMK,EAAK,IAAI,GACtCkC,IAAKtC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMI,EAAK,IAAI,GACtCmC,IAAKF,IAAKA,IAAKC,IAAKA;AACxB,YAAIC,IAAKT,GAAQ;AACf,cAAIhC,IAAI,KAAK,KAAKgC,IAASS,CAAE;AAC7B,UAAAjC,IAAKP,IAAID,GAAGS,IAAKP,IAAIF,GACrBmC,IAAKlC,IAAID,GAAGoC,IAAKlC,IAAIF,GACrBqB,IAAOf,EAAK;AAAA,QACd;AAAA,MACF;AAGF,SAAOe;AACT;ACrEe,SAAAqB,EAAS1C,GAAG;AACzB,MAAI,MAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,CAAC,KAAK,MAAME,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC,CAAC,EAAG,QAAO;AAEnF,MAAIK,GACAC,IAAO,KAAK,OACZqC,GACAC,GACAC,GACArC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVV,GACAC,GACAU,GACAC,GACAG,GACAC,GACAC,GACAC;AAGJ,MAAI,CAACb,EAAM,QAAO;AAIlB,MAAIA,EAAK,OAAQ,YAAa;AAG5B,SAFIU,IAAQf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDK,IAASf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,GACrDR,IAASC,GAAM,EAAAA,IAAOA,EAAKY,IAAID,KAAU,IAAID,CAAK,GAAI,QAAO;AACnE,QAAI,CAACV,EAAK,OAAQ;AAClB,KAAID,EAAQa,IAAI,IAAK,CAAC,KAAKb,EAAQa,IAAI,IAAK,CAAC,KAAKb,EAAQa,IAAI,IAAK,CAAC,OAAGyB,IAAWtC,GAAQc,IAAID;AAAA,EAChG;AAGA,SAAOZ,EAAK,SAASN,IAAG,KAAM4C,IAAWtC,GAAM,EAAAA,IAAOA,EAAK,MAAO,QAAO;AAIzE,UAHIuC,IAAOvC,EAAK,SAAM,OAAOA,EAAK,MAG9BsC,KAAkBC,IAAOD,EAAS,OAAOC,IAAO,OAAOD,EAAS,MAAO,QAGtEvC,KAGLwC,IAAOxC,EAAOa,CAAC,IAAI2B,IAAO,OAAOxC,EAAOa,CAAC,IAGpCZ,IAAOD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MACpDC,OAAUD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MACzD,CAACC,EAAK,WACPqC,IAAUA,EAASxB,CAAC,IAAIb,IACvB,KAAK,QAAQA,IAGb,SAba,KAAK,QAAQuC,GAAM;AAczC;AAEO,SAASC,EAAUzB,GAAM;AAC9B,WAASH,IAAI,GAAGI,IAAID,EAAK,QAAQH,IAAII,GAAG,EAAEJ,EAAG,MAAK,OAAOG,EAAKH,CAAC,CAAC;AAChE,SAAO;AACT;AC7De,SAAA6B,IAAW;AACxB,SAAO,KAAK;AACd;ACFe,SAAAC,IAAW;AACxB,MAAIC,IAAO;AACX,cAAK,MAAM,SAAS3C,GAAM;AACxB,QAAI,CAACA,EAAK,OAAQ;AAAG,QAAE2C;AAAA,WAAa3C,IAAOA,EAAK;AAAA,EAClD,CAAC,GACM2C;AACT;ACJe,SAAAC,EAASC,GAAU;AAChC,MAAId,IAAQ,CAAA,GAAIC,GAAGhC,IAAO,KAAK,OAAO8C,GAAO5C,GAAIC,GAAIC,GAAIC;AAEzD,OADIL,KAAM+B,EAAM,KAAK,IAAIP,EAAKxB,GAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GACpEgC,IAAID,EAAM;AACf,QAAI,CAACc,EAAS7C,IAAOgC,EAAE,MAAM9B,IAAK8B,EAAE,IAAI7B,IAAK6B,EAAE,IAAI5B,IAAK4B,EAAE,IAAI3B,IAAK2B,EAAE,EAAE,KAAKhC,EAAK,QAAQ;AACvF,UAAIM,KAAMJ,IAAKE,KAAM,GAAGG,KAAMJ,IAAKE,KAAM;AACzC,OAAIyC,IAAQ9C,EAAK,CAAC,MAAG+B,EAAM,KAAK,IAAIP,EAAKsB,GAAOxC,GAAIC,GAAIH,GAAIC,CAAE,CAAC,IAC3DyC,IAAQ9C,EAAK,CAAC,MAAG+B,EAAM,KAAK,IAAIP,EAAKsB,GAAO5C,GAAIK,GAAID,GAAID,CAAE,CAAC,IAC3DyC,IAAQ9C,EAAK,CAAC,MAAG+B,EAAM,KAAK,IAAIP,EAAKsB,GAAOxC,GAAIH,GAAIC,GAAIG,CAAE,CAAC,IAC3DuC,IAAQ9C,EAAK,CAAC,MAAG+B,EAAM,KAAK,IAAIP,EAAKsB,GAAO5C,GAAIC,GAAIG,GAAIC,CAAE,CAAC;AAAA,IACjE;AAEF,SAAO;AACT;ACbe,SAAAwC,EAASF,GAAU;AAChC,MAAId,IAAQ,CAAA,GAAIQ,IAAO,CAAA,GAAIP;AAE3B,OADI,KAAK,SAAOD,EAAM,KAAK,IAAIP,EAAK,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GAChFQ,IAAID,EAAM,SAAO;AACtB,QAAI/B,IAAOgC,EAAE;AACb,QAAIhC,EAAK,QAAQ;AACf,UAAI8C,GAAO5C,IAAK8B,EAAE,IAAI7B,IAAK6B,EAAE,IAAI5B,IAAK4B,EAAE,IAAI3B,IAAK2B,EAAE,IAAI1B,KAAMJ,IAAKE,KAAM,GAAGG,KAAMJ,IAAKE,KAAM;AAC5F,OAAIyC,IAAQ9C,EAAK,CAAC,MAAG+B,EAAM,KAAK,IAAIP,EAAKsB,GAAO5C,GAAIC,GAAIG,GAAIC,CAAE,CAAC,IAC3DuC,IAAQ9C,EAAK,CAAC,MAAG+B,EAAM,KAAK,IAAIP,EAAKsB,GAAOxC,GAAIH,GAAIC,GAAIG,CAAE,CAAC,IAC3DuC,IAAQ9C,EAAK,CAAC,MAAG+B,EAAM,KAAK,IAAIP,EAAKsB,GAAO5C,GAAIK,GAAID,GAAID,CAAE,CAAC,IAC3DyC,IAAQ9C,EAAK,CAAC,MAAG+B,EAAM,KAAK,IAAIP,EAAKsB,GAAOxC,GAAIC,GAAIH,GAAIC,CAAE,CAAC;AAAA,IACjE;AACA,IAAAkC,EAAK,KAAKP,CAAC;AAAA,EACb;AACA,SAAOA,IAAIO,EAAK;AACd,IAAAM,EAASb,EAAE,MAAMA,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,EAAE;AAEzC,SAAO;AACT;ACpBO,SAASgB,EAAStD,GAAG;AAC1B,SAAOA,EAAE,CAAC;AACZ;AAEe,SAAAuD,GAAS1B,GAAG;AACzB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;ACNO,SAAS2B,GAASxD,GAAG;AAC1B,SAAOA,EAAE,CAAC;AACZ;AAEe,SAAAyD,GAAS5B,GAAG;AACzB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;ACOe,SAAS6B,EAASC,GAAO1D,GAAGC,GAAG;AAC5C,MAAIE,IAAO,IAAIwD,EAAS3D,KAAYqD,GAAcpD,KAAYsD,IAAc,KAAK,KAAK,KAAK,GAAG;AAC9F,SAAOG,KAAS,OAAOvD,IAAOA,EAAK,OAAOuD,CAAK;AACjD;AAEA,SAASC,EAAS3D,GAAGC,GAAGM,GAAIC,GAAIC,GAAIC,GAAI;AACtC,OAAK,KAAKV,GACV,KAAK,KAAKC,GACV,KAAK,MAAMM,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,QAAQ;AACf;AAEA,SAASkD,EAAUtD,GAAM;AAEvB,WADIuD,IAAO,EAAC,MAAMvD,EAAK,KAAI,GAAGsC,IAAOiB,GAC9BvD,IAAOA,EAAK,OAAM,CAAAsC,IAAOA,EAAK,OAAO,EAAC,MAAMtC,EAAK,KAAI;AAC5D,SAAOuD;AACT;AAEA,IAAIC,IAAYL,EAAS,YAAYE,EAAS;AAE9CG,EAAU,OAAO,WAAW;AAC1B,MAAID,IAAO,IAAIF,EAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GAC5EtD,IAAO,KAAK,OACZqD,GACAP;AAEJ,MAAI,CAAC9C,EAAM,QAAOwD;AAElB,MAAI,CAACxD,EAAK,OAAQ,QAAOwD,EAAK,QAAQD,EAAUvD,CAAI,GAAGwD;AAGvD,OADAH,IAAQ,CAAC,EAAC,QAAQrD,GAAM,QAAQwD,EAAK,QAAQ,IAAI,MAAM,CAAC,EAAC,CAAC,GACnDxD,IAAOqD,EAAM;AAClB,aAASzC,IAAI,GAAGA,IAAI,GAAG,EAAEA;AACvB,OAAIkC,IAAQ9C,EAAK,OAAOY,CAAC,OACnBkC,EAAM,SAAQO,EAAM,KAAK,EAAC,QAAQP,GAAO,QAAQ9C,EAAK,OAAOY,CAAC,IAAI,IAAI,MAAM,CAAC,EAAC,CAAC,IAC9EZ,EAAK,OAAOY,CAAC,IAAI2C,EAAUT,CAAK;AAK3C,SAAOU;AACT;AAEAC,EAAU,MAAMhE;AAChBgE,EAAU,SAASC;AACnBD,EAAU,QAAQtC;AAClBsC,EAAU,OAAOpC;AACjBoC,EAAU,SAASnC;AACnBmC,EAAU,OAAOhC;AACjBgC,EAAU,SAASrB;AACnBqB,EAAU,YAAYE;AACtBF,EAAU,OAAOhB;AACjBgB,EAAU,OAAOf;AACjBe,EAAU,QAAQb;AAClBa,EAAU,aAAaV;AACvBU,EAAU,IAAIR;AACdQ,EAAU,IAAIN;ACxEC,SAAAS,EAASjE,GAAG;AACzB,SAAO,WAAW;AAChB,WAAOA;AAAA,EACT;AACF;ACJe,SAAAkE,EAASC,GAAQ;AAC9B,UAAQA,MAAW,OAAO;AAC5B;ACEA,SAASnE,GAAED,GAAG;AACZ,SAAOA,EAAE,IAAIA,EAAE;AACjB;AAEA,SAASE,GAAEF,GAAG;AACZ,SAAOA,EAAE,IAAIA,EAAE;AACjB;AAEe,SAAAqE,GAASrC,GAAQ;AAC9B,MAAI2B,GACAW,GACAF,GACAG,IAAW,GACXC,IAAa;AAEjB,EAAI,OAAOxC,KAAW,eAAYA,IAASkC,EAASlC,KAAU,OAAO,IAAI,CAACA,CAAM;AAEhF,WAASyC,IAAQ;AASf,aARIvD,GAAGI,IAAIqC,EAAM,QACbvD,GACAE,GACAoE,GACAC,GACAC,GACAC,GAEKC,IAAI,GAAGA,IAAIN,GAAY,EAAEM;AAEhC,WADA1E,IAAOsD,EAASC,GAAO1D,IAAGC,EAAC,EAAE,WAAW6E,CAAO,GAC1C7D,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnB,QAAAZ,IAAOqD,EAAMzC,CAAC,GACd0D,IAAKN,EAAMhE,EAAK,KAAK,GAAGuE,IAAMD,IAAKA,GACnCF,IAAKpE,EAAK,IAAIA,EAAK,IACnBqE,IAAKrE,EAAK,IAAIA,EAAK,IACnBF,EAAK,MAAM4E,CAAK;AAIpB,aAASA,EAAMC,GAAMzE,GAAIC,GAAIC,GAAIC,GAAI;AACnC,UAAIU,IAAO4D,EAAK,MAAMC,IAAKD,EAAK,GAAGE,IAAIP,IAAKM;AAC5C,UAAI7D,GAAM;AACR,YAAIA,EAAK,QAAQf,EAAK,OAAO;AAC3B,cAAIL,IAAIyE,IAAKrD,EAAK,IAAIA,EAAK,IACvBnB,IAAIyE,IAAKtD,EAAK,IAAIA,EAAK,IACvB+D,IAAInF,IAAIA,IAAIC,IAAIA;AACpB,UAAIkF,IAAID,IAAIA,MACNlF,MAAM,MAAGA,IAAIkE,EAAOC,CAAM,GAAGgB,KAAKnF,IAAIA,IACtCC,MAAM,MAAGA,IAAIiE,EAAOC,CAAM,GAAGgB,KAAKlF,IAAIA,IAC1CkF,KAAKD,KAAKC,IAAI,KAAK,KAAKA,CAAC,MAAMA,IAAIb,GACnCjE,EAAK,OAAOL,KAAKmF,MAAMD,KAAKD,KAAMA,MAAOL,IAAMK,KAC/C5E,EAAK,OAAOJ,KAAKkF,KAAKD,GACtB9D,EAAK,MAAMpB,KAAKkF,IAAI,IAAIA,IACxB9D,EAAK,MAAMnB,IAAIiF;AAAA,QAEnB;AACA;AAAA,MACF;AACA,aAAO3E,IAAKkE,IAAKS,KAAKzE,IAAKgE,IAAKS,KAAK1E,IAAKkE,IAAKQ,KAAKxE,IAAKgE,IAAKQ;AAAA,IAChE;AAAA,EACF;AAEA,WAASJ,EAAQE,GAAM;AACrB,QAAIA,EAAK,KAAM,QAAOA,EAAK,IAAIX,EAAMW,EAAK,KAAK,KAAK;AACpD,aAAS/D,IAAI+D,EAAK,IAAI,GAAG/D,IAAI,GAAG,EAAEA;AAChC,MAAI+D,EAAK/D,CAAC,KAAK+D,EAAK/D,CAAC,EAAE,IAAI+D,EAAK,MAC9BA,EAAK,IAAIA,EAAK/D,CAAC,EAAE;AAAA,EAGvB;AAEA,WAASmE,IAAa;AACpB,QAAK1B,GACL;AAAA,UAAIzC,GAAGI,IAAIqC,EAAM,QAAQrD;AAEzB,WADAgE,IAAQ,IAAI,MAAMhD,CAAC,GACdJ,IAAI,GAAGA,IAAII,GAAG,EAAEJ,EAAG,CAAAZ,IAAOqD,EAAMzC,CAAC,GAAGoD,EAAMhE,EAAK,KAAK,IAAI,CAAC0B,EAAO1B,GAAMY,GAAGyC,CAAK;AAAA;AAAA,EACrF;AAEA,SAAAc,EAAM,aAAa,SAASa,GAAQC,GAAS;AAC3C,IAAA5B,IAAQ2B,GACRlB,IAASmB,GACTF,EAAU;AAAA,EACZ,GAEAZ,EAAM,aAAa,SAAS5C,GAAG;AAC7B,WAAO,UAAU,UAAU2C,IAAa,CAAC3C,GAAG4C,KAASD;AAAA,EACvD,GAEAC,EAAM,WAAW,SAAS5C,GAAG;AAC3B,WAAO,UAAU,UAAU0C,IAAW,CAAC1C,GAAG4C,KAASF;AAAA,EACrD,GAEAE,EAAM,SAAS,SAAS5C,GAAG;AACzB,WAAO,UAAU,UAAUG,IAAS,OAAOH,KAAM,aAAaA,IAAIqC,EAAS,CAACrC,CAAC,GAAGwD,EAAU,GAAIZ,KAASzC;AAAA,EACzG,GAEOyC;AACT;AClGA,MAAMe,KAAI,SACJC,KAAI,YACJC,IAAI;AAEK,SAAAC,KAAW;AACxB,MAAIC,IAAI;AACR,SAAO,OAAOA,KAAKJ,KAAII,IAAIH,MAAKC,KAAKA;AACvC;ACJO,SAASzF,GAAED,GAAG;AACnB,SAAOA,EAAE;AACX;AAEO,SAASE,GAAEF,GAAG;AACnB,SAAOA,EAAE;AACX;AAEA,IAAI6F,KAAgB,IAChBC,KAAe,KAAK,MAAM,IAAI,KAAK,KAAK,CAAC;AAE9B,SAAAC,GAASpC,GAAO;AAC7B,MAAIqC,GACAC,IAAQ,GACRC,IAAW,MACXC,IAAa,IAAI,KAAK,IAAID,GAAU,IAAI,GAAG,GAC3CE,IAAc,GACdC,IAAgB,KAChBC,IAAS,oBAAI,IAAG,GAChBC,IAAUC,EAAMC,CAAI,GACpBC,IAAQC,EAAS,QAAQ,KAAK,GAC9BvC,IAASuB,GAAG;AAEhB,EAAIhC,KAAS,SAAMA,IAAQ,CAAA;AAE3B,WAAS8C,IAAO;AACd,IAAAG,EAAI,GACJF,EAAM,KAAK,QAAQV,CAAU,GACzBC,IAAQC,MACVK,EAAQ,KAAI,GACZG,EAAM,KAAK,OAAOV,CAAU;AAAA,EAEhC;AAEA,WAASY,EAAKpC,GAAY;AACxB,QAAItD,GAAGI,IAAIqC,EAAM,QAAQrD;AAEzB,IAAIkE,MAAe,WAAWA,IAAa;AAE3C,aAASM,IAAI,GAAGA,IAAIN,GAAY,EAAEM;AAOhC,WANAmB,MAAUG,IAAcH,KAASE,GAEjCG,EAAO,QAAQ,SAAS7B,GAAO;AAC7B,QAAAA,EAAMwB,CAAK;AAAA,MACb,CAAC,GAEI/E,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnB,QAAAZ,IAAOqD,EAAMzC,CAAC,GACVZ,EAAK,MAAM,OAAMA,EAAK,KAAKA,EAAK,MAAM+F,KACrC/F,EAAK,IAAIA,EAAK,IAAIA,EAAK,KAAK,IAC7BA,EAAK,MAAM,OAAMA,EAAK,KAAKA,EAAK,MAAM+F,KACrC/F,EAAK,IAAIA,EAAK,IAAIA,EAAK,KAAK;AAIrC,WAAO0F;AAAA,EACT;AAEA,WAASa,IAAkB;AACzB,aAAS3F,IAAI,GAAGI,IAAIqC,EAAM,QAAQrD,GAAMY,IAAII,GAAG,EAAEJ,GAAG;AAIlD,UAHAZ,IAAOqD,EAAMzC,CAAC,GAAGZ,EAAK,QAAQY,GAC1BZ,EAAK,MAAM,SAAMA,EAAK,IAAIA,EAAK,KAC/BA,EAAK,MAAM,SAAMA,EAAK,IAAIA,EAAK,KAC/B,MAAMA,EAAK,CAAC,KAAK,MAAMA,EAAK,CAAC,GAAG;AAClC,YAAI0B,IAAS6D,KAAgB,KAAK,KAAK,MAAM3E,CAAC,GAAG4F,IAAQ5F,IAAI4E;AAC7D,QAAAxF,EAAK,IAAI0B,IAAS,KAAK,IAAI8E,CAAK,GAChCxG,EAAK,IAAI0B,IAAS,KAAK,IAAI8E,CAAK;AAAA,MAClC;AACA,OAAI,MAAMxG,EAAK,EAAE,KAAK,MAAMA,EAAK,EAAE,OACjCA,EAAK,KAAKA,EAAK,KAAK;AAAA,IAExB;AAAA,EACF;AAEA,WAASyG,EAAgBtC,GAAO;AAC9B,WAAIA,EAAM,cAAYA,EAAM,WAAWd,GAAOS,CAAM,GAC7CK;AAAA,EACT;AAEA,SAAAoC,EAAe,GAERb,IAAa;AAAA,IAClB,MAAMY;AAAA,IAEN,SAAS,WAAW;AAClB,aAAOL,EAAQ,QAAQE,CAAI,GAAGT;AAAA,IAChC;AAAA,IAEA,MAAM,WAAW;AACf,aAAOO,EAAQ,KAAI,GAAIP;AAAA,IACzB;AAAA,IAEA,OAAO,SAASnE,GAAG;AACjB,aAAO,UAAU,UAAU8B,IAAQ9B,GAAGgF,KAAmBP,EAAO,QAAQS,CAAe,GAAGf,KAAcrC;AAAA,IAC1G;AAAA,IAEA,OAAO,SAAS9B,GAAG;AACjB,aAAO,UAAU,UAAUoE,IAAQ,CAACpE,GAAGmE,KAAcC;AAAA,IACvD;AAAA,IAEA,UAAU,SAASpE,GAAG;AACpB,aAAO,UAAU,UAAUqE,IAAW,CAACrE,GAAGmE,KAAcE;AAAA,IAC1D;AAAA,IAEA,YAAY,SAASrE,GAAG;AACtB,aAAO,UAAU,UAAUsE,IAAa,CAACtE,GAAGmE,KAAc,CAACG;AAAA,IAC7D;AAAA,IAEA,aAAa,SAAStE,GAAG;AACvB,aAAO,UAAU,UAAUuE,IAAc,CAACvE,GAAGmE,KAAcI;AAAA,IAC7D;AAAA,IAEA,eAAe,SAASvE,GAAG;AACzB,aAAO,UAAU,UAAUwE,IAAgB,IAAIxE,GAAGmE,KAAc,IAAIK;AAAA,IACtE;AAAA,IAEA,cAAc,SAASxE,GAAG;AACxB,aAAO,UAAU,UAAUuC,IAASvC,GAAGyE,EAAO,QAAQS,CAAe,GAAGf,KAAc5B;AAAA,IACxF;AAAA,IAEA,OAAO,SAAS4C,GAAMnF,GAAG;AACvB,aAAO,UAAU,SAAS,KAAMA,KAAK,OAAOyE,EAAO,OAAOU,CAAI,IAAIV,EAAO,IAAIU,GAAMD,EAAgBlF,CAAC,CAAC,GAAImE,KAAcM,EAAO,IAAIU,CAAI;AAAA,IACxI;AAAA,IAEA,MAAM,SAAS/G,GAAGC,GAAG8B,GAAQ;AAC3B,UAAId,IAAI,GACJI,IAAIqC,EAAM,QACVpB,GACAC,GACAC,GACAnC,GACA2G;AAKJ,WAHIjF,KAAU,OAAMA,IAAS,QACxBA,KAAUA,GAEVd,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnB,QAAAZ,IAAOqD,EAAMzC,CAAC,GACdqB,IAAKtC,IAAIK,EAAK,GACdkC,IAAKtC,IAAII,EAAK,GACdmC,IAAKF,IAAKA,IAAKC,IAAKA,GAChBC,IAAKT,MAAQiF,IAAU3G,GAAM0B,IAASS;AAG5C,aAAOwE;AAAA,IACT;AAAA,IAEA,IAAI,SAASD,GAAMnF,GAAG;AACpB,aAAO,UAAU,SAAS,KAAK6E,EAAM,GAAGM,GAAMnF,CAAC,GAAGmE,KAAcU,EAAM,GAAGM,CAAI;AAAA,IAC/E;AAAA,EACJ;AACA;ACtJe,SAAAE,KAAW;AACxB,MAAIvD,GACArD,GACA8D,GACA6B,GACA1B,IAAWL,EAAS,GAAG,GACvBiD,GACAC,IAAe,GACfC,IAAe,OACfC,IAAS;AAEb,WAAS7C,EAAM5C,GAAG;AAChB,QAAIX,GAAGI,IAAIqC,EAAM,QAAQvD,IAAOsD,EAASC,GAAO1D,IAAGC,EAAC,EAAE,WAAWqH,CAAU;AAC3E,SAAKtB,IAAQpE,GAAGX,IAAI,GAAGA,IAAII,GAAG,EAAEJ,EAAG,CAAAZ,IAAOqD,EAAMzC,CAAC,GAAGd,EAAK,MAAM4E,CAAK;AAAA,EACtE;AAEA,WAASK,IAAa;AACpB,QAAK1B,GACL;AAAA,UAAIzC,GAAGI,IAAIqC,EAAM,QAAQrD;AAEzB,WADA6G,IAAY,IAAI,MAAM7F,CAAC,GAClBJ,IAAI,GAAGA,IAAII,GAAG,EAAEJ,EAAG,CAAAZ,IAAOqD,EAAMzC,CAAC,GAAGiG,EAAU7G,EAAK,KAAK,IAAI,CAACiE,EAASjE,GAAMY,GAAGyC,CAAK;AAAA;AAAA,EAC3F;AAEA,WAAS4D,EAAWtC,GAAM;AACxB,QAAIV,IAAW,GAAGjC,GAAGmD,GAAG+B,IAAS,GAAGvH,GAAGC,GAAGgB;AAG1C,QAAI+D,EAAK,QAAQ;AACf,WAAKhF,IAAIC,IAAIgB,IAAI,GAAGA,IAAI,GAAG,EAAEA;AAC3B,SAAKoB,IAAI2C,EAAK/D,CAAC,OAAOuE,IAAI,KAAK,IAAInD,EAAE,KAAK,OACxCiC,KAAYjC,EAAE,OAAOkF,KAAU/B,GAAGxF,KAAKwF,IAAInD,EAAE,GAAGpC,KAAKuF,IAAInD,EAAE;AAG/D,MAAA2C,EAAK,IAAIhF,IAAIuH,GACbvC,EAAK,IAAI/E,IAAIsH;AAAA,IACf,OAGK;AACH,MAAAlF,IAAI2C,GACJ3C,EAAE,IAAIA,EAAE,KAAK,GACbA,EAAE,IAAIA,EAAE,KAAK;AACb;AAAG,QAAAiC,KAAY4C,EAAU7E,EAAE,KAAK,KAAK;AAAA,aAC9BA,IAAIA,EAAE;AAAA,IACf;AAEA,IAAA2C,EAAK,QAAQV;AAAA,EACf;AAEA,WAASS,EAAMC,GAAMvE,GAAImB,GAAGI,GAAI;AAC9B,QAAI,CAACgD,EAAK,MAAO,QAAO;AAExB,QAAIhF,IAAIgF,EAAK,IAAI3E,EAAK,GAClBJ,IAAI+E,EAAK,IAAI3E,EAAK,GAClBmH,IAAIxF,IAAKvB,GACT0E,IAAInF,IAAIA,IAAIC,IAAIA;AAIpB,QAAIuH,IAAIA,IAAIH,IAASlC;AACnB,aAAIA,IAAIiC,MACFpH,MAAM,MAAGA,IAAIkE,EAAOC,CAAM,GAAGgB,KAAKnF,IAAIA,IACtCC,MAAM,MAAGA,IAAIiE,EAAOC,CAAM,GAAGgB,KAAKlF,IAAIA,IACtCkF,IAAIgC,MAAchC,IAAI,KAAK,KAAKgC,IAAehC,CAAC,IACpD9E,EAAK,MAAML,IAAIgF,EAAK,QAAQgB,IAAQb,GACpC9E,EAAK,MAAMJ,IAAI+E,EAAK,QAAQgB,IAAQb,IAE/B;AAIJ,QAAIH,EAAK,UAAUG,KAAKiC,EAAc;AAG3C,KAAIpC,EAAK,SAAS3E,KAAQ2E,EAAK,UACzBhF,MAAM,MAAGA,IAAIkE,EAAOC,CAAM,GAAGgB,KAAKnF,IAAIA,IACtCC,MAAM,MAAGA,IAAIiE,EAAOC,CAAM,GAAGgB,KAAKlF,IAAIA,IACtCkF,IAAIgC,MAAchC,IAAI,KAAK,KAAKgC,IAAehC,CAAC;AAGtD;AAAG,MAAIH,EAAK,SAAS3E,MACnBmH,IAAIN,EAAUlC,EAAK,KAAK,KAAK,IAAIgB,IAAQb,GACzC9E,EAAK,MAAML,IAAIwH,GACfnH,EAAK,MAAMJ,IAAIuH;AAAA,WACRxC,IAAOA,EAAK;AAAA,EACvB;AAEA,SAAAR,EAAM,aAAa,SAASa,GAAQC,GAAS;AAC3C,IAAA5B,IAAQ2B,GACRlB,IAASmB,GACTF,EAAU;AAAA,EACZ,GAEAZ,EAAM,WAAW,SAAS5C,GAAG;AAC3B,WAAO,UAAU,UAAU0C,IAAW,OAAO1C,KAAM,aAAaA,IAAIqC,EAAS,CAACrC,CAAC,GAAGwD,EAAU,GAAIZ,KAASF;AAAA,EAC3G,GAEAE,EAAM,cAAc,SAAS5C,GAAG;AAC9B,WAAO,UAAU,UAAUuF,IAAevF,IAAIA,GAAG4C,KAAS,KAAK,KAAK2C,CAAY;AAAA,EAClF,GAEA3C,EAAM,cAAc,SAAS5C,GAAG;AAC9B,WAAO,UAAU,UAAUwF,IAAexF,IAAIA,GAAG4C,KAAS,KAAK,KAAK4C,CAAY;AAAA,EAClF,GAEA5C,EAAM,QAAQ,SAAS5C,GAAG;AACxB,WAAO,UAAU,UAAUyF,IAASzF,IAAIA,GAAG4C,KAAS,KAAK,KAAK6C,CAAM;AAAA,EACtE,GAEO7C;AACT;ACjHe,SAAAiD,GAASzH,GAAG;AACzB,MAAIsE,IAAWL,EAAS,GAAG,GACvBP,GACAwD,GACA5F;AAEJ,EAAI,OAAOtB,KAAM,eAAYA,IAAIiE,EAASjE,KAAK,OAAO,IAAI,CAACA,CAAC;AAE5D,WAASwE,EAAMwB,GAAO;AACpB,aAAS/E,IAAI,GAAGI,IAAIqC,EAAM,QAAQrD,GAAMY,IAAII,GAAG,EAAEJ;AAC/C,MAAAZ,IAAOqD,EAAMzC,CAAC,GAAGZ,EAAK,OAAOiB,EAAGL,CAAC,IAAIZ,EAAK,KAAK6G,EAAUjG,CAAC,IAAI+E;AAAA,EAElE;AAEA,WAASZ,IAAa;AACpB,QAAK1B,GACL;AAAA,UAAIzC,GAAGI,IAAIqC,EAAM;AAGjB,WAFAwD,IAAY,IAAI,MAAM7F,CAAC,GACvBC,IAAK,IAAI,MAAMD,CAAC,GACXJ,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnB,QAAAiG,EAAUjG,CAAC,IAAI,MAAMK,EAAGL,CAAC,IAAI,CAACjB,EAAE0D,EAAMzC,CAAC,GAAGA,GAAGyC,CAAK,CAAC,IAAI,IAAI,CAACY,EAASZ,EAAMzC,CAAC,GAAGA,GAAGyC,CAAK;AAAA;AAAA,EAE3F;AAEA,SAAAc,EAAM,aAAa,SAAS5C,GAAG;AAC7B,IAAA8B,IAAQ9B,GACRwD,EAAU;AAAA,EACZ,GAEAZ,EAAM,WAAW,SAAS5C,GAAG;AAC3B,WAAO,UAAU,UAAU0C,IAAW,OAAO1C,KAAM,aAAaA,IAAIqC,EAAS,CAACrC,CAAC,GAAGwD,EAAU,GAAIZ,KAASF;AAAA,EAC3G,GAEAE,EAAM,IAAI,SAAS5C,GAAG;AACpB,WAAO,UAAU,UAAU5B,IAAI,OAAO4B,KAAM,aAAaA,IAAIqC,EAAS,CAACrC,CAAC,GAAGwD,EAAU,GAAIZ,KAASxE;AAAA,EACpG,GAEOwE;AACT;ACtCe,SAAAkD,GAASzH,GAAG;AACzB,MAAIqE,IAAWL,EAAS,GAAG,GACvBP,GACAwD,GACA3F;AAEJ,EAAI,OAAOtB,KAAM,eAAYA,IAAIgE,EAAShE,KAAK,OAAO,IAAI,CAACA,CAAC;AAE5D,WAASuE,EAAMwB,GAAO;AACpB,aAAS/E,IAAI,GAAGI,IAAIqC,EAAM,QAAQrD,GAAMY,IAAII,GAAG,EAAEJ;AAC/C,MAAAZ,IAAOqD,EAAMzC,CAAC,GAAGZ,EAAK,OAAOkB,EAAGN,CAAC,IAAIZ,EAAK,KAAK6G,EAAUjG,CAAC,IAAI+E;AAAA,EAElE;AAEA,WAASZ,IAAa;AACpB,QAAK1B,GACL;AAAA,UAAIzC,GAAGI,IAAIqC,EAAM;AAGjB,WAFAwD,IAAY,IAAI,MAAM7F,CAAC,GACvBE,IAAK,IAAI,MAAMF,CAAC,GACXJ,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnB,QAAAiG,EAAUjG,CAAC,IAAI,MAAMM,EAAGN,CAAC,IAAI,CAAChB,EAAEyD,EAAMzC,CAAC,GAAGA,GAAGyC,CAAK,CAAC,IAAI,IAAI,CAACY,EAASZ,EAAMzC,CAAC,GAAGA,GAAGyC,CAAK;AAAA;AAAA,EAE3F;AAEA,SAAAc,EAAM,aAAa,SAAS5C,GAAG;AAC7B,IAAA8B,IAAQ9B,GACRwD,EAAU;AAAA,EACZ,GAEAZ,EAAM,WAAW,SAAS5C,GAAG;AAC3B,WAAO,UAAU,UAAU0C,IAAW,OAAO1C,KAAM,aAAaA,IAAIqC,EAAS,CAACrC,CAAC,GAAGwD,EAAU,GAAIZ,KAASF;AAAA,EAC3G,GAEAE,EAAM,IAAI,SAAS5C,GAAG;AACpB,WAAO,UAAU,UAAU3B,IAAI,OAAO2B,KAAM,aAAaA,IAAIqC,EAAS,CAACrC,CAAC,GAAGwD,EAAU,GAAIZ,KAASvE;AAAA,EACpG,GAEOuE;AACT;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21]}

package/dist/y-QcCbqrzx.cjs

@@ -0,0 +1,2 @@
+"use strict";const C=require("./timer-CKyBCVzT.cjs");function $(t){const n=+this._x.call(null,t),i=+this._y.call(null,t);return T(this.cover(n,i),n,i,t)}function T(t,n,i,o){if(isNaN(n)||isNaN(i))return t;var f,a=t._root,s={data:o},e=t._x0,l=t._y0,r=t._x1,y=t._y1,p,_,h,x,u,g,c,v;if(!a)return t._root=s,t;for(;a.length;)if((u=n>=(p=(e+r)/2))?e=p:r=p,(g=i>=(_=(l+y)/2))?l=_:y=_,f=a,!(a=a[c=g<<1|u]))return f[c]=s,t;if(h=+t._x.call(null,a.data),x=+t._y.call(null,a.data),n===h&&i===x)return s.next=a,f?f[c]=s:t._root=s,t;do f=f?f[c]=new Array(4):t._root=new Array(4),(u=n>=(p=(e+r)/2))?e=p:r=p,(g=i>=(_=(l+y)/2))?l=_:y=_;while((c=g<<1|u)===(v=(x>=_)<<1|h>=p));return f[v]=a,f[c]=s,t}function F(t){var n,i,o=t.length,f,a,s=new Array(o),e=new Array(o),l=1/0,r=1/0,y=-1/0,p=-1/0;for(i=0;i<o;++i)isNaN(f=+this._x.call(null,n=t[i]))||isNaN(a=+this._y.call(null,n))||(s[i]=f,e[i]=a,f<l&&(l=f),f>y&&(y=f),a<r&&(r=a),a>p&&(p=a));if(l>y||r>p)return this;for(this.cover(l,r).cover(y,p),i=0;i<o;++i)T(this,s[i],e[i],t[i]);return this}function R(t,n){if(isNaN(t=+t)||isNaN(n=+n))return this;var i=this._x0,o=this._y0,f=this._x1,a=this._y1;if(isNaN(i))f=(i=Math.floor(t))+1,a=(o=Math.floor(n))+1;else{for(var s=f-i||1,e=this._root,l,r;i>t||t>=f||o>n||n>=a;)switch(r=(n<o)<<1|t<i,l=new Array(4),l[r]=e,e=l,s*=2,r){case 0:f=i+s,a=o+s;break;case 1:i=f-s,a=o+s;break;case 2:f=i+s,o=a-s;break;case 3:i=f-s,o=a-s;break}this._root&&this._root.length&&(this._root=e)}return this._x0=i,this._y0=o,this._x1=f,this._y1=a,this}function G(){var t=[];return this.visit(function(n){if(!n.length)do t.push(n.data);while(n=n.next)}),t}function H(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]]}function M(t,n,i,o,f){this.node=t,this.x0=n,this.y0=i,this.x1=o,this.y1=f}function J(t,n,i){var o,f=this._x0,a=this._y0,s,e,l,r,y=this._x1,p=this._y1,_=[],h=this._root,x,u;for(h&&_.push(new M(h,f,a,y,p)),i==null?i=1/0:(f=t-i,a=n-i,y=t+i,p=n+i,i*=i);x=_.pop();)if(!(!(h=x.node)||(s=x.x0)>y||(e=x.y0)>p||(l=x.x1)<f||(r=x.y1)<a))if(h.length){var g=(s+l)/2,c=(e+r)/2;_.push(new M(h[3],g,c,l,r),new M(h[2],s,c,g,r),new M(h[1],g,e,l,c),new M(h[0],s,e,g,c)),(u=(n>=c)<<1|t>=g)&&(x=_[_.length-1],_[_.length-1]=_[_.length-1-u],_[_.length-1-u]=x)}else{var v=t-+this._x.call(null,h.data),N=n-+this._y.call(null,h.data),w=v*v+N*N;if(w<i){var b=Math.sqrt(i=w);f=t-b,a=n-b,y=t+b,p=n+b,o=h.data}}return o}function K(t){if(isNaN(y=+this._x.call(null,t))||isNaN(p=+this._y.call(null,t)))return this;var n,i=this._root,o,f,a,s=this._x0,e=this._y0,l=this._x1,r=this._y1,y,p,_,h,x,u,g,c;if(!i)return this;if(i.length)for(;;){if((x=y>=(_=(s+l)/2))?s=_:l=_,(u=p>=(h=(e+r)/2))?e=h:r=h,n=i,!(i=i[g=u<<1|x]))return this;if(!i.length)break;(n[g+1&3]||n[g+2&3]||n[g+3&3])&&(o=n,c=g)}for(;i.data!==t;)if(f=i,!(i=i.next))return this;return(a=i.next)&&delete i.next,f?(a?f.next=a:delete f.next,this):n?(a?n[g]=a:delete n[g],(i=n[0]||n[1]||n[2]||n[3])&&i===(n[3]||n[2]||n[1]||n[0])&&!i.length&&(o?o[c]=i:this._root=i),this):(this._root=a,this)}function L(t){for(var n=0,i=t.length;n<i;++n)this.remove(t[n]);return this}function O(){return this._root}function U(){var t=0;return this.visit(function(n){if(!n.length)do++t;while(n=n.next)}),t}function V(t){var n=[],i,o=this._root,f,a,s,e,l;for(o&&n.push(new M(o,this._x0,this._y0,this._x1,this._y1));i=n.pop();)if(!t(o=i.node,a=i.x0,s=i.y0,e=i.x1,l=i.y1)&&o.length){var r=(a+e)/2,y=(s+l)/2;(f=o[3])&&n.push(new M(f,r,y,e,l)),(f=o[2])&&n.push(new M(f,a,y,r,l)),(f=o[1])&&n.push(new M(f,r,s,e,y)),(f=o[0])&&n.push(new M(f,a,s,r,y))}return this}function W(t){var n=[],i=[],o;for(this._root&&n.push(new M(this._root,this._x0,this._y0,this._x1,this._y1));o=n.pop();){var f=o.node;if(f.length){var a,s=o.x0,e=o.y0,l=o.x1,r=o.y1,y=(s+l)/2,p=(e+r)/2;(a=f[0])&&n.push(new M(a,s,e,y,p)),(a=f[1])&&n.push(new M(a,y,e,l,p)),(a=f[2])&&n.push(new M(a,s,p,y,r)),(a=f[3])&&n.push(new M(a,y,p,l,r))}i.push(o)}for(;o=i.pop();)t(o.node,o.x0,o.y0,o.x1,o.y1);return this}function Z(t){return t[0]}function q(t){return arguments.length?(this._x=t,this):this._x}function tt(t){return t[1]}function nt(t){return arguments.length?(this._y=t,this):this._y}function Y(t,n,i){var o=new B(n??Z,i??tt,NaN,NaN,NaN,NaN);return t==null?o:o.addAll(t)}function B(t,n,i,o,f,a){this._x=t,this._y=n,this._x0=i,this._y0=o,this._x1=f,this._y1=a,this._root=void 0}function P(t){for(var n={data:t.data},i=n;t=t.next;)i=i.next={data:t.data};return n}var A=Y.prototype=B.prototype;A.copy=function(){var t=new B(this._x,this._y,this._x0,this._y0,this._x1,this._y1),n=this._root,i,o;if(!n)return t;if(!n.length)return t._root=P(n),t;for(i=[{source:n,target:t._root=new Array(4)}];n=i.pop();)for(var f=0;f<4;++f)(o=n.source[f])&&(o.length?i.push({source:o,target:n.target[f]=new Array(4)}):n.target[f]=P(o));return t};A.add=$;A.addAll=F;A.cover=R;A.data=G;A.extent=H;A.find=J;A.remove=K;A.removeAll=L;A.root=O;A.size=U;A.visit=V;A.visitAfter=W;A.x=q;A.y=nt;function d(t){return function(){return t}}function E(t){return(t()-.5)*1e-6}function it(t){return t.x+t.vx}function et(t){return t.y+t.vy}function rt(t){var n,i,o,f=1,a=1;typeof t!="function"&&(t=d(t==null?1:+t));function s(){for(var r,y=n.length,p,_,h,x,u,g,c=0;c<a;++c)for(p=Y(n,it,et).visitAfter(e),r=0;r<y;++r)_=n[r],u=i[_.index],g=u*u,h=_.x+_.vx,x=_.y+_.vy,p.visit(v);function v(N,w,b,S,D){var z=N.data,X=N.r,m=u+X;if(z){if(z.index>_.index){var k=h-z.x-z.vx,j=x-z.y-z.vy,I=k*k+j*j;I<m*m&&(k===0&&(k=E(o),I+=k*k),j===0&&(j=E(o),I+=j*j),I=(m-(I=Math.sqrt(I)))/I*f,_.vx+=(k*=I)*(m=(X*=X)/(g+X)),_.vy+=(j*=I)*m,z.vx-=k*(m=1-m),z.vy-=j*m)}return}return w>h+m||S<h-m||b>x+m||D<x-m}}function e(r){if(r.data)return r.r=i[r.data.index];for(var y=r.r=0;y<4;++y)r[y]&&r[y].r>r.r&&(r.r=r[y].r)}function l(){if(n){var r,y=n.length,p;for(i=new Array(y),r=0;r<y;++r)p=n[r],i[p.index]=+t(p,r,n)}}return s.initialize=function(r,y){n=r,o=y,l()},s.iterations=function(r){return arguments.length?(a=+r,s):a},s.strength=function(r){return arguments.length?(f=+r,s):f},s.radius=function(r){return arguments.length?(t=typeof r=="function"?r:d(+r),l(),s):t},s}const ft=1664525,ot=1013904223,Q=4294967296;function at(){let t=1;return()=>(t=(ft*t+ot)%Q)/Q}function ut(t){return t.x}function ht(t){return t.y}var st=10,lt=Math.PI*(3-Math.sqrt(5));function ct(t){var n,i=1,o=.001,f=1-Math.pow(o,1/300),a=0,s=.6,e=new Map,l=C.timer(p),r=C.dispatch("tick","end"),y=at();t==null&&(t=[]);function p(){_(),r.call("tick",n),i<o&&(l.stop(),r.call("end",n))}function _(u){var g,c=t.length,v;u===void 0&&(u=1);for(var N=0;N<u;++N)for(i+=(a-i)*f,e.forEach(function(w){w(i)}),g=0;g<c;++g)v=t[g],v.fx==null?v.x+=v.vx*=s:(v.x=v.fx,v.vx=0),v.fy==null?v.y+=v.vy*=s:(v.y=v.fy,v.vy=0);return n}function h(){for(var u=0,g=t.length,c;u<g;++u){if(c=t[u],c.index=u,c.fx!=null&&(c.x=c.fx),c.fy!=null&&(c.y=c.fy),isNaN(c.x)||isNaN(c.y)){var v=st*Math.sqrt(.5+u),N=u*lt;c.x=v*Math.cos(N),c.y=v*Math.sin(N)}(isNaN(c.vx)||isNaN(c.vy))&&(c.vx=c.vy=0)}}function x(u){return u.initialize&&u.initialize(t,y),u}return h(),n={tick:_,restart:function(){return l.restart(p),n},stop:function(){return l.stop(),n},nodes:function(u){return arguments.length?(t=u,h(),e.forEach(x),n):t},alpha:function(u){return arguments.length?(i=+u,n):i},alphaMin:function(u){return arguments.length?(o=+u,n):o},alphaDecay:function(u){return arguments.length?(f=+u,n):+f},alphaTarget:function(u){return arguments.length?(a=+u,n):a},velocityDecay:function(u){return arguments.length?(s=1-u,n):1-s},randomSource:function(u){return arguments.length?(y=u,e.forEach(x),n):y},force:function(u,g){return arguments.length>1?(g==null?e.delete(u):e.set(u,x(g)),n):e.get(u)},find:function(u,g,c){var v=0,N=t.length,w,b,S,D,z;for(c==null?c=1/0:c*=c,v=0;v<N;++v)D=t[v],w=u-D.x,b=g-D.y,S=w*w+b*b,S<c&&(z=D,c=S);return z},on:function(u,g){return arguments.length>1?(r.on(u,g),n):r.on(u)}}}function yt(){var t,n,i,o,f=d(-30),a,s=1,e=1/0,l=.81;function r(h){var x,u=t.length,g=Y(t,ut,ht).visitAfter(p);for(o=h,x=0;x<u;++x)n=t[x],g.visit(_)}function y(){if(t){var h,x=t.length,u;for(a=new Array(x),h=0;h<x;++h)u=t[h],a[u.index]=+f(u,h,t)}}function p(h){var x=0,u,g,c=0,v,N,w;if(h.length){for(v=N=w=0;w<4;++w)(u=h[w])&&(g=Math.abs(u.value))&&(x+=u.value,c+=g,v+=g*u.x,N+=g*u.y);h.x=v/c,h.y=N/c}else{u=h,u.x=u.data.x,u.y=u.data.y;do x+=a[u.data.index];while(u=u.next)}h.value=x}function _(h,x,u,g){if(!h.value)return!0;var c=h.x-n.x,v=h.y-n.y,N=g-x,w=c*c+v*v;if(N*N/l<w)return w<e&&(c===0&&(c=E(i),w+=c*c),v===0&&(v=E(i),w+=v*v),w<s&&(w=Math.sqrt(s*w)),n.vx+=c*h.value*o/w,n.vy+=v*h.value*o/w),!0;if(h.length||w>=e)return;(h.data!==n||h.next)&&(c===0&&(c=E(i),w+=c*c),v===0&&(v=E(i),w+=v*v),w<s&&(w=Math.sqrt(s*w)));do h.data!==n&&(N=a[h.data.index]*o/w,n.vx+=c*N,n.vy+=v*N);while(h=h.next)}return r.initialize=function(h,x){t=h,i=x,y()},r.strength=function(h){return arguments.length?(f=typeof h=="function"?h:d(+h),y(),r):f},r.distanceMin=function(h){return arguments.length?(s=h*h,r):Math.sqrt(s)},r.distanceMax=function(h){return arguments.length?(e=h*h,r):Math.sqrt(e)},r.theta=function(h){return arguments.length?(l=h*h,r):Math.sqrt(l)},r}function vt(t){var n=d(.1),i,o,f;typeof t!="function"&&(t=d(t==null?0:+t));function a(e){for(var l=0,r=i.length,y;l<r;++l)y=i[l],y.vx+=(f[l]-y.x)*o[l]*e}function s(){if(i){var e,l=i.length;for(o=new Array(l),f=new Array(l),e=0;e<l;++e)o[e]=isNaN(f[e]=+t(i[e],e,i))?0:+n(i[e],e,i)}}return a.initialize=function(e){i=e,s()},a.strength=function(e){return arguments.length?(n=typeof e=="function"?e:d(+e),s(),a):n},a.x=function(e){return arguments.length?(t=typeof e=="function"?e:d(+e),s(),a):t},a}function gt(t){var n=d(.1),i,o,f;typeof t!="function"&&(t=d(t==null?0:+t));function a(e){for(var l=0,r=i.length,y;l<r;++l)y=i[l],y.vy+=(f[l]-y.y)*o[l]*e}function s(){if(i){var e,l=i.length;for(o=new Array(l),f=new Array(l),e=0;e<l;++e)o[e]=isNaN(f[e]=+t(i[e],e,i))?0:+n(i[e],e,i)}}return a.initialize=function(e){i=e,s()},a.strength=function(e){return arguments.length?(n=typeof e=="function"?e:d(+e),s(),a):n},a.y=function(e){return arguments.length?(t=typeof e=="function"?e:d(+e),s(),a):t},a}exports.forceCollide=rt;exports.forceManyBody=yt;exports.forceSimulation=ct;exports.forceX=vt;exports.forceY=gt;
+//# sourceMappingURL=y-QcCbqrzx.cjs.map