@milaboratories/graph-maker 1.1.131 → 1.1.133

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-format/src/precisionPrefix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"precisionPrefix.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-format/src/precisionPrefix.js"],"sourcesContent":["import exponent from \"./exponent.js\";\n\nexport default function(step, value) {\n  return Math.max(0, Math.max(-8, Math.min(8, Math.floor(exponent(value) / 3))) * 3 - exponent(Math.abs(step)));\n}\n"],"names":["precisionPrefix","step","value","exponent"],"mappings":";AAEe,SAAAA,EAASC,GAAMC,GAAO;AACnC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,KAAK,MAAMC,EAASD,CAAK,IAAI,CAAC,CAAC,CAAC,IAAI,IAAIC,EAAS,KAAK,IAAIF,CAAI,CAAC,CAAC;AAC9G;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-format/src/precisionRound.js

@@ -0,0 +1,8 @@
+import r from "./exponent.js";
+function f(t, a) {
+  return t = Math.abs(t), a = Math.abs(a) - t, Math.max(0, r(a) - r(t)) + 1;
+}
+export {
+  f as default
+};
+//# sourceMappingURL=precisionRound.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-format/src/precisionRound.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"precisionRound.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-format/src/precisionRound.js"],"sourcesContent":["import exponent from \"./exponent.js\";\n\nexport default function(step, max) {\n  step = Math.abs(step), max = Math.abs(max) - step;\n  return Math.max(0, exponent(max) - exponent(step)) + 1;\n}\n"],"names":["precisionRound","step","max","exponent"],"mappings":";AAEe,SAAAA,EAASC,GAAMC,GAAK;AACjC,SAAAD,IAAO,KAAK,IAAIA,CAAI,GAAGC,IAAM,KAAK,IAAIA,CAAG,IAAID,GACtC,KAAK,IAAI,GAAGE,EAASD,CAAG,IAAIC,EAASF,CAAI,CAAC,IAAI;AACvD;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/accessors.js

@@ -0,0 +1,12 @@
+function o(r) {
+  return r == null ? null : n(r);
+}
+function n(r) {
+  if (typeof r != "function") throw new Error();
+  return r;
+}
+export {
+  o as optional,
+  n as required
+};
+//# sourceMappingURL=accessors.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/accessors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"accessors.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/accessors.js"],"sourcesContent":["export function optional(f) {\n  return f == null ? null : required(f);\n}\n\nexport function required(f) {\n  if (typeof f !== \"function\") throw new Error;\n  return f;\n}\n"],"names":["optional","f","required"],"mappings":"AAAO,SAASA,EAASC,GAAG;AAC1B,SAAOA,KAAK,OAAO,OAAOC,EAASD,CAAC;AACtC;AAEO,SAASC,EAASD,GAAG;AAC1B,MAAI,OAAOA,KAAM,WAAY,OAAM,IAAI,MAAA;AACvC,SAAOA;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/cluster.js

