@marimo-team/islands 0.23.17-dev54 → 0.23.17-dev56

package/dist/d-D50Bz34p.js

@@ -0,0 +1,4 @@
+import { t as d } from "./d-HXBWOoe9.js";
+export {
+  d
+};

package/dist/{dagre-By_QsQgc.js → dagre-ThTNj8pe.js}

@@ -1,14 +1,13 @@
-import { C as isArray_default, T as _baseGetTag_default, g as eq_default, m as isArrayLike_default, t as _baseFor_default, u as _baseUnary_default, w as isObjectLike_default, x as identity_default } from "./_baseFor-4jw-lnCC.js";
-import { t as isSymbol_default } from "./isSymbol-CoUCgMCM.js";
-import { d as _arrayMap_default, l as toString_default, n as _hasPath_default, o as _baseGet_default, r as _baseFlatten_default } from "./hasIn-Deg7jl_j.js";
-import { n as toNumber_default, t as now_default } from "./now-Ch98bJO_.js";
-import { i as _baseKeys_default, n as _getTag_default } from "./isEmpty-CJJMn-QP.js";
-import { c as keysIn_default, g as constant_default, l as _isIterateeCall_default, m as _baseAssignValue_default, p as _assignValue_default, t as merge_default, u as _baseRest_default } from "./merge-Be1CqGnU.js";
-import { a as _castFunction_default, c as _baseIteratee_default, h as _baseFindIndex_default, i as forEach_default, l as _baseProperty_default, m as keys_default, n as reduce_default, r as filter_default, s as _baseForOwn_default } from "./_baseUniq-B_2Hw7zG.js";
-import { t as flatten_default } from "./flatten-Bbw7g6-K.js";
-import { t as pick_default } from "./pick-D1Qo8s2C.js";
-import { i as _baseClone_default, n as isUndefined_default, r as values_default, t as Graph } from "./graphlib-Ns7y5crs.js";
-import { a as _baseMap_default, i as map_default, n as _baseExtremum_default, r as _baseLt_default, t as min_default } from "./min-Dtgc8txR.js";
+import { A as isObjectLike_default, C as constant_default, D as identity_default, _ as _baseRest_default, d as _baseUnary_default, h as isArrayLike_default, j as _baseGetTag_default, k as isArray_default, n as _baseFor_default, y as eq_default } from "./isArrayLikeObject-CBUaLibE.js";
+import { t as isSymbol_default } from "./isSymbol-Ch3GYg4S.js";
+import { d as _arrayMap_default, l as toString_default, n as _hasPath_default, o as _baseGet_default, r as _baseFlatten_default } from "./hasIn-synBnXn4.js";
+import { n as toNumber_default, t as now_default } from "./now-sFWt-GLC.js";
+import { i as _baseKeys_default, n as _getTag_default } from "./isEmpty-CgME6WRV.js";
+import { c as _assignValue_default, l as _baseAssignValue_default, o as keysIn_default } from "./_initCloneObject-DNUst5Cg.js";
+import { _ as _baseFindIndex_default, a as filter_default, d as _baseProperty_default, g as keys_default, i as values_default, l as _baseForOwn_default, n as reduce_default, o as forEach_default, r as isUndefined_default, s as _castFunction_default, t as Graph, u as _baseIteratee_default } from "./graphlib-DMVIRZap.js";
+import { n as _isIterateeCall_default, t as merge_default } from "./merge-CDbSrd9f.js";
+import { r as flatten_default, t as pick_default } from "./pick-CaEWivSF.js";
+import { n as _baseMap_default, r as _baseClone_default, t as map_default } from "./map-BQ_Xp80D.js";
 var INFINITY = Infinity, MAX_INTEGER = 17976931348623157e292;
 function toFinite(d) {
   return d ? (d = toNumber_default(d), d === INFINITY || d === -INFINITY ? (d < 0 ? -1 : 1) * MAX_INTEGER : d === d ? d : 0) : d === 0 ? d : 0;
@@ -28,10 +27,10 @@ function cloneDeep(d) {
 }
 var cloneDeep_default = cloneDeep, objectProto = Object.prototype, hasOwnProperty$1 = objectProto.hasOwnProperty, defaults_default = _baseRest_default(function(d, B) {
   d = Object(d);
-  var H = -1, U = B.length, W = U > 2 ? B[2] : void 0;
-  for (W && _isIterateeCall_default(B[0], B[1], W) && (U = 1); ++H < U; ) for (var G = B[H], K = keysIn_default(G), q = -1, J = K.length; ++q < J; ) {
-    var Y = K[q], X = d[Y];
-    (X === void 0 || eq_default(X, objectProto[Y]) && !hasOwnProperty$1.call(d, Y)) && (d[Y] = G[Y]);
+  var V = -1, H = B.length, U = H > 2 ? B[2] : void 0;
+  for (U && _isIterateeCall_default(B[0], B[1], U) && (H = 1); ++V < H; ) for (var W = B[V], G = keysIn_default(W), K = -1, q = G.length; ++K < q; ) {
+    var Y = G[K], X = d[Y];
+    (X === void 0 || eq_default(X, objectProto[Y]) && !hasOwnProperty$1.call(d, Y)) && (d[Y] = W[Y]);
   }
   return d;
 });
@@ -41,16 +40,16 @@ function last(d) {
 }
 var last_default = last;
 function createFind(d) {
-  return function(B, V, U) {
-    var W = Object(B);
+  return function(B, V, H) {
+    var U = Object(B);
     if (!isArrayLike_default(B)) {
       var G = _baseIteratee_default(V, 3);
       B = keys_default(B), V = function(d2) {
-        return G(W[d2], d2, W);
+        return G(U[d2], d2, U);
       };
     }
-    var K = d(B, V, U);
-    return K > -1 ? W[G ? B[K] : K] : void 0;
+    var K = d(B, V, H);
+    return K > -1 ? U[G ? B[K] : K] : void 0;
   };
 }
 var _createFind_default = createFind, nativeMax$1 = Math.max;
@@ -81,10 +80,14 @@ function has(d, B) {
   return d != null && _hasPath_default(d, B, _baseHas_default);
 }
 var has_default = has, stringTag = "[object String]";
-function isString(V) {
-  return typeof V == "string" || !isArray_default(V) && isObjectLike_default(V) && _baseGetTag_default(V) == stringTag;
+function isString(B) {
+  return typeof B == "string" || !isArray_default(B) && isObjectLike_default(B) && _baseGetTag_default(B) == stringTag;
 }
 var isString_default = isString;
+function baseLt(d, B) {
+  return d < B;
+}
+var _baseLt_default = baseLt;
 function mapValues(d, B) {
   var V = {};
   return B = _baseIteratee_default(B, 3), _baseForOwn_default(d, function(d2, H, U) {
@@ -92,10 +95,22 @@ function mapValues(d, B) {
   }), V;
 }
 var mapValues_default = mapValues;
+function baseExtremum(d, B, V) {
+  for (var H = -1, U = d.length; ++H < U; ) {
+    var W = d[H], G = B(W);
+    if (G != null && (K === void 0 ? G === G && !isSymbol_default(G) : V(G, K))) var K = G, q = W;
+  }
+  return q;
+}
+var _baseExtremum_default = baseExtremum;
 function max(d) {
   return d && d.length ? _baseExtremum_default(d, identity_default, _baseGt_default) : void 0;
 }
 var max_default = max;
+function min(d) {
+  return d && d.length ? _baseExtremum_default(d, identity_default, _baseLt_default) : void 0;
+}
+var min_default = min;
 function minBy(d, B) {
   return d && d.length ? _baseExtremum_default(d, _baseIteratee_default(B, 2), _baseLt_default) : void 0;
 }
@@ -108,9 +123,9 @@ function baseSortBy(d, B) {
 var _baseSortBy_default = baseSortBy;
 function compareAscending(d, B) {
   if (d !== B) {
-    var V = d !== void 0, H = d === null, U = d === d, W = isSymbol_default(d), G = B !== void 0, K = B === null, J = B === B, Y = isSymbol_default(B);
-    if (!K && !Y && !W && d > B || W && G && J && !K && !Y || H && G && J || !V && J || !U) return 1;
-    if (!H && !W && !Y && d < B || Y && V && U && !H && !W || K && V && U || !G && U || !J) return -1;
+    var V = d !== void 0, H = d === null, U = d === d, W = isSymbol_default(d), G = B !== void 0, K = B === null, q = B === B, J = isSymbol_default(B);
+    if (!K && !J && !W && d > B || W && G && q && !K && !J || H && G && q || !V && q || !U) return 1;
+    if (!H && !W && !J && d < B || J && V && U && !H && !W || K && V && U || !G && U || !q) return -1;
   }
   return 0;
 }
@@ -123,23 +138,23 @@ function compareMultiple(d, B, V) {
   return d.index - B.index;
 }
 var _compareMultiple_default = compareMultiple;
-function baseOrderBy(B, V, H) {
-  V = V.length ? _arrayMap_default(V, function(B2) {
-    return isArray_default(B2) ? function(d) {
-      return _baseGet_default(d, B2.length === 1 ? B2[0] : B2);
-    } : B2;
+function baseOrderBy(d, B, H) {
+  B = B.length ? _arrayMap_default(B, function(d2) {
+    return isArray_default(d2) ? function(B2) {
+      return _baseGet_default(B2, d2.length === 1 ? d2[0] : d2);
+    } : d2;
   }) : [identity_default];
-  var U = -1;
-  return V = _arrayMap_default(V, _baseUnary_default(_baseIteratee_default)), _baseSortBy_default(_baseMap_default(B, function(d, B2, H2) {
+  var W = -1;
+  return B = _arrayMap_default(B, _baseUnary_default(_baseIteratee_default)), _baseSortBy_default(_baseMap_default(d, function(d2, V, H2) {
     return {
-      criteria: _arrayMap_default(V, function(B3) {
-        return B3(d);
+      criteria: _arrayMap_default(B, function(B2) {
+        return B2(d2);
       }),
-      index: ++U,
-      value: d
+      index: ++W,
+      value: d2
     };
-  }), function(d, B2) {
-    return _compareMultiple_default(d, B2, H);
+  }), function(d2, B2) {
+    return _compareMultiple_default(d2, B2, H);
   });
 }
 var _baseOrderBy_default = baseOrderBy, _asciiSize_default = _baseProperty_default("length"), rsAstralRange = "\\ud800-\\udfff", rsComboRange = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff", rsVarRange = "\\ufe0e\\ufe0f", rsAstral = "[" + rsAstralRange + "]", rsCombo = "[" + rsComboRange + "]", rsFitz = "\\ud83c[\\udffb-\\udfff]", rsModifier = "(?:" + rsCombo + "|" + rsFitz + ")", rsNonAstral = "[^" + rsAstralRange + "]", rsRegional = "(?:\\ud83c[\\udde6-\\uddff]){2}", rsSurrPair = "[\\ud800-\\udbff][\\udc00-\\udfff]", rsZWJ = "\\u200d", reOptMod = rsModifier + "?", rsOptVar = "[" + rsVarRange + "]?", rsOptJoin = "(?:" + rsZWJ + "(?:" + [
@@ -563,13 +578,13 @@ function topsort(d) {
 function CycleException() {
 }
 CycleException.prototype = /* @__PURE__ */ Error();
-function dfs$1(B, V, H) {
-  isArray_default(V) || (V = [V]);
-  var U = (B.isDirected() ? B.successors : B.neighbors).bind(B), W = [], G = {};
-  return forEach_default(V, function(d) {
-    if (!B.hasNode(d)) throw Error("Graph does not have node: " + d);
-    doDfs(B, d, H === "post", G, U, W);
-  }), W;
+function dfs$1(d, B, V) {
+  isArray_default(B) || (B = [B]);
+  var H = (d.isDirected() ? d.successors : d.neighbors).bind(d), U = [], W = {};
+  return forEach_default(B, function(B2) {
+    if (!d.hasNode(B2)) throw Error("Graph does not have node: " + B2);
+    doDfs(d, B2, V === "post", W, H, U);
+  }), U;
 }
 function doDfs(d, B, V, H, U, W) {
   Object.prototype.hasOwnProperty.call(H, B) || (H[B] = true, V || W.push(B), forEach_default(U(B), function(B2) {

package/dist/dagre-VZM6K2ZE-DEs5dfXA.js

@@ -0,0 +1,343 @@
+import { t as layout } from "./dagre-ThTNj8pe.js";
+import { t as Graph } from "./graphlib-DMVIRZap.js";
+import { a as sortNodesByHierarchy, i as findNonClusterChild, n as clear, o as write, r as clusterDb, t as adjustClustersAndEdges } from "./chunk-RYQCIY6F-poA0Ugpr.js";
+import "./purify.es-DR5PNXwx.js";
+import "./chunk-NSK5VX7P-BmmoJBbx.js";
+import { n as log } from "./src-BwVZVGyf.js";
+import { n as __name } from "./chunk-Y2CYZVJY-DX3DSigL.js";
+import { x as getConfig2 } from "./chunk-I66GZJ75-9xAsFrdW.js";
+import "./chunk-W5SLKNZC-DK-_KuKT.js";
+import "./dist-HaLHv0k5.js";
+import { n as getSubGraphTitleMargins } from "./chunk-UBXNYLIW-C8LueN5Q.js";
+import "./chunk-4I5QYGJK-CYJC3pkC.js";
+import "./chunk-WRU74C26-DLgw-V0j.js";
+import { a as insertNode, c as positionNode, i as insertCluster, l as setNodeElem, n as clear2, t as clear$2, u as updateNodeBounds } from "./chunk-QR6OTTB3-C4L1dLRd.js";
+import "./chunk-7BUUIJ7U-CkIbJNZo.js";
+import { a as markers_default, i as insertEdgeLabel, o as positionEdgeLabel, r as insertEdge, t as clear$1 } from "./chunk-7Z6QIM7H-1j-x7ddW.js";
+var clamp = /* @__PURE__ */ __name((e, l, u) => Math.max(l, Math.min(u, e)), "clamp"), getDefaultSelfLoopSide = /* @__PURE__ */ __name((e = "TB") => {
+  switch (e) {
+    case "BT":
+      return "bottom";
+    case "LR":
+      return "right";
+    case "RL":
+      return "left";
+    case "TB":
+    default:
+      return "top";
+  }
+}, "getDefaultSelfLoopSide"), shouldMergeSelfLoopSegments = /* @__PURE__ */ __name((e) => e === "flowchart" || e === "flowchart-v2" || e === "stateDiagram", "shouldMergeSelfLoopSegments"), getSelfLoopSide = /* @__PURE__ */ __name((e, l, u, d, f) => {
+  let p = [], m = /* @__PURE__ */ new Set();
+  if (u.forEach(({ start: e2, end: l2 }) => {
+    e2 !== d && m.add(e2), l2 !== d && m.add(l2);
+  }), m.forEach((l2) => {
+    let u2 = e.node(l2);
+    typeof (u2 == null ? void 0 : u2.x) == "number" && typeof (u2 == null ? void 0 : u2.y) == "number" && p.push(u2);
+  }), p.length === 0 && u.forEach(({ edge: e2 }) => {
+    (e2.points ?? []).forEach((e3) => {
+      typeof (e3 == null ? void 0 : e3.x) == "number" && typeof (e3 == null ? void 0 : e3.y) == "number" && p.push(e3);
+    });
+  }), p.length === 0) return getDefaultSelfLoopSide(f);
+  let h = p.reduce((e2, l2) => ({
+    x: e2.x + l2.x / p.length,
+    y: e2.y + l2.y / p.length
+  }), {
+    x: 0,
+    y: 0
+  }), g = h.x - l.x, _ = h.y - l.y;
+  return Math.abs(g) > Math.abs(_) ? g > 0 ? "right" : "left" : Math.abs(_) > 0 ? _ > 0 ? "bottom" : "top" : getDefaultSelfLoopSide(f);
+}, "getSelfLoopSide"), getSelfLoopPoints = /* @__PURE__ */ __name((e, l = "top", u = 0, d = 0) => {
+  let f = e.x, p = e.y - u, m = e.width / 2, h = e.height / 2, g = Math.max(36, Math.min(100, e.width * 0.8)), _ = clamp(Math.max(d, e.width * 0.35), 36, g), v = clamp(Math.min(e.width, e.height) * 0.45, 24, 48);
+  switch (l) {
+    case "bottom": {
+      let e2 = p + h;
+      return [
+        {
+          x: f - _ / 2,
+          y: e2
+        },
+        {
+          x: f - _ / 2,
+          y: e2 + v
+        },
+        {
+          x: f + _ / 2,
+          y: e2 + v
+        },
+        {
+          x: f + _ / 2,
+          y: e2
+        }
+      ];
+    }
+    case "right": {
+      let e2 = f + m;
+      return [
+        {
+          x: e2,
+          y: p - _ / 2
+        },
+        {
+          x: e2 + v,
+          y: p - _ / 2
+        },
+        {
+          x: e2 + v,
+          y: p + _ / 2
+        },
+        {
+          x: e2,
+          y: p + _ / 2
+        }
+      ];
+    }
+    case "left": {
+      let e2 = f - m;
+      return [
+        {
+          x: e2,
+          y: p - _ / 2
+        },
+        {
+          x: e2 - v,
+          y: p - _ / 2
+        },
+        {
+          x: e2 - v,
+          y: p + _ / 2
+        },
+        {
+          x: e2,
+          y: p + _ / 2
+        }
+      ];
+    }
+    case "top":
+    default: {
+      let e2 = p - h;
+      return [
+        {
+          x: f - _ / 2,
+          y: e2
+        },
+        {
+          x: f - _ / 2,
+          y: e2 - v
+        },
+        {
+          x: f + _ / 2,
+          y: e2 - v
+        },
+        {
+          x: f + _ / 2,
+          y: e2
+        }
+      ];
+    }
+  }
+}, "getSelfLoopPoints"), getSelfLoopLabelPosition = /* @__PURE__ */ __name((e, l, u = "top", d = 0, f = {}) => {
+  let p = e.x, m = e.y - d, h = f.width ?? 0, g = f.height ?? 0;
+  switch (u) {
+    case "bottom":
+      return {
+        x: p,
+        y: Math.max(...l.map((e2) => e2.y)) + g / 2 + 4
+      };
+    case "right":
+      return {
+        x: Math.max(...l.map((e2) => e2.x)) + h / 2 + 4,
+        y: m
+      };
+    case "left":
+      return {
+        x: Math.min(...l.map((e2) => e2.x)) - h / 2 - 4,
+        y: m
+      };
+    case "top":
+    default:
+      return {
+        x: p,
+        y: Math.min(...l.map((e2) => e2.y)) - g / 2 - 4
+      };
+  }
+}, "getSelfLoopLabelPosition"), getEdgesToRender = /* @__PURE__ */ __name((e, l = 0, { mergeSelfLoops: u = true } = {}) => {
+  var _a;
+  let d = /* @__PURE__ */ new Map(), f = [], p = (_a = e.graph()) == null ? void 0 : _a.rankdir;
+  return e.edges().forEach((l2) => {
+    let p2 = e.edge(l2);
+    if (u && p2.selfLoop) {
+      let e2 = p2.selfLoop.id;
+      d.has(e2) || d.set(e2, []), d.get(e2).push({
+        edge: p2,
+        start: l2.v,
+        end: l2.w
+      });
+    } else f.push({
+      edge: p2,
+      start: l2.v,
+      end: l2.w
+    });
+  }), d.forEach((u2) => {
+    if (u2.length !== 3) {
+      u2.forEach((e2) => f.push(e2));
+      return;
+    }
+    u2.sort((e2, l2) => e2.edge.selfLoop.order - l2.edge.selfLoop.order);
+    let [d2, m, h] = u2, g = d2.edge.originalEdge ?? m.edge.originalEdge ?? h.edge.originalEdge ?? m.edge, _ = e.node(g.start);
+    if (!_) {
+      u2.forEach((e2) => f.push(e2));
+      return;
+    }
+    let v = {
+      width: m.edge.width,
+      height: m.edge.height
+    }, y = getSelfLoopSide(e, _, u2, g.start, p), b = getSelfLoopPoints(_, y, l, v.width ?? 0), x = getSelfLoopLabelPosition(_, b, y, l, v), S = {
+      ...m.edge,
+      ...g,
+      id: g.id,
+      points: b,
+      start: g.start,
+      end: g.end,
+      x: x.x,
+      y: x.y,
+      width: v.width,
+      height: v.height,
+      labelStyle: m.edge.labelStyle,
+      fromCluster: d2.edge.fromCluster ?? m.edge.fromCluster ?? h.edge.fromCluster,
+      toCluster: d2.edge.toCluster ?? m.edge.toCluster ?? h.edge.toCluster
+    };
+    delete S.selfLoop, delete S.originalEdge, f.push({
+      edge: S,
+      start: S.start,
+      end: S.end
+    });
+  }), f;
+}, "getEdgesToRender"), recursiveRender = /* @__PURE__ */ __name(async (l, f, h, v, C, w) => {
+  log.warn("Graph in recursive render:XAX", write(f), C);
+  let T = f.graph().rankdir;
+  log.trace("Dir in recursive render - dir:", T);
+  let E = l.insert("g").attr("class", "root");
+  f.nodes() ? log.info("Recursive render XXX", f.nodes()) : log.info("No nodes found for", f), f.edges().length > 0 && log.info("Recursive edges", f.edge(f.edges()[0]));
+  let D = E.insert("g").attr("class", "clusters"), O = E.insert("g").attr("class", "edgePaths"), k = E.insert("g").attr("class", "edgeLabels"), A = E.insert("g").attr("class", "nodes"), j = shouldMergeSelfLoopSegments(h);
+  await Promise.all(f.nodes().map(async function(e) {
+    let l2 = f.node(e);
+    if (C !== void 0) {
+      let l3 = JSON.parse(JSON.stringify(C.clusterData));
+      log.trace("Setting data for parent cluster XXX\n Node.id = ", e, "\n data=", l3.height, "\nParent cluster", C.height), f.setNode(C.id, l3), f.parent(e) || (log.trace("Setting parent", e, C.id), f.setParent(e, C.id, l3));
+    }
+    if (log.info("(Insert) Node XXX" + e + ": " + JSON.stringify(f.node(e))), l2 == null ? void 0 : l2.clusterNode) {
+      log.info("Cluster identified XBX", e, l2.width, f.node(e));
+      let { ranksep: u, nodesep: d } = f.graph();
+      l2.graph.setGraph({
+        ...l2.graph.graph(),
+        ranksep: u + 25,
+        nodesep: d
+      });
+      let p = await recursiveRender(A, l2.graph, h, v, f.node(e), w), m = p.elem;
+      updateNodeBounds(l2, m), l2.diff = p.diff || 0, log.info("New compound node after recursive render XAX", e, "width", l2.width, "height", l2.height), setNodeElem(m, l2);
+    } else f.children(e).length > 0 ? (log.trace("Cluster - the non recursive path XBX", e, l2.id, l2, l2.width, "Graph:", f), log.trace(findNonClusterChild(l2.id, f)), clusterDb.set(l2.id, {
+      id: findNonClusterChild(l2.id, f),
+      node: l2
+    })) : (log.trace("Node - the non recursive path XAX", e, A, f.node(e), T), await insertNode(A, f.node(e), {
+      config: w,
+      dir: T
+    }));
+  })), await (/* @__PURE__ */ __name(async () => {
+    let e = f.edges().map(async function(e2) {
+      let l2 = f.edge(e2.v, e2.w, e2.name);
+      if (log.info("Edge " + e2.v + " -> " + e2.w + ": " + JSON.stringify(e2)), log.info("Edge " + e2.v + " -> " + e2.w + ": ", e2, " ", JSON.stringify(f.edge(e2))), log.info("Fix", clusterDb, "ids:", e2.v, e2.w, "Translating: ", clusterDb.get(e2.v), clusterDb.get(e2.w)), j && l2.selfLoop) {
+        if (l2.selfLoop.order !== 1) return;
+        let e3 = l2.id;
+        l2.id = l2.selfLoop.id, await insertEdgeLabel(k, l2), l2.id = e3;
+        return;
+      }
+      await insertEdgeLabel(k, l2);
+    });
+    await Promise.all(e);
+  }, "processEdges"))(), log.info("Graph before layout:", JSON.stringify(write(f))), log.info("############################################# XXX"), log.info("###                Layout                 ### XXX"), log.info("############################################# XXX"), layout(f), log.info("Graph after layout:", JSON.stringify(write(f)));
+  let M = 0, { subGraphTitleTotalMargin: N } = getSubGraphTitleMargins(w);
+  await Promise.all(sortNodesByHierarchy(f).map(async function(e) {
+    var _a;
+    let l2 = f.node(e);
+    if (log.info("Position XBX => " + e + ": (" + l2.x, "," + l2.y, ") width: ", l2.width, " height: ", l2.height), l2 == null ? void 0 : l2.clusterNode) l2.y += N, log.info("A tainted cluster node XBX1", e, l2.id, l2.width, l2.height, l2.x, l2.y, f.parent(e)), clusterDb.get(l2.id).node = l2, positionNode(l2);
+    else if (f.children(e).length > 0) {
+      log.info("A pure cluster node XBX1", e, l2.id, l2.x, l2.y, l2.width, l2.height, f.parent(e)), l2.height += N, f.node(l2.parentId);
+      let u = (l2 == null ? void 0 : l2.padding) / 2 || 0, d = ((_a = l2 == null ? void 0 : l2.labelBBox) == null ? void 0 : _a.height) || 0, p = d - u || 0;
+      log.debug("OffsetY", p, "labelHeight", d, "halfPadding", u), await insertCluster(D, l2), clusterDb.get(l2.id).node = l2;
+    } else {
+      let e2 = f.node(l2.parentId);
+      l2.y += N / 2, log.info("A regular node XBX1 - using the padding", l2.id, "parent", l2.parentId, l2.width, l2.height, l2.x, l2.y, "offsetY", l2.offsetY, "parent", e2, e2 == null ? void 0 : e2.offsetY, l2), positionNode(l2);
+    }
+  }));
+  let P = N / 2;
+  return getEdgesToRender(f, P, { mergeSelfLoops: j }).forEach(function({ edge: e, start: l2, end: u }) {
+    log.info("Edge " + l2 + " -> " + u + ": " + JSON.stringify(e), e), e.points.forEach((e2) => e2.y += P), positionEdgeLabel(e, insertEdge(O, e, clusterDb, h, f.node(l2), f.node(u), v));
+  }), f.nodes().forEach(function(e) {
+    let l2 = f.node(e);
+    log.info(e, l2.type, l2.diff), l2.isGroup && (M = l2.diff);
+  }), log.warn("Returning from recursive render XAX", E, M), {
+    elem: E,
+    diff: M
+  };
+}, "recursiveRender"), render = /* @__PURE__ */ __name(async (e, u) => {
+  var _a, _b, _c, _d, _e, _f;
+  let d = new Graph({
+    multigraph: true,
+    compound: true
+  }).setGraph({
+    rankdir: e.direction,
+    nodesep: ((_a = e.config) == null ? void 0 : _a.nodeSpacing) || ((_c = (_b = e.config) == null ? void 0 : _b.flowchart) == null ? void 0 : _c.nodeSpacing) || e.nodeSpacing,
+    ranksep: ((_d = e.config) == null ? void 0 : _d.rankSpacing) || ((_f = (_e = e.config) == null ? void 0 : _e.flowchart) == null ? void 0 : _f.rankSpacing) || e.rankSpacing,
+    marginx: 8,
+    marginy: 8
+  }).setDefaultEdgeLabel(function() {
+    return {};
+  }), m = u.select("g");
+  markers_default(m, e.markers, e.type, e.diagramId), clear2(), clear$1(), clear$2(), clear(), e.nodes.forEach((e2) => {
+    d.setNode(e2.id, { ...e2 }), e2.parentId && d.setParent(e2.id, e2.parentId);
+  }), log.debug("Edges:", e.edges), e.edges.forEach((e2) => {
+    if (e2.start === e2.end) {
+      let l = e2.start, u2 = l + "---" + l + "---1", f = l + "---" + l + "---2", p = d.node(l);
+      d.setNode(u2, {
+        domId: u2,
+        id: u2,
+        parentId: p.parentId,
+        labelStyle: "",
+        label: "",
+        padding: 0,
+        shape: "labelRect",
+        style: "",
+        width: 10,
+        height: 10
+      }), d.setParent(u2, p.parentId), d.setNode(f, {
+        domId: f,
+        id: f,
+        parentId: p.parentId,
+        labelStyle: "",
+        padding: 0,
+        shape: "labelRect",
+        label: "",
+        style: "",
+        width: 10,
+        height: 10
+      }), d.setParent(f, p.parentId);
+      let m2 = structuredClone(e2), h = structuredClone(e2), g = structuredClone(e2), _2 = structuredClone(e2);
+      h.originalEdge = m2, h.selfLoop = {
+        id: m2.id,
+        order: 0
+      }, g.originalEdge = m2, g.selfLoop = {
+        id: m2.id,
+        order: 1
+      }, _2.originalEdge = m2, _2.selfLoop = {
+        id: m2.id,
+        order: 2
+      }, h.label = "", h.arrowTypeEnd = "none", h.endLabelLeft = "", h.endLabelRight = "", h.startLabelLeft = "", h.id = l + "-cyclic-special-1", g.startLabelRight = "", g.startLabelLeft = "", g.endLabelLeft = "", g.endLabelRight = "", g.arrowTypeStart = "none", g.arrowTypeEnd = "none", g.id = l + "-cyclic-special-mid", _2.label = "", _2.startLabelRight = "", _2.startLabelLeft = "", _2.arrowTypeStart = "none", p.isGroup && (h.fromCluster = l, _2.toCluster = l), _2.id = l + "-cyclic-special-2", _2.arrowTypeStart = "none", d.setEdge(l, u2, h, l + "-cyclic-special-0"), d.setEdge(u2, f, g, l + "-cyclic-special-1"), d.setEdge(f, l, _2, l + "-cyclic-special-2");
+    } else d.setEdge(e2.start, e2.end, { ...e2 }, e2.id);
+  }), log.warn("Graph at first:", JSON.stringify(write(d))), adjustClustersAndEdges(d), log.warn("Graph after XAX:", JSON.stringify(write(d)));
+  let _ = getConfig2();
+  await recursiveRender(m, d, e.type, e.diagramId, void 0, _);
+}, "render");
+export {
+  getEdgesToRender,
+  render
+};

package/dist/{data-grid-overlay-editor-BWRG2b_o.js → data-grid-overlay-editor-Ci7TXVf5.js}

@@ -1,8 +1,8 @@
-import { s as __toESM } from "./chunk-BNovOVIE.js";
-import { t as require_react } from "./react-DA-nE2FX.js";
-import { t as require_react_dom } from "./react-dom-BTJzcVJ9.js";
-import { b as isObjectEditorCallbackResult, i as makeCSSStyle, n as ThemeContext, t as ClickOutsideContainer, v as isEditableGridCell, y as isInnerOnlyCell } from "./click-outside-container-BSIeYt4y.js";
-import { t as styled_default } from "./dist-SXNmlE8A.js";
+import { o as __toESM } from "./chunk-Bfp04NdC.js";
+import { t as require_react } from "./react-DhGsCS90.js";
+import { t as require_react_dom } from "./react-dom-CmENFV8Q.js";
+import { b as isObjectEditorCallbackResult, i as makeCSSStyle, n as ThemeContext, t as ClickOutsideContainer, v as isEditableGridCell, y as isInnerOnlyCell } from "./click-outside-container-BZNsAj09.js";
+import { t as styled_default } from "./dist-kOCFEa1U.js";
 var import_react_dom = require_react_dom(), import_react = /* @__PURE__ */ __toESM(require_react(), 1), _exp2 = () => (e) => e.targetX, _exp3 = () => (e) => e.targetY, _exp4 = () => (e) => e.targetWidth, _exp5 = () => (e) => e.targetHeight, _exp6 = () => (e) => e.targetY + 10, _exp7 = () => (e) => Math.max(0, (e.targetHeight - 28) / 2);
 const DataGridOverlayEditorStyle = /* @__PURE__ */ styled_default("div")({
   name: "DataGridOverlayEditorStyle",

package/dist/{debounce-BOD3DbfP.js → debounce-D784bpms.js}

@@ -1,5 +1,5 @@
-import { S as isObject_default } from "./_baseFor-4jw-lnCC.js";
-import { n as toNumber_default, t as now_default } from "./now-Ch98bJO_.js";
+import { O as isObject_default } from "./isArrayLikeObject-CBUaLibE.js";
+import { n as toNumber_default, t as now_default } from "./now-sFWt-GLC.js";
 var FUNC_ERROR_TEXT = "Expected a function", nativeMax = Math.max, nativeMin = Math.min;
 function debounce(o, s, c) {
   var l, u, d, f, p, m, h = 0, g = false, _ = false, v = true;