@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/d3-hierarchy/src/pack/enclose.js

@@ -0,0 +1,69 @@
+import { shuffle as I } from "../array.js";
+function P(r, n) {
+  for (var e = 0, t = (r = I(Array.from(r), n)).length, o = [], s, x; e < t; )
+    s = r[e], x && G(x, s) ? ++e : (x = K(o = J(o, s)), e = 0);
+  return x;
+}
+function J(r, n) {
+  var e, t;
+  if (j(n, r)) return [n];
+  for (e = 0; e < r.length; ++e)
+    if (w(n, r[e]) && j(l(r[e], n), r))
+      return [r[e], n];
+  for (e = 0; e < r.length - 1; ++e)
+    for (t = e + 1; t < r.length; ++t)
+      if (w(l(r[e], r[t]), n) && w(l(r[e], n), r[t]) && w(l(r[t], n), r[e]) && j(H(r[e], r[t], n), r))
+        return [r[e], r[t], n];
+  throw new Error();
+}
+function w(r, n) {
+  var e = r.r - n.r, t = n.x - r.x, o = n.y - r.y;
+  return e < 0 || e * e < t * t + o * o;
+}
+function G(r, n) {
+  var e = r.r - n.r + Math.max(r.r, n.r, 1) * 1e-9, t = n.x - r.x, o = n.y - r.y;
+  return e > 0 && e * e > t * t + o * o;
+}
+function j(r, n) {
+  for (var e = 0; e < n.length; ++e)
+    if (!G(r, n[e]))
+      return !1;
+  return !0;
+}
+function K(r) {
+  switch (r.length) {
+    case 1:
+      return L(r[0]);
+    case 2:
+      return l(r[0], r[1]);
+    case 3:
+      return H(r[0], r[1], r[2]);
+  }
+}
+function L(r) {
+  return {
+    x: r.x,
+    y: r.y,
+    r: r.r
+  };
+}
+function l(r, n) {
+  var e = r.x, t = r.y, o = r.r, s = n.x, x = n.y, a = n.r, u = s - e, y = x - t, i = a - o, f = Math.sqrt(u * u + y * y);
+  return {
+    x: (e + s + u / f * i) / 2,
+    y: (t + x + y / f * i) / 2,
+    r: (f + o + a) / 2
+  };
+}
+function H(r, n, e) {
+  var t = r.x, o = r.y, s = r.r, x = n.x, a = n.y, u = n.r, y = e.x, i = e.y, f = e.r, M = t - x, k = t - y, A = o - a, q = o - i, C = u - s, N = f - s, R = t * t + o * o - s * s, z = R - x * x - a * a + u * u, D = R - y * y - i * i + f * f, c = k * A - M * q, h = (A * D - q * z) / (c * 2) - t, d = (q * C - A * N) / c, v = (k * z - M * D) / (c * 2) - o, g = (M * N - k * C) / c, E = d * d + g * g - 1, m = 2 * (s + h * d + v * g), F = h * h + v * v - s * s, W = -(Math.abs(E) > 1e-6 ? (m + Math.sqrt(m * m - 4 * E * F)) / (2 * E) : F / m);
+  return {
+    x: t + h + d * W,
+    y: o + v + g * W,
+    r: W
+  };
+}
+export {
+  P as packEncloseRandom
+};
+//# sourceMappingURL=enclose.js.map

package/dist/node_modules/d3-hierarchy/src/pack/enclose.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"enclose.js","sources":["../../../../../node_modules/d3-hierarchy/src/pack/enclose.js"],"sourcesContent":["import {shuffle} from \"../array.js\";\nimport lcg from \"../lcg.js\";\n\nexport default function(circles) {\n  return packEncloseRandom(circles, lcg());\n}\n\nexport function packEncloseRandom(circles, random) {\n  var i = 0, n = (circles = shuffle(Array.from(circles), random)).length, B = [], p, e;\n\n  while (i < n) {\n    p = circles[i];\n    if (e && enclosesWeak(e, p)) ++i;\n    else e = encloseBasis(B = extendBasis(B, p)), i = 0;\n  }\n\n  return e;\n}\n\nfunction extendBasis(B, p) {\n  var i, j;\n\n  if (enclosesWeakAll(p, B)) return [p];\n\n  // If we get here then B must have at least one element.\n  for (i = 0; i < B.length; ++i) {\n    if (enclosesNot(p, B[i])\n        && enclosesWeakAll(encloseBasis2(B[i], p), B)) {\n      return [B[i], p];\n    }\n  }\n\n  // If we get here then B must have at least two elements.\n  for (i = 0; i < B.length - 1; ++i) {\n    for (j = i + 1; j < B.length; ++j) {\n      if (enclosesNot(encloseBasis2(B[i], B[j]), p)\n          && enclosesNot(encloseBasis2(B[i], p), B[j])\n          && enclosesNot(encloseBasis2(B[j], p), B[i])\n          && enclosesWeakAll(encloseBasis3(B[i], B[j], p), B)) {\n        return [B[i], B[j], p];\n      }\n    }\n  }\n\n  // If we get here then something is very wrong.\n  throw new Error;\n}\n\nfunction enclosesNot(a, b) {\n  var dr = a.r - b.r, dx = b.x - a.x, dy = b.y - a.y;\n  return dr < 0 || dr * dr < dx * dx + dy * dy;\n}\n\nfunction enclosesWeak(a, b) {\n  var dr = a.r - b.r + Math.max(a.r, b.r, 1) * 1e-9, dx = b.x - a.x, dy = b.y - a.y;\n  return dr > 0 && dr * dr > dx * dx + dy * dy;\n}\n\nfunction enclosesWeakAll(a, B) {\n  for (var i = 0; i < B.length; ++i) {\n    if (!enclosesWeak(a, B[i])) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction encloseBasis(B) {\n  switch (B.length) {\n    case 1: return encloseBasis1(B[0]);\n    case 2: return encloseBasis2(B[0], B[1]);\n    case 3: return encloseBasis3(B[0], B[1], B[2]);\n  }\n}\n\nfunction encloseBasis1(a) {\n  return {\n    x: a.x,\n    y: a.y,\n    r: a.r\n  };\n}\n\nfunction encloseBasis2(a, b) {\n  var x1 = a.x, y1 = a.y, r1 = a.r,\n      x2 = b.x, y2 = b.y, r2 = b.r,\n      x21 = x2 - x1, y21 = y2 - y1, r21 = r2 - r1,\n      l = Math.sqrt(x21 * x21 + y21 * y21);\n  return {\n    x: (x1 + x2 + x21 / l * r21) / 2,\n    y: (y1 + y2 + y21 / l * r21) / 2,\n    r: (l + r1 + r2) / 2\n  };\n}\n\nfunction encloseBasis3(a, b, c) {\n  var x1 = a.x, y1 = a.y, r1 = a.r,\n      x2 = b.x, y2 = b.y, r2 = b.r,\n      x3 = c.x, y3 = c.y, r3 = c.r,\n      a2 = x1 - x2,\n      a3 = x1 - x3,\n      b2 = y1 - y2,\n      b3 = y1 - y3,\n      c2 = r2 - r1,\n      c3 = r3 - r1,\n      d1 = x1 * x1 + y1 * y1 - r1 * r1,\n      d2 = d1 - x2 * x2 - y2 * y2 + r2 * r2,\n      d3 = d1 - x3 * x3 - y3 * y3 + r3 * r3,\n      ab = a3 * b2 - a2 * b3,\n      xa = (b2 * d3 - b3 * d2) / (ab * 2) - x1,\n      xb = (b3 * c2 - b2 * c3) / ab,\n      ya = (a3 * d2 - a2 * d3) / (ab * 2) - y1,\n      yb = (a2 * c3 - a3 * c2) / ab,\n      A = xb * xb + yb * yb - 1,\n      B = 2 * (r1 + xa * xb + ya * yb),\n      C = xa * xa + ya * ya - r1 * r1,\n      r = -(Math.abs(A) > 1e-6 ? (B + Math.sqrt(B * B - 4 * A * C)) / (2 * A) : C / B);\n  return {\n    x: x1 + xa + xb * r,\n    y: y1 + ya + yb * r,\n    r: r\n  };\n}\n"],"names":["packEncloseRandom","circles","random","i","n","shuffle","B","p","e","enclosesWeak","encloseBasis","extendBasis","j","enclosesWeakAll","enclosesNot","encloseBasis2","encloseBasis3","a","b","dr","dx","dy","encloseBasis1","x1","y1","r1","x2","y2","r2","x21","y21","r21","l","c","x3","y3","r3","a2","a3","b2","b3","c2","c3","d1","d2","d3","ab","xa","xb","ya","yb","A","C","r"],"mappings":";AAOO,SAASA,EAAkBC,GAASC,GAAQ;AAGjD,WAFIC,IAAI,GAAGC,KAAKH,IAAUI,EAAQ,MAAM,KAAKJ,CAAO,GAAGC,CAAM,GAAG,QAAQI,IAAI,CAAA,GAAIC,GAAGC,GAE5EL,IAAIC;AACT,IAAAG,IAAIN,EAAQE,CAAC,GACTK,KAAKC,EAAaD,GAAGD,CAAC,IAAG,EAAEJ,KAC1BK,IAAIE,EAAaJ,IAAIK,EAAYL,GAAGC,CAAC,CAAC,GAAGJ,IAAI;AAGpD,SAAOK;AACT;AAEA,SAASG,EAAYL,GAAGC,GAAG;AACzB,MAAIJ,GAAGS;AAEP,MAAIC,EAAgBN,GAAGD,CAAC,EAAG,QAAO,CAACC,CAAC;AAGpC,OAAKJ,IAAI,GAAGA,IAAIG,EAAE,QAAQ,EAAEH;AAC1B,QAAIW,EAAYP,GAAGD,EAAEH,CAAC,CAAC,KAChBU,EAAgBE,EAAcT,EAAEH,CAAC,GAAGI,CAAC,GAAGD,CAAC;AAC9C,aAAO,CAACA,EAAEH,CAAC,GAAGI,CAAC;AAKnB,OAAKJ,IAAI,GAAGA,IAAIG,EAAE,SAAS,GAAG,EAAEH;AAC9B,SAAKS,IAAIT,IAAI,GAAGS,IAAIN,EAAE,QAAQ,EAAEM;AAC9B,UAAIE,EAAYC,EAAcT,EAAEH,CAAC,GAAGG,EAAEM,CAAC,CAAC,GAAGL,CAAC,KACrCO,EAAYC,EAAcT,EAAEH,CAAC,GAAGI,CAAC,GAAGD,EAAEM,CAAC,CAAC,KACxCE,EAAYC,EAAcT,EAAEM,CAAC,GAAGL,CAAC,GAAGD,EAAEH,CAAC,CAAC,KACxCU,EAAgBG,EAAcV,EAAEH,CAAC,GAAGG,EAAEM,CAAC,GAAGL,CAAC,GAAGD,CAAC;AACpD,eAAO,CAACA,EAAEH,CAAC,GAAGG,EAAEM,CAAC,GAAGL,CAAC;AAM3B,QAAM,IAAI;AACZ;AAEA,SAASO,EAAYG,GAAGC,GAAG;AACzB,MAAIC,IAAKF,EAAE,IAAIC,EAAE,GAAGE,IAAKF,EAAE,IAAID,EAAE,GAAGI,IAAKH,EAAE,IAAID,EAAE;AACjD,SAAOE,IAAK,KAAKA,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA;AAC5C;AAEA,SAASZ,EAAaQ,GAAGC,GAAG;AAC1B,MAAIC,IAAKF,EAAE,IAAIC,EAAE,IAAI,KAAK,IAAID,EAAE,GAAGC,EAAE,GAAG,CAAC,IAAI,MAAME,IAAKF,EAAE,IAAID,EAAE,GAAGI,IAAKH,EAAE,IAAID,EAAE;AAChF,SAAOE,IAAK,KAAKA,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA;AAC5C;AAEA,SAASR,EAAgBI,GAAGX,GAAG;AAC7B,WAASH,IAAI,GAAGA,IAAIG,EAAE,QAAQ,EAAEH;AAC9B,QAAI,CAACM,EAAaQ,GAAGX,EAAEH,CAAC,CAAC;AACvB,aAAO;AAGX,SAAO;AACT;AAEA,SAASO,EAAaJ,GAAG;AACvB,UAAQA,EAAE,QAAM;AAAA,IACd,KAAK;AAAG,aAAOgB,EAAchB,EAAE,CAAC,CAAC;AAAA,IACjC,KAAK;AAAG,aAAOS,EAAcT,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC;AAAA,IACvC,KAAK;AAAG,aAAOU,EAAcV,EAAE,CAAC,GAAGA,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC;AAAA,EACjD;AACA;AAEA,SAASgB,EAAcL,GAAG;AACxB,SAAO;AAAA,IACL,GAAGA,EAAE;AAAA,IACL,GAAGA,EAAE;AAAA,IACL,GAAGA,EAAE;AAAA,EACT;AACA;AAEA,SAASF,EAAcE,GAAGC,GAAG;AAC3B,MAAIK,IAAKN,EAAE,GAAGO,IAAKP,EAAE,GAAGQ,IAAKR,EAAE,GAC3BS,IAAKR,EAAE,GAAGS,IAAKT,EAAE,GAAGU,IAAKV,EAAE,GAC3BW,IAAMH,IAAKH,GAAIO,IAAMH,IAAKH,GAAIO,IAAMH,IAAKH,GACzCO,IAAI,KAAK,KAAKH,IAAMA,IAAMC,IAAMA,CAAG;AACvC,SAAO;AAAA,IACL,IAAIP,IAAKG,IAAKG,IAAMG,IAAID,KAAO;AAAA,IAC/B,IAAIP,IAAKG,IAAKG,IAAME,IAAID,KAAO;AAAA,IAC/B,IAAIC,IAAIP,IAAKG,KAAM;AAAA,EACvB;AACA;AAEA,SAASZ,EAAcC,GAAGC,GAAGe,GAAG;AAC9B,MAAIV,IAAKN,EAAE,GAAGO,IAAKP,EAAE,GAAGQ,IAAKR,EAAE,GAC3BS,IAAKR,EAAE,GAAGS,IAAKT,EAAE,GAAGU,IAAKV,EAAE,GAC3BgB,IAAKD,EAAE,GAAGE,IAAKF,EAAE,GAAGG,IAAKH,EAAE,GAC3BI,IAAKd,IAAKG,GACVY,IAAKf,IAAKW,GACVK,IAAKf,IAAKG,GACVa,IAAKhB,IAAKW,GACVM,IAAKb,IAAKH,GACViB,IAAKN,IAAKX,GACVkB,IAAKpB,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA,GAC9BmB,IAAKD,IAAKjB,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA,GACnCiB,IAAKF,IAAKT,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA,GACnCU,IAAKR,IAAKC,IAAKF,IAAKG,GACpBO,KAAMR,IAAKM,IAAKL,IAAKI,MAAOE,IAAK,KAAKvB,GACtCyB,KAAMR,IAAKC,IAAKF,IAAKG,KAAMI,GAC3BG,KAAMX,IAAKM,IAAKP,IAAKQ,MAAOC,IAAK,KAAKtB,GACtC0B,KAAMb,IAAKK,IAAKJ,IAAKG,KAAMK,GAC3BK,IAAIH,IAAKA,IAAKE,IAAKA,IAAK,GACxB5C,IAAI,KAAKmB,IAAKsB,IAAKC,IAAKC,IAAKC,IAC7BE,IAAIL,IAAKA,IAAKE,IAAKA,IAAKxB,IAAKA,GAC7B4B,IAAI,EAAE,KAAK,IAAIF,CAAC,IAAI,QAAQ7C,IAAI,KAAK,KAAKA,IAAIA,IAAI,IAAI6C,IAAIC,CAAC,MAAM,IAAID,KAAKC,IAAI9C;AAClF,SAAO;AAAA,IACL,GAAGiB,IAAKwB,IAAKC,IAAKK;AAAA,IAClB,GAAG7B,IAAKyB,IAAKC,IAAKG;AAAA,IAClB,GAAGA;AAAA,EACP;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/pack/index.js