@@ -0,0 +1,50 @@
+function g(n, e) {
+  return n.parent === e.parent ? 1 : 2;
+}
+function s(n) {
+  return n.reduce(d, 0) / n.length;
+}
+function d(n, e) {
+  return n + e.x;
+}
+function v(n) {
+  return 1 + n.reduce(m, 0);
+}
+function m(n, e) {
+  return Math.max(n, e.y);
+}
+function p(n) {
+  for (var e; e = n.children; ) n = e[0];
+  return n;
+}
+function z(n) {
+  for (var e; e = n.children; ) n = e[e.length - 1];
+  return n;
+}
+function A() {
+  var n = g, e = 1, c = 1, f = !1;
+  function t(r) {
+    var a, h = 0;
+    r.eachAfter(function(u) {
+      var l = u.children;
+      l ? (u.x = s(l), u.y = v(l)) : (u.x = a ? h += n(u, a) : 0, u.y = 0, a = u);
+    });
+    var i = p(r), o = z(r), x = i.x - n(i, o) / 2, y = o.x + n(o, i) / 2;
+    return r.eachAfter(f ? function(u) {
+      u.x = (u.x - r.x) * e, u.y = (r.y - u.y) * c;
+    } : function(u) {
+      u.x = (u.x - x) / (y - x) * e, u.y = (1 - (r.y ? u.y / r.y : 1)) * c;
+    });
+  }
+  return t.separation = function(r) {
+    return arguments.length ? (n = r, t) : n;
+  }, t.size = function(r) {
+    return arguments.length ? (f = !1, e = +r[0], c = +r[1], t) : f ? null : [e, c];
+  }, t.nodeSize = function(r) {
+    return arguments.length ? (f = !0, e = +r[0], c = +r[1], t) : f ? [e, c] : null;
+  }, t;
+}
+export {
+  A as default
+};
+//# sourceMappingURL=cluster.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/cluster.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/cluster.js"],"sourcesContent":["function defaultSeparation(a, b) {\n  return a.parent === b.parent ? 1 : 2;\n}\n\nfunction meanX(children) {\n  return children.reduce(meanXReduce, 0) / children.length;\n}\n\nfunction meanXReduce(x, c) {\n  return x + c.x;\n}\n\nfunction maxY(children) {\n  return 1 + children.reduce(maxYReduce, 0);\n}\n\nfunction maxYReduce(y, c) {\n  return Math.max(y, c.y);\n}\n\nfunction leafLeft(node) {\n  var children;\n  while (children = node.children) node = children[0];\n  return node;\n}\n\nfunction leafRight(node) {\n  var children;\n  while (children = node.children) node = children[children.length - 1];\n  return node;\n}\n\nexport default function() {\n  var separation = defaultSeparation,\n      dx = 1,\n      dy = 1,\n      nodeSize = false;\n\n  function cluster(root) {\n    var previousNode,\n        x = 0;\n\n    // First walk, computing the initial x & y values.\n    root.eachAfter(function(node) {\n      var children = node.children;\n      if (children) {\n        node.x = meanX(children);\n        node.y = maxY(children);\n      } else {\n        node.x = previousNode ? x += separation(node, previousNode) : 0;\n        node.y = 0;\n        previousNode = node;\n      }\n    });\n\n    var left = leafLeft(root),\n        right = leafRight(root),\n        x0 = left.x - separation(left, right) / 2,\n        x1 = right.x + separation(right, left) / 2;\n\n    // Second walk, normalizing x & y to the desired size.\n    return root.eachAfter(nodeSize ? function(node) {\n      node.x = (node.x - root.x) * dx;\n      node.y = (root.y - node.y) * dy;\n    } : function(node) {\n      node.x = (node.x - x0) / (x1 - x0) * dx;\n      node.y = (1 - (root.y ? node.y / root.y : 1)) * dy;\n    });\n  }\n\n  cluster.separation = function(x) {\n    return arguments.length ? (separation = x, cluster) : separation;\n  };\n\n  cluster.size = function(x) {\n    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? null : [dx, dy]);\n  };\n\n  cluster.nodeSize = function(x) {\n    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? [dx, dy] : null);\n  };\n\n  return cluster;\n}\n"],"names":["defaultSeparation","a","b","meanX","children","meanXReduce","x","c","maxY","maxYReduce","y","leafLeft","node","leafRight","cluster","separation","dx","dy","nodeSize","root","previousNode","left","right","x0","x1"],"mappings":"AAAA,SAASA,EAAkBC,GAAGC,GAAG;AAC/B,SAAOD,EAAE,WAAWC,EAAE,SAAS,IAAI;AACrC;AAEA,SAASC,EAAMC,GAAU;AACvB,SAAOA,EAAS,OAAOC,GAAa,CAAC,IAAID,EAAS;AACpD;AAEA,SAASC,EAAYC,GAAGC,GAAG;AACzB,SAAOD,IAAIC,EAAE;AACf;AAEA,SAASC,EAAKJ,GAAU;AACtB,SAAO,IAAIA,EAAS,OAAOK,GAAY,CAAC;AAC1C;AAEA,SAASA,EAAWC,GAAGH,GAAG;AACxB,SAAO,KAAK,IAAIG,GAAGH,EAAE,CAAC;AACxB;AAEA,SAASI,EAASC,GAAM;AAEtB,WADIR,GACGA,IAAWQ,EAAK,WAAUA,CAAAA,IAAOR,EAAS,CAAC;AAClD,SAAOQ;AACT;AAEA,SAASC,EAAUD,GAAM;AAEvB,WADIR,GACGA,IAAWQ,EAAK,WAAUA,CAAAA,IAAOR,EAASA,EAAS,SAAS,CAAC;AACpE,SAAOQ;AACT;AAEe,SAAAE,IAAW;AACxB,MAAIC,IAAaf,GACbgB,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASJ,EAAQK,GAAM;AACrB,QAAIC,GACAd,IAAI;AAGRa,IAAAA,EAAK,UAAU,SAASP,GAAM;AAC5B,UAAIR,IAAWQ,EAAK;AAChBR,MAAAA,KACFQ,EAAK,IAAIT,EAAMC,CAAQ,GACvBQ,EAAK,IAAIJ,EAAKJ,CAAQ,MAEtBQ,EAAK,IAAIQ,IAAed,KAAKS,EAAWH,GAAMQ,CAAY,IAAI,GAC9DR,EAAK,IAAI,GACTQ,IAAeR;AAAAA,IAEnB,CAAC;AAED,QAAIS,IAAOV,EAASQ,CAAI,GACpBG,IAAQT,EAAUM,CAAI,GACtBI,IAAKF,EAAK,IAAIN,EAAWM,GAAMC,CAAK,IAAI,GACxCE,IAAKF,EAAM,IAAIP,EAAWO,GAAOD,CAAI,IAAI;AAG7C,WAAOF,EAAK,UAAUD,IAAW,SAASN,GAAM;AAC9CA,MAAAA,EAAK,KAAKA,EAAK,IAAIO,EAAK,KAAKH,GAC7BJ,EAAK,KAAKO,EAAK,IAAIP,EAAK,KAAKK;AAAAA,IAC/B,IAAI,SAASL,GAAM;AACjBA,MAAAA,EAAK,KAAKA,EAAK,IAAIW,MAAOC,IAAKD,KAAMP,GACrCJ,EAAK,KAAK,KAAKO,EAAK,IAAIP,EAAK,IAAIO,EAAK,IAAI,MAAMF;AAAAA,IAClD,CAAC;AAAA,EACH;AAEA,SAAAH,EAAQ,aAAa,SAASR,GAAG;AAC/B,WAAO,UAAU,UAAUS,IAAaT,GAAGQ,KAAWC;AAAAA,EACxD,GAEAD,EAAQ,OAAO,SAASR,GAAG;AACzB,WAAO,UAAU,UAAUY,IAAW,IAAOF,IAAK,CAACV,EAAE,CAAC,GAAGW,IAAK,CAACX,EAAE,CAAC,GAAGQ,KAAYI,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EAC5G,GAEAH,EAAQ,WAAW,SAASR,GAAG;AAC7B,WAAO,UAAU,UAAUY,IAAW,IAAMF,IAAK,CAACV,EAAE,CAAC,GAAGW,IAAK,CAACX,EAAE,CAAC,GAAGQ,KAAYI,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EACxG,GAEOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/ancestors.js

@@ -0,0 +1,9 @@
+function a() {
+  for (var t = this, r = [t]; t = t.parent; )
+    r.push(t);
+  return r;
+}
+export {
+  a as default
+};
+//# sourceMappingURL=ancestors.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/ancestors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ancestors.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/ancestors.js"],"sourcesContent":["export default function() {\n  var node = this, nodes = [node];\n  while (node = node.parent) {\n    nodes.push(node);\n  }\n  return nodes;\n}\n"],"names":["node_ancestors","node","nodes"],"mappings":"AAAe,SAAAA,IAAW;AAExB,WADIC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GACvBA,IAAOA,EAAK;AACjBC,IAAAA,EAAM,KAAKD,CAAI;AAEjB,SAAOC;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/count.js

