@performant-software/visualize 2.3.12-beta.4 → 2.3.12-beta.5

package/dist/index.cjs100.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs207.js"),s=require("./index.cjs98.js");function u(t,e){var r=n(t);return e&&s(r,e),r}module.exports=u;
+"use strict";const n=require("./index.cjs206.js"),s=require("./index.cjs98.js");function u(t,e){var r=n(t);return e&&s(r,e),r}module.exports=u;
 //# sourceMappingURL=index.cjs100.js.map

package/dist/index.cjs103.js

@@ -1,2 +1,2 @@
-"use strict";const i=require("./index.cjs208.js"),s=require("./index.cjs209.js"),u=require("./index.cjs72.js");function o(t,r,n){var e=s(t,i(r));return u(e)?n:e}module.exports=o;
+"use strict";const i=require("./index.cjs207.js"),s=require("./index.cjs208.js"),u=require("./index.cjs72.js");function o(t,r,n){var e=s(t,i(r));return u(e)?n:e}module.exports=o;
 //# sourceMappingURL=index.cjs103.js.map

package/dist/index.cjs104.js

@@ -1,2 +1,2 @@
-"use strict";const u=require("./index.cjs199.js"),a=require("./index.cjs208.js");function c(e,r){r=a(r);for(var n=r.length,t=0;t<n;t++){var s=r[t];if(!u(e,s))return!1;e=e[s]}return!!n}module.exports=c;
+"use strict";const u=require("./index.cjs198.js"),a=require("./index.cjs207.js");function c(e,r){r=a(r);for(var n=r.length,t=0;t<n;t++){var s=r[t];if(!u(e,s))return!1;e=e[s]}return!!n}module.exports=c;
 //# sourceMappingURL=index.cjs104.js.map

package/dist/index.cjs105.js

@@ -1,2 +1,2 @@
-"use strict";const v=require("./index.cjs210.js"),a=require("./index.cjs91.js");function f(s,r,n){r=v(r,n);for(var u=a(s),o=u.length,l={},t=0;t<o;t++){var c=u[t];l[c]=r(s[c],c,s)}return l}module.exports=f;
+"use strict";const v=require("./index.cjs209.js"),a=require("./index.cjs91.js");function f(s,r,n){r=v(r,n);for(var u=a(s),o=u.length,l={},t=0;t<o;t++){var c=u[t];l[c]=r(s[c],c,s)}return l}module.exports=f;
 //# sourceMappingURL=index.cjs105.js.map

package/dist/index.cjs109.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs209.js"),n=require("./index.cjs208.js");function o(e){return e=n(e),function(r){return t(r,e)}}module.exports=o;
+"use strict";const t=require("./index.cjs208.js"),n=require("./index.cjs207.js");function o(e){return e=n(e),function(r){return t(r,e)}}module.exports=o;
 //# sourceMappingURL=index.cjs109.js.map

package/dist/index.cjs11.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs198.js"),t=require("./index.cjs8.js"),e=require("./index.cjs204.js"),i=t.isIE11?e.ie11fingerprint(e.mapMethods):r("Map");module.exports=i;
+"use strict";const r=require("./index.cjs197.js"),t=require("./index.cjs8.js"),e=require("./index.cjs203.js"),i=t.isIE11?e.ie11fingerprint(e.mapMethods):r("Map");module.exports=i;
 //# sourceMappingURL=index.cjs11.js.map

package/dist/index.cjs112.js

@@ -1,2 +1,2 @@
-"use strict";const u=require("./index.cjs211.js");function a(o,c,t){var s=Array(Math.max(0,o));c=u(c,t,1);for(var r=0;r<o;r++)s[r]=c(r);return s}module.exports=a;
+"use strict";const u=require("./index.cjs210.js");function a(o,c,t){var s=Array(Math.max(0,o));c=u(c,t,1);for(var r=0;r<o;r++)s[r]=c(r);return s}module.exports=a;
 //# sourceMappingURL=index.cjs112.js.map

package/dist/index.cjs116.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs7.js"),v=require("./index.cjs208.js");function c(e,r,t){r=v(r);var i=r.length;if(!i)return s(t)?t.call(e):t;for(var u=0;u<i;u++){var n=e==null?void 0:e[r[u]];n===void 0&&(n=t,u=i),e=s(n)?n.call(e):n}return e}module.exports=c;
+"use strict";const s=require("./index.cjs7.js"),v=require("./index.cjs207.js");function c(e,r,t){r=v(r);var i=r.length;if(!i)return s(t)?t.call(e):t;for(var u=0;u<i;u++){var n=e==null?void 0:e[r[u]];n===void 0&&(n=t,u=i),e=s(n)?n.call(e):n}return e}module.exports=c;
 //# sourceMappingURL=index.cjs116.js.map

package/dist/index.cjs119.js

@@ -1,2 +1,2 @@
-"use strict";const i=require("./index.cjs199.js");function n(c,a){var e=function(s){var r=e.cache,t=""+(a?a.apply(this,arguments):s);return i(r,t)||(r[t]=c.apply(this,arguments)),r[t]};return e.cache={},e}module.exports=n;
+"use strict";const i=require("./index.cjs198.js");function n(c,a){var e=function(s){var r=e.cache,t=""+(a?a.apply(this,arguments):s);return i(r,t)||(r[t]=c.apply(this,arguments)),r[t]};return e.cache={},e}module.exports=n;
 //# sourceMappingURL=index.cjs119.js.map

package/dist/index.cjs12.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs198.js"),t=require("./index.cjs8.js"),e=require("./index.cjs204.js"),i=t.isIE11?e.ie11fingerprint(e.weakMapMethods):r("WeakMap");module.exports=i;
+"use strict";const r=require("./index.cjs197.js"),t=require("./index.cjs8.js"),e=require("./index.cjs203.js"),i=t.isIE11?e.ie11fingerprint(e.weakMapMethods):r("WeakMap");module.exports=i;
 //# sourceMappingURL=index.cjs12.js.map

package/dist/index.cjs127.js

@@ -1,2 +1,2 @@
-"use strict";const y=require("./index.cjs210.js"),c=require("./index.cjs91.js");function k(e,n,u){n=y(n,u);for(var t=c(e),r,s=0,f=t.length;s<f;s++)if(r=t[s],n(e[r],r,e))return r}module.exports=k;
+"use strict";const y=require("./index.cjs209.js"),c=require("./index.cjs91.js");function k(e,n,u){n=y(n,u);for(var t=c(e),r,s=0,f=t.length;s<f;s++)if(r=t[s],n(e[r],r,e))return r}module.exports=k;
 //# sourceMappingURL=index.cjs127.js.map

package/dist/index.cjs128.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs218.js"),r=e(1);module.exports=r;
+"use strict";const e=require("./index.cjs217.js"),r=e(1);module.exports=r;
 //# sourceMappingURL=index.cjs128.js.map

package/dist/index.cjs129.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs218.js"),t=e(-1);module.exports=t;
+"use strict";const e=require("./index.cjs217.js"),t=e(-1);module.exports=t;
 //# sourceMappingURL=index.cjs129.js.map

package/dist/index.cjs13.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs198.js"),r=require("./index.cjs8.js"),e=require("./index.cjs204.js"),s=r.isIE11?e.ie11fingerprint(e.setMethods):t("Set");module.exports=s;
+"use strict";const t=require("./index.cjs197.js"),r=require("./index.cjs8.js"),e=require("./index.cjs203.js"),s=r.isIE11?e.ie11fingerprint(e.setMethods):t("Set");module.exports=s;
 //# sourceMappingURL=index.cjs13.js.map

package/dist/index.cjs130.js

@@ -1,2 +1,2 @@
-"use strict";const l=require("./index.cjs210.js"),t=require("./index.cjs201.js");function v(e,u,o,c){o=l(o,c,1);for(var h=o(u),r=0,n=t(e);r<n;){var s=Math.floor((r+n)/2);o(e[s])<h?r=s+1:n=s}return r}module.exports=v;
+"use strict";const l=require("./index.cjs209.js"),t=require("./index.cjs200.js");function v(e,u,o,c){o=l(o,c,1);for(var h=o(u),r=0,n=t(e);r<n;){var s=Math.floor((r+n)/2);o(e[s])<h?r=s+1:n=s}return r}module.exports=v;
 //# sourceMappingURL=index.cjs130.js.map

package/dist/index.cjs131.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs130.js"),r=require("./index.cjs128.js"),n=require("./index.cjs219.js"),t=n(1,r,e);module.exports=t;
+"use strict";const e=require("./index.cjs130.js"),r=require("./index.cjs128.js"),n=require("./index.cjs218.js"),t=n(1,r,e);module.exports=t;
 //# sourceMappingURL=index.cjs131.js.map

package/dist/index.cjs132.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs129.js"),t=require("./index.cjs219.js"),n=t(-1,e);module.exports=n;
+"use strict";const e=require("./index.cjs129.js"),t=require("./index.cjs218.js"),n=t(-1,e);module.exports=n;
 //# sourceMappingURL=index.cjs132.js.map

package/dist/index.cjs133.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs220.js"),d=require("./index.cjs128.js"),u=require("./index.cjs127.js");function c(e,i,n){var t=s(e)?d:u,r=t(e,i,n);if(r!==void 0&&r!==-1)return e[r]}module.exports=c;
+"use strict";const s=require("./index.cjs219.js"),d=require("./index.cjs128.js"),u=require("./index.cjs127.js");function c(e,i,n){var t=s(e)?d:u,r=t(e,i,n);if(r!==void 0&&r!==-1)return e[r]}module.exports=c;
 //# sourceMappingURL=index.cjs133.js.map

package/dist/index.cjs135.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs211.js"),u=require("./index.cjs220.js"),f=require("./index.cjs91.js");function h(n,i,c){i=t(i,c);var r,e;if(u(n))for(r=0,e=n.length;r<e;r++)i(n[r],r,n);else{var s=f(n);for(r=0,e=s.length;r<e;r++)i(n[s[r]],s[r],n)}return n}module.exports=h;
+"use strict";const t=require("./index.cjs210.js"),u=require("./index.cjs219.js"),f=require("./index.cjs91.js");function h(n,i,c){i=t(i,c);var r,e;if(u(n))for(r=0,e=n.length;r<e;r++)i(n[r],r,n);else{var s=f(n);for(r=0,e=s.length;r<e;r++)i(n[s[r]],s[r],n)}return n}module.exports=h;
 //# sourceMappingURL=index.cjs135.js.map

