@performant-software/visualize 2.2.21-beta.4 → 2.2.21-beta.8

package/dist/index.es101.js

@@ -1,4 +1,4 @@
-import a from "./index.es205.js";
+import a from "./index.es216.js";
 import f from "./index.es99.js";
 function i(t, e) {
   var r = a(t);

package/dist/index.es104.js

@@ -1,5 +1,5 @@
-import f from "./index.es206.js";
-import i from "./index.es207.js";
+import f from "./index.es217.js";
+import i from "./index.es218.js";
 import m from "./index.es73.js";
 function d(e, r, o) {
   var t = i(e, f(r));

package/dist/index.es105.js

@@ -1,5 +1,5 @@
-import n from "./index.es197.js";
-import o from "./index.es206.js";
+import n from "./index.es208.js";
+import o from "./index.es217.js";
 function s(t, r) {
   r = o(r);
   for (var a = r.length, f = 0; f < a; f++) {

package/dist/index.es106.js

@@ -1,4 +1,4 @@
-import t from "./index.es208.js";
+import t from "./index.es219.js";
 import v from "./index.es92.js";
 function k(r, f, l) {
   f = t(f, l);

package/dist/index.es11.js

@@ -1,6 +1,6 @@
-import r from "./index.es196.js";
+import r from "./index.es207.js";
 import { isIE11 as t } from "./index.es8.js";
-import { ie11fingerprint as o, mapMethods as i } from "./index.es202.js";
+import { ie11fingerprint as o, mapMethods as i } from "./index.es213.js";
 const a = t ? o(i) : r("Map");
 export {
   a as default

package/dist/index.es110.js

@@ -1,5 +1,5 @@
-import o from "./index.es207.js";
-import e from "./index.es206.js";
+import o from "./index.es218.js";
+import e from "./index.es217.js";
 function u(r) {
   return r = e(r), function(t) {
     return o(t, r);

package/dist/index.es113.js

@@ -1,4 +1,4 @@
-import t from "./index.es209.js";
+import t from "./index.es220.js";
 function c(m, a, f) {
   var o = Array(Math.max(0, m));
   a = t(a, f, 1);

package/dist/index.es117.js

@@ -1,5 +1,5 @@
 import v from "./index.es7.js";
-import f from "./index.es206.js";
+import f from "./index.es217.js";
 function d(r, n, e) {
   n = f(n);
   var i = n.length;

package/dist/index.es12.js

@@ -1,6 +1,6 @@
-import e from "./index.es196.js";
+import e from "./index.es207.js";
 import { isIE11 as r } from "./index.es8.js";
-import { ie11fingerprint as t, weakMapMethods as a } from "./index.es202.js";
+import { ie11fingerprint as t, weakMapMethods as a } from "./index.es213.js";
 const m = r ? t(a) : e("WeakMap");
 export {
   m as default

package/dist/index.es120.js

@@ -1,4 +1,4 @@
-import m from "./index.es197.js";
+import m from "./index.es208.js";
 function o(c, t) {
   var a = function(i) {
     var e = a.cache, r = "" + (t ? t.apply(this, arguments) : i);

package/dist/index.es128.js

@@ -1,4 +1,4 @@
-import y from "./index.es208.js";
+import y from "./index.es219.js";
 import k from "./index.es92.js";
 function a(f, n, e) {
   n = y(n, e);

package/dist/index.es129.js

@@ -1,4 +1,4 @@
-import e from "./index.es216.js";
+import e from "./index.es227.js";
 const r = e(1);
 export {
   r as default

package/dist/index.es13.js

@@ -1,6 +1,6 @@
-import t from "./index.es196.js";
+import t from "./index.es207.js";
 import { isIE11 as e } from "./index.es8.js";
-import { ie11fingerprint as r, setMethods as o } from "./index.es202.js";
+import { ie11fingerprint as r, setMethods as o } from "./index.es213.js";
 const f = e ? r(o) : t("Set");
 export {
   f as default

package/dist/index.es130.js

@@ -1,4 +1,4 @@
-import e from "./index.es216.js";
+import e from "./index.es227.js";
 const d = e(-1);
 export {
   d as default

package/dist/index.es131.js

@@ -1,5 +1,5 @@
-import v from "./index.es208.js";
-import g from "./index.es199.js";
+import v from "./index.es219.js";
+import g from "./index.es210.js";
 function a(h, n, o, t) {
   o = v(o, t, 1);
   for (var u = o(n), r = 0, f = g(h); r < f; ) {

package/dist/index.es132.js

@@ -1,6 +1,6 @@
 import e from "./index.es131.js";
 import r from "./index.es129.js";
-import o from "./index.es217.js";
+import o from "./index.es228.js";
 const f = o(1, r, e);
 export {
   f as default

package/dist/index.es133.js

@@ -1,5 +1,5 @@
 import e from "./index.es130.js";
-import t from "./index.es217.js";
+import t from "./index.es228.js";
 const n = t(-1, e);
 export {
   n as default

package/dist/index.es134.js

@@ -1,4 +1,4 @@
-import d from "./index.es218.js";
+import d from "./index.es229.js";
 import o from "./index.es129.js";
 import t from "./index.es128.js";
 function y(r, e, f) {

package/dist/index.es136.js

@@ -1,5 +1,5 @@
-import p from "./index.es209.js";
-import t from "./index.es218.js";
+import p from "./index.es220.js";
+import t from "./index.es229.js";
 import h from "./index.es92.js";
 function u(f, i, l) {
   i = p(i, l);

package/dist/index.es137.js

@@ -1,5 +1,5 @@
-import l from "./index.es208.js";
-import k from "./index.es218.js";
+import l from "./index.es219.js";
+import k from "./index.es229.js";
 import u from "./index.es92.js";
 function h(r, a, t) {
   a = l(a, t);

package/dist/index.es138.js

@@ -1,4 +1,4 @@
-import e from "./index.es219.js";
+import e from "./index.es230.js";
 const t = e(1);
 export {
   t as default

package/dist/index.es139.js

@@ -1,4 +1,4 @@
-import e from "./index.es219.js";
+import e from "./index.es230.js";
 const r = e(-1);
 export {
   r as default

package/dist/index.es140.js

@@ -1,4 +1,4 @@
-import m from "./index.es208.js";
+import m from "./index.es219.js";
 import s from "./index.es136.js";
 function l(t, r, n) {
   var f = [];

package/dist/index.es141.js

@@ -1,6 +1,6 @@
 import o from "./index.es140.js";
 import f from "./index.es124.js";
-import m from "./index.es208.js";
+import m from "./index.es219.js";
 function a(r, t, e) {
   return o(r, f(m(t)), e);
 }

package/dist/index.es142.js

@@ -1,5 +1,5 @@
-import e from "./index.es208.js";
-import l from "./index.es218.js";
+import e from "./index.es219.js";
+import l from "./index.es229.js";
 import u from "./index.es92.js";
 function g(r, t, o) {
   t = e(t, o);

package/dist/index.es143.js

@@ -1,5 +1,5 @@
-import l from "./index.es208.js";
-import u from "./index.es218.js";
+import l from "./index.es219.js";
+import u from "./index.es229.js";
 import e from "./index.es92.js";
 function h(r, t, s) {
   t = l(t, s);

package/dist/index.es144.js

@@ -1,4 +1,4 @@
-import e from "./index.es218.js";
+import e from "./index.es229.js";
 import a from "./index.es94.js";
 import m from "./index.es132.js";
 function u(i, t, r, f) {

package/dist/index.es147.js

@@ -1,6 +1,6 @@
-import c from "./index.es218.js";
+import c from "./index.es229.js";
 import s from "./index.es94.js";
-import e from "./index.es208.js";
+import e from "./index.es219.js";
 import I from "./index.es136.js";
 function g(n, f, o) {
   var r = -1 / 0, u = -1 / 0, i, l;

package/dist/index.es148.js

@@ -1,6 +1,6 @@
-import s from "./index.es218.js";
+import s from "./index.es229.js";
 import a from "./index.es94.js";
-import e from "./index.es208.js";
+import e from "./index.es219.js";
 import I from "./index.es136.js";
 function k(n, f, o) {
   var i = 1 / 0, u = 1 / 0, r, l;

package/dist/index.es15.js

@@ -1,5 +1,5 @@
 import r from "./index.es10.js";
-import i from "./index.es213.js";
+import i from "./index.es224.js";
 function a(e, t) {
   return i(e, t, 1 / 0);
 }

package/dist/index.es150.js

@@ -1,6 +1,6 @@
-import s from "./index.es218.js";
+import s from "./index.es229.js";
 import v from "./index.es94.js";
-import u from "./index.es199.js";
+import u from "./index.es210.js";
 import o from "./index.es114.js";
 import h from "./index.es156.js";
 function M(r, a, e) {

package/dist/index.es151.js

@@ -1,4 +1,4 @@
-import c from "./index.es208.js";
+import c from "./index.es219.js";
 import d from "./index.es145.js";
 import e from "./index.es137.js";
 function x(u, t, f) {

package/dist/index.es152.js

@@ -1,5 +1,5 @@
-import r from "./index.es220.js";
-import i from "./index.es197.js";
+import r from "./index.es231.js";
+import i from "./index.es208.js";
 const n = r(function(o, f, p) {
   i(o, p) ? o[p].push(f) : o[p] = [f];
 });

package/dist/index.es153.js

@@ -1,4 +1,4 @@
-import r from "./index.es220.js";
+import r from "./index.es231.js";
 const f = r(function(o, t, n) {
   o[n] = t;
 });

package/dist/index.es154.js

@@ -1,5 +1,5 @@
-import t from "./index.es220.js";
-import a from "./index.es197.js";
+import t from "./index.es231.js";
+import a from "./index.es208.js";
 const p = t(function(o, i, f) {
   a(o, f) ? o[f]++ : o[f] = 1;
 });

package/dist/index.es155.js

@@ -1,4 +1,4 @@
-import p from "./index.es220.js";
+import p from "./index.es231.js";
 const i = p(function(t, o, r) {
   t[r ? 0 : 1].push(o);
 }, !0);

package/dist/index.es156.js

@@ -1,7 +1,7 @@
 import f from "./index.es84.js";
 import { slice as t } from "./index.es6.js";
 import i from "./index.es76.js";
-import m from "./index.es218.js";
+import m from "./index.es229.js";
 import u from "./index.es137.js";
 import e from "./index.es107.js";
 import o from "./index.es94.js";

package/dist/index.es157.js

@@ -1,4 +1,4 @@
-import e from "./index.es218.js";
+import e from "./index.es229.js";
 import t from "./index.es92.js";
 function f(r) {
   return r == null ? 0 : e(r) ? r.length : t(r).length;

package/dist/index.es16.js

@@ -1,5 +1,5 @@
-import e from "./index.es210.js";
-import a from "./index.es211.js";
+import e from "./index.es221.js";
+import a from "./index.es222.js";
 const o = e(a);
 export {
   o as default

package/dist/index.es163.js

@@ -1,4 +1,4 @@
-import f from "./index.es215.js";
+import f from "./index.es226.js";
 function n(t, e) {
   return f(t, e, !1);
 }

package/dist/index.es164.js

@@ -1,6 +1,6 @@
 import b from "./index.es74.js";
-import q from "./index.es208.js";
-import B from "./index.es199.js";
+import q from "./index.es219.js";
+import B from "./index.es210.js";
 import r from "./index.es144.js";
 function w(l, p, f, g) {
   b(p) || (g = f, f = p, p = !1), f != null && (f = q(f, g));

package/dist/index.es165.js

@@ -1,4 +1,4 @@
-import u from "./index.es199.js";
+import u from "./index.es210.js";
 import f from "./index.es144.js";
 function v(o) {
   for (var t = [], a = arguments.length, n = 0, s = u(o); n < s; n++) {

package/dist/index.es166.js

@@ -1,5 +1,5 @@
 import f from "./index.es147.js";
-import p from "./index.es199.js";
+import p from "./index.es210.js";
 import u from "./index.es145.js";
 function n(t) {
   for (var o = t && f(t, p).length || 0, m = Array(o), r = 0; r < o; r++)

package/dist/index.es167.js

@@ -1,4 +1,4 @@
-import n from "./index.es199.js";
+import n from "./index.es210.js";
 function u(e, t) {
   for (var o = {}, r = 0, f = n(e); r < f; r++)
     t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];

package/dist/index.es17.js

@@ -1,5 +1,5 @@
-import e from "./index.es210.js";
-import a from "./index.es212.js";
+import e from "./index.es221.js";
+import a from "./index.es223.js";
 const o = e(a);
 export {
   o as default

package/dist/index.es170.js

@@ -1,12 +1,40 @@
-function o(e) {
-  "@babel/helpers - typeof";
-  return o = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(t) {
-    return typeof t;
-  } : function(t) {
-    return t && typeof Symbol == "function" && t.constructor === Symbol && t !== Symbol.prototype ? "symbol" : typeof t;
-  }, o(e);
+import e from "./index.es62.js";
+import s from "react";
+var u = {
+  source: {
+    x: 0,
+    y: 0
+  },
+  target: {
+    x: 0,
+    y: 0
+  }
+};
+function a(t) {
+  var i = t.link, r = i === void 0 ? u : i;
+  return /* @__PURE__ */ s.createElement("line", {
+    x1: r.source.x,
+    y1: r.source.y,
+    x2: r.target.x,
+    y2: r.target.y,
+    strokeWidth: 2,
+    stroke: "#999",
+    strokeOpacity: 0.6
+  });
 }
+a.propTypes = {
+  link: e.shape({
+    source: e.shape({
+      x: e.number.isRequired,
+      y: e.number.isRequired
+    }).isRequired,
+    target: e.shape({
+      x: e.number.isRequired,
+      y: e.number.isRequired
+    }).isRequired
+  })
+};
 export {
-  o as default
+  a as default
 };
 //# sourceMappingURL=index.es170.js.map

package/dist/index.es170.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es170.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/typeof.js"],"sourcesContent":["export default function _typeof(o) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n    return typeof o;\n  } : function (o) {\n    return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n  }, _typeof(o);\n}"],"names":["_typeof","o"],"mappings":"AAAA,SAAwBA,EAAQC,GAAG;AACjC;AAEO,SAAAD,IAAwB,OAAO,UAArB,cAA2C,OAAO,OAAO,YAA1B,WAAqC,SAAUC,GAAG;AAChG,WAAO,OAAOA;AAAAA,EAChB,IAAI,SAAUA,GAAG;AACRA,WAAAA,KAAmB,OAAO,UAArB,cAA+BA,EAAE,gBAAgB,UAAUA,MAAM,OAAO,YAAY,WAAW,OAAOA;AAAAA,EAAA,GACjHD,EAAQC,CAAC;AACd;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es170.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultLink.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nvar DEFAULT_LINK = {\n  source: {\n    x: 0,\n    y: 0\n  },\n  target: {\n    x: 0,\n    y: 0\n  }\n};\nexport default function HierarchyDefaultLink(_ref) {\n  var _ref$link = _ref.link,\n    link = _ref$link === void 0 ? DEFAULT_LINK : _ref$link;\n  return /*#__PURE__*/React.createElement(\"line\", {\n    x1: link.source.x,\n    y1: link.source.y,\n    x2: link.target.x,\n    y2: link.target.y,\n    strokeWidth: 2,\n    stroke: \"#999\",\n    strokeOpacity: 0.6\n  });\n}\nHierarchyDefaultLink.propTypes = {\n  link: _pt.shape({\n    source: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired,\n    target: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired\n  })\n};"],"names":["DEFAULT_LINK","HierarchyDefaultLink","_ref","_ref$link","link","React","_pt"],"mappings":";;AAEA,IAAIA,IAAe;AAAA,EACjB,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AAAA,EACA,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AACA,SAAwBC,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAASH,IAAeG;AAC3B,SAAA,gBAAAE,EAAM,cAAc,QAAQ;AAAA,IAC9C,IAAID,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,eAAe;AAAA,EAAA,CAChB;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,IACH,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,EAAA,CACJ;AACH;","x_google_ignoreList":[0]}

package/dist/index.es171.js

@@ -1,8 +1,26 @@
-function c(a, n) {
-  if (!(a instanceof n))
-    throw new TypeError("Cannot call a class as a function");
+import e from "./index.es62.js";
+import n from "react";
+function t(i) {
+  var o = i.node, r = o === void 0 ? {
+    x: 0,
+    y: 0,
+    r: 15
+  } : o;
+  return /* @__PURE__ */ n.createElement("circle", {
+    cx: r.x,
+    cy: r.y,
+    r: r.r || 15,
+    fill: "#21D4FD"
+  });
 }
+t.propTypes = {
+  node: e.shape({
+    x: e.number.isRequired,
+    y: e.number.isRequired,
+    r: e.number
+  })
+};
 export {
-  c as default
+  t as default
 };
 //# sourceMappingURL=index.es171.js.map

package/dist/index.es171.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es171.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/classCallCheck.js"],"sourcesContent":["export default function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}"],"names":["_classCallCheck","instance","Constructor"],"mappings":"AAAwB,SAAAA,EAAgBC,GAAUC,GAAa;AACzD,MAAA,EAAED,aAAoBC;AAClB,UAAA,IAAI,UAAU,mCAAmC;AAE3D;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es171.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultNode.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nexport default function HierarchyDefaultNode(_ref) {\n  var _ref$node = _ref.node,\n    node = _ref$node === void 0 ? {\n      x: 0,\n      y: 0,\n      r: 15\n    } : _ref$node;\n  return /*#__PURE__*/React.createElement(\"circle\", {\n    cx: node.x,\n    cy: node.y,\n    r: node.r || 15,\n    fill: \"#21D4FD\"\n  });\n}\nHierarchyDefaultNode.propTypes = {\n  node: _pt.shape({\n    x: _pt.number.isRequired,\n    y: _pt.number.isRequired,\n    r: _pt.number\n  })\n};"],"names":["HierarchyDefaultNode","_ref","_ref$node","node","React","_pt"],"mappings":";;AAEA,SAAwBA,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAAS;AAAA,IAC5B,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACD,IAAAA;AACc,SAAA,gBAAAE,EAAM,cAAc,UAAU;AAAA,IAChD,IAAID,EAAK;AAAA,IACT,IAAIA,EAAK;AAAA,IACT,GAAGA,EAAK,KAAK;AAAA,IACb,MAAM;AAAA,EAAA,CACP;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI;AAAA,EAAA,CACR;AACH;","x_google_ignoreList":[0]}

package/dist/index.es172.js

@@ -1,16 +1,88 @@
-import t from "./index.es239.js";
-function n(f, l) {
-  for (var a = 0; a < l.length; a++) {
-    var e = l[a];
-    e.enumerable = e.enumerable || !1, e.configurable = !0, "value" in e && (e.writable = !0), Object.defineProperty(f, t(e.key), e);
-  }
+import { Node as k } from "./index.es37.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;
 }
-function u(f, l, a) {
-  return l && n(f.prototype, l), a && n(f, a), Object.defineProperty(f, "prototype", {
-    writable: !1
-  }), f;
+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 {
-  u as default
+  L as default
 };
 //# sourceMappingURL=index.es172.js.map

package/dist/index.es172.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es172.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/createClass.js"],"sourcesContent":["import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, toPropertyKey(descriptor.key), descriptor);\n  }\n}\nexport default function _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  Object.defineProperty(Constructor, \"prototype\", {\n    writable: false\n  });\n  return Constructor;\n}"],"names":["_defineProperties","target","props","i","descriptor","toPropertyKey","_createClass","Constructor","protoProps","staticProps"],"mappings":";AACA,SAASA,EAAkBC,GAAQC,GAAO;AACxC,WAASC,IAAI,GAAGA,IAAID,EAAM,QAAQC,KAAK;AACjC,QAAAC,IAAaF,EAAMC,CAAC;AACb,IAAAC,EAAA,aAAaA,EAAW,cAAc,IACjDA,EAAW,eAAe,IACtB,WAAWA,MAAYA,EAAW,WAAW,KACjD,OAAO,eAAeH,GAAQI,EAAcD,EAAW,GAAG,GAAGA,CAAU;AAAA,EACzE;AACF;AACwB,SAAAE,EAAaC,GAAaC,GAAYC,GAAa;AACrE,SAAAD,KAA8BR,EAAAO,EAAY,WAAWC,CAAU,GAC/DC,KAAaT,EAAkBO,GAAaE,CAAW,GACpD,OAAA,eAAeF,GAAa,aAAa;AAAA,IAC9C,UAAU;AAAA,EAAA,CACX,GACMA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es172.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","d3tree","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;AAMjB,WALHM,IAAQ,GACRC,IAAS,GACTN,IAAWD,EAAE,UACbS,IAAIR,EAAS,QACbS,GACG,EAAED,KAAK;AACZ,IAAAC,IAAIT,EAASQ,CAAC,GACdC,EAAE,KAAKJ,GACPI,EAAE,KAAKJ,GACEA,KAAAI,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;AASf,WARHC,IAAO,IAAIL,EAASI,GAAM,CAAC,GAC3BH,GACAK,IAAQ,CAACD,CAAI,GACbE,GACApB,GACAQ,GACAa,GAEGP,IAAOK,EAAM;AACd,QAAAnB,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;AAKpB,UAAAI,EAAK,SAAS,IAAIL,EAAS,MAAM,CAAC,GAAG,WAAW,CAACK,CAAI,GAC/CA;AACT;AAG0B,SAAAI,IAAA;AACxB,MAAIC,IAAa5B,GACb6B,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASR,EAAKD,GAAM;AACd,QAAAU,IAAIX,EAASC,CAAI;AAOjB,QAJJU,EAAE,UAAUC,CAAS,GAAGD,EAAE,OAAO,IAAI,CAACA,EAAE,GACxCA,EAAE,WAAWE,CAAU,GAGnBH;AAAU,MAAAT,EAAK,WAAWa,CAAQ;AAAA,SAIjC;AACH,UAAIC,IAAOd,GACPe,IAAQf,GACRgB,IAAShB;AACR,MAAAA,EAAA,WAAW,SAASH,GAAM;AACzB,QAAAA,EAAK,IAAIiB,EAAK,MAAUA,IAAAjB,IACxBA,EAAK,IAAIkB,EAAM,MAAWA,IAAAlB,IAC1BA,EAAK,QAAQmB,EAAO,UAAgBA,IAAAnB;AAAA,MAAA,CACzC;AACG,UAAAoB,IAAIH,MAASC,IAAQ,IAAIT,EAAWQ,GAAMC,CAAK,IAAI,GACnDG,IAAKD,IAAIH,EAAK,GACdK,IAAKZ,KAAMQ,EAAM,IAAIE,IAAIC,IACzBE,IAAKZ,KAAMQ,EAAO,SAAS;AAC1B,MAAAhB,EAAA,WAAW,SAASH,GAAM;AACxB,QAAAA,EAAA,KAAKA,EAAK,IAAIqB,KAAMC,GACpBtB,EAAA,IAAIA,EAAK,QAAQuB;AAAA,MAAA,CACvB;AAAA,IACH;AAEO,WAAApB;AAAA,EACT;AAMA,WAASW,EAAU7B,GAAG;AACpB,QAAIC,IAAWD,EAAE,UACbuC,IAAWvC,EAAE,OAAO,UACpBU,IAAIV,EAAE,IAAIuC,EAASvC,EAAE,IAAI,CAAC,IAAI;AAClC,QAAIC,GAAU;AACZ,MAAAO,EAAcR,CAAC;AACX,UAAAwC,KAAYvC,EAAS,CAAC,EAAE,IAAIA,EAASA,EAAS,SAAS,CAAC,EAAE,KAAK;AACnE,MAAIS,KACFV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC,GAC7BV,EAAA,IAAIA,EAAE,IAAIwC,KAEZxC,EAAE,IAAIwC;AAAA;MAEC9B,MACTV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC;AAE/B,IAAAV,EAAA,OAAO,IAAIyC,EAAUzC,GAAGU,GAAGV,EAAE,OAAO,KAAKuC,EAAS,CAAC,CAAC;AAAA,EACxD;AAGA,WAAST,EAAW9B,GAAG;AACrB,IAAAA,EAAE,EAAE,IAAIA,EAAE,IAAIA,EAAE,OAAO,GACrBA,EAAA,KAAKA,EAAE,OAAO;AAAA,EAClB;AAaS,WAAAyC,EAAUzC,GAAGU,GAAGG,GAAU;AACjC,QAAIH,GAAG;AAUE,eATHgC,IAAM1C,GACN2C,IAAM3C,GACNY,IAAMF,GACNkC,IAAMF,EAAI,OAAO,SAAS,CAAC,GAC3BG,IAAMH,EAAI,GACVI,IAAMH,EAAI,GACVI,IAAMnC,EAAI,GACVoC,IAAMJ,EAAI,GACVtC,GACGM,IAAMV,EAAUU,CAAG,GAAG8B,IAAM3C,EAAS2C,CAAG,GAAG9B,KAAO8B;AACvD,QAAAE,IAAM7C,EAAS6C,CAAG,GAClBD,IAAMzC,EAAUyC,CAAG,GACnBA,EAAI,IAAI3C,GACAM,IAAAM,EAAI,IAAImC,IAAML,EAAI,IAAIG,IAAMrB,EAAWZ,EAAI,GAAG8B,EAAI,CAAC,GACvDpC,IAAQ,MACVH,EAAYQ,EAAaC,GAAKZ,GAAGa,CAAQ,GAAGb,GAAGM,CAAK,GAC7CuC,KAAAvC,GACAwC,KAAAxC,IAETyC,KAAOnC,EAAI,GACXiC,KAAOH,EAAI,GACXM,KAAOJ,EAAI,GACXE,KAAOH,EAAI;AAEb,MAAI/B,KAAO,CAACV,EAAUyC,CAAG,MACvBA,EAAI,IAAI/B,GACR+B,EAAI,KAAKI,IAAMD,IAEbJ,KAAO,CAAC3C,EAAS6C,CAAG,MACtBA,EAAI,IAAIF,GACRE,EAAI,KAAKC,IAAMG,GACJnC,IAAAb;AAAA,IAEf;AACO,WAAAa;AAAA,EACT;AAEA,WAASkB,EAAShB,GAAM;AACtB,IAAAA,EAAK,KAAKU,GACLV,EAAA,IAAIA,EAAK,QAAQW;AAAA,EACxB;AAEK,SAAAP,EAAA,aAAa,SAAS8B,GAAG;AAC5B,WAAO,UAAU,UAAUzB,IAAayB,GAAG9B,KAAQK;AAAA,EAAA,GAGhDL,EAAA,OAAO,SAAS8B,GAAG;AACtB,WAAO,UAAU,UAAUtB,IAAW,IAAOF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EAAA,GAGpGP,EAAA,WAAW,SAAS8B,GAAG;AAC1B,WAAO,UAAU,UAAUtB,IAAW,IAAMF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EAAA,GAG9FP;AACT;","x_google_ignoreList":[0]}