@@ -0,0 +1,13 @@
+function r(l) {
+  var e = 0, t = l.children, n = t && t.length;
+  if (!n) e = 1;
+  else for (; --n >= 0; ) e += t[n].value;
+  l.value = e;
+}
+function a() {
+  return this.eachAfter(r);
+}
+export {
+  a as default
+};
+//# sourceMappingURL=count.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/count.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"count.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/count.js"],"sourcesContent":["function count(node) {\n  var sum = 0,\n      children = node.children,\n      i = children && children.length;\n  if (!i) sum = 1;\n  else while (--i >= 0) sum += children[i].value;\n  node.value = sum;\n}\n\nexport default function() {\n  return this.eachAfter(count);\n}\n"],"names":["count","node","sum","children","i","node_count"],"mappings":"AAAA,SAASA,EAAMC,GAAM;AACnB,MAAIC,IAAM,GACNC,IAAWF,EAAK,UAChBG,IAAID,KAAYA,EAAS;AAC7B,MAAI,CAACC,EAAGF,KAAM;AAAA,MACT,QAAO,EAAEE,KAAK,IAAGF,MAAOC,EAASC,CAAC,EAAE;AACzCH,EAAAA,EAAK,QAAQC;AACf;AAEe,SAAAG,IAAW;AACxB,SAAO,KAAK,UAAUL,CAAK;AAC7B;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/descendants.js

@@ -0,0 +1,7 @@
+function r() {
+  return Array.from(this);
+}
+export {
+  r as default
+};
+//# sourceMappingURL=descendants.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/descendants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"descendants.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/descendants.js"],"sourcesContent":["export default function() {\n  return Array.from(this);\n}\n"],"names":["node_descendants"],"mappings":"AAAe,SAAAA,IAAW;AACxB,SAAO,MAAM,KAAK,IAAI;AACxB;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/each.js

@@ -0,0 +1,10 @@
+function s(t, o) {
+  let i = -1;
+  for (const n of this)
+    t.call(o, n, ++i, this);
+  return this;
+}
+export {
+  s as default
+};
+//# sourceMappingURL=each.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/each.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"each.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/each.js"],"sourcesContent":["export default function(callback, that) {\n  let index = -1;\n  for (const node of this) {\n    callback.call(that, node, ++index, this);\n  }\n  return this;\n}\n"],"names":["node_each","callback","that","index","node"],"mappings":"AAAe,SAAAA,EAASC,GAAUC,GAAM;AACtC,MAAIC,IAAQ;AACZ,aAAWC,KAAQ;AACjBH,MAAS,KAAKC,GAAME,GAAM,EAAED,GAAO,IAAI;AAEzC,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/eachAfter.js

@@ -0,0 +1,13 @@
+function a(h, i) {
+  for (var p = this, t = [p], f = [], o, r, s, u = -1; p = t.pop(); )
+    if (f.push(p), o = p.children)
+      for (r = 0, s = o.length; r < s; ++r)
+        t.push(o[r]);
+  for (; p = f.pop(); )
+    h.call(i, p, ++u, this);
+  return this;
+}
+export {
+  a as default
+};
+//# sourceMappingURL=eachAfter.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/eachAfter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eachAfter.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/eachAfter.js"],"sourcesContent":["export default function(callback, that) {\n  var node = this, nodes = [node], next = [], children, i, n, index = -1;\n  while (node = nodes.pop()) {\n    next.push(node);\n    if (children = node.children) {\n      for (i = 0, n = children.length; i < n; ++i) {\n        nodes.push(children[i]);\n      }\n    }\n  }\n  while (node = next.pop()) {\n    callback.call(that, node, ++index, this);\n  }\n  return this;\n}\n"],"names":["node_eachAfter","callback","that","node","nodes","next","children","i","n","index"],"mappings":"AAAe,SAAAA,EAASC,GAAUC,GAAM;AAEtC,WADIC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GAAGE,IAAO,CAAA,GAAIC,GAAUC,GAAGC,GAAGC,IAAQ,IAC7DN,IAAOC,EAAM,IAAA;AAElB,QADAC,EAAK,KAAKF,CAAI,GACVG,IAAWH,EAAK;AAClB,WAAKI,IAAI,GAAGC,IAAIF,EAAS,QAAQC,IAAIC,GAAG,EAAED;AACxCH,QAAAA,EAAM,KAAKE,EAASC,CAAC,CAAC;AAI5B,SAAOJ,IAAOE,EAAK,IAAA;AACjBJ,IAAAA,EAAS,KAAKC,GAAMC,GAAM,EAAEM,GAAO,IAAI;AAEzC,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/eachBefore.js

@@ -0,0 +1,11 @@
+function a(l, o) {
+  for (var t = this, h = [t], f, r, s = -1; t = h.pop(); )
+    if (l.call(o, t, ++s, this), f = t.children)
+      for (r = f.length - 1; r >= 0; --r)
+        h.push(f[r]);
+  return this;
+}
+export {
+  a as default
+};
+//# sourceMappingURL=eachBefore.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/eachBefore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eachBefore.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/eachBefore.js"],"sourcesContent":["export default function(callback, that) {\n  var node = this, nodes = [node], children, i, index = -1;\n  while (node = nodes.pop()) {\n    callback.call(that, node, ++index, this);\n    if (children = node.children) {\n      for (i = children.length - 1; i >= 0; --i) {\n        nodes.push(children[i]);\n      }\n    }\n  }\n  return this;\n}\n"],"names":["node_eachBefore","callback","that","node","nodes","children","i","index"],"mappings":"AAAe,SAAAA,EAASC,GAAUC,GAAM;AAEtC,WADIC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GAAGE,GAAUC,GAAGC,IAAQ,IAC/CJ,IAAOC,EAAM,IAAA;AAElB,QADAH,EAAS,KAAKC,GAAMC,GAAM,EAAEI,GAAO,IAAI,GACnCF,IAAWF,EAAK;AAClB,WAAKG,IAAID,EAAS,SAAS,GAAGC,KAAK,GAAG,EAAEA;AACtCF,UAAM,KAAKC,EAASC,CAAC,CAAC;AAI5B,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/find.js