@@ -0,0 +1,46 @@
+import { optional as p } from "../accessors.js";
+import l, { constantZero as m } from "../constant.js";
+import g from "../lcg.js";
+import { packSiblingsRandom as y } from "./siblings.js";
+function d(r) {
+  return Math.sqrt(r.value);
+}
+function A() {
+  var r = null, n = 1, e = 1, f = m;
+  function a(t) {
+    const u = g();
+    return t.x = n / 2, t.y = e / 2, r ? t.eachBefore(s(r)).eachAfter(c(f, 0.5, u)).eachBefore(h(1)) : t.eachBefore(s(d)).eachAfter(c(m, 1, u)).eachAfter(c(f, t.r / Math.min(n, e), u)).eachBefore(h(Math.min(n, e) / (2 * t.r))), t;
+  }
+  return a.radius = function(t) {
+    return arguments.length ? (r = p(t), a) : r;
+  }, a.size = function(t) {
+    return arguments.length ? (n = +t[0], e = +t[1], a) : [n, e];
+  }, a.padding = function(t) {
+    return arguments.length ? (f = typeof t == "function" ? t : l(+t), a) : f;
+  }, a;
+}
+function s(r) {
+  return function(n) {
+    n.children || (n.r = Math.max(0, +r(n) || 0));
+  };
+}
+function c(r, n, e) {
+  return function(f) {
+    if (a = f.children) {
+      var a, t, u = a.length, i = r(f) * n || 0, o;
+      if (i) for (t = 0; t < u; ++t) a[t].r += i;
+      if (o = y(a, e), i) for (t = 0; t < u; ++t) a[t].r -= i;
+      f.r = o + i;
+    }
+  };
+}
+function h(r) {
+  return function(n) {
+    var e = n.parent;
+    n.r *= r, e && (n.x = e.x + r * n.x, n.y = e.y + r * n.y);
+  };
+}
+export {
+  A as default
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/d3-hierarchy/src/pack/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/d3-hierarchy/src/pack/index.js"],"sourcesContent":["import {optional} from \"../accessors.js\";\nimport constant, {constantZero} from \"../constant.js\";\nimport lcg from \"../lcg.js\";\nimport {packSiblingsRandom} from \"./siblings.js\";\n\nfunction defaultRadius(d) {\n  return Math.sqrt(d.value);\n}\n\nexport default function() {\n  var radius = null,\n      dx = 1,\n      dy = 1,\n      padding = constantZero;\n\n  function pack(root) {\n    const random = lcg();\n    root.x = dx / 2, root.y = dy / 2;\n    if (radius) {\n      root.eachBefore(radiusLeaf(radius))\n          .eachAfter(packChildrenRandom(padding, 0.5, random))\n          .eachBefore(translateChild(1));\n    } else {\n      root.eachBefore(radiusLeaf(defaultRadius))\n          .eachAfter(packChildrenRandom(constantZero, 1, random))\n          .eachAfter(packChildrenRandom(padding, root.r / Math.min(dx, dy), random))\n          .eachBefore(translateChild(Math.min(dx, dy) / (2 * root.r)));\n    }\n    return root;\n  }\n\n  pack.radius = function(x) {\n    return arguments.length ? (radius = optional(x), pack) : radius;\n  };\n\n  pack.size = function(x) {\n    return arguments.length ? (dx = +x[0], dy = +x[1], pack) : [dx, dy];\n  };\n\n  pack.padding = function(x) {\n    return arguments.length ? (padding = typeof x === \"function\" ? x : constant(+x), pack) : padding;\n  };\n\n  return pack;\n}\n\nfunction radiusLeaf(radius) {\n  return function(node) {\n    if (!node.children) {\n      node.r = Math.max(0, +radius(node) || 0);\n    }\n  };\n}\n\nfunction packChildrenRandom(padding, k, random) {\n  return function(node) {\n    if (children = node.children) {\n      var children,\n          i,\n          n = children.length,\n          r = padding(node) * k || 0,\n          e;\n\n      if (r) for (i = 0; i < n; ++i) children[i].r += r;\n      e = packSiblingsRandom(children, random);\n      if (r) for (i = 0; i < n; ++i) children[i].r -= r;\n      node.r = e + r;\n    }\n  };\n}\n\nfunction translateChild(k) {\n  return function(node) {\n    var parent = node.parent;\n    node.r *= k;\n    if (parent) {\n      node.x = parent.x + k * node.x;\n      node.y = parent.y + k * node.y;\n    }\n  };\n}\n"],"names":["defaultRadius","d","packLayout","radius","dx","dy","padding","constantZero","pack","root","random","lcg","radiusLeaf","packChildrenRandom","translateChild","x","optional","constant","node","k","children","i","n","r","e","packSiblingsRandom","parent"],"mappings":";;;;AAKA,SAASA,EAAcC,GAAG;AACxB,SAAO,KAAK,KAAKA,EAAE,KAAK;AAC1B;AAEe,SAAAC,IAAW;AACxB,MAAIC,IAAS,MACTC,IAAK,GACLC,IAAK,GACLC,IAAUC;AAEd,WAASC,EAAKC,GAAM;AAClB,UAAMC,IAASC,EAAG;AAClB,WAAAF,EAAK,IAAIL,IAAK,GAAGK,EAAK,IAAIJ,IAAK,GAC3BF,IACFM,EAAK,WAAWG,EAAWT,CAAM,CAAC,EAC7B,UAAUU,EAAmBP,GAAS,KAAKI,CAAM,CAAC,EAClD,WAAWI,EAAe,CAAC,CAAC,IAEjCL,EAAK,WAAWG,EAAWZ,CAAa,CAAC,EACpC,UAAUa,EAAmBN,GAAc,GAAGG,CAAM,CAAC,EACrD,UAAUG,EAAmBP,GAASG,EAAK,IAAI,KAAK,IAAIL,GAAIC,CAAE,GAAGK,CAAM,CAAC,EACxE,WAAWI,EAAe,KAAK,IAAIV,GAAIC,CAAE,KAAK,IAAII,EAAK,EAAE,CAAC,GAE1DA;AAAA,EACT;AAEA,SAAAD,EAAK,SAAS,SAASO,GAAG;AACxB,WAAO,UAAU,UAAUZ,IAASa,EAASD,CAAC,GAAGP,KAAQL;AAAA,EAC3D,GAEAK,EAAK,OAAO,SAASO,GAAG;AACtB,WAAO,UAAU,UAAUX,IAAK,CAACW,EAAE,CAAC,GAAGV,IAAK,CAACU,EAAE,CAAC,GAAGP,KAAQ,CAACJ,GAAIC,CAAE;AAAA,EACpE,GAEAG,EAAK,UAAU,SAASO,GAAG;AACzB,WAAO,UAAU,UAAUT,IAAU,OAAOS,KAAM,aAAaA,IAAIE,EAAS,CAACF,CAAC,GAAGP,KAAQF;AAAA,EAC3F,GAEOE;AACT;AAEA,SAASI,EAAWT,GAAQ;AAC1B,SAAO,SAASe,GAAM;AACpB,IAAKA,EAAK,aACRA,EAAK,IAAI,KAAK,IAAI,GAAG,CAACf,EAAOe,CAAI,KAAK,CAAC;AAAA,EAE3C;AACF;AAEA,SAASL,EAAmBP,GAASa,GAAGT,GAAQ;AAC9C,SAAO,SAASQ,GAAM;AACpB,QAAIE,IAAWF,EAAK,UAAU;AAC5B,UAAIE,GACAC,GACAC,IAAIF,EAAS,QACbG,IAAIjB,EAAQY,CAAI,IAAIC,KAAK,GACzBK;AAEJ,UAAID,EAAG,MAAKF,IAAI,GAAGA,IAAIC,GAAG,EAAED,EAAG,CAAAD,EAASC,CAAC,EAAE,KAAKE;AAEhD,UADAC,IAAIC,EAAmBL,GAAUV,CAAM,GACnCa,EAAG,MAAKF,IAAI,GAAGA,IAAIC,GAAG,EAAED,EAAG,CAAAD,EAASC,CAAC,EAAE,KAAKE;AAChD,MAAAL,EAAK,IAAIM,IAAID;AAAA,IACf;AAAA,EACF;AACF;AAEA,SAAST,EAAeK,GAAG;AACzB,SAAO,SAASD,GAAM;AACpB,QAAIQ,IAASR,EAAK;AAClB,IAAAA,EAAK,KAAKC,GACNO,MACFR,EAAK,IAAIQ,EAAO,IAAIP,IAAID,EAAK,GAC7BA,EAAK,IAAIQ,EAAO,IAAIP,IAAID,EAAK;AAAA,EAEjC;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/pack/siblings.js

@@ -0,0 +1,52 @@
+import l from "../array.js";
+import { packEncloseRandom as m } from "./enclose.js";
+function v(t, x, r) {
+  var n = t.x - x.x, e, o, y = t.y - x.y, s, i, u = n * n + y * y;
+  u ? (o = x.r + r.r, o *= o, i = t.r + r.r, i *= i, o > i ? (e = (u + i - o) / (2 * u), s = Math.sqrt(Math.max(0, i / u - e * e)), r.x = t.x - e * n - s * y, r.y = t.y - e * y + s * n) : (e = (u + o - i) / (2 * u), s = Math.sqrt(Math.max(0, o / u - e * e)), r.x = x.x + e * n - s * y, r.y = x.y + e * y + s * n)) : (r.x = x.x + r.r, r.y = x.y);
+}
+function h(t, x) {
+  var r = t.r + x.r - 1e-6, n = x.x - t.x, e = x.y - t.y;
+  return r > 0 && r * r > n * n + e * e;
+}
+function d(t) {
+  var x = t._, r = t.next._, n = x.r + r.r, e = (x.x * r.r + r.x * x.r) / n, o = (x.y * r.r + r.y * x.r) / n;
+  return e * e + o * o;
+}
+function p(t) {
+  this._ = t, this.next = null, this.previous = null;
+}
+function M(t, x) {
+  if (!(o = (t = l(t)).length)) return 0;
+  var r, n, e, o, y, s, i, u, f, a, _;
+  if (r = t[0], r.x = 0, r.y = 0, !(o > 1)) return r.r;
+  if (n = t[1], r.x = -n.r, n.x = r.r, n.y = 0, !(o > 2)) return r.r + n.r;
+  v(n, r, e = t[2]), r = new p(r), n = new p(n), e = new p(e), r.next = e.previous = n, n.next = r.previous = e, e.next = n.previous = r;
+  r: for (i = 3; i < o; ++i) {
+    v(r._, n._, e = t[i]), e = new p(e), u = n.next, f = r.previous, a = n._.r, _ = r._.r;
+    do
+      if (a <= _) {
+        if (h(u._, e._)) {
+          n = u, r.next = n, n.previous = r, --i;
+          continue r;
+        }
+        a += u._.r, u = u.next;
+      } else {
+        if (h(f._, e._)) {
+          r = f, r.next = n, n.previous = r, --i;
+          continue r;
+        }
+        _ += f._.r, f = f.previous;
+      }
+    while (u !== f.next);
+    for (e.previous = r, e.next = n, r.next = n.previous = n = e, y = d(r); (e = e.next) !== n; )
+      (s = d(e)) < y && (r = e, y = s);
+    n = r.next;
+  }
+  for (r = [n._], e = n; (e = e.next) !== n; ) r.push(e._);
+  for (e = m(r, x), i = 0; i < o; ++i) r = t[i], r.x -= e.x, r.y -= e.y;
+  return e.r;
+}
+export {
+  M as packSiblingsRandom
+};
+//# sourceMappingURL=siblings.js.map