package/dist/index.cjs136.js

@@ -1,2 +1,2 @@
-"use strict";const l=require("./index.cjs210.js"),n=require("./index.cjs220.js"),q=require("./index.cjs91.js");function v(r,t,k){t=l(t,k);for(var u=!n(r)&&q(r),c=(u||r).length,a=Array(c),s=0;s<c;s++){var e=u?u[s]:s;a[s]=t(r[e],e,r)}return a}module.exports=v;
+"use strict";const l=require("./index.cjs209.js"),n=require("./index.cjs219.js"),q=require("./index.cjs91.js");function v(r,t,k){t=l(t,k);for(var u=!n(r)&&q(r),c=(u||r).length,a=Array(c),s=0;s<c;s++){var e=u?u[s]:s;a[s]=t(r[e],e,r)}return a}module.exports=v;
 //# sourceMappingURL=index.cjs136.js.map

package/dist/index.cjs137.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs221.js"),c=e(1);module.exports=c;
+"use strict";const e=require("./index.cjs220.js"),c=e(1);module.exports=c;
 //# sourceMappingURL=index.cjs137.js.map

package/dist/index.cjs138.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs221.js"),t=e(-1);module.exports=t;
+"use strict";const e=require("./index.cjs220.js"),t=e(-1);module.exports=t;
 //# sourceMappingURL=index.cjs138.js.map

package/dist/index.cjs139.js

@@ -1,2 +1,2 @@
-"use strict";const i=require("./index.cjs210.js"),o=require("./index.cjs135.js");function f(n,r,u){var s=[];return r=i(r,u),o(n,function(t,c,e){r(t,c,e)&&s.push(t)}),s}module.exports=f;
+"use strict";const i=require("./index.cjs209.js"),o=require("./index.cjs135.js");function f(n,r,u){var s=[];return r=i(r,u),o(n,function(t,c,e){r(t,c,e)&&s.push(t)}),s}module.exports=f;
 //# sourceMappingURL=index.cjs139.js.map

package/dist/index.cjs140.js

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs139.js"),n=require("./index.cjs123.js"),i=require("./index.cjs210.js");function s(e,r,t){return c(e,n(i(r)),t)}module.exports=s;
+"use strict";const c=require("./index.cjs139.js"),n=require("./index.cjs123.js"),i=require("./index.cjs209.js");function s(e,r,t){return c(e,n(i(r)),t)}module.exports=s;
 //# sourceMappingURL=index.cjs140.js.map

package/dist/index.cjs141.js

@@ -1,2 +1,2 @@
-"use strict";const v=require("./index.cjs210.js"),a=require("./index.cjs220.js"),c=require("./index.cjs91.js");function i(r,s,n){s=v(s,n);for(var t=!a(r)&&c(r),f=(t||r).length,e=0;e<f;e++){var u=t?t[e]:e;if(!s(r[u],u,r))return!1}return!0}module.exports=i;
+"use strict";const v=require("./index.cjs209.js"),a=require("./index.cjs219.js"),c=require("./index.cjs91.js");function i(r,s,n){s=v(s,n);for(var t=!a(r)&&c(r),f=(t||r).length,e=0;e<f;e++){var u=t?t[e]:e;if(!s(r[u],u,r))return!1}return!0}module.exports=i;
 //# sourceMappingURL=index.cjs141.js.map

package/dist/index.cjs142.js

@@ -1,2 +1,2 @@
-"use strict";const a=require("./index.cjs210.js"),c=require("./index.cjs220.js"),i=require("./index.cjs91.js");function k(r,e,n){e=a(e,n);for(var t=!c(r)&&i(r),f=(t||r).length,s=0;s<f;s++){var u=t?t[s]:s;if(e(r[u],u,r))return!0}return!1}module.exports=k;
+"use strict";const a=require("./index.cjs209.js"),c=require("./index.cjs219.js"),i=require("./index.cjs91.js");function k(r,e,n){e=a(e,n);for(var t=!c(r)&&i(r),f=(t||r).length,s=0;s<f;s++){var u=t?t[s]:s;if(e(r[u],u,r))return!0}return!1}module.exports=k;
 //# sourceMappingURL=index.cjs142.js.map

package/dist/index.cjs143.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs220.js"),n=require("./index.cjs93.js"),u=require("./index.cjs131.js");function c(e,r,i,t){return s(e)||(e=n(e)),(typeof i!="number"||t)&&(i=0),u(e,r,i)>=0}module.exports=c;
+"use strict";const s=require("./index.cjs219.js"),n=require("./index.cjs93.js"),u=require("./index.cjs131.js");function c(e,r,i,t){return s(e)||(e=n(e)),(typeof i!="number"||t)&&(i=0),u(e,r,i)>=0}module.exports=c;
 //# sourceMappingURL=index.cjs143.js.map

package/dist/index.cjs146.js

@@ -1,2 +1,2 @@
-"use strict";const p=require("./index.cjs220.js"),a=require("./index.cjs93.js"),m=require("./index.cjs210.js"),q=require("./index.cjs135.js");function I(n,u,s){var r=-1/0,f=-1/0,i,t;if(u==null||typeof u=="number"&&typeof n[0]!="object"&&n!=null){n=p(n)?n:a(n);for(var e=0,c=n.length;e<c;e++)i=n[e],i!=null&&i>r&&(r=i)}else u=m(u,s),q(n,function(l,y,o){t=u(l,y,o),(t>f||t===-1/0&&r===-1/0)&&(r=l,f=t)});return r}module.exports=I;
+"use strict";const p=require("./index.cjs219.js"),a=require("./index.cjs93.js"),m=require("./index.cjs209.js"),q=require("./index.cjs135.js");function I(n,u,s){var r=-1/0,f=-1/0,i,t;if(u==null||typeof u=="number"&&typeof n[0]!="object"&&n!=null){n=p(n)?n:a(n);for(var e=0,c=n.length;e<c;e++)i=n[e],i!=null&&i>r&&(r=i)}else u=m(u,s),q(n,function(l,y,o){t=u(l,y,o),(t>f||t===-1/0&&r===-1/0)&&(r=l,f=t)});return r}module.exports=I;
 //# sourceMappingURL=index.cjs146.js.map

package/dist/index.cjs147.js

@@ -1,2 +1,2 @@
-"use strict";const p=require("./index.cjs220.js"),m=require("./index.cjs93.js"),q=require("./index.cjs210.js"),I=require("./index.cjs135.js");function a(n,u,s){var i=1/0,f=1/0,r,t;if(u==null||typeof u=="number"&&typeof n[0]!="object"&&n!=null){n=p(n)?n:m(n);for(var e=0,c=n.length;e<c;e++)r=n[e],r!=null&&r<i&&(i=r)}else u=q(u,s),I(n,function(l,y,o){t=u(l,y,o),(t<f||t===1/0&&i===1/0)&&(i=l,f=t)});return i}module.exports=a;
+"use strict";const p=require("./index.cjs219.js"),m=require("./index.cjs93.js"),q=require("./index.cjs209.js"),I=require("./index.cjs135.js");function a(n,u,s){var i=1/0,f=1/0,r,t;if(u==null||typeof u=="number"&&typeof n[0]!="object"&&n!=null){n=p(n)?n:m(n);for(var e=0,c=n.length;e<c;e++)r=n[e],r!=null&&r<i&&(i=r)}else u=q(u,s),I(n,function(l,y,o){t=u(l,y,o),(t<f||t===1/0&&i===1/0)&&(i=l,f=t)});return i}module.exports=a;
 //# sourceMappingURL=index.cjs147.js.map

package/dist/index.cjs149.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs220.js"),h=require("./index.cjs93.js"),m=require("./index.cjs201.js"),i=require("./index.cjs113.js"),o=require("./index.cjs155.js");function q(r,t,l){if(t==null||l)return n(r)||(r=h(r)),r[i(r.length-1)];var e=o(r),s=m(e);t=Math.max(Math.min(t,s),0);for(var c=s-1,a=0;a<t;a++){var u=i(a,c),v=e[a];e[a]=e[u],e[u]=v}return e.slice(0,t)}module.exports=q;
+"use strict";const n=require("./index.cjs219.js"),h=require("./index.cjs93.js"),m=require("./index.cjs200.js"),i=require("./index.cjs113.js"),o=require("./index.cjs155.js");function q(r,t,l){if(t==null||l)return n(r)||(r=h(r)),r[i(r.length-1)];var e=o(r),s=m(e);t=Math.max(Math.min(t,s),0);for(var c=s-1,a=0;a<t;a++){var u=i(a,c),v=e[a];e[a]=e[u],e[u]=v}return e.slice(0,t)}module.exports=q;
 //# sourceMappingURL=index.cjs149.js.map

package/dist/index.cjs15.js

@@ -1,2 +1,2 @@
-"use strict";const i=require("./index.cjs10.js"),n=require("./index.cjs215.js");function e(t,r){return n(t,r,1/0)}i.iteratee=e;module.exports=e;
+"use strict";const i=require("./index.cjs10.js"),n=require("./index.cjs214.js");function e(t,r){return n(t,r,1/0)}i.iteratee=e;module.exports=e;
 //# sourceMappingURL=index.cjs15.js.map

package/dist/index.cjs150.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs210.js"),a=require("./index.cjs144.js"),d=require("./index.cjs136.js");function f(u,t,c){var o=0;return t=s(t,c),a(d(u,function(i,n,r){return{value:i,index:o++,criteria:t(i,n,r)}}).sort(function(i,n){var r=i.criteria,e=n.criteria;if(r!==e){if(r>e||r===void 0)return 1;if(r<e||e===void 0)return-1}return i.index-n.index}),"value")}module.exports=f;
+"use strict";const s=require("./index.cjs209.js"),a=require("./index.cjs144.js"),d=require("./index.cjs136.js");function f(u,t,c){var o=0;return t=s(t,c),a(d(u,function(i,n,r){return{value:i,index:o++,criteria:t(i,n,r)}}).sort(function(i,n){var r=i.criteria,e=n.criteria;if(r!==e){if(r>e||r===void 0)return 1;if(r<e||e===void 0)return-1}return i.index-n.index}),"value")}module.exports=f;
 //# sourceMappingURL=index.cjs150.js.map