@@ -0,0 +1,10 @@
+function e(f, o) {
+  let n = -1;
+  for (const t of this)
+    if (f.call(o, t, ++n, this))
+      return t;
+}
+export {
+  e as default
+};
+//# sourceMappingURL=find.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/find.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/find.js"],"sourcesContent":["export default function(callback, that) {\n  let index = -1;\n  for (const node of this) {\n    if (callback.call(that, node, ++index, this)) {\n      return node;\n    }\n  }\n}\n"],"names":["node_find","callback","that","index","node"],"mappings":"AAAe,SAAAA,EAASC,GAAUC,GAAM;AACtC,MAAIC,IAAQ;AACZ,aAAWC,KAAQ;AACjB,QAAIH,EAAS,KAAKC,GAAME,GAAM,EAAED,GAAO,IAAI;AACzC,aAAOC;AAGb;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/index.js

@@ -0,0 +1,65 @@
+import d from "./count.js";
+import c from "./each.js";
+import u from "./eachBefore.js";
+import s from "./eachAfter.js";
+import l from "./find.js";
+import v from "./sum.js";
+import y from "./sort.js";
+import $ from "./path.js";
+import g from "./ancestors.js";
+import A from "./descendants.js";
+import w from "./leaves.js";
+import B from "./links.js";
+import k from "./iterator.js";
+function h(t, r) {
+  t instanceof Map ? (t = [void 0, t], r === void 0 && (r = j)) : r === void 0 && (r = b);
+  for (var p = new e(t), i, f = [p], n, o, a, m; i = f.pop(); )
+    if ((o = r(i.data)) && (m = (o = Array.from(o)).length))
+      for (i.children = o, a = m - 1; a >= 0; --a)
+        f.push(n = o[a] = new e(o[a])), n.parent = i, n.depth = i.depth + 1;
+  return p.eachBefore(D);
+}
+function x() {
+  return h(this).eachBefore(C);
+}
+function b(t) {
+  return t.children;
+}
+function j(t) {
+  return Array.isArray(t) ? t[1] : null;
+}
+function C(t) {
+  t.data.value !== void 0 && (t.value = t.data.value), t.data = t.data.data;
+}
+function D(t) {
+  var r = 0;
+  do
+    t.height = r;
+  while ((t = t.parent) && t.height < ++r);
+}
+function e(t) {
+  this.data = t, this.depth = this.height = 0, this.parent = null;
+}
+e.prototype = h.prototype = {
+  constructor: e,
+  count: d,
+  each: c,
+  eachAfter: s,
+  eachBefore: u,
+  find: l,
+  sum: v,
+  sort: y,
+  path: $,
+  ancestors: g,
+  descendants: A,
+  leaves: w,
+  links: B,
+  copy: x,
+  [Symbol.iterator]: k
+};
+export {
+  e as Node,
+  D as computeHeight,
+  h as default
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/index.js"],"sourcesContent":["import node_count from \"./count.js\";\nimport node_each from \"./each.js\";\nimport node_eachBefore from \"./eachBefore.js\";\nimport node_eachAfter from \"./eachAfter.js\";\nimport node_find from \"./find.js\";\nimport node_sum from \"./sum.js\";\nimport node_sort from \"./sort.js\";\nimport node_path from \"./path.js\";\nimport node_ancestors from \"./ancestors.js\";\nimport node_descendants from \"./descendants.js\";\nimport node_leaves from \"./leaves.js\";\nimport node_links from \"./links.js\";\nimport node_iterator from \"./iterator.js\";\n\nexport default function hierarchy(data, children) {\n  if (data instanceof Map) {\n    data = [undefined, data];\n    if (children === undefined) children = mapChildren;\n  } else if (children === undefined) {\n    children = objectChildren;\n  }\n\n  var root = new Node(data),\n      node,\n      nodes = [root],\n      child,\n      childs,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if ((childs = children(node.data)) && (n = (childs = Array.from(childs)).length)) {\n      node.children = childs;\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = childs[i] = new Node(childs[i]));\n        child.parent = node;\n        child.depth = node.depth + 1;\n      }\n    }\n  }\n\n  return root.eachBefore(computeHeight);\n}\n\nfunction node_copy() {\n  return hierarchy(this).eachBefore(copyData);\n}\n\nfunction objectChildren(d) {\n  return d.children;\n}\n\nfunction mapChildren(d) {\n  return Array.isArray(d) ? d[1] : null;\n}\n\nfunction copyData(node) {\n  if (node.data.value !== undefined) node.value = node.data.value;\n  node.data = node.data.data;\n}\n\nexport function computeHeight(node) {\n  var height = 0;\n  do node.height = height;\n  while ((node = node.parent) && (node.height < ++height));\n}\n\nexport function Node(data) {\n  this.data = data;\n  this.depth =\n  this.height = 0;\n  this.parent = null;\n}\n\nNode.prototype = hierarchy.prototype = {\n  constructor: Node,\n  count: node_count,\n  each: node_each,\n  eachAfter: node_eachAfter,\n  eachBefore: node_eachBefore,\n  find: node_find,\n  sum: node_sum,\n  sort: node_sort,\n  path: node_path,\n  ancestors: node_ancestors,\n  descendants: node_descendants,\n  leaves: node_leaves,\n  links: node_links,\n  copy: node_copy,\n  [Symbol.iterator]: node_iterator\n};\n"],"names":["hierarchy","data","children","mapChildren","objectChildren","root","Node","node","nodes","child","childs","i","n","computeHeight","node_copy","copyData","d","height","node_count","node_each","node_eachAfter","node_eachBefore","node_find","node_sum","node_sort","node_path","node_ancestors","node_descendants","node_leaves","node_links","node_iterator"],"mappings":";;;;;;;;;;;;;AAce,SAASA,EAAUC,GAAMC,GAAU;AAC5CD,EAAAA,aAAgB,OAClBA,IAAO,CAAC,QAAWA,CAAI,GACnBC,MAAa,WAAWA,IAAWC,MAC9BD,MAAa,WACtBA,IAAWE;AAWb,WARIC,IAAO,IAAIC,EAAKL,CAAI,GACpBM,GACAC,IAAQ,CAACH,CAAI,GACbI,GACAC,GACAC,GACAC,GAEGL,IAAOC,EAAM,IAAA;AAClB,SAAKE,IAASR,EAASK,EAAK,IAAI,OAAOK,KAAKF,IAAS,MAAM,KAAKA,CAAM,GAAG;AAEvE,WADAH,EAAK,WAAWG,GACXC,IAAIC,IAAI,GAAGD,KAAK,GAAG,EAAEA;AACxBH,QAAAA,EAAM,KAAKC,IAAQC,EAAOC,CAAC,IAAI,IAAIL,EAAKI,EAAOC,CAAC,CAAC,CAAC,GAClDF,EAAM,SAASF,GACfE,EAAM,QAAQF,EAAK,QAAQ;AAKjC,SAAOF,EAAK,WAAWQ,CAAa;AACtC;AAEA,SAASC,IAAY;AACnB,SAAOd,EAAU,IAAI,EAAE,WAAWe,CAAQ;AAC5C;AAEA,SAASX,EAAeY,GAAG;AACzB,SAAOA,EAAE;AACX;AAEA,SAASb,EAAYa,GAAG;AACtB,SAAO,MAAM,QAAQA,CAAC,IAAIA,EAAE,CAAC,IAAI;AACnC;AAEA,SAASD,EAASR,GAAM;AAClBA,EAAAA,EAAK,KAAK,UAAU,WAAWA,EAAK,QAAQA,EAAK,KAAK,QAC1DA,EAAK,OAAOA,EAAK,KAAK;AACxB;AAEO,SAASM,EAAcN,GAAM;AAClC,MAAIU,IAAS;AACb;AAAGV,IAAAA,EAAK,SAASU;AAAAA,UACTV,IAAOA,EAAK,WAAYA,EAAK,SAAS,EAAEU;AAClD;AAEO,SAASX,EAAKL,GAAM;AACzB,OAAK,OAAOA,GACZ,KAAK,QACL,KAAK,SAAS,GACd,KAAK,SAAS;AAChB;AAEAK,EAAK,YAAYN,EAAU,YAAY;AAAA,EACrC,aAAaM;AAAAA,EACb,OAAOY;AAAAA,EACP,MAAMC;AAAAA,EACN,WAAWC;AAAAA,EACX,YAAYC;AAAAA,EACZ,MAAMC;AAAAA,EACN,KAAKC;AAAAA,EACL,MAAMC;AAAAA,EACN,MAAMC;AAAAA,EACN,WAAWC;AAAAA,EACX,aAAaC;AAAAA,EACb,QAAQC;AAAAA,EACR,OAAOC;AAAAA,EACP,MAAMf;AAAAA,EACN,CAAC,OAAO,QAAQ,GAAGgB;AACrB;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/iterator.js