package/dist/node_modules/d3-hierarchy/src/pack/siblings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"siblings.js","sources":["../../../../../node_modules/d3-hierarchy/src/pack/siblings.js"],"sourcesContent":["import array from \"../array.js\";\nimport lcg from \"../lcg.js\";\nimport {packEncloseRandom} from \"./enclose.js\";\n\nfunction place(b, a, c) {\n  var dx = b.x - a.x, x, a2,\n      dy = b.y - a.y, y, b2,\n      d2 = dx * dx + dy * dy;\n  if (d2) {\n    a2 = a.r + c.r, a2 *= a2;\n    b2 = b.r + c.r, b2 *= b2;\n    if (a2 > b2) {\n      x = (d2 + b2 - a2) / (2 * d2);\n      y = Math.sqrt(Math.max(0, b2 / d2 - x * x));\n      c.x = b.x - x * dx - y * dy;\n      c.y = b.y - x * dy + y * dx;\n    } else {\n      x = (d2 + a2 - b2) / (2 * d2);\n      y = Math.sqrt(Math.max(0, a2 / d2 - x * x));\n      c.x = a.x + x * dx - y * dy;\n      c.y = a.y + x * dy + y * dx;\n    }\n  } else {\n    c.x = a.x + c.r;\n    c.y = a.y;\n  }\n}\n\nfunction intersects(a, b) {\n  var dr = a.r + b.r - 1e-6, dx = b.x - a.x, dy = b.y - a.y;\n  return dr > 0 && dr * dr > dx * dx + dy * dy;\n}\n\nfunction score(node) {\n  var a = node._,\n      b = node.next._,\n      ab = a.r + b.r,\n      dx = (a.x * b.r + b.x * a.r) / ab,\n      dy = (a.y * b.r + b.y * a.r) / ab;\n  return dx * dx + dy * dy;\n}\n\nfunction Node(circle) {\n  this._ = circle;\n  this.next = null;\n  this.previous = null;\n}\n\nexport function packSiblingsRandom(circles, random) {\n  if (!(n = (circles = array(circles)).length)) return 0;\n\n  var a, b, c, n, aa, ca, i, j, k, sj, sk;\n\n  // Place the first circle.\n  a = circles[0], a.x = 0, a.y = 0;\n  if (!(n > 1)) return a.r;\n\n  // Place the second circle.\n  b = circles[1], a.x = -b.r, b.x = a.r, b.y = 0;\n  if (!(n > 2)) return a.r + b.r;\n\n  // Place the third circle.\n  place(b, a, c = circles[2]);\n\n  // Initialize the front-chain using the first three circles a, b and c.\n  a = new Node(a), b = new Node(b), c = new Node(c);\n  a.next = c.previous = b;\n  b.next = a.previous = c;\n  c.next = b.previous = a;\n\n  // Attempt to place each remaining circle…\n  pack: for (i = 3; i < n; ++i) {\n    place(a._, b._, c = circles[i]), c = new Node(c);\n\n    // Find the closest intersecting circle on the front-chain, if any.\n    // “Closeness” is determined by linear distance along the front-chain.\n    // “Ahead” or “behind” is likewise determined by linear distance.\n    j = b.next, k = a.previous, sj = b._.r, sk = a._.r;\n    do {\n      if (sj <= sk) {\n        if (intersects(j._, c._)) {\n          b = j, a.next = b, b.previous = a, --i;\n          continue pack;\n        }\n        sj += j._.r, j = j.next;\n      } else {\n        if (intersects(k._, c._)) {\n          a = k, a.next = b, b.previous = a, --i;\n          continue pack;\n        }\n        sk += k._.r, k = k.previous;\n      }\n    } while (j !== k.next);\n\n    // Success! Insert the new circle c between a and b.\n    c.previous = a, c.next = b, a.next = b.previous = b = c;\n\n    // Compute the new closest circle pair to the centroid.\n    aa = score(a);\n    while ((c = c.next) !== b) {\n      if ((ca = score(c)) < aa) {\n        a = c, aa = ca;\n      }\n    }\n    b = a.next;\n  }\n\n  // Compute the enclosing circle of the front chain.\n  a = [b._], c = b; while ((c = c.next) !== b) a.push(c._); c = packEncloseRandom(a, random);\n\n  // Translate the circles to put the enclosing circle around the origin.\n  for (i = 0; i < n; ++i) a = circles[i], a.x -= c.x, a.y -= c.y;\n\n  return c.r;\n}\n\nexport default function(circles) {\n  packSiblingsRandom(circles, lcg());\n  return circles;\n}\n"],"names":["place","b","a","c","dx","x","a2","dy","y","b2","d2","intersects","dr","score","node","ab","Node","circle","packSiblingsRandom","circles","random","n","array","aa","ca","j","k","sj","sk","pack","packEncloseRandom"],"mappings":";;AAIA,SAASA,EAAMC,GAAGC,GAAGC,GAAG;AACtB,MAAIC,IAAKH,EAAE,IAAIC,EAAE,GAAGG,GAAGC,GACnBC,IAAKN,EAAE,IAAIC,EAAE,GAAGM,GAAGC,GACnBC,IAAKN,IAAKA,IAAKG,IAAKA;AACxB,EAAIG,KACFJ,IAAKJ,EAAE,IAAIC,EAAE,GAAGG,KAAMA,GACtBG,IAAKR,EAAE,IAAIE,EAAE,GAAGM,KAAMA,GAClBH,IAAKG,KACPJ,KAAKK,IAAKD,IAAKH,MAAO,IAAII,IAC1BF,IAAI,KAAK,KAAK,KAAK,IAAI,GAAGC,IAAKC,IAAKL,IAAIA,CAAC,CAAC,GAC1CF,EAAE,IAAIF,EAAE,IAAII,IAAID,IAAKI,IAAID,GACzBJ,EAAE,IAAIF,EAAE,IAAII,IAAIE,IAAKC,IAAIJ,MAEzBC,KAAKK,IAAKJ,IAAKG,MAAO,IAAIC,IAC1BF,IAAI,KAAK,KAAK,KAAK,IAAI,GAAGF,IAAKI,IAAKL,IAAIA,CAAC,CAAC,GAC1CF,EAAE,IAAID,EAAE,IAAIG,IAAID,IAAKI,IAAID,GACzBJ,EAAE,IAAID,EAAE,IAAIG,IAAIE,IAAKC,IAAIJ,OAG3BD,EAAE,IAAID,EAAE,IAAIC,EAAE,GACdA,EAAE,IAAID,EAAE;AAEZ;AAEA,SAASS,EAAWT,GAAGD,GAAG;AACxB,MAAIW,IAAKV,EAAE,IAAID,EAAE,IAAI,MAAMG,IAAKH,EAAE,IAAIC,EAAE,GAAGK,IAAKN,EAAE,IAAIC,EAAE;AACxD,SAAOU,IAAK,KAAKA,IAAKA,IAAKR,IAAKA,IAAKG,IAAKA;AAC5C;AAEA,SAASM,EAAMC,GAAM;AACnB,MAAIZ,IAAIY,EAAK,GACTb,IAAIa,EAAK,KAAK,GACdC,IAAKb,EAAE,IAAID,EAAE,GACbG,KAAMF,EAAE,IAAID,EAAE,IAAIA,EAAE,IAAIC,EAAE,KAAKa,GAC/BR,KAAML,EAAE,IAAID,EAAE,IAAIA,EAAE,IAAIC,EAAE,KAAKa;AACnC,SAAOX,IAAKA,IAAKG,IAAKA;AACxB;AAEA,SAASS,EAAKC,GAAQ;AACpB,OAAK,IAAIA,GACT,KAAK,OAAO,MACZ,KAAK,WAAW;AAClB;AAEO,SAASC,EAAmBC,GAASC,GAAQ;AAClD,MAAI,EAAEC,KAAKF,IAAUG,EAAMH,CAAO,GAAG,QAAS,QAAO;AAErD,MAAIjB,GAAGD,GAAGE,GAAGkB,GAAGE,GAAIC,GAAI,GAAGC,GAAGC,GAAGC,GAAIC;AAIrC,MADA1B,IAAIiB,EAAQ,CAAC,GAAGjB,EAAE,IAAI,GAAGA,EAAE,IAAI,GAC3B,EAAEmB,IAAI,GAAI,QAAOnB,EAAE;AAIvB,MADAD,IAAIkB,EAAQ,CAAC,GAAGjB,EAAE,IAAI,CAACD,EAAE,GAAGA,EAAE,IAAIC,EAAE,GAAGD,EAAE,IAAI,GACzC,EAAEoB,IAAI,GAAI,QAAOnB,EAAE,IAAID,EAAE;AAG7B,EAAAD,EAAMC,GAAGC,GAAGC,IAAIgB,EAAQ,CAAC,CAAC,GAG1BjB,IAAI,IAAIc,EAAKd,CAAC,GAAGD,IAAI,IAAIe,EAAKf,CAAC,GAAGE,IAAI,IAAIa,EAAKb,CAAC,GAChDD,EAAE,OAAOC,EAAE,WAAWF,GACtBA,EAAE,OAAOC,EAAE,WAAWC,GACtBA,EAAE,OAAOF,EAAE,WAAWC;AAGtB,EAAA2B,EAAM,MAAK,IAAI,GAAG,IAAIR,GAAG,EAAE,GAAG;AAC5B,IAAArB,EAAME,EAAE,GAAGD,EAAE,GAAGE,IAAIgB,EAAQ,CAAC,CAAC,GAAGhB,IAAI,IAAIa,EAAKb,CAAC,GAK/CsB,IAAIxB,EAAE,MAAMyB,IAAIxB,EAAE,UAAUyB,IAAK1B,EAAE,EAAE,GAAG2B,IAAK1B,EAAE,EAAE;AACjD;AACE,UAAIyB,KAAMC,GAAI;AACZ,YAAIjB,EAAWc,EAAE,GAAGtB,EAAE,CAAC,GAAG;AACxB,UAAAF,IAAIwB,GAAGvB,EAAE,OAAOD,GAAGA,EAAE,WAAWC,GAAG,EAAE;AACrC,mBAAS2B;AAAA,QACX;AACA,QAAAF,KAAMF,EAAE,EAAE,GAAGA,IAAIA,EAAE;AAAA,MACrB,OAAO;AACL,YAAId,EAAWe,EAAE,GAAGvB,EAAE,CAAC,GAAG;AACxB,UAAAD,IAAIwB,GAAGxB,EAAE,OAAOD,GAAGA,EAAE,WAAWC,GAAG,EAAE;AACrC,mBAAS2B;AAAA,QACX;AACA,QAAAD,KAAMF,EAAE,EAAE,GAAGA,IAAIA,EAAE;AAAA,MACrB;AAAA,WACOD,MAAMC,EAAE;AAOjB,SAJAvB,EAAE,WAAWD,GAAGC,EAAE,OAAOF,GAAGC,EAAE,OAAOD,EAAE,WAAWA,IAAIE,GAGtDoB,IAAKV,EAAMX,CAAC,IACJC,IAAIA,EAAE,UAAUF;AACtB,OAAKuB,IAAKX,EAAMV,CAAC,KAAKoB,MACpBrB,IAAIC,GAAGoB,IAAKC;AAGhB,IAAAvB,IAAIC,EAAE;AAAA,EACR;AAGkB,OAAlBA,IAAI,CAACD,EAAE,CAAC,GAAGE,IAAIF,IAAWE,IAAIA,EAAE,UAAUF,IAAG,CAAAC,EAAE,KAAKC,EAAE,CAAC;AAGvD,OAH0DA,IAAI2B,EAAkB5B,GAAGkB,CAAM,GAGpF,IAAI,GAAG,IAAIC,GAAG,EAAE,EAAG,CAAAnB,IAAIiB,EAAQ,CAAC,GAAGjB,EAAE,KAAKC,EAAE,GAAGD,EAAE,KAAKC,EAAE;AAE7D,SAAOA,EAAE;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/partition.js

@@ -0,0 +1,27 @@
+import m from "./treemap/round.js";
+import y from "./treemap/dice.js";
+function v() {
+  var x = 1, e = 1, n = 0, h = !1;
+  function t(i) {
+    var u = i.height + 1;
+    return i.x0 = i.y0 = n, i.x1 = x, i.y1 = e / u, i.eachBefore(g(e, u)), h && i.eachBefore(m), i;
+  }
+  function g(i, u) {
+    return function(r) {
+      r.children && y(r, r.x0, i * (r.depth + 1) / u, r.x1, i * (r.depth + 2) / u);
+      var f = r.x0, a = r.y0, c = r.x1 - n, p = r.y1 - n;
+      c < f && (f = c = (f + c) / 2), p < a && (a = p = (a + p) / 2), r.x0 = f, r.y0 = a, r.x1 = c, r.y1 = p;
+    };
+  }
+  return t.round = function(i) {
+    return arguments.length ? (h = !!i, t) : h;
+  }, t.size = function(i) {
+    return arguments.length ? (x = +i[0], e = +i[1], t) : [x, e];
+  }, t.padding = function(i) {
+    return arguments.length ? (n = +i, t) : n;
+  }, t;
+}
+export {
+  v as default
+};
+//# sourceMappingURL=partition.js.map