package/dist/index.cjs151.js

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs222.js"),i=require("./index.cjs199.js"),n=c(function(o,r,s){i(o,s)?o[s].push(r):o[s]=[r]});module.exports=n;
+"use strict";const c=require("./index.cjs221.js"),i=require("./index.cjs198.js"),n=c(function(o,r,s){i(o,s)?o[s].push(r):o[s]=[r]});module.exports=n;
 //# sourceMappingURL=index.cjs151.js.map

package/dist/index.cjs152.js

@@ -1,2 +1,2 @@
-"use strict";const o=require("./index.cjs222.js"),r=o(function(t,e,n){t[n]=e});module.exports=r;
+"use strict";const o=require("./index.cjs221.js"),r=o(function(t,e,n){t[n]=e});module.exports=r;
 //# sourceMappingURL=index.cjs152.js.map

package/dist/index.cjs153.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs222.js"),s=require("./index.cjs199.js"),t=n(function(o,e,c){s(o,c)?o[c]++:o[c]=1});module.exports=t;
+"use strict";const n=require("./index.cjs221.js"),s=require("./index.cjs198.js"),t=n(function(o,e,c){s(o,c)?o[c]++:o[c]=1});module.exports=t;
 //# sourceMappingURL=index.cjs153.js.map

package/dist/index.cjs154.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs222.js"),u=s(function(t,r,o){t[o?0:1].push(r)},!0);module.exports=u;
+"use strict";const s=require("./index.cjs221.js"),u=s(function(t,r,o){t[o?0:1].push(r)},!0);module.exports=u;
 //# sourceMappingURL=index.cjs154.js.map

package/dist/index.cjs155.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs83.js"),u=require("./index.cjs6.js"),t=require("./index.cjs75.js"),i=require("./index.cjs220.js"),f=require("./index.cjs136.js"),n=require("./index.cjs106.js"),s=require("./index.cjs93.js");var c=/[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;function d(r){return r?e(r)?u.slice.call(r):t(r)?r.match(c):i(r)?f(r,n):s(r):[]}module.exports=d;
+"use strict";const e=require("./index.cjs83.js"),u=require("./index.cjs6.js"),t=require("./index.cjs75.js"),i=require("./index.cjs219.js"),f=require("./index.cjs136.js"),n=require("./index.cjs106.js"),s=require("./index.cjs93.js");var c=/[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;function d(r){return r?e(r)?u.slice.call(r):t(r)?r.match(c):i(r)?f(r,n):s(r):[]}module.exports=d;
 //# sourceMappingURL=index.cjs155.js.map

package/dist/index.cjs156.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs220.js"),t=require("./index.cjs91.js");function n(e){return e==null?0:r(e)?e.length:t(e).length}module.exports=n;
+"use strict";const r=require("./index.cjs219.js"),t=require("./index.cjs91.js");function n(e){return e==null?0:r(e)?e.length:t(e).length}module.exports=n;
 //# sourceMappingURL=index.cjs156.js.map

package/dist/index.cjs16.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs212.js"),s=require("./index.cjs213.js"),c=e(s);module.exports=c;
+"use strict";const e=require("./index.cjs211.js"),s=require("./index.cjs212.js"),c=e(s);module.exports=c;
 //# sourceMappingURL=index.cjs16.js.map

package/dist/index.cjs162.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs217.js");function r(t,e){return n(t,e,!1)}module.exports=r;
+"use strict";const n=require("./index.cjs216.js");function r(t,e){return n(t,e,!1)}module.exports=r;
 //# sourceMappingURL=index.cjs162.js.map

package/dist/index.cjs163.js

@@ -1,2 +1,2 @@
-"use strict";const p=require("./index.cjs73.js"),_=require("./index.cjs210.js"),b=require("./index.cjs201.js"),g=require("./index.cjs143.js");function i(o,h,s,r){p(h)||(r=s,s=h,h=!1),s!=null&&(s=_(s,r));for(var f=[],q=[],u=0,l=b(o);u<l;u++){var n=o[u],c=s?s(n,u,o):n;h&&!s?((!u||q!==c)&&f.push(n),q=c):s?g(q,c)||(q.push(c),f.push(n)):g(f,n)||f.push(n)}return f}module.exports=i;
+"use strict";const p=require("./index.cjs73.js"),_=require("./index.cjs209.js"),b=require("./index.cjs200.js"),g=require("./index.cjs143.js");function i(o,h,s,r){p(h)||(r=s,s=h,h=!1),s!=null&&(s=_(s,r));for(var f=[],q=[],u=0,l=b(o);u<l;u++){var n=o[u],c=s?s(n,u,o):n;h&&!s?((!u||q!==c)&&f.push(n),q=c):s?g(q,c)||(q.push(c),f.push(n)):g(f,n)||f.push(n)}return f}module.exports=i;
 //# sourceMappingURL=index.cjs163.js.map

package/dist/index.cjs164.js

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs201.js"),o=require("./index.cjs143.js");function g(s){for(var e=[],u=arguments.length,n=0,a=c(s);n<a;n++){var t=s[n];if(!o(e,t)){var r;for(r=1;r<u&&o(arguments[r],t);r++);r===u&&e.push(t)}}return e}module.exports=g;
+"use strict";const c=require("./index.cjs200.js"),o=require("./index.cjs143.js");function g(s){for(var e=[],u=arguments.length,n=0,a=c(s);n<a;n++){var t=s[n];if(!o(e,t)){var r;for(r=1;r<u&&o(arguments[r],t);r++);r===u&&e.push(t)}}return e}module.exports=g;
 //# sourceMappingURL=index.cjs164.js.map

package/dist/index.cjs165.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs146.js"),s=require("./index.cjs201.js"),c=require("./index.cjs144.js");function o(t){for(var e=t&&n(t,s).length||0,u=Array(e),r=0;r<e;r++)u[r]=c(t,r);return u}module.exports=o;
+"use strict";const n=require("./index.cjs146.js"),s=require("./index.cjs200.js"),c=require("./index.cjs144.js");function o(t){for(var e=t&&n(t,s).length||0,u=Array(e),r=0;r<e;r++)u[r]=c(t,r);return u}module.exports=o;
 //# sourceMappingURL=index.cjs165.js.map

package/dist/index.cjs166.js

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs201.js");function u(r,n){for(var t={},e=0,o=c(r);e<o;e++)n?t[r[e]]=n[e]:t[r[e][0]]=r[e][1];return t}module.exports=u;
+"use strict";const c=require("./index.cjs200.js");function u(r,n){for(var t={},e=0,o=c(r);e<o;e++)n?t[r[e]]=n[e]:t[r[e][0]]=r[e][1];return t}module.exports=u;
 //# sourceMappingURL=index.cjs166.js.map

package/dist/index.cjs169.js

@@ -1,6 +1,2 @@
-"use strict";const f=require("./index.cjs190.js"),i=require("./index.cjs195.js");/*!
-	Copyright (c) 2018 Jed Watson.
-	Licensed under the MIT License (MIT), see
-	http://jedwatson.github.io/classnames
-*/(function(s){(function(){var u={}.hasOwnProperty;function n(){for(var t="",r=0;r<arguments.length;r++){var e=arguments[r];e&&(t=o(t,c(e)))}return t}function c(t){if(typeof t=="string"||typeof t=="number")return t;if(typeof t!="object")return"";if(Array.isArray(t))return n.apply(null,t);if(t.toString!==Object.prototype.toString&&!t.toString.toString().includes("[native code]"))return t.toString();var r="";for(var e in t)u.call(t,e)&&t[e]&&(r=o(r,e));return r}function o(t,r){return r?t?t+" "+r:t+r:t}s.exports?(n.default=n,s.exports=n):window.classNames=n})()})(i.__module);var p=i.__module.exports;const l=f.getDefaultExportFromCjs(p);module.exports=l;
+"use strict";const e=require("./index.cjs62.js"),u=require("react");var n={source:{x:0,y:0},target:{x:0,y:0}};function t(s){var i=s.link,r=i===void 0?n:i;return u.createElement("line",{x1:r.source.x,y1:r.source.y,x2:r.target.x,y2:r.target.y,strokeWidth:2,stroke:"#999",strokeOpacity:.6})}t.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})};module.exports=t;
 //# sourceMappingURL=index.cjs169.js.map