@@ -0,0 +1,13 @@
+function* n() {
+  var e = this, l, r = [e], i, h, t;
+  do
+    for (l = r.reverse(), r = []; e = l.pop(); )
+      if (yield e, i = e.children)
+        for (h = 0, t = i.length; h < t; ++h)
+          r.push(i[h]);
+  while (r.length);
+}
+export {
+  n as default
+};
+//# sourceMappingURL=iterator.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/iterator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterator.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/iterator.js"],"sourcesContent":["export default function*() {\n  var node = this, current, next = [node], children, i, n;\n  do {\n    current = next.reverse(), next = [];\n    while (node = current.pop()) {\n      yield node;\n      if (children = node.children) {\n        for (i = 0, n = children.length; i < n; ++i) {\n          next.push(children[i]);\n        }\n      }\n    }\n  } while (next.length);\n}\n"],"names":["node_iterator","node","current","next","children","i","n"],"mappings":"AAAe,UAAAA,IAAY;AACzB,MAAIC,IAAO,MAAMC,GAASC,IAAO,CAACF,CAAI,GAAGG,GAAUC,GAAGC;AACtD;AAEE,SADAJ,IAAUC,EAAK,QAAA,GAAWA,IAAO,IAC1BF,IAAOC,EAAQ,IAAA;AAEpB,UADA,MAAMD,GACFG,IAAWH,EAAK;AAClB,aAAKI,IAAI,GAAGC,IAAIF,EAAS,QAAQC,IAAIC,GAAG,EAAED;AACxCF,UAAAA,EAAK,KAAKC,EAASC,CAAC,CAAC;AAAA,SAIpBF,EAAK;AAChB;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/leaves.js

@@ -0,0 +1,10 @@
+function r() {
+  var e = [];
+  return this.eachBefore(function(n) {
+    n.children || e.push(n);
+  }), e;
+}
+export {
+  r as default
+};
+//# sourceMappingURL=leaves.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/leaves.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"leaves.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/leaves.js"],"sourcesContent":["export default function() {\n  var leaves = [];\n  this.eachBefore(function(node) {\n    if (!node.children) {\n      leaves.push(node);\n    }\n  });\n  return leaves;\n}\n"],"names":["node_leaves","leaves","node"],"mappings":"AAAe,SAAAA,IAAW;AACxB,MAAIC,IAAS,CAAA;AACb,SAAA,KAAK,WAAW,SAASC,GAAM;AACxBA,IAAAA,EAAK,YACRD,EAAO,KAAKC,CAAI;AAAA,EAEpB,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/links.js

@@ -0,0 +1,10 @@
+function n() {
+  var a = this, e = [];
+  return a.each(function(r) {
+    r !== a && e.push({ source: r.parent, target: r });
+  }), e;
+}
+export {
+  n as default
+};
+//# sourceMappingURL=links.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/links.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"links.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/links.js"],"sourcesContent":["export default function() {\n  var root = this, links = [];\n  root.each(function(node) {\n    if (node !== root) { // Don’t include the root’s parent, if any.\n      links.push({source: node.parent, target: node});\n    }\n  });\n  return links;\n}\n"],"names":["node_links","root","links","node"],"mappings":"AAAe,SAAAA,IAAW;AACxB,MAAIC,IAAO,MAAMC,IAAQ,CAAA;AACzB,SAAAD,EAAK,KAAK,SAASE,GAAM;AACnBA,IAAAA,MAASF,KACXC,EAAM,KAAK,EAAC,QAAQC,EAAK,QAAQ,QAAQA,GAAK;AAAA,EAElD,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/path.js