package/dist/node_modules/d3-hierarchy/src/partition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partition.js","sources":["../../../../node_modules/d3-hierarchy/src/partition.js"],"sourcesContent":["import roundNode from \"./treemap/round.js\";\nimport treemapDice from \"./treemap/dice.js\";\n\nexport default function() {\n  var dx = 1,\n      dy = 1,\n      padding = 0,\n      round = false;\n\n  function partition(root) {\n    var n = root.height + 1;\n    root.x0 =\n    root.y0 = padding;\n    root.x1 = dx;\n    root.y1 = dy / n;\n    root.eachBefore(positionNode(dy, n));\n    if (round) root.eachBefore(roundNode);\n    return root;\n  }\n\n  function positionNode(dy, n) {\n    return function(node) {\n      if (node.children) {\n        treemapDice(node, node.x0, dy * (node.depth + 1) / n, node.x1, dy * (node.depth + 2) / n);\n      }\n      var x0 = node.x0,\n          y0 = node.y0,\n          x1 = node.x1 - padding,\n          y1 = node.y1 - padding;\n      if (x1 < x0) x0 = x1 = (x0 + x1) / 2;\n      if (y1 < y0) y0 = y1 = (y0 + y1) / 2;\n      node.x0 = x0;\n      node.y0 = y0;\n      node.x1 = x1;\n      node.y1 = y1;\n    };\n  }\n\n  partition.round = function(x) {\n    return arguments.length ? (round = !!x, partition) : round;\n  };\n\n  partition.size = function(x) {\n    return arguments.length ? (dx = +x[0], dy = +x[1], partition) : [dx, dy];\n  };\n\n  partition.padding = function(x) {\n    return arguments.length ? (padding = +x, partition) : padding;\n  };\n\n  return partition;\n}\n"],"names":["partition","dx","dy","padding","round","root","n","positionNode","roundNode","node","treemapDice","x0","y0","x1","y1","x"],"mappings":";;AAGe,SAAAA,IAAW;AACxB,MAAIC,IAAK,GACLC,IAAK,GACLC,IAAU,GACVC,IAAQ;AAEZ,WAASJ,EAAUK,GAAM;AACvB,QAAIC,IAAID,EAAK,SAAS;AACtB,WAAAA,EAAK,KACLA,EAAK,KAAKF,GACVE,EAAK,KAAKJ,GACVI,EAAK,KAAKH,IAAKI,GACfD,EAAK,WAAWE,EAAaL,GAAII,CAAC,CAAC,GAC/BF,KAAOC,EAAK,WAAWG,CAAS,GAC7BH;AAAA,EACT;AAEA,WAASE,EAAaL,GAAII,GAAG;AAC3B,WAAO,SAASG,GAAM;AACpB,MAAIA,EAAK,YACPC,EAAYD,GAAMA,EAAK,IAAIP,KAAMO,EAAK,QAAQ,KAAKH,GAAGG,EAAK,IAAIP,KAAMO,EAAK,QAAQ,KAAKH,CAAC;AAE1F,UAAIK,IAAKF,EAAK,IACVG,IAAKH,EAAK,IACVI,IAAKJ,EAAK,KAAKN,GACfW,IAAKL,EAAK,KAAKN;AACnB,MAAIU,IAAKF,MAAIA,IAAKE,KAAMF,IAAKE,KAAM,IAC/BC,IAAKF,MAAIA,IAAKE,KAAMF,IAAKE,KAAM,IACnCL,EAAK,KAAKE,GACVF,EAAK,KAAKG,GACVH,EAAK,KAAKI,GACVJ,EAAK,KAAKK;AAAA,IACZ;AAAA,EACF;AAEA,SAAAd,EAAU,QAAQ,SAASe,GAAG;AAC5B,WAAO,UAAU,UAAUX,IAAQ,CAAC,CAACW,GAAGf,KAAaI;AAAA,EACvD,GAEAJ,EAAU,OAAO,SAASe,GAAG;AAC3B,WAAO,UAAU,UAAUd,IAAK,CAACc,EAAE,CAAC,GAAGb,IAAK,CAACa,EAAE,CAAC,GAAGf,KAAa,CAACC,GAAIC,CAAE;AAAA,EACzE,GAEAF,EAAU,UAAU,SAASe,GAAG;AAC9B,WAAO,UAAU,UAAUZ,IAAU,CAACY,GAAGf,KAAaG;AAAA,EACxD,GAEOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/stratify.js

@@ -0,0 +1,73 @@
+import { optional as y } from "./accessors.js";
+import { Node as S, computeHeight as _ } from "./hierarchy/index.js";
+var $ = { depth: -1 }, P = {}, E = {};
+function x(e) {
+  return e.id;
+}
+function z(e) {
+  return e.parentId;
+}
+function N() {
+  var e = x, r = z, l;
+  function s(u) {
+    var d = Array.from(u), k = e, v = r, h, m, t, i, c, n, f, g, w = /* @__PURE__ */ new Map();
+    if (l != null) {
+      const o = d.map((a, p) => A(l(a, p, u))), I = o.map(K), B = new Set(o).add("");
+      for (const a of I)
+        B.has(a) || (B.add(a), o.push(a), I.push(K(a)), d.push(E));
+      k = (a, p) => o[p], v = (a, p) => I[p];
+    }
+    for (t = 0, h = d.length; t < h; ++t)
+      m = d[t], n = d[t] = new S(m), (f = k(m, t, u)) != null && (f += "") && (g = n.id = f, w.set(g, w.has(g) ? P : n)), (f = v(m, t, u)) != null && (f += "") && (n.parent = f);
+    for (t = 0; t < h; ++t)
+      if (n = d[t], f = n.parent) {
+        if (c = w.get(f), !c) throw new Error("missing: " + f);
+        if (c === P) throw new Error("ambiguous: " + f);
+        c.children ? c.children.push(n) : c.children = [n], n.parent = c;
+      } else {
+        if (i) throw new Error("multiple roots");
+        i = n;
+      }
+    if (!i) throw new Error("no root");
+    if (l != null) {
+      for (; i.data === E && i.children.length === 1; )
+        i = i.children[0], --h;
+      for (let o = d.length - 1; o >= 0 && (n = d[o], n.data === E); --o)
+        n.data = null;
+    }
+    if (i.parent = $, i.eachBefore(function(o) {
+      o.depth = o.parent.depth + 1, --h;
+    }).eachBefore(_), i.parent = null, h > 0) throw new Error("cycle");
+    return i;
+  }
+  return s.id = function(u) {
+    return arguments.length ? (e = y(u), s) : e;
+  }, s.parentId = function(u) {
+    return arguments.length ? (r = y(u), s) : r;
+  }, s.path = function(u) {
+    return arguments.length ? (l = y(u), s) : l;
+  }, s;
+}
+function A(e) {
+  e = `${e}`;
+  let r = e.length;
+  return b(e, r - 1) && !b(e, r - 2) && (e = e.slice(0, -1)), e[0] === "/" ? e : `/${e}`;
+}
+function K(e) {
+  let r = e.length;
+  if (r < 2) return "";
+  for (; --r > 1 && !b(e, r); ) ;
+  return e.slice(0, r);
+}
+function b(e, r) {
+  if (e[r] === "/") {
+    let l = 0;
+    for (; r > 0 && e[--r] === "\\"; ) ++l;
+    if ((l & 1) === 0) return !0;
+  }
+  return !1;
+}
+export {
+  N as default
+};
+//# sourceMappingURL=stratify.js.map

package/dist/node_modules/d3-hierarchy/src/stratify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stratify.js","sources":["../../../../node_modules/d3-hierarchy/src/stratify.js"],"sourcesContent":["import {optional} from \"./accessors.js\";\nimport {Node, computeHeight} from \"./hierarchy/index.js\";\n\nvar preroot = {depth: -1},\n    ambiguous = {},\n    imputed = {};\n\nfunction defaultId(d) {\n  return d.id;\n}\n\nfunction defaultParentId(d) {\n  return d.parentId;\n}\n\nexport default function() {\n  var id = defaultId,\n      parentId = defaultParentId,\n      path;\n\n  function stratify(data) {\n    var nodes = Array.from(data),\n        currentId = id,\n        currentParentId = parentId,\n        n,\n        d,\n        i,\n        root,\n        parent,\n        node,\n        nodeId,\n        nodeKey,\n        nodeByKey = new Map;\n\n    if (path != null) {\n      const I = nodes.map((d, i) => normalize(path(d, i, data)));\n      const P = I.map(parentof);\n      const S = new Set(I).add(\"\");\n      for (const i of P) {\n        if (!S.has(i)) {\n          S.add(i);\n          I.push(i);\n          P.push(parentof(i));\n          nodes.push(imputed);\n        }\n      }\n      currentId = (_, i) => I[i];\n      currentParentId = (_, i) => P[i];\n    }\n\n    for (i = 0, n = nodes.length; i < n; ++i) {\n      d = nodes[i], node = nodes[i] = new Node(d);\n      if ((nodeId = currentId(d, i, data)) != null && (nodeId += \"\")) {\n        nodeKey = node.id = nodeId;\n        nodeByKey.set(nodeKey, nodeByKey.has(nodeKey) ? ambiguous : node);\n      }\n      if ((nodeId = currentParentId(d, i, data)) != null && (nodeId += \"\")) {\n        node.parent = nodeId;\n      }\n    }\n\n    for (i = 0; i < n; ++i) {\n      node = nodes[i];\n      if (nodeId = node.parent) {\n        parent = nodeByKey.get(nodeId);\n        if (!parent) throw new Error(\"missing: \" + nodeId);\n        if (parent === ambiguous) throw new Error(\"ambiguous: \" + nodeId);\n        if (parent.children) parent.children.push(node);\n        else parent.children = [node];\n        node.parent = parent;\n      } else {\n        if (root) throw new Error(\"multiple roots\");\n        root = node;\n      }\n    }\n\n    if (!root) throw new Error(\"no root\");\n\n    // When imputing internal nodes, only introduce roots if needed.\n    // Then replace the imputed marker data with null.\n    if (path != null) {\n      while (root.data === imputed && root.children.length === 1) {\n        root = root.children[0], --n;\n      }\n      for (let i = nodes.length - 1; i >= 0; --i) {\n        node = nodes[i];\n        if (node.data !== imputed) break;\n        node.data = null;\n      }\n    }\n\n    root.parent = preroot;\n    root.eachBefore(function(node) { node.depth = node.parent.depth + 1; --n; }).eachBefore(computeHeight);\n    root.parent = null;\n    if (n > 0) throw new Error(\"cycle\");\n\n    return root;\n  }\n\n  stratify.id = function(x) {\n    return arguments.length ? (id = optional(x), stratify) : id;\n  };\n\n  stratify.parentId = function(x) {\n    return arguments.length ? (parentId = optional(x), stratify) : parentId;\n  };\n\n  stratify.path = function(x) {\n    return arguments.length ? (path = optional(x), stratify) : path;\n  };\n\n  return stratify;\n}\n\n// To normalize a path, we coerce to a string, strip the trailing slash if any\n// (as long as the trailing slash is not immediately preceded by another slash),\n// and add leading slash if missing.\nfunction normalize(path) {\n  path = `${path}`;\n  let i = path.length;\n  if (slash(path, i - 1) && !slash(path, i - 2)) path = path.slice(0, -1);\n  return path[0] === \"/\" ? path : `/${path}`;\n}\n\n// Walk backwards to find the first slash that is not the leading slash, e.g.:\n// \"/foo/bar\" ⇥ \"/foo\", \"/foo\" ⇥ \"/\", \"/\" ↦ \"\". (The root is special-cased\n// because the id of the root must be a truthy value.)\nfunction parentof(path) {\n  let i = path.length;\n  if (i < 2) return \"\";\n  while (--i > 1) if (slash(path, i)) break;\n  return path.slice(0, i);\n}\n\n// Slashes can be escaped; to determine whether a slash is a path delimiter, we\n// count the number of preceding backslashes escaping the forward slash: an odd\n// number indicates an escaped forward slash.\nfunction slash(path, i) {\n  if (path[i] === \"/\") {\n    let k = 0;\n    while (i > 0 && path[--i] === \"\\\\\") ++k;\n    if ((k & 1) === 0) return true;\n  }\n  return false;\n}\n"],"names":["preroot","ambiguous","imputed","defaultId","d","defaultParentId","stratify","id","parentId","path","data","nodes","currentId","currentParentId","n","i","root","parent","node","nodeId","nodeKey","nodeByKey","I","normalize","P","parentof","S","_","Node","computeHeight","x","optional","slash","k"],"mappings":";;AAGA,IAAIA,IAAU,EAAC,OAAO,GAAE,GACpBC,IAAY,CAAA,GACZC,IAAU,CAAA;AAEd,SAASC,EAAUC,GAAG;AACpB,SAAOA,EAAE;AACX;AAEA,SAASC,EAAgBD,GAAG;AAC1B,SAAOA,EAAE;AACX;AAEe,SAAAE,IAAW;AACxB,MAAIC,IAAKJ,GACLK,IAAWH,GACXI;AAEJ,WAASH,EAASI,GAAM;AACtB,QAAIC,IAAQ,MAAM,KAAKD,CAAI,GACvBE,IAAYL,GACZM,IAAkBL,GAClBM,GACAV,GACAW,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,IAAY,oBAAI;AAEpB,QAAIZ,KAAQ,MAAM;AAChB,YAAMa,IAAIX,EAAM,IAAI,CAACP,GAAGW,MAAMQ,EAAUd,EAAKL,GAAGW,GAAGL,CAAI,CAAC,CAAC,GACnDc,IAAIF,EAAE,IAAIG,CAAQ,GAClBC,IAAI,IAAI,IAAIJ,CAAC,EAAE,IAAI,EAAE;AAC3B,iBAAWP,KAAKS;AACd,QAAKE,EAAE,IAAIX,CAAC,MACVW,EAAE,IAAIX,CAAC,GACPO,EAAE,KAAKP,CAAC,GACRS,EAAE,KAAKC,EAASV,CAAC,CAAC,GAClBJ,EAAM,KAAKT,CAAO;AAGtB,MAAAU,IAAY,CAACe,GAAGZ,MAAMO,EAAEP,CAAC,GACzBF,IAAkB,CAACc,GAAGZ,MAAMS,EAAET,CAAC;AAAA,IACjC;AAEA,SAAKA,IAAI,GAAGD,IAAIH,EAAM,QAAQI,IAAID,GAAG,EAAEC;AACrC,MAAAX,IAAIO,EAAMI,CAAC,GAAGG,IAAOP,EAAMI,CAAC,IAAI,IAAIa,EAAKxB,CAAC,IACrCe,IAASP,EAAUR,GAAGW,GAAGL,CAAI,MAAM,SAASS,KAAU,QACzDC,IAAUF,EAAK,KAAKC,GACpBE,EAAU,IAAID,GAASC,EAAU,IAAID,CAAO,IAAInB,IAAYiB,CAAI,KAE7DC,IAASN,EAAgBT,GAAGW,GAAGL,CAAI,MAAM,SAASS,KAAU,QAC/DD,EAAK,SAASC;AAIlB,SAAKJ,IAAI,GAAGA,IAAID,GAAG,EAAEC;AAEnB,UADAG,IAAOP,EAAMI,CAAC,GACVI,IAASD,EAAK,QAAQ;AAExB,YADAD,IAASI,EAAU,IAAIF,CAAM,GACzB,CAACF,EAAQ,OAAM,IAAI,MAAM,cAAcE,CAAM;AACjD,YAAIF,MAAWhB,EAAW,OAAM,IAAI,MAAM,gBAAgBkB,CAAM;AAChE,QAAIF,EAAO,WAAUA,EAAO,SAAS,KAAKC,CAAI,IACzCD,EAAO,WAAW,CAACC,CAAI,GAC5BA,EAAK,SAASD;AAAA,MAChB,OAAO;AACL,YAAID,EAAM,OAAM,IAAI,MAAM,gBAAgB;AAC1C,QAAAA,IAAOE;AAAA,MACT;AAGF,QAAI,CAACF,EAAM,OAAM,IAAI,MAAM,SAAS;AAIpC,QAAIP,KAAQ,MAAM;AAChB,aAAOO,EAAK,SAASd,KAAWc,EAAK,SAAS,WAAW;AACvD,QAAAA,IAAOA,EAAK,SAAS,CAAC,GAAG,EAAEF;AAE7B,eAASC,IAAIJ,EAAM,SAAS,GAAGI,KAAK,MAClCG,IAAOP,EAAMI,CAAC,GACVG,EAAK,SAAShB,IAFmB,EAAEa;AAGvC,QAAAG,EAAK,OAAO;AAAA,IAEhB;AAKA,QAHAF,EAAK,SAAShB,GACdgB,EAAK,WAAW,SAASE,GAAM;AAAE,MAAAA,EAAK,QAAQA,EAAK,OAAO,QAAQ,GAAG,EAAEJ;AAAA,IAAG,CAAC,EAAE,WAAWe,CAAa,GACrGb,EAAK,SAAS,MACVF,IAAI,EAAG,OAAM,IAAI,MAAM,OAAO;AAElC,WAAOE;AAAA,EACT;AAEA,SAAAV,EAAS,KAAK,SAASwB,GAAG;AACxB,WAAO,UAAU,UAAUvB,IAAKwB,EAASD,CAAC,GAAGxB,KAAYC;AAAA,EAC3D,GAEAD,EAAS,WAAW,SAASwB,GAAG;AAC9B,WAAO,UAAU,UAAUtB,IAAWuB,EAASD,CAAC,GAAGxB,KAAYE;AAAA,EACjE,GAEAF,EAAS,OAAO,SAASwB,GAAG;AAC1B,WAAO,UAAU,UAAUrB,IAAOsB,EAASD,CAAC,GAAGxB,KAAYG;AAAA,EAC7D,GAEOH;AACT;AAKA,SAASiB,EAAUd,GAAM;AACvB,EAAAA,IAAO,GAAGA,CAAI;AACd,MAAIM,IAAIN,EAAK;AACb,SAAIuB,EAAMvB,GAAMM,IAAI,CAAC,KAAK,CAACiB,EAAMvB,GAAMM,IAAI,CAAC,MAAGN,IAAOA,EAAK,MAAM,GAAG,EAAE,IAC/DA,EAAK,CAAC,MAAM,MAAMA,IAAO,IAAIA,CAAI;AAC1C;AAKA,SAASgB,EAAShB,GAAM;AACtB,MAAIM,IAAIN,EAAK;AACb,MAAIM,IAAI,EAAG,QAAO;AAClB,SAAO,EAAEA,IAAI,KAAO,CAAAiB,EAAMvB,GAAMM,CAAC,IAAjB;AAChB,SAAON,EAAK,MAAM,GAAGM,CAAC;AACxB;AAKA,SAASiB,EAAMvB,GAAMM,GAAG;AACtB,MAAIN,EAAKM,CAAC,MAAM,KAAK;AACnB,QAAIkB,IAAI;AACR,WAAOlB,IAAI,KAAKN,EAAK,EAAEM,CAAC,MAAM,OAAM,GAAEkB;AACtC,SAAKA,IAAI,OAAO,EAAG,QAAO;AAAA,EAC5B;AACA,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/tree.js