package/dist/index.cjs169.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs169.js","sources":["../../../node_modules/classnames/index.js"],"sourcesContent":["/*!\n\tCopyright (c) 2018 Jed Watson.\n\tLicensed under the MIT License (MIT), see\n\thttp://jedwatson.github.io/classnames\n*/\n/* global define */\n\n(function () {\n\t'use strict';\n\n\tvar hasOwn = {}.hasOwnProperty;\n\n\tfunction classNames () {\n\t\tvar classes = '';\n\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tvar arg = arguments[i];\n\t\t\tif (arg) {\n\t\t\t\tclasses = appendClass(classes, parseValue(arg));\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction parseValue (arg) {\n\t\tif (typeof arg === 'string' || typeof arg === 'number') {\n\t\t\treturn arg;\n\t\t}\n\n\t\tif (typeof arg !== 'object') {\n\t\t\treturn '';\n\t\t}\n\n\t\tif (Array.isArray(arg)) {\n\t\t\treturn classNames.apply(null, arg);\n\t\t}\n\n\t\tif (arg.toString !== Object.prototype.toString && !arg.toString.toString().includes('[native code]')) {\n\t\t\treturn arg.toString();\n\t\t}\n\n\t\tvar classes = '';\n\n\t\tfor (var key in arg) {\n\t\t\tif (hasOwn.call(arg, key) && arg[key]) {\n\t\t\t\tclasses = appendClass(classes, key);\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction appendClass (value, newClass) {\n\t\tif (!newClass) {\n\t\t\treturn value;\n\t\t}\n\t\n\t\tif (value) {\n\t\t\treturn value + ' ' + newClass;\n\t\t}\n\t\n\t\treturn value + newClass;\n\t}\n\n\tif (typeof module !== 'undefined' && module.exports) {\n\t\tclassNames.default = classNames;\n\t\tmodule.exports = classNames;\n\t} else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n\t\t// register as 'classnames', consistent with npm package name\n\t\tdefine('classnames', [], function () {\n\t\t\treturn classNames;\n\t\t});\n\t} else {\n\t\twindow.classNames = classNames;\n\t}\n}());\n"],"names":["hasOwn","classNames","classes","i","arg","appendClass","parseValue","key","value","newClass","module"],"mappings":";;;;gBAOC,UAAY,CAGR,IAAAA,EAAS,CAAG,EAAA,eAEhB,SAASC,GAAc,CAGtB,QAFIC,EAAU,GAELC,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CACtC,IAAAC,EAAM,UAAUD,CAAC,EACjBC,IACHF,EAAUG,EAAYH,EAASI,EAAWF,CAAG,CAAC,EAEhD,CAEO,OAAAF,CACR,CAEA,SAASI,EAAYF,EAAK,CACzB,GAAI,OAAOA,GAAQ,UAAY,OAAOA,GAAQ,SACtC,OAAAA,EAGJ,GAAA,OAAOA,GAAQ,SACX,MAAA,GAGJ,GAAA,MAAM,QAAQA,CAAG,EACb,OAAAH,EAAW,MAAM,KAAMG,CAAG,EAGlC,GAAIA,EAAI,WAAa,OAAO,UAAU,UAAY,CAACA,EAAI,SAAS,SAAS,EAAE,SAAS,eAAe,EAClG,OAAOA,EAAI,WAGZ,IAAIF,EAAU,GAEd,QAASK,KAAOH,EACXJ,EAAO,KAAKI,EAAKG,CAAG,GAAKH,EAAIG,CAAG,IACzBL,EAAAG,EAAYH,EAASK,CAAG,GAI7B,OAAAL,CACR,CAES,SAAAG,EAAaG,EAAOC,EAAU,CACtC,OAAKA,EAIDD,EACIA,EAAQ,IAAMC,EAGfD,EAAQC,EAPPD,CAQT,CAEqCE,EAAO,SAC3CT,EAAW,QAAUA,EACrBS,EAAA,QAAiBT,GAOjB,OAAO,WAAaA,CAEtB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs169.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":"oEAEA,IAAIA,EAAe,CACjB,OAAQ,CACN,EAAG,EACH,EAAG,CACL,EACA,OAAQ,CACN,EAAG,EACH,EAAG,CACL,CACF,EACA,SAAwBC,EAAqBC,EAAM,CACjD,IAAIC,EAAYD,EAAK,KACnBE,EAAOD,IAAc,OAASH,EAAeG,EAC3B,OAAAE,EAAM,cAAc,OAAQ,CAC9C,GAAID,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,YAAa,EACb,OAAQ,OACR,cAAe,EAAA,CAChB,CACH,CACAH,EAAqB,UAAY,CAC/B,KAAMK,EAAI,MAAM,CACd,OAAQA,EAAI,MAAM,CAChB,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,UACf,CAAA,EAAE,WACH,OAAQA,EAAI,MAAM,CAChB,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,UACf,CAAA,EAAE,UAAA,CACJ,CACH","x_google_ignoreList":[0]}

package/dist/index.cjs17.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs212.js"),s=require("./index.cjs214.js"),c=e(s);module.exports=c;
+"use strict";const e=require("./index.cjs211.js"),s=require("./index.cjs213.js"),c=e(s);module.exports=c;
 //# sourceMappingURL=index.cjs17.js.map

package/dist/index.cjs170.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs62.js"),u=require("react");var n={source:{x:0,y:0},target:{x:0,y:0}};function t(s){var i=s.link,r=i===void 0?n:i;return u.createElement("line",{x1:r.source.x,y1:r.source.y,x2:r.target.x,y2:r.target.y,strokeWidth:2,stroke:"#999",strokeOpacity:.6})}t.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})};module.exports=t;
+"use strict";const e=require("./index.cjs62.js"),o=require("react");function i(c){var n=c.node,r=n===void 0?{x:0,y:0,r:15}:n;return o.createElement("circle",{cx:r.x,cy:r.y,r:r.r||15,fill:"#21D4FD"})}i.propTypes={node:e.shape({x:e.number.isRequired,y:e.number.isRequired,r:e.number})};module.exports=i;
 //# sourceMappingURL=index.cjs170.js.map

package/dist/index.cjs170.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs170.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":"oEAEA,IAAIA,EAAe,CACjB,OAAQ,CACN,EAAG,EACH,EAAG,CACL,EACA,OAAQ,CACN,EAAG,EACH,EAAG,CACL,CACF,EACA,SAAwBC,EAAqBC,EAAM,CACjD,IAAIC,EAAYD,EAAK,KACnBE,EAAOD,IAAc,OAASH,EAAeG,EAC3B,OAAAE,EAAM,cAAc,OAAQ,CAC9C,GAAID,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,YAAa,EACb,OAAQ,OACR,cAAe,EAAA,CAChB,CACH,CACAH,EAAqB,UAAY,CAC/B,KAAMK,EAAI,MAAM,CACd,OAAQA,EAAI,MAAM,CAChB,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,UACf,CAAA,EAAE,WACH,OAAQA,EAAI,MAAM,CAChB,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,UACf,CAAA,EAAE,UAAA,CACJ,CACH","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs170.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":"oEAEA,SAAwBA,EAAqBC,EAAM,CACjD,IAAIC,EAAYD,EAAK,KACnBE,EAAOD,IAAc,OAAS,CAC5B,EAAG,EACH,EAAG,EACH,EAAG,EACD,EAAAA,EACc,OAAAE,EAAM,cAAc,SAAU,CAChD,GAAID,EAAK,EACT,GAAIA,EAAK,EACT,EAAGA,EAAK,GAAK,GACb,KAAM,SAAA,CACP,CACH,CACAH,EAAqB,UAAY,CAC/B,KAAMK,EAAI,MAAM,CACd,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,MAAA,CACR,CACH","x_google_ignoreList":[0]}

package/dist/index.cjs171.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs62.js"),o=require("react");function i(c){var n=c.node,r=n===void 0?{x:0,y:0,r:15}:n;return o.createElement("circle",{cx:r.x,cy:r.y,r:r.r||15,fill:"#21D4FD"})}i.propTypes={node:e.shape({x:e.number.isRequired,y:e.number.isRequired,r:e.number})};module.exports=i;
+"use strict";const k=require("./index.cjs37.js");function R(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 W(r,n,c){var l=c/(n.i-r.i);n.c-=l,n.s+=c,r.c+=l,n.z+=c,n.m+=c}function b(r){for(var n=0,c=0,l=r.children,u=l.length,s;--u>=0;)s=l[u],s.z+=n,s.m+=n,n+=s.s+(c+=s.c)}function j(r,n,c){return r.a.parent===n.parent?r.a:c}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.Node.prototype);function o(r){for(var n=new A(r,0),c,l=[n],u,s,x,y;c=l.pop();)if(s=c._.children)for(c.children=new Array(y=s.length),x=y-1;x>=0;--x)l.push(u=c.children[x]=new A(s[x],x)),u.parent=c;return(n.parent=new A(null,0)).children=[n],n}function q(){var r=R,n=1,c=1,l=null;function u(e){var f=o(e);if(f.eachAfter(s),f.parent.m=-f.z,f.eachBefore(x),l)e.eachBefore(N);else{var d=e,t=e,a=e;e.eachBefore(function(i){i.x<d.x&&(d=i),i.x>t.x&&(t=i),i.depth>a.depth&&(a=i)});var h=d===t?1:r(d,t)/2,z=h-d.x,g=n/(t.x+h+z),_=c/(a.depth||1);e.eachBefore(function(i){i.x=(i.x+z)*g,i.y=i.depth*_})}return e}function s(e){var f=e.children,d=e.parent.children,t=e.i?d[e.i-1]:null;if(f){b(e);var a=(f[0].z+f[f.length-1].z)/2;t?(e.z=t.z+r(e._,t._),e.m=e.z-a):e.z=a}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,a=e,h=f,z=t.parent.children[0],g=t.m,_=a.m,i=h.m,w=z.m,p;h=B(h),t=S(t),h&&t;)z=S(z),a=B(a),a.a=e,p=h.z+i-t.z-g+r(h._,t._),p>0&&(W(j(h,e,d),e,p),g+=p,_+=p),i+=h.m,g+=t.m,w+=z.m,_+=a.m;h&&!B(a)&&(a.t=h,a.m+=i-_),t&&!S(z)&&(z.t=t,z.m+=g-w,d=e)}return d}function N(e){e.x*=n,e.y=e.depth*c}return u.separation=function(e){return arguments.length?(r=e,u):r},u.size=function(e){return arguments.length?(l=!1,n=+e[0],c=+e[1],u):l?null:[n,c]},u.nodeSize=function(e){return arguments.length?(l=!0,n=+e[0],c=+e[1],u):l?[n,c]:null},u}module.exports=q;
 //# sourceMappingURL=index.cjs171.js.map

package/dist/index.cjs171.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs171.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":"oEAEA,SAAwBA,EAAqBC,EAAM,CACjD,IAAIC,EAAYD,EAAK,KACnBE,EAAOD,IAAc,OAAS,CAC5B,EAAG,EACH,EAAG,EACH,EAAG,EACD,EAAAA,EACc,OAAAE,EAAM,cAAc,SAAU,CAChD,GAAID,EAAK,EACT,GAAIA,EAAK,EACT,EAAGA,EAAK,GAAK,GACb,KAAM,SAAA,CACP,CACH,CACAH,EAAqB,UAAY,CAC/B,KAAMK,EAAI,MAAM,CACd,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,MAAA,CACR,CACH","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs171.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":"iDAEA,SAASA,EAAkBC,EAAGC,EAAG,CAC/B,OAAOD,EAAE,SAAWC,EAAE,OAAS,EAAI,CACrC,CAUA,SAASC,EAASC,EAAG,CACnB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAAS,CAAC,EAAID,EAAE,CACpC,CAGA,SAASE,EAAUF,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAASA,EAAS,OAAS,CAAC,EAAID,EAAE,CACtD,CAIA,SAASG,EAAYC,EAAIC,EAAIC,EAAO,CAClC,IAAIC,EAASD,GAASD,EAAG,EAAID,EAAG,GAChCC,EAAG,GAAKE,EACRF,EAAG,GAAKC,EACRF,EAAG,GAAKG,EACRF,EAAG,GAAKC,EACRD,EAAG,GAAKC,CACV,CAKA,SAASE,EAAcR,EAAG,CAMjB,QALHM,EAAQ,EACRC,EAAS,EACTN,EAAWD,EAAE,SACbS,EAAIR,EAAS,OACbS,EACG,EAAED,GAAK,GACZC,EAAIT,EAASQ,CAAC,EACdC,EAAE,GAAKJ,EACPI,EAAE,GAAKJ,EACEA,GAAAI,EAAE,GAAKH,GAAUG,EAAE,EAEhC,CAIA,SAASC,EAAaC,EAAKZ,EAAGa,EAAU,CACtC,OAAOD,EAAI,EAAE,SAAWZ,EAAE,OAASY,EAAI,EAAIC,CAC7C,CAEA,SAASC,EAASC,EAAMN,EAAG,CACzB,KAAK,EAAIM,EACT,KAAK,OAAS,KACd,KAAK,SAAW,KAChB,KAAK,EAAI,KACT,KAAK,EAAI,KACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,KACT,KAAK,EAAIN,CACX,CAEAK,EAAS,UAAY,OAAO,OAAOE,EAAA,KAAK,SAAS,EAEjD,SAASC,EAASC,EAAM,CASf,QARHC,EAAO,IAAIL,EAASI,EAAM,CAAC,EAC3BH,EACAK,EAAQ,CAACD,CAAI,EACbE,EACApB,EACAQ,EACAa,EAEGP,EAAOK,EAAM,OACd,GAAAnB,EAAWc,EAAK,EAAE,SAEpB,IADAA,EAAK,SAAW,IAAI,MAAMO,EAAIrB,EAAS,MAAM,EACxCQ,EAAIa,EAAI,EAAGb,GAAK,EAAG,EAAEA,EACxBW,EAAM,KAAKC,EAAQN,EAAK,SAASN,CAAC,EAAI,IAAIK,EAASb,EAASQ,CAAC,EAAGA,CAAC,CAAC,EAClEY,EAAM,OAASN,EAKpB,OAAAI,EAAK,OAAS,IAAIL,EAAS,KAAM,CAAC,GAAG,SAAW,CAACK,CAAI,EAC/CA,CACT,CAG0B,SAAAI,GAAA,CACxB,IAAIC,EAAa5B,EACb6B,EAAK,EACLC,EAAK,EACLC,EAAW,KAEf,SAASR,EAAKD,EAAM,CACd,IAAAU,EAAIX,EAASC,CAAI,EAOjB,GAJJU,EAAE,UAAUC,CAAS,EAAGD,EAAE,OAAO,EAAI,CAACA,EAAE,EACxCA,EAAE,WAAWE,CAAU,EAGnBH,EAAUT,EAAK,WAAWa,CAAQ,MAIjC,CACH,IAAIC,EAAOd,EACPe,EAAQf,EACRgB,EAAShB,EACRA,EAAA,WAAW,SAASH,EAAM,CACzBA,EAAK,EAAIiB,EAAK,IAAUA,EAAAjB,GACxBA,EAAK,EAAIkB,EAAM,IAAWA,EAAAlB,GAC1BA,EAAK,MAAQmB,EAAO,QAAgBA,EAAAnB,EAAA,CACzC,EACG,IAAAoB,EAAIH,IAASC,EAAQ,EAAIT,EAAWQ,EAAMC,CAAK,EAAI,EACnDG,EAAKD,EAAIH,EAAK,EACdK,EAAKZ,GAAMQ,EAAM,EAAIE,EAAIC,GACzBE,EAAKZ,GAAMQ,EAAO,OAAS,GAC1BhB,EAAA,WAAW,SAASH,EAAM,CACxBA,EAAA,GAAKA,EAAK,EAAIqB,GAAMC,EACpBtB,EAAA,EAAIA,EAAK,MAAQuB,CAAA,CACvB,CACH,CAEO,OAAApB,CACT,CAMA,SAASW,EAAU7B,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACbuC,EAAWvC,EAAE,OAAO,SACpBU,EAAIV,EAAE,EAAIuC,EAASvC,EAAE,EAAI,CAAC,EAAI,KAClC,GAAIC,EAAU,CACZO,EAAcR,CAAC,EACX,IAAAwC,GAAYvC,EAAS,CAAC,EAAE,EAAIA,EAASA,EAAS,OAAS,CAAC,EAAE,GAAK,EAC/DS,GACFV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,EAC7BV,EAAA,EAAIA,EAAE,EAAIwC,GAEZxC,EAAE,EAAIwC,OAEC9B,IACTV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,GAE/BV,EAAA,OAAO,EAAIyC,EAAUzC,EAAGU,EAAGV,EAAE,OAAO,GAAKuC,EAAS,CAAC,CAAC,CACxD,CAGA,SAAST,EAAW9B,EAAG,CACrBA,EAAE,EAAE,EAAIA,EAAE,EAAIA,EAAE,OAAO,EACrBA,EAAA,GAAKA,EAAE,OAAO,CAClB,CAaS,SAAAyC,EAAUzC,EAAGU,EAAGG,EAAU,CACjC,GAAIH,EAAG,CAUE,QATHgC,EAAM1C,EACN2C,EAAM3C,EACNY,EAAMF,EACNkC,EAAMF,EAAI,OAAO,SAAS,CAAC,EAC3BG,EAAMH,EAAI,EACVI,EAAMH,EAAI,EACVI,EAAMnC,EAAI,EACVoC,EAAMJ,EAAI,EACVtC,EACGM,EAAMV,EAAUU,CAAG,EAAG8B,EAAM3C,EAAS2C,CAAG,EAAG9B,GAAO8B,GACvDE,EAAM7C,EAAS6C,CAAG,EAClBD,EAAMzC,EAAUyC,CAAG,EACnBA,EAAI,EAAI3C,EACAM,EAAAM,EAAI,EAAImC,EAAML,EAAI,EAAIG,EAAMrB,EAAWZ,EAAI,EAAG8B,EAAI,CAAC,EACvDpC,EAAQ,IACVH,EAAYQ,EAAaC,EAAKZ,EAAGa,CAAQ,EAAGb,EAAGM,CAAK,EAC7CuC,GAAAvC,EACAwC,GAAAxC,GAETyC,GAAOnC,EAAI,EACXiC,GAAOH,EAAI,EACXM,GAAOJ,EAAI,EACXE,GAAOH,EAAI,EAET/B,GAAO,CAACV,EAAUyC,CAAG,IACvBA,EAAI,EAAI/B,EACR+B,EAAI,GAAKI,EAAMD,GAEbJ,GAAO,CAAC3C,EAAS6C,CAAG,IACtBA,EAAI,EAAIF,EACRE,EAAI,GAAKC,EAAMG,EACJnC,EAAAb,EAEf,CACO,OAAAa,CACT,CAEA,SAASkB,EAAShB,EAAM,CACtBA,EAAK,GAAKU,EACLV,EAAA,EAAIA,EAAK,MAAQW,CACxB,CAEK,OAAAP,EAAA,WAAa,SAAS8B,EAAG,CAC5B,OAAO,UAAU,QAAUzB,EAAayB,EAAG9B,GAAQK,CAAA,EAGhDL,EAAA,KAAO,SAAS8B,EAAG,CACtB,OAAO,UAAU,QAAUtB,EAAW,GAAOF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,KAAO,CAACF,EAAIC,CAAE,CAAA,EAGpGP,EAAA,SAAW,SAAS8B,EAAG,CAC1B,OAAO,UAAU,QAAUtB,EAAW,GAAMF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,CAACF,EAAIC,CAAE,EAAI,IAAA,EAG9FP,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs172.js

@@ -1,2 +1,2 @@
-"use strict";const k=require("./index.cjs37.js");function R(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 W(r,n,c){var l=c/(n.i-r.i);n.c-=l,n.s+=c,r.c+=l,n.z+=c,n.m+=c}function b(r){for(var n=0,c=0,l=r.children,u=l.length,s;--u>=0;)s=l[u],s.z+=n,s.m+=n,n+=s.s+(c+=s.c)}function j(r,n,c){return r.a.parent===n.parent?r.a:c}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.Node.prototype);function o(r){for(var n=new A(r,0),c,l=[n],u,s,x,y;c=l.pop();)if(s=c._.children)for(c.children=new Array(y=s.length),x=y-1;x>=0;--x)l.push(u=c.children[x]=new A(s[x],x)),u.parent=c;return(n.parent=new A(null,0)).children=[n],n}function q(){var r=R,n=1,c=1,l=null;function u(e){var f=o(e);if(f.eachAfter(s),f.parent.m=-f.z,f.eachBefore(x),l)e.eachBefore(N);else{var d=e,t=e,a=e;e.eachBefore(function(i){i.x<d.x&&(d=i),i.x>t.x&&(t=i),i.depth>a.depth&&(a=i)});var h=d===t?1:r(d,t)/2,z=h-d.x,g=n/(t.x+h+z),_=c/(a.depth||1);e.eachBefore(function(i){i.x=(i.x+z)*g,i.y=i.depth*_})}return e}function s(e){var f=e.children,d=e.parent.children,t=e.i?d[e.i-1]:null;if(f){b(e);var a=(f[0].z+f[f.length-1].z)/2;t?(e.z=t.z+r(e._,t._),e.m=e.z-a):e.z=a}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,a=e,h=f,z=t.parent.children[0],g=t.m,_=a.m,i=h.m,w=z.m,p;h=B(h),t=S(t),h&&t;)z=S(z),a=B(a),a.a=e,p=h.z+i-t.z-g+r(h._,t._),p>0&&(W(j(h,e,d),e,p),g+=p,_+=p),i+=h.m,g+=t.m,w+=z.m,_+=a.m;h&&!B(a)&&(a.t=h,a.m+=i-_),t&&!S(z)&&(z.t=t,z.m+=g-w,d=e)}return d}function N(e){e.x*=n,e.y=e.depth*c}return u.separation=function(e){return arguments.length?(r=e,u):r},u.size=function(e){return arguments.length?(l=!1,n=+e[0],c=+e[1],u):l?null:[n,c]},u.nodeSize=function(e){return arguments.length?(l=!0,n=+e[0],c=+e[1],u):l?[n,c]:null},u}module.exports=q;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e){return typeof(e==null?void 0:e.x)=="number"?e==null?void 0:e.x:0}function n(e){return typeof(e==null?void 0:e.y)=="number"?e==null?void 0:e.y:0}function u(e){return e==null?void 0:e.source}function r(e){return e==null?void 0:e.target}exports.getSource=u;exports.getTarget=r;exports.getX=t;exports.getY=n;
 //# sourceMappingURL=index.cjs172.js.map

package/dist/index.cjs172.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs172.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":"iDAEA,SAASA,EAAkBC,EAAGC,EAAG,CAC/B,OAAOD,EAAE,SAAWC,EAAE,OAAS,EAAI,CACrC,CAUA,SAASC,EAASC,EAAG,CACnB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAAS,CAAC,EAAID,EAAE,CACpC,CAGA,SAASE,EAAUF,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAASA,EAAS,OAAS,CAAC,EAAID,EAAE,CACtD,CAIA,SAASG,EAAYC,EAAIC,EAAIC,EAAO,CAClC,IAAIC,EAASD,GAASD,EAAG,EAAID,EAAG,GAChCC,EAAG,GAAKE,EACRF,EAAG,GAAKC,EACRF,EAAG,GAAKG,EACRF,EAAG,GAAKC,EACRD,EAAG,GAAKC,CACV,CAKA,SAASE,EAAcR,EAAG,CAMjB,QALHM,EAAQ,EACRC,EAAS,EACTN,EAAWD,EAAE,SACbS,EAAIR,EAAS,OACbS,EACG,EAAED,GAAK,GACZC,EAAIT,EAASQ,CAAC,EACdC,EAAE,GAAKJ,EACPI,EAAE,GAAKJ,EACEA,GAAAI,EAAE,GAAKH,GAAUG,EAAE,EAEhC,CAIA,SAASC,EAAaC,EAAKZ,EAAGa,EAAU,CACtC,OAAOD,EAAI,EAAE,SAAWZ,EAAE,OAASY,EAAI,EAAIC,CAC7C,CAEA,SAASC,EAASC,EAAMN,EAAG,CACzB,KAAK,EAAIM,EACT,KAAK,OAAS,KACd,KAAK,SAAW,KAChB,KAAK,EAAI,KACT,KAAK,EAAI,KACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,KACT,KAAK,EAAIN,CACX,CAEAK,EAAS,UAAY,OAAO,OAAOE,EAAA,KAAK,SAAS,EAEjD,SAASC,EAASC,EAAM,CASf,QARHC,EAAO,IAAIL,EAASI,EAAM,CAAC,EAC3BH,EACAK,EAAQ,CAACD,CAAI,EACbE,EACApB,EACAQ,EACAa,EAEGP,EAAOK,EAAM,OACd,GAAAnB,EAAWc,EAAK,EAAE,SAEpB,IADAA,EAAK,SAAW,IAAI,MAAMO,EAAIrB,EAAS,MAAM,EACxCQ,EAAIa,EAAI,EAAGb,GAAK,EAAG,EAAEA,EACxBW,EAAM,KAAKC,EAAQN,EAAK,SAASN,CAAC,EAAI,IAAIK,EAASb,EAASQ,CAAC,EAAGA,CAAC,CAAC,EAClEY,EAAM,OAASN,EAKpB,OAAAI,EAAK,OAAS,IAAIL,EAAS,KAAM,CAAC,GAAG,SAAW,CAACK,CAAI,EAC/CA,CACT,CAG0B,SAAAI,GAAA,CACxB,IAAIC,EAAa5B,EACb6B,EAAK,EACLC,EAAK,EACLC,EAAW,KAEf,SAASR,EAAKD,EAAM,CACd,IAAAU,EAAIX,EAASC,CAAI,EAOjB,GAJJU,EAAE,UAAUC,CAAS,EAAGD,EAAE,OAAO,EAAI,CAACA,EAAE,EACxCA,EAAE,WAAWE,CAAU,EAGnBH,EAAUT,EAAK,WAAWa,CAAQ,MAIjC,CACH,IAAIC,EAAOd,EACPe,EAAQf,EACRgB,EAAShB,EACRA,EAAA,WAAW,SAASH,EAAM,CACzBA,EAAK,EAAIiB,EAAK,IAAUA,EAAAjB,GACxBA,EAAK,EAAIkB,EAAM,IAAWA,EAAAlB,GAC1BA,EAAK,MAAQmB,EAAO,QAAgBA,EAAAnB,EAAA,CACzC,EACG,IAAAoB,EAAIH,IAASC,EAAQ,EAAIT,EAAWQ,EAAMC,CAAK,EAAI,EACnDG,EAAKD,EAAIH,EAAK,EACdK,EAAKZ,GAAMQ,EAAM,EAAIE,EAAIC,GACzBE,EAAKZ,GAAMQ,EAAO,OAAS,GAC1BhB,EAAA,WAAW,SAASH,EAAM,CACxBA,EAAA,GAAKA,EAAK,EAAIqB,GAAMC,EACpBtB,EAAA,EAAIA,EAAK,MAAQuB,CAAA,CACvB,CACH,CAEO,OAAApB,CACT,CAMA,SAASW,EAAU7B,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACbuC,EAAWvC,EAAE,OAAO,SACpBU,EAAIV,EAAE,EAAIuC,EAASvC,EAAE,EAAI,CAAC,EAAI,KAClC,GAAIC,EAAU,CACZO,EAAcR,CAAC,EACX,IAAAwC,GAAYvC,EAAS,CAAC,EAAE,EAAIA,EAASA,EAAS,OAAS,CAAC,EAAE,GAAK,EAC/DS,GACFV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,EAC7BV,EAAA,EAAIA,EAAE,EAAIwC,GAEZxC,EAAE,EAAIwC,OAEC9B,IACTV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,GAE/BV,EAAA,OAAO,EAAIyC,EAAUzC,EAAGU,EAAGV,EAAE,OAAO,GAAKuC,EAAS,CAAC,CAAC,CACxD,CAGA,SAAST,EAAW9B,EAAG,CACrBA,EAAE,EAAE,EAAIA,EAAE,EAAIA,EAAE,OAAO,EACrBA,EAAA,GAAKA,EAAE,OAAO,CAClB,CAaS,SAAAyC,EAAUzC,EAAGU,EAAGG,EAAU,CACjC,GAAIH,EAAG,CAUE,QATHgC,EAAM1C,EACN2C,EAAM3C,EACNY,EAAMF,EACNkC,EAAMF,EAAI,OAAO,SAAS,CAAC,EAC3BG,EAAMH,EAAI,EACVI,EAAMH,EAAI,EACVI,EAAMnC,EAAI,EACVoC,EAAMJ,EAAI,EACVtC,EACGM,EAAMV,EAAUU,CAAG,EAAG8B,EAAM3C,EAAS2C,CAAG,EAAG9B,GAAO8B,GACvDE,EAAM7C,EAAS6C,CAAG,EAClBD,EAAMzC,EAAUyC,CAAG,EACnBA,EAAI,EAAI3C,EACAM,EAAAM,EAAI,EAAImC,EAAML,EAAI,EAAIG,EAAMrB,EAAWZ,EAAI,EAAG8B,EAAI,CAAC,EACvDpC,EAAQ,IACVH,EAAYQ,EAAaC,EAAKZ,EAAGa,CAAQ,EAAGb,EAAGM,CAAK,EAC7CuC,GAAAvC,EACAwC,GAAAxC,GAETyC,GAAOnC,EAAI,EACXiC,GAAOH,EAAI,EACXM,GAAOJ,EAAI,EACXE,GAAOH,EAAI,EAET/B,GAAO,CAACV,EAAUyC,CAAG,IACvBA,EAAI,EAAI/B,EACR+B,EAAI,GAAKI,EAAMD,GAEbJ,GAAO,CAAC3C,EAAS6C,CAAG,IACtBA,EAAI,EAAIF,EACRE,EAAI,GAAKC,EAAMG,EACJnC,EAAAb,EAEf,CACO,OAAAa,CACT,CAEA,SAASkB,EAAShB,EAAM,CACtBA,EAAK,GAAKU,EACLV,EAAA,EAAIA,EAAK,MAAQW,CACxB,CAEK,OAAAP,EAAA,WAAa,SAAS8B,EAAG,CAC5B,OAAO,UAAU,QAAUzB,EAAayB,EAAG9B,GAAQK,CAAA,EAGhDL,EAAA,KAAO,SAAS8B,EAAG,CACtB,OAAO,UAAU,QAAUtB,EAAW,GAAOF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,KAAO,CAACF,EAAIC,CAAE,CAAA,EAGpGP,EAAA,SAAW,SAAS8B,EAAG,CAC1B,OAAO,UAAU,QAAUtB,EAAW,GAAMF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,CAACF,EAAIC,CAAE,EAAI,IAAA,EAG9FP,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs172.js","sources":["../../../node_modules/@visx/shape/esm/util/accessors.js"],"sourcesContent":["export function getX(l) {\n  return typeof (l == null ? void 0 : l.x) === 'number' ? l == null ? void 0 : l.x : 0;\n}\nexport function getY(l) {\n  return typeof (l == null ? void 0 : l.y) === 'number' ? l == null ? void 0 : l.y : 0;\n}\nexport function getSource(l) {\n  return l == null ? void 0 : l.source;\n}\nexport function getTarget(l) {\n  return l == null ? void 0 : l.target;\n}\nexport function getFirstItem(d) {\n  return d == null ? void 0 : d[0];\n}\nexport function getSecondItem(d) {\n  return d == null ? void 0 : d[1];\n}"],"names":["getX","l","getY","getSource","getTarget"],"mappings":"gFAAO,SAASA,EAAKC,EAAG,CACf,OAAA,OAAQA,GAAK,KAAO,OAASA,EAAE,IAAO,SAAWA,GAAK,KAAO,OAASA,EAAE,EAAI,CACrF,CACO,SAASC,EAAKD,EAAG,CACf,OAAA,OAAQA,GAAK,KAAO,OAASA,EAAE,IAAO,SAAWA,GAAK,KAAO,OAASA,EAAE,EAAI,CACrF,CACO,SAASE,EAAUF,EAAG,CACpB,OAAAA,GAAK,KAAO,OAASA,EAAE,MAChC,CACO,SAASG,EAAUH,EAAG,CACpB,OAAAA,GAAK,KAAO,OAASA,EAAE,MAChC","x_google_ignoreList":[0]}

package/dist/index.cjs173.js

@@ -1,2 +1,2 @@
-"use strict";const q=require("./index.cjs190.js"),L=require("./index.cjs236.js"),M=require("./index.cjs237.js"),N=require("./index.cjs238.js");var O=L.isObject_1,b=M.now_1,I=N.toNumber_1,S="Expected a function",$=Math.max,y=Math.min;function F(x,n,u){var a,c,v,o,i,r,s=0,h=!1,l=!1,d=!0;if(typeof x!="function")throw new TypeError(S);n=I(n)||0,O(u)&&(h=!!u.leading,l="maxWait"in u,v=l?$(I(u.maxWait)||0,n):v,d="trailing"in u?!!u.trailing:d);function g(e){var t=a,m=c;return a=c=void 0,s=e,o=x.apply(m,t),o}function j(e){return s=e,i=setTimeout(f,n),h?g(e):o}function C(e){var t=e-r,m=e-s,k=n-t;return l?y(k,v-m):k}function E(e){var t=e-r,m=e-s;return r===void 0||t>=n||t<0||l&&m>=v}function f(){var e=b();if(E(e))return _(e);i=setTimeout(f,C(e))}function _(e){return i=void 0,d&&a?g(e):(a=c=void 0,o)}function W(){i!==void 0&&clearTimeout(i),s=0,a=r=c=i=void 0}function p(){return i===void 0?o:_(b())}function T(){var e=b(),t=E(e);if(a=arguments,c=this,r=e,t){if(i===void 0)return j(r);if(l)return clearTimeout(i),i=setTimeout(f,n),g(r)}return i===void 0&&(i=setTimeout(f,n)),o}return T.cancel=W,T.flush=p,T}var R=F;const A=q.getDefaultExportFromCjs(R);module.exports=A;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./index.cjs264.js"),f=require("./index.cjs265.js"),p=require("./index.cjs266.js"),c=require("./index.cjs263.js"),k=require("./index.cjs174.js");function m(n){return n.source}function d(n){return n.target}function s(n){var r=m,e=d,u=p.x,l=p.y,a=null;function i(){var t,o=h.slice.call(arguments),g=r.apply(this,o),v=e.apply(this,o);if(a||(a=t=k()),n(a,+u.apply(this,(o[0]=g,o)),+l.apply(this,o),+u.apply(this,(o[0]=v,o)),+l.apply(this,o)),t)return a=null,t+""||null}return i.source=function(t){return arguments.length?(r=t,i):r},i.target=function(t){return arguments.length?(e=t,i):e},i.x=function(t){return arguments.length?(u=typeof t=="function"?t:f(+t),i):u},i.y=function(t){return arguments.length?(l=typeof t=="function"?t:f(+t),i):l},i.context=function(t){return arguments.length?(a=t??null,i):a},i}function T(n,r,e,u,l){n.moveTo(r,e),n.bezierCurveTo(r=(r+u)/2,e,r,l,u,l)}function b(n,r,e,u,l){n.moveTo(r,e),n.bezierCurveTo(r,e=(e+l)/2,u,e,u,l)}function y(n,r,e,u,l){var a=c(r,e),i=c(r,e=(e+l)/2),t=c(u,e),o=c(u,l);n.moveTo(a[0],a[1]),n.bezierCurveTo(i[0],i[1],t[0],t[1],o[0],o[1])}function z(){return s(T)}function q(){return s(b)}function R(){var n=s(y);return n.angle=n.x,delete n.x,n.radius=n.y,delete n.y,n}exports.linkHorizontal=z;exports.linkRadial=R;exports.linkVertical=q;
 //# sourceMappingURL=index.cjs173.js.map

package/dist/index.cjs173.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs173.js","sources":["../../../node_modules/lodash/debounce.js"],"sourcesContent":["var isObject = require('./isObject'),\n    now = require('./now'),\n    toNumber = require('./toNumber');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        timeWaiting = wait - timeSinceLastCall;\n\n    return maxing\n      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n      : timeWaiting;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerId);\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\nmodule.exports = debounce;\n"],"names":["isObject","require$$0","now","require$$1","toNumber","require$$2","FUNC_ERROR_TEXT","nativeMax","nativeMin","debounce","func","wait","options","lastArgs","lastThis","maxWait","result","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","invokeFunc","time","args","thisArg","leadingEdge","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","flush","debounced","isInvoking","debounce_1"],"mappings":"+IAAA,IAAIA,EAAWC,EAAAA,WACXC,EAAMC,EAAAA,MACNC,EAAWC,EAAAA,WAGXC,EAAkB,sBAGlBC,EAAY,KAAK,IACjBC,EAAY,KAAK,IAwDrB,SAASC,EAASC,EAAMC,EAAMC,EAAS,CACrC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAiB,EACjBC,EAAU,GACVC,EAAS,GACTC,EAAW,GAEX,GAAA,OAAOZ,GAAQ,WACX,MAAA,IAAI,UAAUJ,CAAe,EAE9BK,EAAAP,EAASO,CAAI,GAAK,EACrBX,EAASY,CAAO,IACRQ,EAAA,CAAC,CAACR,EAAQ,QACpBS,EAAS,YAAaT,EACZG,EAAAM,EAASd,EAAUH,EAASQ,EAAQ,OAAO,GAAK,EAAGD,CAAI,EAAII,EACrEO,EAAW,aAAcV,EAAU,CAAC,CAACA,EAAQ,SAAWU,GAG1D,SAASC,EAAWC,EAAM,CACpB,IAAAC,EAAOZ,EACPa,EAAUZ,EAEd,OAAAD,EAAWC,EAAW,OACLK,EAAAK,EACRR,EAAAN,EAAK,MAAMgB,EAASD,CAAI,EAC1BT,CACT,CAEA,SAASW,EAAYH,EAAM,CAER,OAAAL,EAAAK,EAEPP,EAAA,WAAWW,EAAcjB,CAAI,EAEhCS,EAAUG,EAAWC,CAAI,EAAIR,CACtC,CAEA,SAASa,EAAcL,EAAM,CAC3B,IAAIM,EAAoBN,EAAON,EAC3Ba,EAAsBP,EAAOL,EAC7Ba,EAAcrB,EAAOmB,EAEzB,OAAOT,EACHb,EAAUwB,EAAajB,EAAUgB,CAAmB,EACpDC,CACN,CAEA,SAASC,EAAaT,EAAM,CAC1B,IAAIM,EAAoBN,EAAON,EAC3Ba,EAAsBP,EAAOL,EAKjC,OAAQD,IAAiB,QAAcY,GAAqBnB,GACzDmB,EAAoB,GAAOT,GAAUU,GAAuBhB,CACjE,CAEA,SAASa,GAAe,CACtB,IAAIJ,EAAOtB,IACP,GAAA+B,EAAaT,CAAI,EACnB,OAAOU,EAAaV,CAAI,EAG1BP,EAAU,WAAWW,EAAcC,EAAcL,CAAI,CAAC,CACxD,CAEA,SAASU,EAAaV,EAAM,CAK1B,OAJUP,EAAA,OAINK,GAAYT,EACPU,EAAWC,CAAI,GAExBX,EAAWC,EAAW,OACfE,EACT,CAEA,SAASmB,GAAS,CACZlB,IAAY,QACd,aAAaA,CAAO,EAELE,EAAA,EACNN,EAAAK,EAAeJ,EAAWG,EAAU,MACjD,CAEA,SAASmB,GAAQ,CACf,OAAOnB,IAAY,OAAYD,EAASkB,EAAahC,GAAK,CAC5D,CAEA,SAASmC,GAAY,CACnB,IAAIb,EAAOtB,EACP,EAAAoC,EAAaL,EAAaT,CAAI,EAMlC,GAJWX,EAAA,UACAC,EAAA,KACII,EAAAM,EAEXc,EAAY,CACd,GAAIrB,IAAY,OACd,OAAOU,EAAYT,CAAY,EAEjC,GAAIG,EAEF,oBAAaJ,CAAO,EACVA,EAAA,WAAWW,EAAcjB,CAAI,EAChCY,EAAWL,CAAY,CAElC,CACA,OAAID,IAAY,SACJA,EAAA,WAAWW,EAAcjB,CAAI,GAElCK,CACT,CACA,OAAAqB,EAAU,OAASF,EACnBE,EAAU,MAAQD,EACXC,CACT,CAEA,IAAAE,EAAiB9B","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs173.js","sources":["../../../node_modules/d3-shape/src/link/index.js"],"sourcesContent":["import {path} from \"d3-path\";\nimport {slice} from \"../array.js\";\nimport constant from \"../constant.js\";\nimport {x as pointX, y as pointY} from \"../point.js\";\nimport pointRadial from \"../pointRadial.js\";\n\nfunction linkSource(d) {\n  return d.source;\n}\n\nfunction linkTarget(d) {\n  return d.target;\n}\n\nfunction link(curve) {\n  var source = linkSource,\n      target = linkTarget,\n      x = pointX,\n      y = pointY,\n      context = null;\n\n  function link() {\n    var buffer, argv = slice.call(arguments), s = source.apply(this, argv), t = target.apply(this, argv);\n    if (!context) context = buffer = path();\n    curve(context, +x.apply(this, (argv[0] = s, argv)), +y.apply(this, argv), +x.apply(this, (argv[0] = t, argv)), +y.apply(this, argv));\n    if (buffer) return context = null, buffer + \"\" || null;\n  }\n\n  link.source = function(_) {\n    return arguments.length ? (source = _, link) : source;\n  };\n\n  link.target = function(_) {\n    return arguments.length ? (target = _, link) : target;\n  };\n\n  link.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), link) : x;\n  };\n\n  link.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), link) : y;\n  };\n\n  link.context = function(_) {\n    return arguments.length ? ((context = _ == null ? null : _), link) : context;\n  };\n\n  return link;\n}\n\nfunction curveHorizontal(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0 = (x0 + x1) / 2, y0, x0, y1, x1, y1);\n}\n\nfunction curveVertical(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0, y0 = (y0 + y1) / 2, x1, y0, x1, y1);\n}\n\nfunction curveRadial(context, x0, y0, x1, y1) {\n  var p0 = pointRadial(x0, y0),\n      p1 = pointRadial(x0, y0 = (y0 + y1) / 2),\n      p2 = pointRadial(x1, y0),\n      p3 = pointRadial(x1, y1);\n  context.moveTo(p0[0], p0[1]);\n  context.bezierCurveTo(p1[0], p1[1], p2[0], p2[1], p3[0], p3[1]);\n}\n\nexport function linkHorizontal() {\n  return link(curveHorizontal);\n}\n\nexport function linkVertical() {\n  return link(curveVertical);\n}\n\nexport function linkRadial() {\n  var l = link(curveRadial);\n  l.angle = l.x, delete l.x;\n  l.radius = l.y, delete l.y;\n  return l;\n}\n"],"names":["linkSource","d","linkTarget","link","curve","source","target","x","pointX","y","pointY","context","buffer","argv","slice","s","t","path","_","constant","curveHorizontal","x0","y0","x1","y1","curveVertical","curveRadial","p0","pointRadial","p1","p2","p3","linkHorizontal","linkVertical","linkRadial","l"],"mappings":"iPAMA,SAASA,EAAWC,EAAG,CACrB,OAAOA,EAAE,MACX,CAEA,SAASC,EAAWD,EAAG,CACrB,OAAOA,EAAE,MACX,CAEA,SAASE,EAAKC,EAAO,CACf,IAAAC,EAASL,EACTM,EAASJ,EACTK,EAAIC,EACJ,EAAAC,EAAIC,EAAAA,EACJC,EAAU,KAEd,SAASR,GAAO,CACd,IAAIS,EAAQC,EAAOC,EAAA,MAAM,KAAK,SAAS,EAAGC,EAAIV,EAAO,MAAM,KAAMQ,CAAI,EAAGG,EAAIV,EAAO,MAAM,KAAMO,CAAI,EAG/F,GAFCF,IAASA,EAAUC,EAASK,KACjCb,EAAMO,EAAS,CAACJ,EAAE,MAAM,MAAOM,EAAK,CAAC,EAAIE,EAAGF,EAAK,EAAG,CAACJ,EAAE,MAAM,KAAMI,CAAI,EAAG,CAACN,EAAE,MAAM,MAAOM,EAAK,CAAC,EAAIG,EAAGH,EAAK,EAAG,CAACJ,EAAE,MAAM,KAAMI,CAAI,CAAC,EAC/HD,EAAe,OAAAD,EAAU,KAAMC,EAAS,IAAM,IACpD,CAEAT,OAAAA,EAAK,OAAS,SAASe,EAAG,CACxB,OAAO,UAAU,QAAUb,EAASa,EAAGf,GAAQE,CAAA,EAGjDF,EAAK,OAAS,SAASe,EAAG,CACxB,OAAO,UAAU,QAAUZ,EAASY,EAAGf,GAAQG,CAAA,EAGjDH,EAAK,EAAI,SAASe,EAAG,CACZ,OAAA,UAAU,QAAUX,EAAI,OAAOW,GAAM,WAAaA,EAAIC,EAAS,CAACD,CAAC,EAAGf,GAAQI,CAAA,EAGrFJ,EAAK,EAAI,SAASe,EAAG,CACZ,OAAA,UAAU,QAAUT,EAAI,OAAOS,GAAM,WAAaA,EAAIC,EAAS,CAACD,CAAC,EAAGf,GAAQM,CAAA,EAGrFN,EAAK,QAAU,SAASe,EAAG,CACzB,OAAO,UAAU,QAAWP,EAAUO,GAAY,KAAWf,GAAQQ,CAAA,EAGhER,CACT,CAEA,SAASiB,EAAgBT,EAASU,EAAIC,EAAIC,EAAIC,EAAI,CACxCb,EAAA,OAAOU,EAAIC,CAAE,EACbX,EAAA,cAAcU,GAAMA,EAAKE,GAAM,EAAGD,EAAID,EAAIG,EAAID,EAAIC,CAAE,CAC9D,CAEA,SAASC,EAAcd,EAASU,EAAIC,EAAIC,EAAIC,EAAI,CACtCb,EAAA,OAAOU,EAAIC,CAAE,EACbX,EAAA,cAAcU,EAAIC,GAAMA,EAAKE,GAAM,EAAGD,EAAID,EAAIC,EAAIC,CAAE,CAC9D,CAEA,SAASE,EAAYf,EAASU,EAAIC,EAAIC,EAAIC,EAAI,CACxC,IAAAG,EAAKC,EAAYP,EAAIC,CAAE,EACvBO,EAAKD,EAAYP,EAAIC,GAAMA,EAAKE,GAAM,CAAC,EACvCM,EAAKF,EAAYL,EAAID,CAAE,EACvBS,EAAKH,EAAYL,EAAIC,CAAE,EAC3Bb,EAAQ,OAAOgB,EAAG,CAAC,EAAGA,EAAG,CAAC,CAAC,EAC3BhB,EAAQ,cAAckB,EAAG,CAAC,EAAGA,EAAG,CAAC,EAAGC,EAAG,CAAC,EAAGA,EAAG,CAAC,EAAGC,EAAG,CAAC,EAAGA,EAAG,CAAC,CAAC,CAChE,CAEO,SAASC,GAAiB,CAC/B,OAAO7B,EAAKiB,CAAe,CAC7B,CAEO,SAASa,GAAe,CAC7B,OAAO9B,EAAKsB,CAAa,CAC3B,CAEO,SAASS,GAAa,CACvB,IAAAC,EAAIhC,EAAKuB,CAAW,EACxB,OAAAS,EAAE,MAAQA,EAAE,EAAG,OAAOA,EAAE,EACxBA,EAAE,OAASA,EAAE,EAAG,OAAOA,EAAE,EAClBA,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs174.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index.cjs255.js"),o=require("./index.cjs256.js");var s=function(){function r(e){if(arguments.length===0)throw new TypeError("Failed to construct 'ResizeObserver': 1 argument required, but only 0 present.");if(typeof e!="function")throw new TypeError("Failed to construct 'ResizeObserver': The callback provided as parameter 1 is not a function.");t.ResizeObserverController.connect(this,e)}return r.prototype.observe=function(e,n){if(arguments.length===0)throw new TypeError("Failed to execute 'observe' on 'ResizeObserver': 1 argument required, but only 0 present.");if(!o.isElement(e))throw new TypeError("Failed to execute 'observe' on 'ResizeObserver': parameter 1 is not of type 'Element");t.ResizeObserverController.observe(this,e,n)},r.prototype.unobserve=function(e){if(arguments.length===0)throw new TypeError("Failed to execute 'unobserve' on 'ResizeObserver': 1 argument required, but only 0 present.");if(!o.isElement(e))throw new TypeError("Failed to execute 'unobserve' on 'ResizeObserver': parameter 1 is not of type 'Element");t.ResizeObserverController.unobserve(this,e)},r.prototype.disconnect=function(){t.ResizeObserverController.disconnect(this)},r.toString=function(){return"function ResizeObserver () { [polyfill code] }"},r}();exports.ResizeObserver=s;
+"use strict";var v=Math.PI,p=2*v,c=1e-6,C=p-c;function y(){this._x0=this._y0=this._x1=this._y1=null,this._=""}function g(){return new y}y.prototype=g.prototype={constructor:y,moveTo:function(i,s){this._+="M"+(this._x0=this._x1=+i)+","+(this._y0=this._y1=+s)},closePath:function(){this._x1!==null&&(this._x1=this._x0,this._y1=this._y0,this._+="Z")},lineTo:function(i,s){this._+="L"+(this._x1=+i)+","+(this._y1=+s)},quadraticCurveTo:function(i,s,t,h){this._+="Q"+ +i+","+ +s+","+(this._x1=+t)+","+(this._y1=+h)},bezierCurveTo:function(i,s,t,h,_,e){this._+="C"+ +i+","+ +s+","+ +t+","+ +h+","+(this._x1=+_)+","+(this._y1=+e)},arcTo:function(i,s,t,h,_){i=+i,s=+s,t=+t,h=+h,_=+_;var e=this._x1,M=this._y1,f=t-i,a=h-s,n=e-i,u=M-s,o=n*n+u*u;if(_<0)throw new Error("negative radius: "+_);if(this._x1===null)this._+="M"+(this._x1=i)+","+(this._y1=s);else if(o>c)if(!(Math.abs(u*f-a*n)>c)||!_)this._+="L"+(this._x1=i)+","+(this._y1=s);else{var r=t-e,l=h-M,d=f*f+a*a,q=r*r+l*l,b=Math.sqrt(d),T=Math.sqrt(o),A=_*Math.tan((v-Math.acos((d+o-q)/(2*b*T)))/2),x=A/T,L=A/b;Math.abs(x-1)>c&&(this._+="L"+(i+x*n)+","+(s+x*u)),this._+="A"+_+","+_+",0,0,"+ +(u*r>n*l)+","+(this._x1=i+L*f)+","+(this._y1=s+L*a)}},arc:function(i,s,t,h,_,e){i=+i,s=+s,t=+t,e=!!e;var M=t*Math.cos(h),f=t*Math.sin(h),a=i+M,n=s+f,u=1^e,o=e?h-_:_-h;if(t<0)throw new Error("negative radius: "+t);this._x1===null?this._+="M"+a+","+n:(Math.abs(this._x1-a)>c||Math.abs(this._y1-n)>c)&&(this._+="L"+a+","+n),t&&(o<0&&(o=o%p+p),o>C?this._+="A"+t+","+t+",0,1,"+u+","+(i-M)+","+(s-f)+"A"+t+","+t+",0,1,"+u+","+(this._x1=a)+","+(this._y1=n):o>c&&(this._+="A"+t+","+t+",0,"+ +(o>=v)+","+u+","+(this._x1=i+t*Math.cos(_))+","+(this._y1=s+t*Math.sin(_))))},rect:function(i,s,t,h){this._+="M"+(this._x0=this._x1=+i)+","+(this._y0=this._y1=+s)+"h"+ +t+"v"+ +h+"h"+-t+"Z"},toString:function(){return this._}};module.exports=g;
 //# sourceMappingURL=index.cjs174.js.map