@@ -0,0 +1,18 @@
+function u(r) {
+  for (var n = this, o = s(n, r), p = [n]; n !== o; )
+    n = n.parent, p.push(n);
+  for (var a = p.length; r !== o; )
+    p.splice(a, 0, r), r = r.parent;
+  return p;
+}
+function s(r, n) {
+  if (r === n) return r;
+  var o = r.ancestors(), p = n.ancestors(), a = null;
+  for (r = o.pop(), n = p.pop(); r === n; )
+    a = r, r = o.pop(), n = p.pop();
+  return a;
+}
+export {
+  u as default
+};
+//# sourceMappingURL=path.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/path.js"],"sourcesContent":["export default function(end) {\n  var start = this,\n      ancestor = leastCommonAncestor(start, end),\n      nodes = [start];\n  while (start !== ancestor) {\n    start = start.parent;\n    nodes.push(start);\n  }\n  var k = nodes.length;\n  while (end !== ancestor) {\n    nodes.splice(k, 0, end);\n    end = end.parent;\n  }\n  return nodes;\n}\n\nfunction leastCommonAncestor(a, b) {\n  if (a === b) return a;\n  var aNodes = a.ancestors(),\n      bNodes = b.ancestors(),\n      c = null;\n  a = aNodes.pop();\n  b = bNodes.pop();\n  while (a === b) {\n    c = a;\n    a = aNodes.pop();\n    b = bNodes.pop();\n  }\n  return c;\n}\n"],"names":["node_path","end","start","ancestor","leastCommonAncestor","nodes","k","a","b","aNodes","bNodes","c"],"mappings":"AAAe,SAAAA,EAASC,GAAK;AAI3B,WAHIC,IAAQ,MACRC,IAAWC,EAAoBF,GAAOD,CAAG,GACzCI,IAAQ,CAACH,CAAK,GACXA,MAAUC;AACfD,IAAAA,IAAQA,EAAM,QACdG,EAAM,KAAKH,CAAK;AAGlB,WADII,IAAID,EAAM,QACPJ,MAAQE;AACbE,IAAAA,EAAM,OAAOC,GAAG,GAAGL,CAAG,GACtBA,IAAMA,EAAI;AAEZ,SAAOI;AACT;AAEA,SAASD,EAAoBG,GAAGC,GAAG;AACjC,MAAID,MAAMC,EAAG,QAAOD;AACpB,MAAIE,IAASF,EAAE,UAAA,GACXG,IAASF,EAAE,aACXG,IAAI;AAGR,OAFAJ,IAAIE,EAAO,IAAA,GACXD,IAAIE,EAAO,OACJH,MAAMC;AACXG,IAAAA,IAAIJ,GACJA,IAAIE,EAAO,OACXD,IAAIE,EAAO,IAAA;AAEb,SAAOC;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/sort.js

@@ -0,0 +1,9 @@
+function n(e) {
+  return this.eachBefore(function(t) {
+    t.children && t.children.sort(e);
+  });
+}
+export {
+  n as default
+};
+//# sourceMappingURL=sort.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/sort.js"],"sourcesContent":["export default function(compare) {\n  return this.eachBefore(function(node) {\n    if (node.children) {\n      node.children.sort(compare);\n    }\n  });\n}\n"],"names":["node_sort","compare","node"],"mappings":"AAAe,SAAAA,EAASC,GAAS;AAC/B,SAAO,KAAK,WAAW,SAASC,GAAM;AAChCA,IAAAA,EAAK,YACPA,EAAK,SAAS,KAAKD,CAAO;AAAA,EAE9B,CAAC;AACH;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/sum.js

@@ -0,0 +1,10 @@
+function l(t) {
+  return this.eachAfter(function(a) {
+    for (var n = +t(a.data) || 0, e = a.children, r = e && e.length; --r >= 0; ) n += e[r].value;
+    a.value = n;
+  });
+}
+export {
+  l as default
+};
+//# sourceMappingURL=sum.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/hierarchy/sum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-hierarchy/src/hierarchy/sum.js"],"sourcesContent":["export default function(value) {\n  return this.eachAfter(function(node) {\n    var sum = +value(node.data) || 0,\n        children = node.children,\n        i = children && children.length;\n    while (--i >= 0) sum += children[i].value;\n    node.value = sum;\n  });\n}\n"],"names":["node_sum","value","node","sum","children","i"],"mappings":"AAAe,SAAAA,EAASC,GAAO;AAC7B,SAAO,KAAK,UAAU,SAASC,GAAM;AAInC,aAHIC,IAAM,CAACF,EAAMC,EAAK,IAAI,KAAK,GAC3BE,IAAWF,EAAK,UAChBG,IAAID,KAAYA,EAAS,QACtB,EAAEC,KAAK,IAAGF,CAAAA,KAAOC,EAASC,CAAC,EAAE;AACpCH,IAAAA,EAAK,QAAQC;AAAAA,EACf,CAAC;AACH;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-hierarchy/src/stratify.js

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"stratify.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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,GAAA,GAClBC,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,IAAA;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;AACTE,QAAAA,EAAE,IAAIX,CAAC,MACVW,EAAE,IAAIX,CAAC,GACPO,EAAE,KAAKP,CAAC,GACRS,EAAE,KAAKC,EAASV,CAAC,CAAC,GAClBJ,EAAM,KAAKT,CAAO;AAGtBU,MAAAA,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;AACrCX,MAAAA,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;AAC5DF,QAAAA,EAAO,WAAUA,EAAO,SAAS,KAAKC,CAAI,IACzCD,EAAO,WAAW,CAACC,CAAI,GAC5BA,EAAK,SAASD;AAAAA,MAChB,OAAO;AACL,YAAID,EAAM,OAAM,IAAI,MAAM,gBAAgB;AAC1CA,QAAAA,IAAOE;AAAAA,MACT;AAGF,QAAI,CAACF,EAAM,OAAM,IAAI,MAAM,SAAS;AAIpC,QAAIP,KAAQ,MAAM;AAChB,aAAOO,EAAK,SAASd,KAAWc,EAAK,SAAS,WAAW;AACvDA,QAAAA,IAAOA,EAAK,SAAS,CAAC,GAAG,EAAEF;AAE7B,eAASC,IAAIJ,EAAM,SAAS,GAAGI,KAAK,MAClCG,IAAOP,EAAMI,CAAC,GACVG,EAAK,SAAShB,IAFmB,EAAEa;AAGvCG,QAAAA,EAAK,OAAO;AAAA,IAEhB;AAKA,QAHAF,EAAK,SAAShB,GACdgB,EAAK,WAAW,SAASE,GAAM;AAAEA,MAAAA,EAAK,QAAQA,EAAK,OAAO,QAAQ,GAAG,EAAEJ;AAAAA,IAAG,CAAC,EAAE,WAAWe,CAAa,GACrGb,EAAK,SAAS,MACVF,IAAI,EAAG,OAAM,IAAI,MAAM,OAAO;AAElC,WAAOE;AAAAA,EACT;AAEA,SAAAV,EAAS,KAAK,SAASwB,GAAG;AACxB,WAAO,UAAU,UAAUvB,IAAKwB,EAASD,CAAC,GAAGxB,KAAYC;AAAAA,EAC3D,GAEAD,EAAS,WAAW,SAASwB,GAAG;AAC9B,WAAO,UAAU,UAAUtB,IAAWuB,EAASD,CAAC,GAAGxB,KAAYE;AAAAA,EACjE,GAEAF,EAAS,OAAO,SAASwB,GAAG;AAC1B,WAAO,UAAU,UAAUrB,IAAOsB,EAASD,CAAC,GAAGxB,KAAYG;AAAAA,EAC7D,GAEOH;AACT;AAKA,SAASiB,EAAUd,GAAM;AACvBA,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,QAAK,EAAAA,IAAI,GAAU,QAAO;AAAA,EAC5B;AACA,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/array.js