@@ -0,0 +1,86 @@
+import { Node as k } from "./hierarchy/index.js";
+function o(r, n) {
+  return r.parent === n.parent ? 1 : 2;
+}
+function S(r) {
+  var n = r.children;
+  return n ? n[0] : r.t;
+}
+function B(r) {
+  var n = r.children;
+  return n ? n[n.length - 1] : r.t;
+}
+function R(r, n, a) {
+  var i = a / (n.i - r.i);
+  n.c -= i, n.s += a, r.c += i, n.z += a, n.m += a;
+}
+function W(r) {
+  for (var n = 0, a = 0, i = r.children, u = i.length, z; --u >= 0; )
+    z = i[u], z.z += n, z.m += n, n += z.s + (a += z.c);
+}
+function b(r, n, a) {
+  return r.a.parent === n.parent ? r.a : a;
+}
+function A(r, n) {
+  this._ = r, this.parent = null, this.children = null, this.A = null, this.a = this, this.z = 0, this.m = 0, this.c = 0, this.s = 0, this.t = null, this.i = n;
+}
+A.prototype = Object.create(k.prototype);
+function j(r) {
+  for (var n = new A(r, 0), a, i = [n], u, z, x, y; a = i.pop(); )
+    if (z = a._.children)
+      for (a.children = new Array(y = z.length), x = y - 1; x >= 0; --x)
+        i.push(u = a.children[x] = new A(z[x], x)), u.parent = a;
+  return (n.parent = new A(null, 0)).children = [n], n;
+}
+function L() {
+  var r = o, n = 1, a = 1, i = null;
+  function u(e) {
+    var f = j(e);
+    if (f.eachAfter(z), f.parent.m = -f.z, f.eachBefore(x), i) e.eachBefore(N);
+    else {
+      var d = e, t = e, c = e;
+      e.eachBefore(function(l) {
+        l.x < d.x && (d = l), l.x > t.x && (t = l), l.depth > c.depth && (c = l);
+      });
+      var h = d === t ? 1 : r(d, t) / 2, s = h - d.x, g = n / (t.x + h + s), _ = a / (c.depth || 1);
+      e.eachBefore(function(l) {
+        l.x = (l.x + s) * g, l.y = l.depth * _;
+      });
+    }
+    return e;
+  }
+  function z(e) {
+    var f = e.children, d = e.parent.children, t = e.i ? d[e.i - 1] : null;
+    if (f) {
+      W(e);
+      var c = (f[0].z + f[f.length - 1].z) / 2;
+      t ? (e.z = t.z + r(e._, t._), e.m = e.z - c) : e.z = c;
+    } else t && (e.z = t.z + r(e._, t._));
+    e.parent.A = y(e, t, e.parent.A || d[0]);
+  }
+  function x(e) {
+    e._.x = e.z + e.parent.m, e.m += e.parent.m;
+  }
+  function y(e, f, d) {
+    if (f) {
+      for (var t = e, c = e, h = f, s = t.parent.children[0], g = t.m, _ = c.m, l = h.m, w = s.m, p; h = B(h), t = S(t), h && t; )
+        s = S(s), c = B(c), c.a = e, p = h.z + l - t.z - g + r(h._, t._), p > 0 && (R(b(h, e, d), e, p), g += p, _ += p), l += h.m, g += t.m, w += s.m, _ += c.m;
+      h && !B(c) && (c.t = h, c.m += l - _), t && !S(s) && (s.t = t, s.m += g - w, d = e);
+    }
+    return d;
+  }
+  function N(e) {
+    e.x *= n, e.y = e.depth * a;
+  }
+  return u.separation = function(e) {
+    return arguments.length ? (r = e, u) : r;
+  }, u.size = function(e) {
+    return arguments.length ? (i = !1, n = +e[0], a = +e[1], u) : i ? null : [n, a];
+  }, u.nodeSize = function(e) {
+    return arguments.length ? (i = !0, n = +e[0], a = +e[1], u) : i ? [n, a] : null;
+  }, u;
+}
+export {
+  L as default
+};
+//# sourceMappingURL=tree.js.map

