@digipair/skill-web-chatbot 0.113.1 → 0.114.2

package/{layout-fd473db2.cjs.js → dist/layout-fd473db2.cjs.js}

@@ -19,7 +19,6 @@ function _defineProperties(target, props) {
 }
 function _create_class(Constructor, protoProps, staticProps) {
     if (protoProps) _defineProperties(Constructor.prototype, protoProps);
-    if (staticProps) _defineProperties(Constructor, staticProps);
     return Constructor;
 }
 var de = /\s/;
@@ -59,7 +58,7 @@ function be(n) {
 }
 function _(n) {
     var e = n == null ? 0 : n.length;
-    return e ? graph0ee63739.Se(n, 1) : [];
+    return e ? graph0ee63739.Se(n) : [];
 }
 function ge(n) {
     return index.l0(index.Qm(n, void 0, _), n + "");
@@ -68,10 +67,6 @@ var xe = 1, Ee = 4;
 function ke(n) {
     return graph0ee63739.j(n, xe | Ee);
 }
-var ye = function ye() {
-    return index.Dt.Date.now();
-};
-var fn = ye;
 var Rn = Object.prototype, Ne = Rn.hasOwnProperty, Le = index.h0(function(n, e) {
     n = Object(n);
     var r = -1, t = e.length, i = t > 2 ? e[2] : void 0;
@@ -160,7 +155,7 @@ function Se(n, e, r, t) {
         if (d === "__proto__" || d === "constructor" || d === "prototype") return n;
         if (i != a) {
             var c = u[d];
-            f = t ? t(c, d, u) : void 0, f === void 0 && (f = index.ye(c) ? c : index.Za(e[i + 1]) ? [] : {});
+            f = void 0, f === void 0 && (f = index.ye(c) ? c : index.Za(e[i + 1]) ? [] : {});
         }
         index.Rm(u, d, f), u = u[d];
     }
@@ -232,12 +227,12 @@ var Ye = ge(function(n, e) {
 var G = Ye;
 var De = Math.ceil, qe = Math.max;
 function We(n, e, r, t) {
-    for(var i = -1, o = qe(De((e - n) / (r || 1)), 0), a = Array(o); o--;)a[t ? o : ++i] = n, n += r;
+    for(var i = -1, o = qe(De((e - n) / (r || 1)), 0), a = Array(o); o--;)a[++i] = n, n += r;
     return a;
 }
 function Xe(n) {
     return function(e, r, t) {
-        return t && typeof t != "number" && index.c0(e, r, t) && (r = t = void 0), e = S(e), r === void 0 ? (r = e, e = 0) : r = S(r), t = t === void 0 ? e < r ? 1 : -1 : S(t), We(e, r, t, n);
+        return t && typeof t != "number" && index.c0(e, r, t) && (r = t = void 0), e = S(e), r === void 0 ? (r = e, e = 0) : r = S(r), t = t === void 0 ? e < r ? 1 : -1 : S(t), We(e, r, t);
     };
 }
 var ze = Xe();
@@ -247,7 +242,7 @@ var Ue = index.h0(function(n, e) {
     var r = e.length;
     return r > 1 && index.c0(n, e[0], e[1]) ? e = [] : r > 2 && index.c0(e[0], e[1], e[2]) && (e = [
         e[0]
-    ]), Ge(n, graph0ee63739.Se(e, 1), []);
+    ]), Ge(n, graph0ee63739.Se(e), []);
 });
 var O = Ue;
 var He = 0;
@@ -316,7 +311,7 @@ function er(n, e, r) {
         for(; a = i.dequeue();)q(n, e, r, a);
         if (n.nodeCount()) {
             for(var u = e.length - 2; u > 0; --u)if (a = e[u].dequeue(), a) {
-                t = t.concat(q(n, e, r, a, !0));
+                t = t.concat(q(n, e, r, a, true));
                 break;
             }
         }
@@ -366,7 +361,7 @@ function tr(n) {
     var e = n.graph().acyclicer === "greedy" ? nr(n, r(n)) : ir(n);
     graph0ee63739.m(e, function(t) {
         var i = n.edge(t);
-        n.removeEdge(t), i.forwardName = t.name, i.reversed = !0, n.setEdge(t.w, t.v, i, en("rev"));
+        n.removeEdge(t), i.forwardName = t.name, i.reversed = true, n.setEdge(t.w, t.v, i, en("rev"));
     });
     function r(t) {
         return function(i) {
@@ -377,7 +372,7 @@ function tr(n) {
 function ir(n) {
     var e = [], r = {}, t = {};
     function i(o) {
-        graph0ee63739.E(t, o) || (t[o] = !0, r[o] = !0, graph0ee63739.m(n.outEdges(o), function(a) {
+        graph0ee63739.E(t, o) || (t[o] = true, r[o] = true, graph0ee63739.m(n.outEdges(o), function(a) {
             graph0ee63739.E(r, a.w) ? e.push(a) : i(a.w);
         }), delete r[o]);
     }
@@ -488,14 +483,6 @@ function fr(n, e) {
         e(t) ? r.lhs.push(t) : r.rhs.push(t);
     }), r;
 }
-function sr(n, e) {
-    var r = fn();
-    try {
-        return e();
-    } finally{
-        console.log(n + " time: " + (fn() - r) + "ms");
-    }
-}
 function cr(n, e) {
     return e();
 }
@@ -600,7 +587,7 @@ function rn(n) {
     function r(t) {
         var i = n.node(t);
         if (graph0ee63739.E(e, t)) return i.rank;
-        e[t] = !0;
+        e[t] = true;
         var o = R(m(n.outEdges(t), function(a) {
             return r(a.w) - n.edge(a).minlen;
         }));
@@ -615,7 +602,7 @@ function T(n, e) {
 }
 function Fn(n) {
     var e = new graph0ee63739.Ze({
-        directed: !1
+        directed: false
     }), r = n.nodes()[0], t = n.nodeCount();
     e.setNode(r, {});
     for(var i, o; xr(e, n) < t;)i = Er(e, n), o = e.hasNode(i.v) ? T(n, i) : -T(n, i), kr(e, n, o);
@@ -651,7 +638,7 @@ function An(n, e, r) {
     }), i;
 }
 function Bn(n, e, r, t, i, o) {
-    graph0ee63739.E(t, e) || (t[e] = !0, r || o.push(e), graph0ee63739.m(i(e), function(a) {
+    graph0ee63739.E(t, e) || (t[e] = true, r || o.push(e), graph0ee63739.m(i(e), function(a) {
         Bn(n, a, r, t, i, o);
     }), r && o.push(e));
 }
@@ -684,8 +671,8 @@ function _r(n, e, r) {
     n.edge(r, i).cutvalue = $n(n, e, r);
 }
 function $n(n, e, r) {
-    var t = n.node(r), i = t.parent, o = !0, a = e.edge(r, i), u = 0;
-    return a || (o = !1, a = e.edge(i, r)), u = a.weight, graph0ee63739.m(e.nodeEdges(r), function(d) {
+    var t = n.node(r), i = t.parent, o = true, a = e.edge(r, i), u = 0;
+    return a || (o = false, a = e.edge(i, r)), u = a.weight, graph0ee63739.m(e.nodeEdges(r), function(d) {
         var f = d.v === r, c = f ? d.w : d.v;
         if (c !== i) {
             var h = f === o, l = e.edge(d).weight;
@@ -701,7 +688,7 @@ function an(n, e) {
 }
 function Gn(n, e, r, t, i) {
     var o = r, a = n.node(t);
-    return e[t] = !0, graph0ee63739.m(n.neighbors(t), function(u) {
+    return e[t] = true, graph0ee63739.m(n.neighbors(t), function(u) {
         graph0ee63739.E(e, u) || (r = Gn(n, e, r, u, t));
     }), a.low = o, a.lim = r++, i ? a.parent = i : delete a.parent, r;
 }
@@ -713,8 +700,8 @@ function Vn(n) {
 function Yn(n, e, r) {
     var t = r.v, i = r.w;
     e.hasEdge(t, i) || (t = r.w, i = r.v);
-    var o = n.node(t), a = n.node(i), u = o, d = !1;
-    o.lim > a.lim && (u = a, d = !0);
+    var o = n.node(t), a = n.node(i), u = o, d = false;
+    o.lim > a.lim && (u = a, d = true);
     var f = graph0ee63739.D(e.edges(), function(c) {
         return d === pn(n, n.node(c.v), u) && d !== pn(n, n.node(c.w), u);
     });
@@ -731,8 +718,8 @@ function Cr(n, e) {
         return !e.node(i).parent;
     }), t = Lr(n, r);
     t = t.slice(1), graph0ee63739.m(t, function(i) {
-        var o = n.node(i).parent, a = e.edge(i, o), u = !1;
-        a || (a = e.edge(o, i), u = !0), e.node(i).rank = e.node(o).rank + (u ? a.minlen : -a.minlen);
+        var o = n.node(i).parent, a = e.edge(i, o), u = false;
+        a || (a = e.edge(o, i), u = true), e.node(i).rank = e.node(o).rank + (u ? a.minlen : -a.minlen);
     });
 }
 function Ir(n, e, r) {
@@ -789,11 +776,11 @@ function qn(n, e, r, t, i, o, a) {
         n.setEdge(d, v, {
             weight: b,
             minlen: I,
-            nestingEdge: !0
+            nestingEdge: true
         }), n.setEdge(p, f, {
             weight: b,
             minlen: I,
-            nestingEdge: !0
+            nestingEdge: true
         });
     }), n.parent(a) || n.setEdge(e, d, {
         weight: 0,
@@ -838,7 +825,7 @@ function Ar(n, e, r) {
 }
 function Br(n, e, r) {
     var t = $r(n), i = new graph0ee63739.Ze({
-        compound: !0
+        compound: true
     }).setGraph({
         root: t
     }).setDefaultNodeLabel(function(o) {
@@ -899,7 +886,7 @@ function Yr(n) {
     });
     function o(u) {
         if (!graph0ee63739.E(e, u)) {
-            e[u] = !0;
+            e[u] = true;
             var d = n.node(u);
             i[d.rank].push(u), graph0ee63739.m(n.successors(u), o);
         }
@@ -984,7 +971,7 @@ function Wr(n) {
 }
 function Xr(n, e) {
     var r = 0, t = 0;
-    n.weight && (r += n.barycenter * n.weight, t += n.weight), e.weight && (r += e.barycenter * e.weight, t += e.weight), n.vs = e.vs.concat(n.vs), n.barycenter = r / t, n.weight = t, n.i = Math.min(e.i, n.i), e.merged = !0;
+    n.weight && (r += n.barycenter * n.weight, t += n.weight), e.weight && (r += e.barycenter * e.weight, t += e.weight), n.vs = e.vs.concat(n.vs), n.barycenter = r / t, n.weight = t, n.i = Math.min(e.i, n.i), e.merged = true;
 }
 function zr(n, e) {
     var r = fr(n, function(c) {
@@ -1078,10 +1065,10 @@ function gn(n, e) {
 function Zr(n) {
     var e = nt(n);
     graph0ee63739.m(n.graph().dummyChains, function(r) {
-        for(var t = n.node(r), i = t.edgeObj, o = Qr(n, e, i.v, i.w), a = o.path, u = o.lca, d = 0, f = a[d], c = !0; r !== i.w;){
+        for(var t = n.node(r), i = t.edgeObj, o = Qr(n, e, i.v, i.w), a = o.path, u = o.lca, d = 0, f = a[d], c = true; r !== i.w;){
             if (t = n.node(r), c) {
                 for(; (f = a[d]) !== u && n.node(f).maxRank < t.rank;)d++;
-                f === u && (c = !1);
+                f === u && (c = false);
             }
             if (!c) {
                 for(; d < a.length - 1 && n.node(f = a[d + 1]).minRank <= t.rank;)d++;
@@ -1163,7 +1150,7 @@ function Xn(n, e, r) {
         e = r, r = t;
     }
     var i = n[e];
-    i || (n[e] = i = {}), i[r] = !0;
+    i || (n[e] = i = {}), i[r] = true;
 }
 function it(n, e, r) {
     if (e > r) {
@@ -1200,7 +1187,7 @@ function at(n, e, r, t) {
 function ot(n, e, r, t, i) {
     var o = {}, a = ut(n, e, r, i), u = i ? "borderLeft" : "borderRight";
     function d(h, l) {
-        for(var v = a.nodes(), p = v.pop(), b = {}; p;)b[p] ? h(p) : (b[p] = !0, v.push(p), v = v.concat(l(p))), p = v.pop();
+        for(var v = a.nodes(), p = v.pop(), b = {}; p;)b[p] ? h(p) : (b[p] = true, v.push(p), v = v.concat(l(p))), p = v.pop();
     }
     function f(h) {
         o[h] = a.inEdges(h).reduce(function(l, v) {
@@ -1331,7 +1318,7 @@ function pt(n) {
     });
 }
 function Yt(n, e) {
-    var r = e && e.debugTiming ? sr : cr;
+    var r = cr;
     r("layout", function() {
         var t = r("  buildLayoutGraph", function() {
             return _t(n);
@@ -1449,8 +1436,8 @@ var bt = [
 ];
 function _t(n) {
     var e = new graph0ee63739.Ze({
-        multigraph: !0,
-        compound: !0
+        multigraph: true,
+        compound: true
     }), r = U(n.graph());
     return e.setGraph(index.d0({}, gt, z(r, bt), G(r, xt))), graph0ee63739.m(n.nodes(), function(t) {
         var i = U(n.node(t));

package/{layout-fd473db2.esm.js → dist/layout-fd473db2.esm.js}

@@ -1,5 +1,5 @@
-import { S as Se$1, v as ve$1, m as m$1, Z as Ze$1, e as ee, Y as Ye$1, D as Dt, C as Ce$1, H, X as Xt, j as j$1, B as Bt$1, I as Ie$1, a as It$1, b as v, E as E$1, c as D$1, Q as Q$1, U as U$1, P as Pn$1, T as T$1, d as cn$1 } from './graph-0ee63739.esm.js';
-import { l as h0, ab as c0, a0 as Ja, a9 as br$1, ac as l0, ad as Qm, T as tl, ae as d0, v as vr$1, r as rr$1, a6 as Mm, af as Dt$1, ag as Dn$1, C as ye$1, Z as Za, a3 as Rm, W as Mg, m as t0 } from './index.esm2.js';
+import { S as Se$1, m as m$1, Z as Ze$1, a as ve$1, C as Ce$1, Y as Ye$1, H, D as Dt, e as ee, X as Xt, v, b as D$1, j as j$1, P as Pn$1, Q as Q$1, I as Ie$1, U as U$1, T as T$1, B as Bt$1, c as It$1, E as E$1, d as cn$1 } from './graph-0ee63739.esm.js';
+import { a8 as h0, a9 as c0, aa as Ja, ab as br$1, ac as d0, ad as l0, ae as Qm, af as rr$1, ag as tl, ah as Mm, ai as vr$1, aj as ye, ak as Za, al as Rm, am as Dn$1, an as t0, ao as Mg } from './index.esm2.js';
 
 function _class_call_check(instance, Constructor) {
     if (!(instance instanceof Constructor)) {
@@ -17,7 +17,6 @@ function _defineProperties(target, props) {
 }
 function _create_class(Constructor, protoProps, staticProps) {
     if (protoProps) _defineProperties(Constructor.prototype, protoProps);
-    if (staticProps) _defineProperties(Constructor, staticProps);
     return Constructor;
 }
 var de = /\s/;
@@ -33,9 +32,9 @@ var un = 0 / 0, he = /^[-+]0x[0-9a-f]+$/i, le = /^0b[01]+$/i, ve = /^0o[0-7]+$/i
 function we(n) {
     if (typeof n == "number") return n;
     if (Q$1(n)) return un;
-    if (ye$1(n)) {
+    if (ye(n)) {
         var e = typeof n.valueOf == "function" ? n.valueOf() : n;
-        n = ye$1(e) ? e + "" : e;
+        n = ye(e) ? e + "" : e;
     }
     if (typeof n != "string") return n === 0 ? n : +n;
     n = ce(n);
@@ -57,7 +56,7 @@ function be(n) {
 }
 function _(n) {
     var e = n == null ? 0 : n.length;
-    return e ? Se$1(n, 1) : [];
+    return e ? Se$1(n) : [];
 }
 function ge(n) {
     return l0(Qm(n, void 0, _), n + "");
@@ -66,10 +65,6 @@ var xe = 1, Ee = 4;
 function ke(n) {
     return j$1(n, xe | Ee);
 }
-var ye = function ye() {
-    return Dt$1.Date.now();
-};
-var fn = ye;
 var Rn = Object.prototype, Ne = Rn.hasOwnProperty, Le = h0(function(n, e) {
     n = Object(n);
     var r = -1, t = e.length, i = t > 2 ? e[2] : void 0;
@@ -151,14 +146,14 @@ function nn(n, e) {
     return n && n.length ? Q(n, Ye$1(e), Mn) : void 0;
 }
 function Se(n, e, r, t) {
-    if (!ye$1(n)) return n;
+    if (!ye(n)) return n;
     e = Ie$1(e, n);
     for(var i = -1, o = e.length, a = o - 1, u = n; u != null && ++i < o;){
         var d = U$1(e[i]), f = r;
         if (d === "__proto__" || d === "constructor" || d === "prototype") return n;
         if (i != a) {
             var c = u[d];
-            f = t ? t(c, d, u) : void 0, f === void 0 && (f = ye$1(c) ? c : Za(e[i + 1]) ? [] : {});
+            f = void 0, f === void 0 && (f = ye(c) ? c : Za(e[i + 1]) ? [] : {});
         }
         Rm(u, d, f), u = u[d];
     }
@@ -230,12 +225,12 @@ var Ye = ge(function(n, e) {
 var G = Ye;
 var De = Math.ceil, qe = Math.max;
 function We(n, e, r, t) {
-    for(var i = -1, o = qe(De((e - n) / (r || 1)), 0), a = Array(o); o--;)a[t ? o : ++i] = n, n += r;
+    for(var i = -1, o = qe(De((e - n) / (r || 1)), 0), a = Array(o); o--;)a[++i] = n, n += r;
     return a;
 }
 function Xe(n) {
     return function(e, r, t) {
-        return t && typeof t != "number" && c0(e, r, t) && (r = t = void 0), e = S(e), r === void 0 ? (r = e, e = 0) : r = S(r), t = t === void 0 ? e < r ? 1 : -1 : S(t), We(e, r, t, n);
+        return t && typeof t != "number" && c0(e, r, t) && (r = t = void 0), e = S(e), r === void 0 ? (r = e, e = 0) : r = S(r), t = t === void 0 ? e < r ? 1 : -1 : S(t), We(e, r, t);
     };
 }
 var ze = Xe();
@@ -245,7 +240,7 @@ var Ue = h0(function(n, e) {
     var r = e.length;
     return r > 1 && c0(n, e[0], e[1]) ? e = [] : r > 2 && c0(e[0], e[1], e[2]) && (e = [
         e[0]
-    ]), Ge(n, Se$1(e, 1), []);
+    ]), Ge(n, Se$1(e), []);
 });
 var O = Ue;
 var He = 0;
@@ -314,7 +309,7 @@ function er(n, e, r) {
         for(; a = i.dequeue();)q(n, e, r, a);
         if (n.nodeCount()) {
             for(var u = e.length - 2; u > 0; --u)if (a = e[u].dequeue(), a) {
-                t = t.concat(q(n, e, r, a, !0));
+                t = t.concat(q(n, e, r, a, true));
                 break;
             }
         }
@@ -364,7 +359,7 @@ function tr(n) {
     var e = n.graph().acyclicer === "greedy" ? nr(n, r(n)) : ir(n);
     m$1(e, function(t) {
         var i = n.edge(t);
-        n.removeEdge(t), i.forwardName = t.name, i.reversed = !0, n.setEdge(t.w, t.v, i, en("rev"));
+        n.removeEdge(t), i.forwardName = t.name, i.reversed = true, n.setEdge(t.w, t.v, i, en("rev"));
     });
     function r(t) {
         return function(i) {
@@ -375,7 +370,7 @@ function tr(n) {
 function ir(n) {
     var e = [], r = {}, t = {};
     function i(o) {
-        E$1(t, o) || (t[o] = !0, r[o] = !0, m$1(n.outEdges(o), function(a) {
+        E$1(t, o) || (t[o] = true, r[o] = true, m$1(n.outEdges(o), function(a) {
             E$1(r, a.w) ? e.push(a) : i(a.w);
         }), delete r[o]);
     }
@@ -486,14 +481,6 @@ function fr(n, e) {
         e(t) ? r.lhs.push(t) : r.rhs.push(t);
     }), r;
 }
-function sr(n, e) {
-    var r = fn();
-    try {
-        return e();
-    } finally{
-        console.log(n + " time: " + (fn() - r) + "ms");
-    }
-}
 function cr(n, e) {
     return e();
 }
@@ -598,7 +585,7 @@ function rn(n) {
     function r(t) {
         var i = n.node(t);
         if (E$1(e, t)) return i.rank;
-        e[t] = !0;
+        e[t] = true;
         var o = R(m(n.outEdges(t), function(a) {
             return r(a.w) - n.edge(a).minlen;
         }));
@@ -613,7 +600,7 @@ function T(n, e) {
 }
 function Fn(n) {
     var e = new Ze$1({
-        directed: !1
+        directed: false
     }), r = n.nodes()[0], t = n.nodeCount();
     e.setNode(r, {});
     for(var i, o; xr(e, n) < t;)i = Er(e, n), o = e.hasNode(i.v) ? T(n, i) : -T(n, i), kr(e, n, o);
@@ -649,7 +636,7 @@ function An(n, e, r) {
     }), i;
 }
 function Bn(n, e, r, t, i, o) {
-    E$1(t, e) || (t[e] = !0, r || o.push(e), m$1(i(e), function(a) {
+    E$1(t, e) || (t[e] = true, r || o.push(e), m$1(i(e), function(a) {
         Bn(n, a, r, t, i, o);
     }), r && o.push(e));
 }
@@ -682,8 +669,8 @@ function _r(n, e, r) {
     n.edge(r, i).cutvalue = $n(n, e, r);
 }
 function $n(n, e, r) {
-    var t = n.node(r), i = t.parent, o = !0, a = e.edge(r, i), u = 0;
-    return a || (o = !1, a = e.edge(i, r)), u = a.weight, m$1(e.nodeEdges(r), function(d) {
+    var t = n.node(r), i = t.parent, o = true, a = e.edge(r, i), u = 0;
+    return a || (o = false, a = e.edge(i, r)), u = a.weight, m$1(e.nodeEdges(r), function(d) {
         var f = d.v === r, c = f ? d.w : d.v;
         if (c !== i) {
             var h = f === o, l = e.edge(d).weight;
@@ -699,7 +686,7 @@ function an(n, e) {
 }
 function Gn(n, e, r, t, i) {
     var o = r, a = n.node(t);
-    return e[t] = !0, m$1(n.neighbors(t), function(u) {
+    return e[t] = true, m$1(n.neighbors(t), function(u) {
         E$1(e, u) || (r = Gn(n, e, r, u, t));
     }), a.low = o, a.lim = r++, i ? a.parent = i : delete a.parent, r;
 }
@@ -711,8 +698,8 @@ function Vn(n) {
 function Yn(n, e, r) {
     var t = r.v, i = r.w;
     e.hasEdge(t, i) || (t = r.w, i = r.v);
-    var o = n.node(t), a = n.node(i), u = o, d = !1;
-    o.lim > a.lim && (u = a, d = !0);
+    var o = n.node(t), a = n.node(i), u = o, d = false;
+    o.lim > a.lim && (u = a, d = true);
     var f = D$1(e.edges(), function(c) {
         return d === pn(n, n.node(c.v), u) && d !== pn(n, n.node(c.w), u);
     });
@@ -729,8 +716,8 @@ function Cr(n, e) {
         return !e.node(i).parent;
     }), t = Lr(n, r);
     t = t.slice(1), m$1(t, function(i) {
-        var o = n.node(i).parent, a = e.edge(i, o), u = !1;
-        a || (a = e.edge(o, i), u = !0), e.node(i).rank = e.node(o).rank + (u ? a.minlen : -a.minlen);
+        var o = n.node(i).parent, a = e.edge(i, o), u = false;
+        a || (a = e.edge(o, i), u = true), e.node(i).rank = e.node(o).rank + (u ? a.minlen : -a.minlen);
     });
 }
 function Ir(n, e, r) {
@@ -787,11 +774,11 @@ function qn(n, e, r, t, i, o, a) {
         n.setEdge(d, v, {
             weight: b,
             minlen: I,
-            nestingEdge: !0
+            nestingEdge: true
         }), n.setEdge(p, f, {
             weight: b,
             minlen: I,
-            nestingEdge: !0
+            nestingEdge: true
         });
     }), n.parent(a) || n.setEdge(e, d, {
         weight: 0,
@@ -836,7 +823,7 @@ function Ar(n, e, r) {
 }
 function Br(n, e, r) {
     var t = $r(n), i = new Ze$1({
-        compound: !0
+        compound: true
     }).setGraph({
         root: t
     }).setDefaultNodeLabel(function(o) {
@@ -897,7 +884,7 @@ function Yr(n) {
     });
     function o(u) {
         if (!E$1(e, u)) {
-            e[u] = !0;
+            e[u] = true;
             var d = n.node(u);
             i[d.rank].push(u), m$1(n.successors(u), o);
         }
@@ -982,7 +969,7 @@ function Wr(n) {
 }
 function Xr(n, e) {
     var r = 0, t = 0;
-    n.weight && (r += n.barycenter * n.weight, t += n.weight), e.weight && (r += e.barycenter * e.weight, t += e.weight), n.vs = e.vs.concat(n.vs), n.barycenter = r / t, n.weight = t, n.i = Math.min(e.i, n.i), e.merged = !0;
+    n.weight && (r += n.barycenter * n.weight, t += n.weight), e.weight && (r += e.barycenter * e.weight, t += e.weight), n.vs = e.vs.concat(n.vs), n.barycenter = r / t, n.weight = t, n.i = Math.min(e.i, n.i), e.merged = true;
 }
 function zr(n, e) {
     var r = fr(n, function(c) {
@@ -1076,10 +1063,10 @@ function gn(n, e) {
 function Zr(n) {
     var e = nt(n);
     m$1(n.graph().dummyChains, function(r) {
-        for(var t = n.node(r), i = t.edgeObj, o = Qr(n, e, i.v, i.w), a = o.path, u = o.lca, d = 0, f = a[d], c = !0; r !== i.w;){
+        for(var t = n.node(r), i = t.edgeObj, o = Qr(n, e, i.v, i.w), a = o.path, u = o.lca, d = 0, f = a[d], c = true; r !== i.w;){
             if (t = n.node(r), c) {
                 for(; (f = a[d]) !== u && n.node(f).maxRank < t.rank;)d++;
-                f === u && (c = !1);
+                f === u && (c = false);
             }
             if (!c) {
                 for(; d < a.length - 1 && n.node(f = a[d + 1]).minRank <= t.rank;)d++;
@@ -1161,7 +1148,7 @@ function Xn(n, e, r) {
         e = r, r = t;
     }
     var i = n[e];
-    i || (n[e] = i = {}), i[r] = !0;
+    i || (n[e] = i = {}), i[r] = true;
 }
 function it(n, e, r) {
     if (e > r) {
@@ -1198,7 +1185,7 @@ function at(n, e, r, t) {
 function ot(n, e, r, t, i) {
     var o = {}, a = ut(n, e, r, i), u = i ? "borderLeft" : "borderRight";
     function d(h, l) {
-        for(var v = a.nodes(), p = v.pop(), b = {}; p;)b[p] ? h(p) : (b[p] = !0, v.push(p), v = v.concat(l(p))), p = v.pop();
+        for(var v = a.nodes(), p = v.pop(), b = {}; p;)b[p] ? h(p) : (b[p] = true, v.push(p), v = v.concat(l(p))), p = v.pop();
     }
     function f(h) {
         o[h] = a.inEdges(h).reduce(function(l, v) {
@@ -1329,7 +1316,7 @@ function pt(n) {
     });
 }
 function Yt(n, e) {
-    var r = e && e.debugTiming ? sr : cr;
+    var r = cr;
     r("layout", function() {
         var t = r("  buildLayoutGraph", function() {
             return _t(n);
@@ -1447,8 +1434,8 @@ var bt = [
 ];
 function _t(n) {
     var e = new Ze$1({
-        multigraph: !0,
-        compound: !0
+        multigraph: true,
+        compound: true
     }), r = U(n.graph());
     return e.setGraph(d0({}, gt, z(r, bt), G(r, xt))), m$1(n.nodes(), function(t) {
         var i = U(n.node(t));

package/{line-24d93f1b.cjs.js → dist/line-24d93f1b.cjs.js}

@@ -11,10 +11,10 @@ function b(t) {
     return t[1];
 }
 function P(t, u) {
-    var s = path428ebac9.P(!0), i = null, l = index.Df, r = null, m = path428ebac9.q(e);
+    var s = path428ebac9.P(true), i = null, l = index.Df, r = null, m = path428ebac9.q(e);
     t = typeof t == "function" ? t : t === void 0 ? w : path428ebac9.P(t), u = typeof u == "function" ? u : u === void 0 ? b : path428ebac9.P(u);
     function e(n) {
-        var f, g = (n = array2ff2c7a6.t(n)).length, p, c = !1, a;
+        var f, g = (n = array2ff2c7a6.t(n)).length, p, c = false, a;
         for(i == null && (r = l(a = m())), f = 0; f <= g; ++f)!(f < g && s(p = n[f], f, n)) === c && ((c = !c) ? r.lineStart() : r.lineEnd()), c && r.point(+t(p, f, n), +u(p, f, n));
         if (a) return r = null, a + "" || null;
     }

package/{line-24d93f1b.esm.js → dist/line-24d93f1b.esm.js}

@@ -9,10 +9,10 @@ function b(t) {
     return t[1];
 }
 function P(t$1, u) {
-    var s = P$1(!0), i = null, l = Df, r = null, m = q(e);
+    var s = P$1(true), i = null, l = Df, r = null, m = q(e);
     t$1 = typeof t$1 == "function" ? t$1 : t$1 === void 0 ? w : P$1(t$1), u = typeof u == "function" ? u : u === void 0 ? b : P$1(u);
     function e(n) {
-        var f, g = (n = t(n)).length, p, c = !1, a;
+        var f, g = (n = t(n)).length, p, c = false, a;
         for(i == null && (r = l(a = m())), f = 0; f <= g; ++f)!(f < g && s(p = n[f], f, n)) === c && ((c = !c) ? r.lineStart() : r.lineEnd()), c && r.point(+t$1(p, f, n), +u(p, f, n));
         if (a) return r = null, a + "" || null;
     }

package/{linear-9bcf74c4.cjs.js → dist/linear-9bcf74c4.cjs.js}

@@ -174,7 +174,7 @@ function vn(n, t) {
 }
 function Sn(n, t) {
     var e = {}, r = {}, i;
-    (n === null || typeof n != "object") && (n = {}), (t === null || typeof t != "object") && (t = {});
+    (n === null || (typeof n === "undefined" ? "undefined" : _type_of(n)) != "object") && (n = {}), (t === null || (typeof t === "undefined" ? "undefined" : _type_of(t)) != "object") && (t = {});
     for(i in t)i in n ? e[i] = C(n[i], t[i]) : r[i] = t[i];
     return function(f) {
         for(i in e)r[i] = e[i](f);
@@ -314,7 +314,7 @@ var K = Array.prototype.map, Q = [
     "f",
     "p",
     "n",
-    "\xb5",
+    "µ",
     "m",
     "",
     "k",
@@ -331,7 +331,7 @@ function En(n) {
     function o(h) {
         h = D(h);
         var s = h.fill, p = h.align, y = h.sign, S = h.symbol, k = h.zero, b = h.width, T = h.comma, w = h.precision, G = h.trim, d = h.type;
-        d === "n" ? (T = !0, d = "g") : H[d] || (w === void 0 && (w = 12), G = !0, d = "g"), (k || s === "0" && p === "=") && (k = !0, s = "0", p = "=");
+        d === "n" ? (T = true, d = "g") : H[d] || (w === void 0 && (w = 12), G = true, d = "g"), (k || s === "0" && p === "=") && (k = true, s = "0", p = "=");
         var en = S === "$" ? e : S === "#" && /[boxX]/.test(d) ? "0" + d.toLowerCase() : "", on = S === "$" ? r : /[%p]/.test(d) ? a : "", O = H[d], an = /[defgprs%]/.test(d);
         w = w === void 0 ? 6 : /[gprs]/.test(d) ? Math.max(1, Math.min(21, w)) : Math.max(0, Math.min(20, w));
         function V(m) {
@@ -340,7 +340,7 @@ function En(n) {
             else {
                 m = +m;
                 var P = m < 0 || 1 / m < 0;
-                if (m = isNaN(m) ? c : O(Math.abs(m), w), G && (m = Fn(m)), P && +m == 0 && y !== "+" && (P = !1), N = (P ? y === "(" ? y : u : y === "-" || y === "(" ? "" : y) + N, g = (d === "s" ? Q[8 + nn / 3] : "") + g + (P && y === "(" ? ")" : ""), an) {
+                if (m = isNaN(m) ? c : O(Math.abs(m), w), G && (m = Fn(m)), P && +m == 0 && y !== "+" && (P = false), N = (P ? y === "(" ? y : u : y === "-" || y === "(" ? "" : y) + N, g = (d === "s" ? Q[8 + nn / 3] : "") + g + (P && y === "(" ? ")" : ""), an) {
                     for(x = -1, X = m.length; ++x < X;)if (j = m.charCodeAt(x), 48 > j || j > 57) {
                         g = (j === 46 ? i + m.slice(x + 1) : m.slice(x)) + g, m = m.slice(0, x);
                         break;
@@ -464,7 +464,7 @@ function Xn() {
     }, h.rangeRound = function(s) {
         return t = Array.from(s), e = bn, l();
     }, h.clamp = function(s) {
-        return arguments.length ? (a = s ? !0 : A, l()) : a !== A;
+        return arguments.length ? (a = s ? true : A, l()) : a !== A;
     }, h.interpolate = function(s) {
         return arguments.length ? (e = s, l()) : e;
     }, h.unknown = function(s) {

package/{linear-9bcf74c4.esm.js → dist/linear-9bcf74c4.esm.js}

@@ -1,4 +1,4 @@
-import { aF as te, aG as vn$1, aH as oi, aI as Mo, aJ as _u } from './index.esm2.js';
+import { Y as te, a0 as vn$1, a1 as Mo, a2 as _u, a3 as oi } from './index.esm2.js';
 import { t } from './init-f9637058.esm.js';
 
 function _array_like_to_array(arr, len) {
@@ -172,7 +172,7 @@ function vn(n, t) {
 }
 function Sn(n, t) {
     var e = {}, r = {}, i;
-    (n === null || typeof n != "object") && (n = {}), (t === null || typeof t != "object") && (t = {});
+    (n === null || (typeof n === "undefined" ? "undefined" : _type_of(n)) != "object") && (n = {}), (t === null || (typeof t === "undefined" ? "undefined" : _type_of(t)) != "object") && (t = {});
     for(i in t)i in n ? e[i] = C(n[i], t[i]) : r[i] = t[i];
     return function(f) {
         for(i in e)r[i] = e[i](f);
@@ -312,7 +312,7 @@ var K = Array.prototype.map, Q = [
     "f",
     "p",
     "n",
-    "\xb5",
+    "µ",
     "m",
     "",
     "k",
@@ -329,7 +329,7 @@ function En(n) {
     function o(h) {
         h = D(h);
         var s = h.fill, p = h.align, y = h.sign, S = h.symbol, k = h.zero, b = h.width, T = h.comma, w = h.precision, G = h.trim, d = h.type;
-        d === "n" ? (T = !0, d = "g") : H[d] || (w === void 0 && (w = 12), G = !0, d = "g"), (k || s === "0" && p === "=") && (k = !0, s = "0", p = "=");
+        d === "n" ? (T = true, d = "g") : H[d] || (w === void 0 && (w = 12), G = true, d = "g"), (k || s === "0" && p === "=") && (k = true, s = "0", p = "=");
         var en = S === "$" ? e : S === "#" && /[boxX]/.test(d) ? "0" + d.toLowerCase() : "", on = S === "$" ? r : /[%p]/.test(d) ? a : "", O = H[d], an = /[defgprs%]/.test(d);
         w = w === void 0 ? 6 : /[gprs]/.test(d) ? Math.max(1, Math.min(21, w)) : Math.max(0, Math.min(20, w));
         function V(m) {
@@ -338,7 +338,7 @@ function En(n) {
             else {
                 m = +m;
                 var P = m < 0 || 1 / m < 0;
-                if (m = isNaN(m) ? c : O(Math.abs(m), w), G && (m = Fn(m)), P && +m == 0 && y !== "+" && (P = !1), N = (P ? y === "(" ? y : u : y === "-" || y === "(" ? "" : y) + N, g = (d === "s" ? Q[8 + nn / 3] : "") + g + (P && y === "(" ? ")" : ""), an) {
+                if (m = isNaN(m) ? c : O(Math.abs(m), w), G && (m = Fn(m)), P && +m == 0 && y !== "+" && (P = false), N = (P ? y === "(" ? y : u : y === "-" || y === "(" ? "" : y) + N, g = (d === "s" ? Q[8 + nn / 3] : "") + g + (P && y === "(" ? ")" : ""), an) {
                     for(x = -1, X = m.length; ++x < X;)if (j = m.charCodeAt(x), 48 > j || j > 57) {
                         g = (j === 46 ? i + m.slice(x + 1) : m.slice(x)) + g, m = m.slice(0, x);
                         break;
@@ -462,7 +462,7 @@ function Xn() {
     }, h.rangeRound = function(s) {
         return t = Array.from(s), e = bn, l();
     }, h.clamp = function(s) {
-        return arguments.length ? (a = s ? !0 : A, l()) : a !== A;
+        return arguments.length ? (a = s ? true : A, l()) : a !== A;
     }, h.interpolate = function(s) {
         return arguments.length ? (e = s, l()) : e;
     }, h.unknown = function(s) {