@@ -0,0 +1,14 @@
+import g from "./value.js";
+function c(n, t) {
+  var o = t ? t.length : 0, e = n ? Math.min(o, n.length) : 0, a = new Array(e), f = new Array(o), r;
+  for (r = 0; r < e; ++r) a[r] = g(n[r], t[r]);
+  for (; r < o; ++r) f[r] = t[r];
+  return function(i) {
+    for (r = 0; r < e; ++r) f[r] = a[r](i);
+    return f;
+  };
+}
+export {
+  c as genericArray
+};
+//# sourceMappingURL=array.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-interpolate/src/array.js"],"sourcesContent":["import value from \"./value.js\";\nimport numberArray, {isNumberArray} from \"./numberArray.js\";\n\nexport default function(a, b) {\n  return (isNumberArray(b) ? numberArray : genericArray)(a, b);\n}\n\nexport function genericArray(a, b) {\n  var nb = b ? b.length : 0,\n      na = a ? Math.min(nb, a.length) : 0,\n      x = new Array(na),\n      c = new Array(nb),\n      i;\n\n  for (i = 0; i < na; ++i) x[i] = value(a[i], b[i]);\n  for (; i < nb; ++i) c[i] = b[i];\n\n  return function(t) {\n    for (i = 0; i < na; ++i) c[i] = x[i](t);\n    return c;\n  };\n}\n"],"names":["genericArray","a","b","nb","na","x","c","i","value","t"],"mappings":";AAOO,SAASA,EAAaC,GAAGC,GAAG;AACjC,MAAIC,IAAKD,IAAIA,EAAE,SAAS,GACpBE,IAAKH,IAAI,KAAK,IAAIE,GAAIF,EAAE,MAAM,IAAI,GAClCI,IAAI,IAAI,MAAMD,CAAE,GAChBE,IAAI,IAAI,MAAMH,CAAE,GAChBI;AAEJ,OAAKA,IAAI,GAAGA,IAAIH,GAAI,EAAEG,EAAGF,CAAAA,EAAEE,CAAC,IAAIC,EAAMP,EAAEM,CAAC,GAAGL,EAAEK,CAAC,CAAC;AAChD,SAAOA,IAAIJ,GAAI,EAAEI,EAAGD,CAAAA,EAAEC,CAAC,IAAIL,EAAEK,CAAC;AAE9B,SAAO,SAASE,GAAG;AACjB,SAAKF,IAAI,GAAGA,IAAIH,GAAI,EAAEG,EAAGD,CAAAA,EAAEC,CAAC,IAAIF,EAAEE,CAAC,EAAEE,CAAC;AACtC,WAAOH;AAAAA,EACT;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/color.js

@@ -0,0 +1,25 @@
+import n from "./constant.js";
+function r(t, a) {
+  return function(u) {
+    return t + u * a;
+  };
+}
+function i(t, a, u) {
+  return t = Math.pow(t, u), a = Math.pow(a, u) - t, u = 1 / u, function(o) {
+    return Math.pow(t + o * a, u);
+  };
+}
+function c(t) {
+  return (t = +t) == 1 ? e : function(a, u) {
+    return u - a ? i(a, u, t) : n(isNaN(a) ? u : a);
+  };
+}
+function e(t, a) {
+  var u = a - t;
+  return u ? r(t, u) : n(isNaN(t) ? a : t);
+}
+export {
+  e as default,
+  c as gamma
+};
+//# sourceMappingURL=color.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/color.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"color.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-interpolate/src/color.js"],"sourcesContent":["import constant from \"./constant.js\";\n\nfunction linear(a, d) {\n  return function(t) {\n    return a + t * d;\n  };\n}\n\nfunction exponential(a, b, y) {\n  return a = Math.pow(a, y), b = Math.pow(b, y) - a, y = 1 / y, function(t) {\n    return Math.pow(a + t * b, y);\n  };\n}\n\nexport function hue(a, b) {\n  var d = b - a;\n  return d ? linear(a, d > 180 || d < -180 ? d - 360 * Math.round(d / 360) : d) : constant(isNaN(a) ? b : a);\n}\n\nexport function gamma(y) {\n  return (y = +y) === 1 ? nogamma : function(a, b) {\n    return b - a ? exponential(a, b, y) : constant(isNaN(a) ? b : a);\n  };\n}\n\nexport default function nogamma(a, b) {\n  var d = b - a;\n  return d ? linear(a, d) : constant(isNaN(a) ? b : a);\n}\n"],"names":["linear","a","d","t","exponential","b","y","gamma","nogamma","constant"],"mappings":";AAEA,SAASA,EAAOC,GAAGC,GAAG;AACpB,SAAO,SAASC,GAAG;AACjB,WAAOF,IAAIE,IAAID;AAAAA,EACjB;AACF;AAEA,SAASE,EAAYH,GAAGI,GAAGC,GAAG;AAC5B,SAAOL,IAAI,KAAK,IAAIA,GAAGK,CAAC,GAAGD,IAAI,KAAK,IAAIA,GAAGC,CAAC,IAAIL,GAAGK,IAAI,IAAIA,GAAG,SAASH,GAAG;AACxE,WAAO,KAAK,IAAIF,IAAIE,IAAIE,GAAGC,CAAC;AAAA,EAC9B;AACF;AAOO,SAASC,EAAMD,GAAG;AACvB,UAAQA,IAAI,CAACA,MAAO,IAAIE,IAAU,SAASP,GAAGI,GAAG;AAC/C,WAAOA,IAAIJ,IAAIG,EAAYH,GAAGI,GAAGC,CAAC,IAAIG,EAAS,MAAMR,CAAC,IAAII,IAAIJ,CAAC;AAAA,EACjE;AACF;AAEe,SAASO,EAAQP,GAAGI,GAAG;AACpC,MAAIH,IAAIG,IAAIJ;AACZ,SAAOC,IAAIF,EAAOC,GAAGC,CAAC,IAAIO,EAAS,MAAMR,CAAC,IAAII,IAAIJ,CAAC;AACrD;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/constant.js