package/dist/node_modules/d3-hierarchy/src/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sources":["../../../../node_modules/d3-hierarchy/src/tree.js"],"sourcesContent":["import {Node} from \"./hierarchy/index.js\";\n\nfunction defaultSeparation(a, b) {\n  return a.parent === b.parent ? 1 : 2;\n}\n\n// function radialSeparation(a, b) {\n//   return (a.parent === b.parent ? 1 : 2) / a.depth;\n// }\n\n// This function is used to traverse the left contour of a subtree (or\n// subforest). It returns the successor of v on this contour. This successor is\n// either given by the leftmost child of v or by the thread of v. The function\n// returns null if and only if v is on the highest level of its subtree.\nfunction nextLeft(v) {\n  var children = v.children;\n  return children ? children[0] : v.t;\n}\n\n// This function works analogously to nextLeft.\nfunction nextRight(v) {\n  var children = v.children;\n  return children ? children[children.length - 1] : v.t;\n}\n\n// Shifts the current subtree rooted at w+. This is done by increasing\n// prelim(w+) and mod(w+) by shift.\nfunction moveSubtree(wm, wp, shift) {\n  var change = shift / (wp.i - wm.i);\n  wp.c -= change;\n  wp.s += shift;\n  wm.c += change;\n  wp.z += shift;\n  wp.m += shift;\n}\n\n// All other shifts, applied to the smaller subtrees between w- and w+, are\n// performed by this function. To prepare the shifts, we have to adjust\n// change(w+), shift(w+), and change(w-).\nfunction executeShifts(v) {\n  var shift = 0,\n      change = 0,\n      children = v.children,\n      i = children.length,\n      w;\n  while (--i >= 0) {\n    w = children[i];\n    w.z += shift;\n    w.m += shift;\n    shift += w.s + (change += w.c);\n  }\n}\n\n// If vi-’s ancestor is a sibling of v, returns vi-’s ancestor. Otherwise,\n// returns the specified (default) ancestor.\nfunction nextAncestor(vim, v, ancestor) {\n  return vim.a.parent === v.parent ? vim.a : ancestor;\n}\n\nfunction TreeNode(node, i) {\n  this._ = node;\n  this.parent = null;\n  this.children = null;\n  this.A = null; // default ancestor\n  this.a = this; // ancestor\n  this.z = 0; // prelim\n  this.m = 0; // mod\n  this.c = 0; // change\n  this.s = 0; // shift\n  this.t = null; // thread\n  this.i = i; // number\n}\n\nTreeNode.prototype = Object.create(Node.prototype);\n\nfunction treeRoot(root) {\n  var tree = new TreeNode(root, 0),\n      node,\n      nodes = [tree],\n      child,\n      children,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if (children = node._.children) {\n      node.children = new Array(n = children.length);\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = node.children[i] = new TreeNode(children[i], i));\n        child.parent = node;\n      }\n    }\n  }\n\n  (tree.parent = new TreeNode(null, 0)).children = [tree];\n  return tree;\n}\n\n// Node-link tree diagram using the Reingold-Tilford \"tidy\" algorithm\nexport default function() {\n  var separation = defaultSeparation,\n      dx = 1,\n      dy = 1,\n      nodeSize = null;\n\n  function tree(root) {\n    var t = treeRoot(root);\n\n    // Compute the layout using Buchheim et al.’s algorithm.\n    t.eachAfter(firstWalk), t.parent.m = -t.z;\n    t.eachBefore(secondWalk);\n\n    // If a fixed node size is specified, scale x and y.\n    if (nodeSize) root.eachBefore(sizeNode);\n\n    // If a fixed tree size is specified, scale x and y based on the extent.\n    // Compute the left-most, right-most, and depth-most nodes for extents.\n    else {\n      var left = root,\n          right = root,\n          bottom = root;\n      root.eachBefore(function(node) {\n        if (node.x < left.x) left = node;\n        if (node.x > right.x) right = node;\n        if (node.depth > bottom.depth) bottom = node;\n      });\n      var s = left === right ? 1 : separation(left, right) / 2,\n          tx = s - left.x,\n          kx = dx / (right.x + s + tx),\n          ky = dy / (bottom.depth || 1);\n      root.eachBefore(function(node) {\n        node.x = (node.x + tx) * kx;\n        node.y = node.depth * ky;\n      });\n    }\n\n    return root;\n  }\n\n  // Computes a preliminary x-coordinate for v. Before that, FIRST WALK is\n  // applied recursively to the children of v, as well as the function\n  // APPORTION. After spacing out the children by calling EXECUTE SHIFTS, the\n  // node v is placed to the midpoint of its outermost children.\n  function firstWalk(v) {\n    var children = v.children,\n        siblings = v.parent.children,\n        w = v.i ? siblings[v.i - 1] : null;\n    if (children) {\n      executeShifts(v);\n      var midpoint = (children[0].z + children[children.length - 1].z) / 2;\n      if (w) {\n        v.z = w.z + separation(v._, w._);\n        v.m = v.z - midpoint;\n      } else {\n        v.z = midpoint;\n      }\n    } else if (w) {\n      v.z = w.z + separation(v._, w._);\n    }\n    v.parent.A = apportion(v, w, v.parent.A || siblings[0]);\n  }\n\n  // Computes all real x-coordinates by summing up the modifiers recursively.\n  function secondWalk(v) {\n    v._.x = v.z + v.parent.m;\n    v.m += v.parent.m;\n  }\n\n  // The core of the algorithm. Here, a new subtree is combined with the\n  // previous subtrees. Threads are used to traverse the inside and outside\n  // contours of the left and right subtree up to the highest common level. The\n  // vertices used for the traversals are vi+, vi-, vo-, and vo+, where the\n  // superscript o means outside and i means inside, the subscript - means left\n  // subtree and + means right subtree. For summing up the modifiers along the\n  // contour, we use respective variables si+, si-, so-, and so+. Whenever two\n  // nodes of the inside contours conflict, we compute the left one of the\n  // greatest uncommon ancestors using the function ANCESTOR and call MOVE\n  // SUBTREE to shift the subtree and prepare the shifts of smaller subtrees.\n  // Finally, we add a new thread (if necessary).\n  function apportion(v, w, ancestor) {\n    if (w) {\n      var vip = v,\n          vop = v,\n          vim = w,\n          vom = vip.parent.children[0],\n          sip = vip.m,\n          sop = vop.m,\n          sim = vim.m,\n          som = vom.m,\n          shift;\n      while (vim = nextRight(vim), vip = nextLeft(vip), vim && vip) {\n        vom = nextLeft(vom);\n        vop = nextRight(vop);\n        vop.a = v;\n        shift = vim.z + sim - vip.z - sip + separation(vim._, vip._);\n        if (shift > 0) {\n          moveSubtree(nextAncestor(vim, v, ancestor), v, shift);\n          sip += shift;\n          sop += shift;\n        }\n        sim += vim.m;\n        sip += vip.m;\n        som += vom.m;\n        sop += vop.m;\n      }\n      if (vim && !nextRight(vop)) {\n        vop.t = vim;\n        vop.m += sim - sop;\n      }\n      if (vip && !nextLeft(vom)) {\n        vom.t = vip;\n        vom.m += sip - som;\n        ancestor = v;\n      }\n    }\n    return ancestor;\n  }\n\n  function sizeNode(node) {\n    node.x *= dx;\n    node.y = node.depth * dy;\n  }\n\n  tree.separation = function(x) {\n    return arguments.length ? (separation = x, tree) : separation;\n  };\n\n  tree.size = function(x) {\n    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], tree) : (nodeSize ? null : [dx, dy]);\n  };\n\n  tree.nodeSize = function(x) {\n    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], tree) : (nodeSize ? [dx, dy] : null);\n  };\n\n  return tree;\n}\n"],"names":["defaultSeparation","a","b","nextLeft","v","children","nextRight","moveSubtree","wm","wp","shift","change","executeShifts","i","w","nextAncestor","vim","ancestor","TreeNode","node","Node","treeRoot","root","tree","nodes","child","n","separation","dx","dy","nodeSize","t","firstWalk","secondWalk","sizeNode","left","right","bottom","s","tx","kx","ky","siblings","midpoint","apportion","vip","vop","vom","sip","sop","sim","som","x"],"mappings":";AAEA,SAASA,EAAkBC,GAAGC,GAAG;AAC/B,SAAOD,EAAE,WAAWC,EAAE,SAAS,IAAI;AACrC;AAUA,SAASC,EAASC,GAAG;AACnB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAAS,CAAC,IAAID,EAAE;AACpC;AAGA,SAASE,EAAUF,GAAG;AACpB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAASA,EAAS,SAAS,CAAC,IAAID,EAAE;AACtD;AAIA,SAASG,EAAYC,GAAIC,GAAIC,GAAO;AAClC,MAAIC,IAASD,KAASD,EAAG,IAAID,EAAG;AAChC,EAAAC,EAAG,KAAKE,GACRF,EAAG,KAAKC,GACRF,EAAG,KAAKG,GACRF,EAAG,KAAKC,GACRD,EAAG,KAAKC;AACV;AAKA,SAASE,EAAcR,GAAG;AAMxB,WALIM,IAAQ,GACRC,IAAS,GACTN,IAAWD,EAAE,UACbS,IAAIR,EAAS,QACbS,GACG,EAAED,KAAK;AACZ,IAAAC,IAAIT,EAASQ,CAAC,GACdC,EAAE,KAAKJ,GACPI,EAAE,KAAKJ,GACPA,KAASI,EAAE,KAAKH,KAAUG,EAAE;AAEhC;AAIA,SAASC,EAAaC,GAAKZ,GAAGa,GAAU;AACtC,SAAOD,EAAI,EAAE,WAAWZ,EAAE,SAASY,EAAI,IAAIC;AAC7C;AAEA,SAASC,EAASC,GAAMN,GAAG;AACzB,OAAK,IAAIM,GACT,KAAK,SAAS,MACd,KAAK,WAAW,MAChB,KAAK,IAAI,MACT,KAAK,IAAI,MACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,MACT,KAAK,IAAIN;AACX;AAEAK,EAAS,YAAY,OAAO,OAAOE,EAAK,SAAS;AAEjD,SAASC,EAASC,GAAM;AAStB,WARIC,IAAO,IAAIL,EAASI,GAAM,CAAC,GAC3BH,GACAK,IAAQ,CAACD,CAAI,GACbE,GACApB,GACAQ,GACAa,GAEGP,IAAOK,EAAM;AAClB,QAAInB,IAAWc,EAAK,EAAE;AAEpB,WADAA,EAAK,WAAW,IAAI,MAAMO,IAAIrB,EAAS,MAAM,GACxCQ,IAAIa,IAAI,GAAGb,KAAK,GAAG,EAAEA;AACxB,QAAAW,EAAM,KAAKC,IAAQN,EAAK,SAASN,CAAC,IAAI,IAAIK,EAASb,EAASQ,CAAC,GAAGA,CAAC,CAAC,GAClEY,EAAM,SAASN;AAKrB,UAACI,EAAK,SAAS,IAAIL,EAAS,MAAM,CAAC,GAAG,WAAW,CAACK,CAAI,GAC/CA;AACT;AAGe,SAAAA,IAAW;AACxB,MAAII,IAAa3B,GACb4B,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASP,EAAKD,GAAM;AAClB,QAAIS,IAAIV,EAASC,CAAI;AAOrB,QAJAS,EAAE,UAAUC,CAAS,GAAGD,EAAE,OAAO,IAAI,CAACA,EAAE,GACxCA,EAAE,WAAWE,CAAU,GAGnBH,EAAU,CAAAR,EAAK,WAAWY,CAAQ;AAAA,SAIjC;AACH,UAAIC,IAAOb,GACPc,IAAQd,GACRe,IAASf;AACb,MAAAA,EAAK,WAAW,SAASH,GAAM;AAC7B,QAAIA,EAAK,IAAIgB,EAAK,MAAGA,IAAOhB,IACxBA,EAAK,IAAIiB,EAAM,MAAGA,IAAQjB,IAC1BA,EAAK,QAAQkB,EAAO,UAAOA,IAASlB;AAAA,MAC1C,CAAC;AACD,UAAImB,IAAIH,MAASC,IAAQ,IAAIT,EAAWQ,GAAMC,CAAK,IAAI,GACnDG,IAAKD,IAAIH,EAAK,GACdK,IAAKZ,KAAMQ,EAAM,IAAIE,IAAIC,IACzBE,IAAKZ,KAAMQ,EAAO,SAAS;AAC/B,MAAAf,EAAK,WAAW,SAASH,GAAM;AAC7B,QAAAA,EAAK,KAAKA,EAAK,IAAIoB,KAAMC,GACzBrB,EAAK,IAAIA,EAAK,QAAQsB;AAAA,MACxB,CAAC;AAAA,IACH;AAEA,WAAOnB;AAAA,EACT;AAMA,WAASU,EAAU5B,GAAG;AACpB,QAAIC,IAAWD,EAAE,UACbsC,IAAWtC,EAAE,OAAO,UACpBU,IAAIV,EAAE,IAAIsC,EAAStC,EAAE,IAAI,CAAC,IAAI;AAClC,QAAIC,GAAU;AACZ,MAAAO,EAAcR,CAAC;AACf,UAAIuC,KAAYtC,EAAS,CAAC,EAAE,IAAIA,EAASA,EAAS,SAAS,CAAC,EAAE,KAAK;AACnE,MAAIS,KACFV,EAAE,IAAIU,EAAE,IAAIa,EAAWvB,EAAE,GAAGU,EAAE,CAAC,GAC/BV,EAAE,IAAIA,EAAE,IAAIuC,KAEZvC,EAAE,IAAIuC;AAAA,IAEV,MAAO,CAAI7B,MACTV,EAAE,IAAIU,EAAE,IAAIa,EAAWvB,EAAE,GAAGU,EAAE,CAAC;AAEjC,IAAAV,EAAE,OAAO,IAAIwC,EAAUxC,GAAGU,GAAGV,EAAE,OAAO,KAAKsC,EAAS,CAAC,CAAC;AAAA,EACxD;AAGA,WAAST,EAAW7B,GAAG;AACrB,IAAAA,EAAE,EAAE,IAAIA,EAAE,IAAIA,EAAE,OAAO,GACvBA,EAAE,KAAKA,EAAE,OAAO;AAAA,EAClB;AAaA,WAASwC,EAAUxC,GAAGU,GAAGG,GAAU;AACjC,QAAIH,GAAG;AAUL,eATI+B,IAAMzC,GACN0C,IAAM1C,GACNY,IAAMF,GACNiC,IAAMF,EAAI,OAAO,SAAS,CAAC,GAC3BG,IAAMH,EAAI,GACVI,IAAMH,EAAI,GACVI,IAAMlC,EAAI,GACVmC,IAAMJ,EAAI,GACVrC,GACGM,IAAMV,EAAUU,CAAG,GAAG6B,IAAM1C,EAAS0C,CAAG,GAAG7B,KAAO6B;AACvD,QAAAE,IAAM5C,EAAS4C,CAAG,GAClBD,IAAMxC,EAAUwC,CAAG,GACnBA,EAAI,IAAI1C,GACRM,IAAQM,EAAI,IAAIkC,IAAML,EAAI,IAAIG,IAAMrB,EAAWX,EAAI,GAAG6B,EAAI,CAAC,GACvDnC,IAAQ,MACVH,EAAYQ,EAAaC,GAAKZ,GAAGa,CAAQ,GAAGb,GAAGM,CAAK,GACpDsC,KAAOtC,GACPuC,KAAOvC,IAETwC,KAAOlC,EAAI,GACXgC,KAAOH,EAAI,GACXM,KAAOJ,EAAI,GACXE,KAAOH,EAAI;AAEb,MAAI9B,KAAO,CAACV,EAAUwC,CAAG,MACvBA,EAAI,IAAI9B,GACR8B,EAAI,KAAKI,IAAMD,IAEbJ,KAAO,CAAC1C,EAAS4C,CAAG,MACtBA,EAAI,IAAIF,GACRE,EAAI,KAAKC,IAAMG,GACflC,IAAWb;AAAA,IAEf;AACA,WAAOa;AAAA,EACT;AAEA,WAASiB,EAASf,GAAM;AACtB,IAAAA,EAAK,KAAKS,GACVT,EAAK,IAAIA,EAAK,QAAQU;AAAA,EACxB;AAEA,SAAAN,EAAK,aAAa,SAAS6B,GAAG;AAC5B,WAAO,UAAU,UAAUzB,IAAayB,GAAG7B,KAAQI;AAAA,EACrD,GAEAJ,EAAK,OAAO,SAAS6B,GAAG;AACtB,WAAO,UAAU,UAAUtB,IAAW,IAAOF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG7B,KAASO,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EACzG,GAEAN,EAAK,WAAW,SAAS6B,GAAG;AAC1B,WAAO,UAAU,UAAUtB,IAAW,IAAMF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG7B,KAASO,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EACrG,GAEON;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/treemap/binary.js

