@marimo-team/islands 0.13.16-dev2 → 0.13.16-dev21

package/dist/{layout-Qs-BVu8V.js → layout-BUA-DPJm.js}

@@ -1,7 +1,7 @@
-import { G as g } from "./graph-BFerxzEi.js";
-import { b as Re, h as fe, j as ce, d as W, c as f, i as m, f as P, v as x, r as M } from "./_baseUniq-C1K8a5jF.js";
-import { b as le, a as Te, c as Ie, m as w, d as N, h as he, f as q, l as T, e as Me } from "./min-BTA1UVkn.js";
-import { aU as Se, av as je, aV as Fe, aD as ve, aC as K, az as F, aA as pe, aW as Ve, aX as Ae, x as Be, au as Q, y as Ge, aY as Ye, aZ as De, a_ as _, a$ as E, A as $e, b0 as I, b1 as D } from "./main-Cx3zrED9.js";
+import { G as g } from "./graph-BXO6Y4fK.js";
+import { b as Re, h as fe, j as ce, d as W, c as f, i as m, f as P, v as x, r as M } from "./_baseUniq-BPYian-Y.js";
+import { b as le, a as Te, c as Ie, m as w, d as N, h as he, f as q, l as T, e as Me } from "./min-D_xIH6wU.js";
+import { aU as Se, av as je, aV as Fe, aD as ve, aC as K, az as F, aA as pe, aW as Ve, aX as Ae, x as Be, au as Q, y as Ge, aY as Ye, aZ as De, a_ as _, a$ as E, A as $e, b0 as I, b1 as D } from "./main-D-37AaR4.js";
 var We = 1, qe = 4;
 function ze(e) {
   return Re(e, We | qe);
@@ -140,7 +140,7 @@ function dn(e, n, r) {
     if (e.nodeCount()) {
       for (var u = n.length - 2; u > 0; --u)
         if (o = n[u].dequeue(), o) {
-          t = t.concat(V(e, n, r, o, !0));
+          t = t.concat(V(e, n, r, o, true));
           break;
         }
     }
@@ -179,7 +179,7 @@ function fn(e) {
   var n = e.graph().acyclicer === "greedy" ? un(e, r(e)) : cn(e);
   f(n, function(t) {
     var a = e.edge(t);
-    e.removeEdge(t), a.forwardName = t.name, a.reversed = !0, e.setEdge(t.w, t.v, a, X("rev"));
+    e.removeEdge(t), a.forwardName = t.name, a.reversed = true, e.setEdge(t.w, t.v, a, X("rev"));
   });
   function r(t) {
     return function(a) {
@@ -190,7 +190,7 @@ function fn(e) {
 function cn(e) {
   var n = [], r = {}, t = {};
   function a(i) {
-    Object.prototype.hasOwnProperty.call(t, i) || (t[i] = !0, r[i] = !0, f(e.outEdges(i), function(o) {
+    Object.prototype.hasOwnProperty.call(t, i) || (t[i] = true, r[i] = true, f(e.outEdges(i), function(o) {
       Object.prototype.hasOwnProperty.call(r, o.w) ? n.push(o) : a(o.w);
     }), delete r[i]);
   }
@@ -393,7 +393,7 @@ function U(e) {
     var a = e.node(t);
     if (Object.prototype.hasOwnProperty.call(n, t))
       return a.rank;
-    n[t] = !0;
+    n[t] = true;
     var i = N(
       w(e.outEdges(t), function(o) {
         return r(o.w) - e.edge(o).minlen;
@@ -409,7 +409,7 @@ function C(e, n) {
   return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
 }
 function ge(e) {
-  var n = new g({ directed: !1 }), r = e.nodes()[0], t = e.nodeCount();
+  var n = new g({ directed: false }), r = e.nodes()[0], t = e.nodeCount();
   n.setNode(r, {});
   for (var a, i; Nn(n, e) < t; )
     a = Cn(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), Pn(n, e, i);
@@ -448,7 +448,7 @@ function ye(e, n, r) {
   }), a;
 }
 function ke(e, n, r, t, a, i) {
-  Object.prototype.hasOwnProperty.call(t, n) || (t[n] = !0, r || i.push(n), f(a(n), function(o) {
+  Object.prototype.hasOwnProperty.call(t, n) || (t[n] = true, r || i.push(n), f(a(n), function(o) {
     ke(e, o, r, t, a, i);
   }), r && i.push(n));
 }
@@ -482,8 +482,8 @@ function In(e, n, r) {
   e.edge(r, a).cutvalue = xe(e, n, r);
 }
 function xe(e, n, r) {
-  var t = e.node(r), a = t.parent, i = !0, o = n.edge(r, a), u = 0;
-  return o || (i = !1, o = n.edge(a, r)), u = o.weight, f(n.nodeEdges(r), function(d) {
+  var t = e.node(r), a = t.parent, i = true, o = n.edge(r, a), u = 0;
+  return o || (i = false, o = n.edge(a, r)), u = o.weight, f(n.nodeEdges(r), function(d) {
     var s = d.v === r, c = s ? d.w : d.v;
     if (c !== a) {
       var l = s === i, h = n.edge(d).weight;
@@ -499,7 +499,7 @@ function Z(e, n) {
 }
 function Ee(e, n, r, t, a) {
   var i = r, o = e.node(t);
-  return n[t] = !0, f(e.neighbors(t), function(u) {
+  return n[t] = true, f(e.neighbors(t), function(u) {
     Object.prototype.hasOwnProperty.call(n, u) || (r = Ee(e, n, r, u, t));
   }), o.low = i, o.lim = r++, a ? o.parent = a : delete o.parent, r;
 }
@@ -511,8 +511,8 @@ function Oe(e) {
 function Le(e, n, r) {
   var t = r.v, a = r.w;
   n.hasEdge(t, a) || (t = r.w, a = r.v);
-  var i = e.node(t), o = e.node(a), u = i, d = !1;
-  i.lim > o.lim && (u = o, d = !0);
+  var i = e.node(t), o = e.node(a), u = i, d = false;
+  i.lim > o.lim && (u = o, d = true);
   var s = P(n.edges(), function(c) {
     return d === ie(e, e.node(c.v), u) && d !== ie(e, e.node(c.w), u);
   });
@@ -529,8 +529,8 @@ function Mn(e, n) {
     return !n.node(a).parent;
   }), t = Tn(e, r);
   t = t.slice(1), f(t, function(a) {
-    var i = e.node(a).parent, o = n.edge(a, i), u = !1;
-    o || (o = n.edge(i, a), u = !0), n.node(a).rank = n.node(i).rank + (u ? o.minlen : -o.minlen);
+    var i = e.node(a).parent, o = n.edge(a, i), u = false;
+    o || (o = n.edge(i, a), u = true), n.node(a).rank = n.node(i).rank + (u ? o.minlen : -o.minlen);
   });
 }
 function Sn(e, n, r) {
@@ -584,11 +584,11 @@ function Ce(e, n, r, t, a, i, o) {
     e.setEdge(d, v, {
       weight: b,
       minlen: L,
-      nestingEdge: !0
+      nestingEdge: true
     }), e.setEdge(p, s, {
       weight: b,
       minlen: L,
-      nestingEdge: !0
+      nestingEdge: true
     });
   }), e.parent(o) || e.setEdge(n, d, { weight: 0, minlen: a + i[o] });
 }
@@ -633,7 +633,7 @@ function Dn(e, n, r) {
   });
 }
 function $n(e, n, r) {
-  var t = Wn(e), a = new g({ compound: !0 }).setGraph({ root: t }).setDefaultNodeLabel(function(i) {
+  var t = Wn(e), a = new g({ compound: true }).setGraph({ root: t }).setDefaultNodeLabel(function(i) {
     return e.node(i);
   });
   return f(e.nodes(), function(i) {
@@ -700,7 +700,7 @@ function Xn(e) {
   });
   function i(u) {
     if (!he(n, u)) {
-      n[u] = !0;
+      n[u] = true;
       var d = e.node(u);
       a[d.rank].push(u), f(e.successors(u), i);
     }
@@ -781,7 +781,7 @@ function Zn(e) {
 }
 function Jn(e, n) {
   var r = 0, t = 0;
-  e.weight && (r += e.barycenter * e.weight, t += e.weight), n.weight && (r += n.barycenter * n.weight, t += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = r / t, e.weight = t, e.i = Math.min(n.i, e.i), n.merged = !0;
+  e.weight && (r += e.barycenter * e.weight, t += e.weight), n.weight && (r += n.barycenter * n.weight, t += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = r / t, e.weight = t, e.i = Math.min(n.i, e.i), n.merged = true;
 }
 function Kn(e, n) {
   var r = wn(e, function(c) {
@@ -872,11 +872,11 @@ function se(e, n) {
 function ar(e) {
   var n = or(e);
   f(e.graph().dummyChains, function(r) {
-    for (var t = e.node(r), a = t.edgeObj, i = ir(e, n, a.v, a.w), o = i.path, u = i.lca, d = 0, s = o[d], c = !0; r !== a.w; ) {
+    for (var t = e.node(r), a = t.edgeObj, i = ir(e, n, a.v, a.w), o = i.path, u = i.lca, d = 0, s = o[d], c = true; r !== a.w; ) {
       if (t = e.node(r), c) {
         for (; (s = o[d]) !== u && e.node(s).maxRank < t.rank; )
           d++;
-        s === u && (c = !1);
+        s === u && (c = false);
       }
       if (!c) {
         for (; d < o.length - 1 && e.node(s = o[d + 1]).minRank <= t.rank; )
@@ -956,7 +956,7 @@ function _e(e, n, r) {
     n = r, r = t;
   }
   var a = e[n];
-  a || (e[n] = a = {}), a[r] = !0;
+  a || (e[n] = a = {}), a[r] = true;
 }
 function fr(e, n, r) {
   if (n > r) {
@@ -991,7 +991,7 @@ function lr(e, n, r, t, a) {
   var i = {}, o = hr(e, n, r, a), u = a ? "borderLeft" : "borderRight";
   function d(l, h) {
     for (var v = o.nodes(), p = v.pop(), b = {}; p; )
-      b[p] ? l(p) : (b[p] = !0, v.push(p), v = v.concat(h(p))), p = v.pop();
+      b[p] ? l(p) : (b[p] = true, v.push(p), v = v.concat(h(p))), p = v.pop();
   }
   function s(l) {
     i[l] = o.inEdges(l).reduce(function(h, v) {
@@ -1142,7 +1142,7 @@ var Or = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Lr = { ranksep
   labelpos: "r"
 }, Tr = ["labelpos"];
 function Ir(e) {
-  var n = new g({ multigraph: !0, compound: !0 }), r = Y(e.graph());
+  var n = new g({ multigraph: true, compound: true }), r = Y(e.graph());
   return n.setGraph(
     D({}, Lr, G(r, Or), I(r, Nr))
   ), f(e.nodes(), function(t) {

package/dist/{linear-SIbCb7yI.js → linear-BnTRnU3J.js}

@@ -1,5 +1,5 @@
 import { x, y as h, z as v, A as S, B as d } from "./timer-BYwnU4DF.js";
-import { a6 as M, aK as B, af as D, aL as F, aM as P, aN as z, aO as I, aP as L, aQ as O, aR as V, aS as $ } from "./main-Cx3zrED9.js";
+import { a6 as M, aK as B, af as D, aL as F, aM as P, aN as z, aO as I, aP as L, aQ as O, aR as V, aS as $ } from "./main-D-37AaR4.js";
 import { i as q } from "./init-DxzjmxYy.js";
 function K(n) {
   return n === null ? NaN : +n;
@@ -123,7 +123,7 @@ function Y() {
   }, l.rangeRound = function(o) {
     return r = Array.from(o), e = E, m();
   }, l.clamp = function(o) {
-    return arguments.length ? (a = o ? !0 : p, m()) : a !== p;
+    return arguments.length ? (a = o ? true : p, m()) : a !== p;
   }, l.interpolate = function(o) {
     return arguments.length ? (e = o, m()) : e;
   }, l.unknown = function(o) {