@@ -0,0 +1,5 @@
+const t = (a) => () => a;
+export {
+  t as default
+};
+//# sourceMappingURL=constant.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/constant.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constant.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-interpolate/src/constant.js"],"sourcesContent":["export default x => () => x;\n"],"names":["constant","x"],"mappings":"AAAA,MAAAA,IAAe,CAAAC,MAAK,MAAMA;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/date.js

@@ -0,0 +1,10 @@
+function r(n, e) {
+  var t = /* @__PURE__ */ new Date();
+  return n = +n, e = +e, function(u) {
+    return t.setTime(n * (1 - u) + e * u), t;
+  };
+}
+export {
+  r as default
+};
+//# sourceMappingURL=date.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/date.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"date.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-interpolate/src/date.js"],"sourcesContent":["export default function(a, b) {\n  var d = new Date;\n  return a = +a, b = +b, function(t) {\n    return d.setTime(a * (1 - t) + b * t), d;\n  };\n}\n"],"names":["date","a","b","d","t"],"mappings":"AAAe,SAAAA,EAASC,GAAGC,GAAG;AAC5B,MAAIC,IAAI,oBAAI,KAAA;AACZ,SAAOF,IAAI,CAACA,GAAGC,IAAI,CAACA,GAAG,SAASE,GAAG;AACjC,WAAOD,EAAE,QAAQF,KAAK,IAAIG,KAAKF,IAAIE,CAAC,GAAGD;AAAAA,EACzC;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/number.js

@@ -0,0 +1,9 @@
+function r(t, u) {
+  return t = +t, u = +u, function(n) {
+    return t * (1 - n) + u * n;
+  };
+}
+export {
+  r as default
+};
+//# sourceMappingURL=number.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/number.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"number.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-interpolate/src/number.js"],"sourcesContent":["export default function(a, b) {\n  return a = +a, b = +b, function(t) {\n    return a * (1 - t) + b * t;\n  };\n}\n"],"names":["interpolateNumber","a","b","t"],"mappings":"AAAe,SAAAA,EAASC,GAAGC,GAAG;AAC5B,SAAOD,IAAI,CAACA,GAAGC,IAAI,CAACA,GAAG,SAASC,GAAG;AACjC,WAAOF,KAAK,IAAIE,KAAKD,IAAIC;AAAAA,EAC3B;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/numberArray.js

@@ -0,0 +1,16 @@
+function e(n, t) {
+  t || (t = []);
+  var u = n ? Math.min(t.length, n.length) : 0, a = t.slice(), r;
+  return function(i) {
+    for (r = 0; r < u; ++r) a[r] = n[r] * (1 - i) + t[r] * i;
+    return a;
+  };
+}
+function f(n) {
+  return ArrayBuffer.isView(n) && !(n instanceof DataView);
+}
+export {
+  e as default,
+  f as isNumberArray
+};
+//# sourceMappingURL=numberArray.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-interpolate/src/numberArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"numberArray.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-interpolate/src/numberArray.js"],"sourcesContent":["export default function(a, b) {\n  if (!b) b = [];\n  var n = a ? Math.min(b.length, a.length) : 0,\n      c = b.slice(),\n      i;\n  return function(t) {\n    for (i = 0; i < n; ++i) c[i] = a[i] * (1 - t) + b[i] * t;\n    return c;\n  };\n}\n\nexport function isNumberArray(x) {\n  return ArrayBuffer.isView(x) && !(x instanceof DataView);\n}\n"],"names":["numberArray","a","b","n","c","i","t","isNumberArray","x"],"mappings":"AAAe,SAAAA,EAASC,GAAGC,GAAG;AACvBA,EAAAA,MAAGA,IAAI;AACZ,MAAIC,IAAIF,IAAI,KAAK,IAAIC,EAAE,QAAQD,EAAE,MAAM,IAAI,GACvCG,IAAIF,EAAE,SACNG;AACJ,SAAO,SAASC,GAAG;AACjB,SAAKD,IAAI,GAAGA,IAAIF,GAAG,EAAEE,EAAGD,CAAAA,EAAEC,CAAC,IAAIJ,EAAEI,CAAC,KAAK,IAAIC,KAAKJ,EAAEG,CAAC,IAAIC;AACvD,WAAOF;AAAAA,EACT;AACF;AAEO,SAASG,EAAcC,GAAG;AAC/B,SAAO,YAAY,OAAOA,CAAC,KAAK,EAAEA,aAAa;AACjD;","x_google_ignoreList":[0]}