@@ -0,0 +1,30 @@
+function D(B, b, q, z, C) {
+  var o = B.children, l, p = o.length, L, a = new Array(p + 1);
+  for (a[0] = L = l = 0; l < p; ++l)
+    a[l + 1] = L += o[l].value;
+  u(0, p, B.value, b, q, z, C);
+  function u(e, h, n, s, v, t, f) {
+    if (e >= h - 1) {
+      var c = o[e];
+      c.x0 = s, c.y0 = v, c.x1 = t, c.y1 = f;
+      return;
+    }
+    for (var O = a[e], w = n / 2 + O, r = e + 1, m = h - 1; r < m; ) {
+      var A = r + m >>> 1;
+      a[A] < w ? r = A + 1 : m = A;
+    }
+    w - a[r - 1] < a[r] - w && e + 1 < r && --r;
+    var i = a[r] - O, g = n - i;
+    if (t - s > f - v) {
+      var R = n ? (s * g + t * i) / n : t;
+      u(e, r, i, s, v, R, f), u(r, h, g, R, v, t, f);
+    } else {
+      var T = n ? (v * g + f * i) / n : f;
+      u(e, r, i, s, v, t, T), u(r, h, g, s, T, t, f);
+    }
+  }
+}
+export {
+  D as default
+};
+//# sourceMappingURL=binary.js.map

package/dist/node_modules/d3-hierarchy/src/treemap/binary.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binary.js","sources":["../../../../../node_modules/d3-hierarchy/src/treemap/binary.js"],"sourcesContent":["export default function(parent, x0, y0, x1, y1) {\n  var nodes = parent.children,\n      i, n = nodes.length,\n      sum, sums = new Array(n + 1);\n\n  for (sums[0] = sum = i = 0; i < n; ++i) {\n    sums[i + 1] = sum += nodes[i].value;\n  }\n\n  partition(0, n, parent.value, x0, y0, x1, y1);\n\n  function partition(i, j, value, x0, y0, x1, y1) {\n    if (i >= j - 1) {\n      var node = nodes[i];\n      node.x0 = x0, node.y0 = y0;\n      node.x1 = x1, node.y1 = y1;\n      return;\n    }\n\n    var valueOffset = sums[i],\n        valueTarget = (value / 2) + valueOffset,\n        k = i + 1,\n        hi = j - 1;\n\n    while (k < hi) {\n      var mid = k + hi >>> 1;\n      if (sums[mid] < valueTarget) k = mid + 1;\n      else hi = mid;\n    }\n\n    if ((valueTarget - sums[k - 1]) < (sums[k] - valueTarget) && i + 1 < k) --k;\n\n    var valueLeft = sums[k] - valueOffset,\n        valueRight = value - valueLeft;\n\n    if ((x1 - x0) > (y1 - y0)) {\n      var xk = value ? (x0 * valueRight + x1 * valueLeft) / value : x1;\n      partition(i, k, valueLeft, x0, y0, xk, y1);\n      partition(k, j, valueRight, xk, y0, x1, y1);\n    } else {\n      var yk = value ? (y0 * valueRight + y1 * valueLeft) / value : y1;\n      partition(i, k, valueLeft, x0, y0, x1, yk);\n      partition(k, j, valueRight, x0, yk, x1, y1);\n    }\n  }\n}\n"],"names":["treemapBinary","parent","x0","y0","x1","y1","nodes","i","n","sum","sums","partition","j","value","node","valueOffset","valueTarget","k","hi","mid","valueLeft","valueRight","xk","yk"],"mappings":"AAAe,SAAAA,EAASC,GAAQC,GAAIC,GAAIC,GAAIC,GAAI;AAC9C,MAAIC,IAAQL,EAAO,UACfM,GAAGC,IAAIF,EAAM,QACbG,GAAKC,IAAO,IAAI,MAAMF,IAAI,CAAC;AAE/B,OAAKE,EAAK,CAAC,IAAID,IAAMF,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnC,IAAAG,EAAKH,IAAI,CAAC,IAAIE,KAAOH,EAAMC,CAAC,EAAE;AAGhC,EAAAI,EAAU,GAAGH,GAAGP,EAAO,OAAOC,GAAIC,GAAIC,GAAIC,CAAE;AAE5C,WAASM,EAAUJ,GAAGK,GAAGC,GAAOX,GAAIC,GAAIC,GAAIC,GAAI;AAC9C,QAAIE,KAAKK,IAAI,GAAG;AACd,UAAIE,IAAOR,EAAMC,CAAC;AAClB,MAAAO,EAAK,KAAKZ,GAAIY,EAAK,KAAKX,GACxBW,EAAK,KAAKV,GAAIU,EAAK,KAAKT;AACxB;AAAA,IACF;AAOA,aALIU,IAAcL,EAAKH,CAAC,GACpBS,IAAeH,IAAQ,IAAKE,GAC5BE,IAAIV,IAAI,GACRW,IAAKN,IAAI,GAENK,IAAIC,KAAI;AACb,UAAIC,IAAMF,IAAIC,MAAO;AACrB,MAAIR,EAAKS,CAAG,IAAIH,IAAaC,IAAIE,IAAM,IAClCD,IAAKC;AAAA,IACZ;AAEA,IAAKH,IAAcN,EAAKO,IAAI,CAAC,IAAMP,EAAKO,CAAC,IAAID,KAAgBT,IAAI,IAAIU,KAAG,EAAEA;AAE1E,QAAIG,IAAYV,EAAKO,CAAC,IAAIF,GACtBM,IAAaR,IAAQO;AAEzB,QAAKhB,IAAKF,IAAOG,IAAKF,GAAK;AACzB,UAAImB,IAAKT,KAASX,IAAKmB,IAAajB,IAAKgB,KAAaP,IAAQT;AAC9D,MAAAO,EAAUJ,GAAGU,GAAGG,GAAWlB,GAAIC,GAAImB,GAAIjB,CAAE,GACzCM,EAAUM,GAAGL,GAAGS,GAAYC,GAAInB,GAAIC,GAAIC,CAAE;AAAA,IAC5C,OAAO;AACL,UAAIkB,IAAKV,KAASV,IAAKkB,IAAahB,IAAKe,KAAaP,IAAQR;AAC9D,MAAAM,EAAUJ,GAAGU,GAAGG,GAAWlB,GAAIC,GAAIC,GAAImB,CAAE,GACzCZ,EAAUM,GAAGL,GAAGS,GAAYnB,GAAIqB,GAAInB,GAAIC,CAAE;AAAA,IAC5C;AAAA,EACF;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/treemap/dice.js

@@ -0,0 +1,8 @@
+function h(l, a, u, d, o) {
+  for (var i = l.children, e, n = -1, v = i.length, c = l.value && (d - a) / l.value; ++n < v; )
+    e = i[n], e.y0 = u, e.y1 = o, e.x0 = a, e.x1 = a += e.value * c;
+}
+export {
+  h as default
+};
+//# sourceMappingURL=dice.js.map

package/dist/node_modules/d3-hierarchy/src/treemap/dice.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dice.js","sources":["../../../../../node_modules/d3-hierarchy/src/treemap/dice.js"],"sourcesContent":["export default function(parent, x0, y0, x1, y1) {\n  var nodes = parent.children,\n      node,\n      i = -1,\n      n = nodes.length,\n      k = parent.value && (x1 - x0) / parent.value;\n\n  while (++i < n) {\n    node = nodes[i], node.y0 = y0, node.y1 = y1;\n    node.x0 = x0, node.x1 = x0 += node.value * k;\n  }\n}\n"],"names":["treemapDice","parent","x0","y0","x1","y1","nodes","node","i","n","k"],"mappings":"AAAe,SAAAA,EAASC,GAAQC,GAAIC,GAAIC,GAAIC,GAAI;AAO9C,WANIC,IAAQL,EAAO,UACfM,GACAC,IAAI,IACJC,IAAIH,EAAM,QACVI,IAAIT,EAAO,UAAUG,IAAKF,KAAMD,EAAO,OAEpC,EAAEO,IAAIC;AACX,IAAAF,IAAOD,EAAME,CAAC,GAAGD,EAAK,KAAKJ,GAAII,EAAK,KAAKF,GACzCE,EAAK,KAAKL,GAAIK,EAAK,KAAKL,KAAMK,EAAK,QAAQG;AAE/C;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/treemap/index.js

@@ -0,0 +1,39 @@
+import L from "./round.js";
+import T from "./squarify.js";
+import { required as R } from "../accessors.js";
+import g, { constantZero as p } from "../constant.js";
+function S() {
+  var f = T, d = !1, o = 1, c = 1, m = [0], h = p, s = p, y = p, l = p, B = p;
+  function t(n) {
+    return n.x0 = n.y0 = 0, n.x1 = o, n.y1 = c, n.eachBefore(I), m = [0], d && n.eachBefore(L), n;
+  }
+  function I(n) {
+    var i = m[n.depth], r = n.x0 + i, e = n.y0 + i, u = n.x1 - i, a = n.y1 - i;
+    u < r && (r = u = (r + u) / 2), a < e && (e = a = (e + a) / 2), n.x0 = r, n.y0 = e, n.x1 = u, n.y1 = a, n.children && (i = m[n.depth + 1] = h(n) / 2, r += B(n) - i, e += s(n) - i, u -= y(n) - i, a -= l(n) - i, u < r && (r = u = (r + u) / 2), a < e && (e = a = (e + a) / 2), f(n, r, e, u, a));
+  }
+  return t.round = function(n) {
+    return arguments.length ? (d = !!n, t) : d;
+  }, t.size = function(n) {
+    return arguments.length ? (o = +n[0], c = +n[1], t) : [o, c];
+  }, t.tile = function(n) {
+    return arguments.length ? (f = R(n), t) : f;
+  }, t.padding = function(n) {
+    return arguments.length ? t.paddingInner(n).paddingOuter(n) : t.paddingInner();
+  }, t.paddingInner = function(n) {
+    return arguments.length ? (h = typeof n == "function" ? n : g(+n), t) : h;
+  }, t.paddingOuter = function(n) {
+    return arguments.length ? t.paddingTop(n).paddingRight(n).paddingBottom(n).paddingLeft(n) : t.paddingTop();
+  }, t.paddingTop = function(n) {
+    return arguments.length ? (s = typeof n == "function" ? n : g(+n), t) : s;
+  }, t.paddingRight = function(n) {
+    return arguments.length ? (y = typeof n == "function" ? n : g(+n), t) : y;
+  }, t.paddingBottom = function(n) {
+    return arguments.length ? (l = typeof n == "function" ? n : g(+n), t) : l;
+  }, t.paddingLeft = function(n) {
+    return arguments.length ? (B = typeof n == "function" ? n : g(+n), t) : B;
+  }, t;
+}
+export {
+  S as default
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/d3-hierarchy/src/treemap/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/d3-hierarchy/src/treemap/index.js"],"sourcesContent":["import roundNode from \"./round.js\";\nimport squarify from \"./squarify.js\";\nimport {required} from \"../accessors.js\";\nimport constant, {constantZero} from \"../constant.js\";\n\nexport default function() {\n  var tile = squarify,\n      round = false,\n      dx = 1,\n      dy = 1,\n      paddingStack = [0],\n      paddingInner = constantZero,\n      paddingTop = constantZero,\n      paddingRight = constantZero,\n      paddingBottom = constantZero,\n      paddingLeft = constantZero;\n\n  function treemap(root) {\n    root.x0 =\n    root.y0 = 0;\n    root.x1 = dx;\n    root.y1 = dy;\n    root.eachBefore(positionNode);\n    paddingStack = [0];\n    if (round) root.eachBefore(roundNode);\n    return root;\n  }\n\n  function positionNode(node) {\n    var p = paddingStack[node.depth],\n        x0 = node.x0 + p,\n        y0 = node.y0 + p,\n        x1 = node.x1 - p,\n        y1 = node.y1 - p;\n    if (x1 < x0) x0 = x1 = (x0 + x1) / 2;\n    if (y1 < y0) y0 = y1 = (y0 + y1) / 2;\n    node.x0 = x0;\n    node.y0 = y0;\n    node.x1 = x1;\n    node.y1 = y1;\n    if (node.children) {\n      p = paddingStack[node.depth + 1] = paddingInner(node) / 2;\n      x0 += paddingLeft(node) - p;\n      y0 += paddingTop(node) - p;\n      x1 -= paddingRight(node) - p;\n      y1 -= paddingBottom(node) - p;\n      if (x1 < x0) x0 = x1 = (x0 + x1) / 2;\n      if (y1 < y0) y0 = y1 = (y0 + y1) / 2;\n      tile(node, x0, y0, x1, y1);\n    }\n  }\n\n  treemap.round = function(x) {\n    return arguments.length ? (round = !!x, treemap) : round;\n  };\n\n  treemap.size = function(x) {\n    return arguments.length ? (dx = +x[0], dy = +x[1], treemap) : [dx, dy];\n  };\n\n  treemap.tile = function(x) {\n    return arguments.length ? (tile = required(x), treemap) : tile;\n  };\n\n  treemap.padding = function(x) {\n    return arguments.length ? treemap.paddingInner(x).paddingOuter(x) : treemap.paddingInner();\n  };\n\n  treemap.paddingInner = function(x) {\n    return arguments.length ? (paddingInner = typeof x === \"function\" ? x : constant(+x), treemap) : paddingInner;\n  };\n\n  treemap.paddingOuter = function(x) {\n    return arguments.length ? treemap.paddingTop(x).paddingRight(x).paddingBottom(x).paddingLeft(x) : treemap.paddingTop();\n  };\n\n  treemap.paddingTop = function(x) {\n    return arguments.length ? (paddingTop = typeof x === \"function\" ? x : constant(+x), treemap) : paddingTop;\n  };\n\n  treemap.paddingRight = function(x) {\n    return arguments.length ? (paddingRight = typeof x === \"function\" ? x : constant(+x), treemap) : paddingRight;\n  };\n\n  treemap.paddingBottom = function(x) {\n    return arguments.length ? (paddingBottom = typeof x === \"function\" ? x : constant(+x), treemap) : paddingBottom;\n  };\n\n  treemap.paddingLeft = function(x) {\n    return arguments.length ? (paddingLeft = typeof x === \"function\" ? x : constant(+x), treemap) : paddingLeft;\n  };\n\n  return treemap;\n}\n"],"names":["treemapLayout","tile","squarify","round","dx","dy","paddingStack","paddingInner","constantZero","paddingTop","paddingRight","paddingBottom","paddingLeft","treemap","root","positionNode","roundNode","node","p","x0","y0","x1","y1","x","required","constant"],"mappings":";;;;AAKe,SAAAA,IAAW;AACxB,MAAIC,IAAOC,GACPC,IAAQ,IACRC,IAAK,GACLC,IAAK,GACLC,IAAe,CAAC,CAAC,GACjBC,IAAeC,GACfC,IAAaD,GACbE,IAAeF,GACfG,IAAgBH,GAChBI,IAAcJ;AAElB,WAASK,EAAQC,GAAM;AACrB,WAAAA,EAAK,KACLA,EAAK,KAAK,GACVA,EAAK,KAAKV,GACVU,EAAK,KAAKT,GACVS,EAAK,WAAWC,CAAY,GAC5BT,IAAe,CAAC,CAAC,GACbH,KAAOW,EAAK,WAAWE,CAAS,GAC7BF;AAAA,EACT;AAEA,WAASC,EAAaE,GAAM;AAC1B,QAAIC,IAAIZ,EAAaW,EAAK,KAAK,GAC3BE,IAAKF,EAAK,KAAKC,GACfE,IAAKH,EAAK,KAAKC,GACfG,IAAKJ,EAAK,KAAKC,GACfI,IAAKL,EAAK,KAAKC;AACnB,IAAIG,IAAKF,MAAIA,IAAKE,KAAMF,IAAKE,KAAM,IAC/BC,IAAKF,MAAIA,IAAKE,KAAMF,IAAKE,KAAM,IACnCL,EAAK,KAAKE,GACVF,EAAK,KAAKG,GACVH,EAAK,KAAKI,GACVJ,EAAK,KAAKK,GACNL,EAAK,aACPC,IAAIZ,EAAaW,EAAK,QAAQ,CAAC,IAAIV,EAAaU,CAAI,IAAI,GACxDE,KAAMP,EAAYK,CAAI,IAAIC,GAC1BE,KAAMX,EAAWQ,CAAI,IAAIC,GACzBG,KAAMX,EAAaO,CAAI,IAAIC,GAC3BI,KAAMX,EAAcM,CAAI,IAAIC,GACxBG,IAAKF,MAAIA,IAAKE,KAAMF,IAAKE,KAAM,IAC/BC,IAAKF,MAAIA,IAAKE,KAAMF,IAAKE,KAAM,IACnCrB,EAAKgB,GAAME,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAE7B;AAEA,SAAAT,EAAQ,QAAQ,SAASU,GAAG;AAC1B,WAAO,UAAU,UAAUpB,IAAQ,CAAC,CAACoB,GAAGV,KAAWV;AAAA,EACrD,GAEAU,EAAQ,OAAO,SAASU,GAAG;AACzB,WAAO,UAAU,UAAUnB,IAAK,CAACmB,EAAE,CAAC,GAAGlB,IAAK,CAACkB,EAAE,CAAC,GAAGV,KAAW,CAACT,GAAIC,CAAE;AAAA,EACvE,GAEAQ,EAAQ,OAAO,SAASU,GAAG;AACzB,WAAO,UAAU,UAAUtB,IAAOuB,EAASD,CAAC,GAAGV,KAAWZ;AAAA,EAC5D,GAEAY,EAAQ,UAAU,SAASU,GAAG;AAC5B,WAAO,UAAU,SAASV,EAAQ,aAAaU,CAAC,EAAE,aAAaA,CAAC,IAAIV,EAAQ,aAAY;AAAA,EAC1F,GAEAA,EAAQ,eAAe,SAASU,GAAG;AACjC,WAAO,UAAU,UAAUhB,IAAe,OAAOgB,KAAM,aAAaA,IAAIE,EAAS,CAACF,CAAC,GAAGV,KAAWN;AAAA,EACnG,GAEAM,EAAQ,eAAe,SAASU,GAAG;AACjC,WAAO,UAAU,SAASV,EAAQ,WAAWU,CAAC,EAAE,aAAaA,CAAC,EAAE,cAAcA,CAAC,EAAE,YAAYA,CAAC,IAAIV,EAAQ,WAAU;AAAA,EACtH,GAEAA,EAAQ,aAAa,SAASU,GAAG;AAC/B,WAAO,UAAU,UAAUd,IAAa,OAAOc,KAAM,aAAaA,IAAIE,EAAS,CAACF,CAAC,GAAGV,KAAWJ;AAAA,EACjG,GAEAI,EAAQ,eAAe,SAASU,GAAG;AACjC,WAAO,UAAU,UAAUb,IAAe,OAAOa,KAAM,aAAaA,IAAIE,EAAS,CAACF,CAAC,GAAGV,KAAWH;AAAA,EACnG,GAEAG,EAAQ,gBAAgB,SAASU,GAAG;AAClC,WAAO,UAAU,UAAUZ,IAAgB,OAAOY,KAAM,aAAaA,IAAIE,EAAS,CAACF,CAAC,GAAGV,KAAWF;AAAA,EACpG,GAEAE,EAAQ,cAAc,SAASU,GAAG;AAChC,WAAO,UAAU,UAAUX,IAAc,OAAOW,KAAM,aAAaA,IAAIE,EAAS,CAACF,CAAC,GAAGV,KAAWD;AAAA,EAClG,GAEOC;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/treemap/resquarify.js

@@ -0,0 +1,21 @@
+import g from "./dice.js";
+import R from "./slice.js";
+import { squarifyRatio as _, phi as d } from "./squarify.js";
+const k = (function v(r) {
+  function h(i, f, u, l, m) {
+    if ((t = i._squarify) && t.ratio === r)
+      for (var t, e, n, c, p = -1, q, s = t.length, a = i.value; ++p < s; ) {
+        for (e = t[p], n = e.children, c = e.value = 0, q = n.length; c < q; ++c) e.value += n[c].value;
+        e.dice ? g(e, f, u, l, a ? u += (m - u) * e.value / a : m) : R(e, f, u, a ? f += (l - f) * e.value / a : l, m), a -= e.value;
+      }
+    else
+      i._squarify = t = _(r, i, f, u, l, m), t.ratio = r;
+  }
+  return h.ratio = function(i) {
+    return v((i = +i) > 1 ? i : 1);
+  }, h;
+})(d);
+export {
+  k as default
+};
+//# sourceMappingURL=resquarify.js.map

package/dist/node_modules/d3-hierarchy/src/treemap/resquarify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resquarify.js","sources":["../../../../../node_modules/d3-hierarchy/src/treemap/resquarify.js"],"sourcesContent":["import treemapDice from \"./dice.js\";\nimport treemapSlice from \"./slice.js\";\nimport {phi, squarifyRatio} from \"./squarify.js\";\n\nexport default (function custom(ratio) {\n\n  function resquarify(parent, x0, y0, x1, y1) {\n    if ((rows = parent._squarify) && (rows.ratio === ratio)) {\n      var rows,\n          row,\n          nodes,\n          i,\n          j = -1,\n          n,\n          m = rows.length,\n          value = parent.value;\n\n      while (++j < m) {\n        row = rows[j], nodes = row.children;\n        for (i = row.value = 0, n = nodes.length; i < n; ++i) row.value += nodes[i].value;\n        if (row.dice) treemapDice(row, x0, y0, x1, value ? y0 += (y1 - y0) * row.value / value : y1);\n        else treemapSlice(row, x0, y0, value ? x0 += (x1 - x0) * row.value / value : x1, y1);\n        value -= row.value;\n      }\n    } else {\n      parent._squarify = rows = squarifyRatio(ratio, parent, x0, y0, x1, y1);\n      rows.ratio = ratio;\n    }\n  }\n\n  resquarify.ratio = function(x) {\n    return custom((x = +x) > 1 ? x : 1);\n  };\n\n  return resquarify;\n})(phi);\n"],"names":["treemapResquarify","custom","ratio","resquarify","parent","x0","y0","x1","y1","rows","row","nodes","i","j","n","m","value","treemapDice","treemapSlice","squarifyRatio","x","phi"],"mappings":";;;AAIA,MAAAA,KAAgB,SAASC,EAAOC,GAAO;AAErC,WAASC,EAAWC,GAAQC,GAAIC,GAAIC,GAAIC,GAAI;AAC1C,SAAKC,IAAOL,EAAO,cAAeK,EAAK,UAAUP;AAU/C,eATIO,GACAC,GACAC,GACAC,GACAC,IAAI,IACJC,GACAC,IAAIN,EAAK,QACTO,IAAQZ,EAAO,OAEZ,EAAES,IAAIE,KAAG;AAEd,aADAL,IAAMD,EAAKI,CAAC,GAAGF,IAAQD,EAAI,UACtBE,IAAIF,EAAI,QAAQ,GAAGI,IAAIH,EAAM,QAAQC,IAAIE,GAAG,EAAEF,EAAG,CAAAF,EAAI,SAASC,EAAMC,CAAC,EAAE;AAC5E,QAAIF,EAAI,OAAMO,EAAYP,GAAKL,GAAIC,GAAIC,GAAIS,IAAQV,MAAOE,IAAKF,KAAMI,EAAI,QAAQM,IAAQR,CAAE,IACtFU,EAAaR,GAAKL,GAAIC,GAAIU,IAAQX,MAAOE,IAAKF,KAAMK,EAAI,QAAQM,IAAQT,GAAIC,CAAE,GACnFQ,KAASN,EAAI;AAAA,MACf;AAAA;AAEA,MAAAN,EAAO,YAAYK,IAAOU,EAAcjB,GAAOE,GAAQC,GAAIC,GAAIC,GAAIC,CAAE,GACrEC,EAAK,QAAQP;AAAA,EAEjB;AAEA,SAAAC,EAAW,QAAQ,SAASiB,GAAG;AAC7B,WAAOnB,GAAQmB,IAAI,CAACA,KAAK,IAAIA,IAAI,CAAC;AAAA,EACpC,GAEOjB;AACT,GAAGkB,CAAG;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/treemap/round.js

@@ -0,0 +1,7 @@
+function u(t) {
+  t.x0 = Math.round(t.x0), t.y0 = Math.round(t.y0), t.x1 = Math.round(t.x1), t.y1 = Math.round(t.y1);
+}
+export {
+  u as default
+};
+//# sourceMappingURL=round.js.map

package/dist/node_modules/d3-hierarchy/src/treemap/round.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"round.js","sources":["../../../../../node_modules/d3-hierarchy/src/treemap/round.js"],"sourcesContent":["export default function(node) {\n  node.x0 = Math.round(node.x0);\n  node.y0 = Math.round(node.y0);\n  node.x1 = Math.round(node.x1);\n  node.y1 = Math.round(node.y1);\n}\n"],"names":["roundNode","node"],"mappings":"AAAe,SAAAA,EAASC,GAAM;AAC5B,EAAAA,EAAK,KAAK,KAAK,MAAMA,EAAK,EAAE,GAC5BA,EAAK,KAAK,KAAK,MAAMA,EAAK,EAAE,GAC5BA,EAAK,KAAK,KAAK,MAAMA,EAAK,EAAE,GAC5BA,EAAK,KAAK,KAAK,MAAMA,EAAK,EAAE;AAC9B;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/treemap/slice.js

@@ -0,0 +1,8 @@
+function h(l, u, a, d, o) {
+  for (var i = l.children, e, n = -1, v = i.length, c = l.value && (o - a) / l.value; ++n < v; )
+    e = i[n], e.x0 = u, e.x1 = d, e.y0 = a, e.y1 = a += e.value * c;
+}
+export {
+  h as default
+};
+//# sourceMappingURL=slice.js.map

package/dist/node_modules/d3-hierarchy/src/treemap/slice.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"slice.js","sources":["../../../../../node_modules/d3-hierarchy/src/treemap/slice.js"],"sourcesContent":["export default function(parent, x0, y0, x1, y1) {\n  var nodes = parent.children,\n      node,\n      i = -1,\n      n = nodes.length,\n      k = parent.value && (y1 - y0) / parent.value;\n\n  while (++i < n) {\n    node = nodes[i], node.x0 = x0, node.x1 = x1;\n    node.y0 = y0, node.y1 = y0 += node.value * k;\n  }\n}\n"],"names":["treemapSlice","parent","x0","y0","x1","y1","nodes","node","i","n","k"],"mappings":"AAAe,SAAAA,EAASC,GAAQC,GAAIC,GAAIC,GAAIC,GAAI;AAO9C,WANIC,IAAQL,EAAO,UACfM,GACAC,IAAI,IACJC,IAAIH,EAAM,QACVI,IAAIT,EAAO,UAAUI,IAAKF,KAAMF,EAAO,OAEpC,EAAEO,IAAIC;AACX,IAAAF,IAAOD,EAAME,CAAC,GAAGD,EAAK,KAAKL,GAAIK,EAAK,KAAKH,GACzCG,EAAK,KAAKJ,GAAII,EAAK,KAAKJ,KAAMI,EAAK,QAAQG;AAE/C;","x_google_ignoreList":[0]}