@belonguniverseai/react-sdk 0.6.2 → 0.6.3

package/dist/embed/voice/line-slots.d.ts

@@ -19,11 +19,40 @@
  * switch must not hand a slot from workspace A to a session that actually
  * belongs to workspace B.
  *
- * localStorage is a perimeter: the persisted bag is zod-validated on read and
+ * TAB isolation (§ multi-tab), the same two tiers and the same rules
+ * `stream-state-store.ts` uses for the session pointer:
+ *
+ *   • AUTHORITATIVE bag → `sessionStorage` (PER TAB). What this tab's rail
+ *     rehydrates from, `runId`s included. Survives a same-tab reload (§41),
+ *     invisible to every other tab.
+ *   • SEED → `localStorage` (SHARED). The same bag with every `runId` stripped.
+ *     A brand-new tab with no bag of its own adopts it ONCE so it comes up
+ *     holding the user's agents (today's UX, and what a returning visitor
+ *     expects after closing the browser).
+ *
+ * The tiers exist because the rail used to live entirely in `localStorage`,
+ * which made three tabs of one workspace share ONE set of bindings. Whichever
+ * tab last moved an agent silently re-pointed every other tab's rail;
+ * `closeAgentLine` wiped the agent everywhere at once; and a boot
+ * `reattachPendingLineRuns()` (BelongDock) could open a reader — one that also
+ * drives host route navigation — against a `runId` a DIFFERENT tab was
+ * driving. Field report (Simetrik, 2026-08-05): "al cerrar el agente o
+ * intentar abrir el mismo chat en otra pestaña … el contenido no se carga
+ * correctamente — mostrando el contenido de otro chat activo".
+ *
+ * Stripping `runId` from the seed is what makes cross-tab adoption safe: a
+ * brand-new tab inherits WHO the agents are, never a live run it owns no
+ * reader for. A genuine same-tab reload still rehydrates its own in-flight
+ * runs, because it reads its own `sessionStorage` bag rather than the seed.
+ *
+ * Web Storage is a perimeter: the persisted bag is zod-validated on read and
  * any junk (corrupted JSON, wrong shape, storage disabled) degrades to "no
  * slots" — the switchboard just starts fresh, same as a first-ever call. The
  * schema is back-compatible with the pre-line-1 bag: a persisted object with
  * only `line2`/`line3` still parses fine, `line1` just defaults to `null`.
+ * It is also back-compatible ACROSS this change: an existing localStorage bag
+ * is exactly what the seed looks like, so an upgrading tab adopts the agents
+ * it already had.
  *
  * `runId` (F3/R4 — reload must not lie about a still-running background
  * line): the durable half of `bindLineRun`'s in-memory tracking, written by
@@ -98,6 +127,12 @@ export declare const readAllLineSlots: () => readonly {
     readonly line: SlotLine;
     readonly slot: LineSlot;
 }[];
-/** Test-only: drop every persisted slot for the current workspace scope. */
+/** Test-only: drop every persisted slot for the current workspace scope, in
+ * BOTH tiers, and forget this realm's provenance/seed bookkeeping — so the
+ * next read behaves like a brand-new tab with nothing to adopt. */
 export declare const __clearLineSlotsForTest: () => void;
+/** Test-only: re-mint this module's PAGE-REALM state (provenance + seed cache)
+ * without touching Web Storage, so a test can model a fresh page load while
+ * choosing for itself which storage tiers carry over. */
+export declare const __resetLineSlotsProvenanceForTest: () => void;
 export {};

package/dist/embed/voice-call.d.ts

@@ -36,6 +36,18 @@ export type CallState = {
     readonly assistantCaption: string;
     /** True from a send_to_belong_agent dispatch until its reply is delivered. */
     readonly agentBusy: boolean;
+    /**
+     * What the agent was ASKED to do, verbatim, from dispatch until the run
+     * reaches a terminal state; `null` when nothing is in flight.
+     *
+     * State rather than a timeline row on purpose. It is the summary card's
+     * HEADLINE, so a row saying the same thing rendered it twice on one screen —
+     * and it counted toward "Worked · N steps", which must count what the agent
+     * DID, not what it was asked. Stored WHOLE and untrimmed (the exact string
+     * the delegate listeners got): the card truncates for display in CSS, and
+     * `callSummary` blank-guards it.
+     */
+    readonly currentRequest: string | null;
     /** Current tool phase of the delegated run (drives the orb's work badge). */
     readonly workPhase: "coding" | "files" | "actions" | null;
     /** True while the voice model is producing a spoken response. */

package/dist/i18n/messages/en.d.ts

@@ -535,8 +535,7 @@ export declare const en: {
         readonly lineFailed: "Couldn't finish";
         readonly lineIdle: "Ready";
         readonly activity: "Activity";
-        readonly showConversationLog: "Show what was said";
-        readonly hideConversationLog: "Hide what was said";
+        readonly conversation: "Conversation";
         readonly ambientTypingCode: "Typing code…";
         readonly ambientReviewingDiff: "Reviewing the diff…";
         readonly ambientRunningChecks: "Running checks…";

package/dist/lib/web-storage.d.ts

@@ -0,0 +1,8 @@
+/** The small Web Storage surface used by the SDK's durable browser state. */
+type WebStorage = Pick<Storage, "getItem" | "setItem" | "removeItem">;
+export declare const getSessionStorage: () => WebStorage | null;
+export declare const getLocalStorage: () => WebStorage | null;
+export declare const readWebStorage: (store: WebStorage | null, key: string) => string | null;
+export declare const writeWebStorage: (store: WebStorage | null, key: string, value: string) => void;
+export declare const removeWebStorage: (store: WebStorage | null, key: string) => void;
+export {};

package/dist/stream/stream-state-store.d.ts

@@ -23,6 +23,19 @@ export declare const peekGenerationLostSession: () => string | null;
  * consumed, or superseded by a newer loss) — a stale reconciler can never
  * clear a loss it did not actually adopt. */
 export declare const consumeGenerationLostSession: (sessionId: string) => void;
+/**
+ * May per-tab state found at the FIRST read of this page realm keep a live run
+ * id? True only for a navigation that PROVES the writing realm is gone (a
+ * genuine reload, bfcache/back-forward, or an environment with no Performance
+ * API to ask). A `navigate` load is what "Duplicate Tab" performs, and the
+ * original tab is still there consuming its own runs.
+ *
+ * Exported because `sessionStorage` now carries TWO per-tab tiers that both
+ * name live runs — the session pointer + parked cursors here, and the rail's
+ * agent-line slots (`embed/voice/line-slots.ts`). One duplicate-tab rule for
+ * both, so a clone can never double-attach to a run from either direction.
+ */
+export declare const mayKeepClonedRunIds: () => boolean;
 /**
  * The tab's active stream state.
  *

package/dist/types/public.d.ts

@@ -246,6 +246,9 @@ export type BelongGlobal = {
         userCaption?: string;
         assistantCaption?: string;
         agentBusy?: boolean;
+        /** What the agent was ASKED to do — the call summary card's headline when
+         * no plan step is in flight. State, not a timeline row. */
+        currentRequest?: string | null;
         workPhase?: "coding" | "files" | "actions" | null;
         speaking?: boolean;
         thinking?: boolean;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@belonguniverseai/react-sdk",
-  "version": "0.6.2",
+  "version": "0.6.3",
   "description": "Belong — embeddable React AI assistant dock. Mount <BelongWidget> in your app tree with getToken dependency-injection auth.",
   "license": "UNLICENSED",
   "type": "module",

package/dist/component/arc-TLcl3N8_.js

@@ -1,86 +0,0 @@
-import { O as ln, P as an, Q as g, S as on, T as Z, V as w, W as _, X as sn, Y as rn, Z as z, $ as t, a0 as V, a1 as un, a2 as tn, a3 as fn } from "./mermaid-GHXKKRXX-DXPXjnb7.js";
-globalThis.process = globalThis.process || { env: {} };
-globalThis.global = globalThis.global || globalThis;
-function cn(l) {
-  return l.innerRadius;
-}
-function gn(l) {
-  return l.outerRadius;
-}
-function yn(l) {
-  return l.startAngle;
-}
-function pn(l) {
-  return l.endAngle;
-}
-function dn(l) {
-  return l && l.padAngle;
-}
-function hn(l, x, q, O, v, T, W, a) {
-  var D = q - l, u = O - x, n = W - v, p = a - T, s = p * D - n * u;
-  if (!(s * s < g))
-    return s = (n * (x - T) - p * (l - v)) / s, [l + s * D, x + s * u];
-}
-function J(l, x, q, O, v, T, W) {
-  var a = l - q, D = x - O, u = (W ? T : -T) / z(a * a + D * D), n = u * D, p = -u * a, s = l + n, i = x + p, f = q + n, c = O + p, X = (s + f) / 2, o = (i + c) / 2, d = f - s, y = c - i, A = d * d + y * y, R = v - T, b = s * c - f * i, E = (y < 0 ? -1 : 1) * z(fn(0, R * R * A - b * b)), I = (b * y - d * E) / A, Q = (-b * d - y * E) / A, P = (b * y + d * E) / A, h = (-b * d + y * E) / A, m = I - X, e = Q - o, r = P - X, Y = h - o;
-  return m * m + e * e > r * r + Y * Y && (I = P, Q = h), {
-    cx: I,
-    cy: Q,
-    x01: -n,
-    y01: -p,
-    x11: I * (v / R - 1),
-    y11: Q * (v / R - 1)
-  };
-}
-function xn() {
-  var l = cn, x = gn, q = V(0), O = null, v = yn, T = pn, W = dn, a = null, D = ln(u);
-  function u() {
-    var n, p, s = +l.apply(this, arguments), i = +x.apply(this, arguments), f = v.apply(this, arguments) - an, c = T.apply(this, arguments) - an, X = sn(c - f), o = c > f;
-    if (a || (a = n = D()), i < s && (p = i, i = s, s = p), !(i > g)) a.moveTo(0, 0);
-    else if (X > on - g)
-      a.moveTo(i * Z(f), i * w(f)), a.arc(0, 0, i, f, c, !o), s > g && (a.moveTo(s * Z(c), s * w(c)), a.arc(0, 0, s, c, f, o));
-    else {
-      var d = f, y = c, A = f, R = c, b = X, E = X, I = W.apply(this, arguments) / 2, Q = I > g && (O ? +O.apply(this, arguments) : z(s * s + i * i)), P = _(sn(i - s) / 2, +q.apply(this, arguments)), h = P, m = P, e, r;
-      if (Q > g) {
-        var Y = un(Q / s * w(I)), B = un(Q / i * w(I));
-        (b -= Y * 2) > g ? (Y *= o ? 1 : -1, A += Y, R -= Y) : (b = 0, A = R = (f + c) / 2), (E -= B * 2) > g ? (B *= o ? 1 : -1, d += B, y -= B) : (E = 0, d = y = (f + c) / 2);
-      }
-      var $ = i * Z(d), j = i * w(d), C = s * Z(R), F = s * w(R);
-      if (P > g) {
-        var G = i * Z(y), H = i * w(y), K = s * Z(A), L = s * w(A), S;
-        if (X < rn)
-          if (S = hn($, j, K, L, G, H, C, F)) {
-            var M = $ - S[0], N = j - S[1], U = G - S[0], k = H - S[1], nn = 1 / w(tn((M * U + N * k) / (z(M * M + N * N) * z(U * U + k * k))) / 2), en = z(S[0] * S[0] + S[1] * S[1]);
-            h = _(P, (s - en) / (nn - 1)), m = _(P, (i - en) / (nn + 1));
-          } else
-            h = m = 0;
-      }
-      E > g ? m > g ? (e = J(K, L, $, j, i, m, o), r = J(G, H, C, F, i, m, o), a.moveTo(e.cx + e.x01, e.cy + e.y01), m < P ? a.arc(e.cx, e.cy, m, t(e.y01, e.x01), t(r.y01, r.x01), !o) : (a.arc(e.cx, e.cy, m, t(e.y01, e.x01), t(e.y11, e.x11), !o), a.arc(0, 0, i, t(e.cy + e.y11, e.cx + e.x11), t(r.cy + r.y11, r.cx + r.x11), !o), a.arc(r.cx, r.cy, m, t(r.y11, r.x11), t(r.y01, r.x01), !o))) : (a.moveTo($, j), a.arc(0, 0, i, d, y, !o)) : a.moveTo($, j), !(s > g) || !(b > g) ? a.lineTo(C, F) : h > g ? (e = J(C, F, G, H, s, -h, o), r = J($, j, K, L, s, -h, o), a.lineTo(e.cx + e.x01, e.cy + e.y01), h < P ? a.arc(e.cx, e.cy, h, t(e.y01, e.x01), t(r.y01, r.x01), !o) : (a.arc(e.cx, e.cy, h, t(e.y01, e.x01), t(e.y11, e.x11), !o), a.arc(0, 0, s, t(e.cy + e.y11, e.cx + e.x11), t(r.cy + r.y11, r.cx + r.x11), o), a.arc(r.cx, r.cy, h, t(r.y11, r.x11), t(r.y01, r.x01), !o))) : a.arc(0, 0, s, R, A, o);
-    }
-    if (a.closePath(), n) return a = null, n + "" || null;
-  }
-  return u.centroid = function() {
-    var n = (+l.apply(this, arguments) + +x.apply(this, arguments)) / 2, p = (+v.apply(this, arguments) + +T.apply(this, arguments)) / 2 - rn / 2;
-    return [Z(p) * n, w(p) * n];
-  }, u.innerRadius = function(n) {
-    return arguments.length ? (l = typeof n == "function" ? n : V(+n), u) : l;
-  }, u.outerRadius = function(n) {
-    return arguments.length ? (x = typeof n == "function" ? n : V(+n), u) : x;
-  }, u.cornerRadius = function(n) {
-    return arguments.length ? (q = typeof n == "function" ? n : V(+n), u) : q;
-  }, u.padRadius = function(n) {
-    return arguments.length ? (O = n == null ? null : typeof n == "function" ? n : V(+n), u) : O;
-  }, u.startAngle = function(n) {
-    return arguments.length ? (v = typeof n == "function" ? n : V(+n), u) : v;
-  }, u.endAngle = function(n) {
-    return arguments.length ? (T = typeof n == "function" ? n : V(+n), u) : T;
-  }, u.padAngle = function(n) {
-    return arguments.length ? (W = typeof n == "function" ? n : V(+n), u) : W;
-  }, u.context = function(n) {
-    return arguments.length ? (a = n ?? null, u) : a;
-  }, u;
-}
-export {
-  xn as d
-};
-//# sourceMappingURL=arc-TLcl3N8_.js.map

package/dist/component/dagre-BM42HDAG-BoPUzTvD.js

@@ -1,448 +0,0 @@
-import { _ as w, aY as _, aZ as Y, a_ as F, a$ as j, l as i, c as H, b0 as V, b1 as $, al as U, aT as Z, am as P, ak as q, b2 as z, b3 as K, b4 as Q } from "./mermaid-GHXKKRXX-DXPXjnb7.js";
-import { i as N, G as k } from "./graph-BZLHvygk.js";
-import { b as W, m as B, l as I } from "./layout-Bu6nRdWm.js";
-globalThis.process = globalThis.process || { env: {} };
-globalThis.global = globalThis.global || globalThis;
-var ee = 4;
-function ne(e) {
-  return W(e, ee);
-}
-function v(e) {
-  var t = {
-    options: {
-      directed: e.isDirected(),
-      multigraph: e.isMultigraph(),
-      compound: e.isCompound()
-    },
-    nodes: te(e),
-    edges: se(e)
-  };
-  return N(e.graph()) || (t.value = ne(e.graph())), t;
-}
-function te(e) {
-  return B(e.nodes(), function(t) {
-    var n = e.node(t), a = e.parent(t), r = { v: t };
-    return N(n) || (r.value = n), N(a) || (r.parent = a), r;
-  });
-}
-function se(e) {
-  return B(e.edges(), function(t) {
-    var n = e.edge(t), a = { v: t.v, w: t.w };
-    return N(t.name) || (a.name = t.name), N(n) || (a.value = n), a;
-  });
-}
-var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), R = /* @__PURE__ */ new Map(), ie = /* @__PURE__ */ w(() => {
-  y.clear(), R.clear(), d.clear();
-}, "clear"), D = /* @__PURE__ */ w((e, t) => {
-  const n = y.get(t) || [];
-  return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
-}, "isDescendant"), re = /* @__PURE__ */ w((e, t) => {
-  const n = y.get(t) || [];
-  return i.info("Descendants of ", t, " is ", n), i.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || D(e.v, t) || D(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
-}, "edgeInCluster"), A = /* @__PURE__ */ w((e, t, n, a) => {
-  i.warn(
-    "Copying children of ",
-    e,
-    "root",
-    a,
-    "data",
-    t.node(e),
-    a
-  );
-  const r = t.children(e) || [];
-  e !== a && r.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", r), r.forEach((o) => {
-    if (t.children(o).length > 0)
-      A(o, t, n, a);
-    else {
-      const l = t.node(o);
-      i.info("cp ", o, " to ", a, " with parent ", e), n.setNode(o, l), a !== t.parent(o) && (i.warn("Setting parent", o, t.parent(o)), n.setParent(o, t.parent(o))), e !== a && o !== e ? (i.debug("Setting parent", o, e), n.setParent(o, e)) : (i.info("In copy ", e, "root", a, "data", t.node(e), a), i.debug(
-        "Not Setting parent for node=",
-        o,
-        "cluster!==rootId",
-        e !== a,
-        "node!==clusterId",
-        o !== e
-      ));
-      const u = t.edges(o);
-      i.debug("Copying Edges", u), u.forEach((c) => {
-        i.info("Edge", c);
-        const h = t.edge(c.v, c.w, c.name);
-        i.info("Edge data", h, a);
-        try {
-          re(c, a) ? (i.info("Copying as ", c.v, c.w, h, c.name), n.setEdge(c.v, c.w, h, c.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
-            "Skipping copy of edge ",
-            c.v,
-            "-->",
-            c.w,
-            " rootId: ",
-            a,
-            " clusterId:",
-            e
-          );
-        } catch (m) {
-          i.error(m);
-        }
-      });
-    }
-    i.debug("Removing node", o), t.removeNode(o);
-  });
-}, "copy"), G = /* @__PURE__ */ w((e, t) => {
-  const n = t.children(e);
-  let a = [...n];
-  for (const r of n)
-    R.set(r, e), a = [...a, ...G(r, t)];
-  return a;
-}, "extractDescendants"), oe = /* @__PURE__ */ w((e, t, n) => {
-  const a = e.edges().filter((c) => c.v === t || c.w === t), r = e.edges().filter((c) => c.v === n || c.w === n), o = a.map((c) => ({ v: c.v === t ? n : c.v, w: c.w === t ? t : c.w })), l = r.map((c) => ({ v: c.v, w: c.w }));
-  return o.filter((c) => l.some((h) => c.v === h.v && c.w === h.w));
-}, "findCommonEdges"), C = /* @__PURE__ */ w((e, t, n) => {
-  const a = t.children(e);
-  if (i.trace("Searching children of id ", e, a), a.length < 1)
-    return e;
-  let r;
-  for (const o of a) {
-    const l = C(o, t, n), u = oe(t, n, l);
-    if (l)
-      if (u.length > 0)
-        r = l;
-      else
-        return l;
-  }
-  return r;
-}, "findNonClusterChild"), T = /* @__PURE__ */ w((e) => !d.has(e) || !d.get(e).externalConnections ? e : d.has(e) ? d.get(e).id : e, "getAnchorId"), ae = /* @__PURE__ */ w((e, t) => {
-  if (!e || t > 10) {
-    i.debug("Opting out, no graph ");
-    return;
-  } else
-    i.debug("Opting in, graph ");
-  e.nodes().forEach(function(n) {
-    e.children(n).length > 0 && (i.warn(
-      "Cluster identified",
-      n,
-      " Replacement id in edges: ",
-      C(n, e, n)
-    ), y.set(n, G(n, e)), d.set(n, { id: C(n, e, n), clusterData: e.node(n) }));
-  }), e.nodes().forEach(function(n) {
-    const a = e.children(n), r = e.edges();
-    a.length > 0 ? (i.debug("Cluster identified", n, y), r.forEach((o) => {
-      const l = D(o.v, n), u = D(o.w, n);
-      l ^ u && (i.warn("Edge: ", o, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", y.get(n)), d.get(n).externalConnections = !0);
-    })) : i.debug("Not a cluster ", n, y);
-  });
-  for (let n of d.keys()) {
-    const a = d.get(n).id, r = e.parent(a);
-    r !== n && d.has(r) && !d.get(r).externalConnections && (d.get(n).id = r);
-  }
-  e.edges().forEach(function(n) {
-    const a = e.edge(n);
-    i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
-    let r = n.v, o = n.w;
-    if (i.warn(
-      "Fix XXX",
-      d,
-      "ids:",
-      n.v,
-      n.w,
-      "Translating: ",
-      d.get(n.v),
-      " --- ",
-      d.get(n.w)
-    ), d.get(n.v) || d.get(n.w)) {
-      if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), r = T(n.v), o = T(n.w), e.removeEdge(n.v, n.w, n.name), r !== n.v) {
-        const l = e.parent(r);
-        d.get(l).externalConnections = !0, a.fromCluster = n.v;
-      }
-      if (o !== n.w) {
-        const l = e.parent(o);
-        d.get(l).externalConnections = !0, a.toCluster = n.w;
-      }
-      i.warn("Fix Replacing with XXX", r, o, n.name), e.setEdge(r, o, a, n.name);
-    }
-  }), i.warn("Adjusted Graph", v(e)), J(e, 0), i.trace(d);
-}, "adjustClustersAndEdges"), J = /* @__PURE__ */ w((e, t) => {
-  if (i.warn("extractor - ", t, v(e), e.children("D")), t > 10) {
-    i.error("Bailing out");
-    return;
-  }
-  let n = e.nodes(), a = !1;
-  for (const r of n) {
-    const o = e.children(r);
-    a = a || o.length > 0;
-  }
-  if (!a) {
-    i.debug("Done, no node has children", e.nodes());
-    return;
-  }
-  i.debug("Nodes = ", n, t);
-  for (const r of n)
-    if (i.debug(
-      "Extracting node",
-      r,
-      d,
-      d.has(r) && !d.get(r).externalConnections,
-      !e.parent(r),
-      e.node(r),
-      e.children("D"),
-      " Depth ",
-      t
-    ), !d.has(r))
-      i.debug("Not a cluster", r, t);
-    else if (!d.get(r).externalConnections && e.children(r) && e.children(r).length > 0) {
-      i.warn(
-        "Cluster without external connections, without a parent and with children",
-        r,
-        t
-      );
-      let l = e.graph().rankdir === "TB" ? "LR" : "TB";
-      d.get(r)?.clusterData?.dir && (l = d.get(r).clusterData.dir, i.warn("Fixing dir", d.get(r).clusterData.dir, l));
-      const u = new k({
-        multigraph: !0,
-        compound: !0
-      }).setGraph({
-        rankdir: l,
-        nodesep: 50,
-        ranksep: 50,
-        marginx: 8,
-        marginy: 8
-      }).setDefaultEdgeLabel(function() {
-        return {};
-      });
-      i.warn("Old graph before copy", v(e)), A(r, e, u, r), e.setNode(r, {
-        clusterNode: !0,
-        id: r,
-        clusterData: d.get(r).clusterData,
-        label: d.get(r).label,
-        graph: u
-      }), i.warn("New graph after copy node: (", r, ")", v(u)), i.debug("Old graph after copy", v(e));
-    } else
-      i.warn(
-        "Cluster ** ",
-        r,
-        " **not meeting the criteria !externalConnections:",
-        !d.get(r).externalConnections,
-        " no parent: ",
-        !e.parent(r),
-        " children ",
-        e.children(r) && e.children(r).length > 0,
-        e.children("D"),
-        t
-      ), i.debug(d);
-  n = e.nodes(), i.warn("New list of nodes", n);
-  for (const r of n) {
-    const o = e.node(r);
-    i.warn(" Now next level", r, o), o?.clusterNode && J(o.graph, t + 1);
-  }
-}, "extractor"), L = /* @__PURE__ */ w((e, t) => {
-  if (t.length === 0)
-    return [];
-  let n = Object.assign([], t);
-  return t.forEach((a) => {
-    const r = e.children(a), o = L(e, r);
-    n = [...n, ...o];
-  }), n;
-}, "sorter"), ce = /* @__PURE__ */ w((e) => L(e, e.children()), "sortNodesByHierarchy"), M = /* @__PURE__ */ w(async (e, t, n, a, r, o) => {
-  i.warn("Graph in recursive render:XAX", v(t), r);
-  const l = t.graph().rankdir;
-  i.trace("Dir in recursive render - dir:", l);
-  const u = e.insert("g").attr("class", "root");
-  t.nodes() ? i.info("Recursive render XXX", t.nodes()) : i.info("No nodes found for", t), t.edges().length > 0 && i.info("Recursive edges", t.edge(t.edges()[0]));
-  const c = u.insert("g").attr("class", "clusters"), h = u.insert("g").attr("class", "edgePaths"), m = u.insert("g").attr("class", "edgeLabels"), b = u.insert("g").attr("class", "nodes");
-  await Promise.all(
-    t.nodes().map(async function(f) {
-      const s = t.node(f);
-      if (r !== void 0) {
-        const g = JSON.parse(JSON.stringify(r.clusterData));
-        i.trace(
-          `Setting data for parent cluster XXX
- Node.id = `,
-          f,
-          `
- data=`,
-          g.height,
-          `
-Parent cluster`,
-          r.height
-        ), t.setNode(r.id, g), t.parent(f) || (i.trace("Setting parent", f, r.id), t.setParent(f, r.id, g));
-      }
-      if (i.info("(Insert) Node XXX" + f + ": " + JSON.stringify(t.node(f))), s?.clusterNode) {
-        i.info("Cluster identified XBX", f, s.width, t.node(f));
-        const { ranksep: g, nodesep: p } = t.graph();
-        s.graph.setGraph({
-          ...s.graph.graph(),
-          ranksep: g + 25,
-          nodesep: p
-        });
-        const E = await M(
-          b,
-          s.graph,
-          n,
-          a,
-          t.node(f),
-          o
-        ), x = E.elem;
-        V(s, x), s.diff = E.diff || 0, i.info(
-          "New compound node after recursive render XAX",
-          f,
-          "width",
-          // node,
-          s.width,
-          "height",
-          s.height
-          // node.x,
-          // node.y
-        ), $(x, s);
-      } else
-        t.children(f).length > 0 ? (i.trace(
-          "Cluster - the non recursive path XBX",
-          f,
-          s.id,
-          s,
-          s.width,
-          "Graph:",
-          t
-        ), i.trace(C(s.id, t)), d.set(s.id, { id: C(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", f, b, t.node(f), l), await U(b, t.node(f), { config: o, dir: l }));
-    })
-  ), await (/* @__PURE__ */ w(async () => {
-    const f = t.edges().map(async function(s) {
-      const g = t.edge(s.v, s.w, s.name);
-      i.info("Edge " + s.v + " -> " + s.w + ": " + JSON.stringify(s)), i.info("Edge " + s.v + " -> " + s.w + ": ", s, " ", JSON.stringify(t.edge(s))), i.info(
-        "Fix",
-        d,
-        "ids:",
-        s.v,
-        s.w,
-        "Translating: ",
-        d.get(s.v),
-        d.get(s.w)
-      ), await Q(m, g);
-    });
-    await Promise.all(f);
-  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(v(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(v(t)));
-  let O = 0, { subGraphTitleTotalMargin: S } = Z(o);
-  return await Promise.all(
-    ce(t).map(async function(f) {
-      const s = t.node(f);
-      if (i.info(
-        "Position XBX => " + f + ": (" + s.x,
-        "," + s.y,
-        ") width: ",
-        s.width,
-        " height: ",
-        s.height
-      ), s?.clusterNode)
-        s.y += S, i.info(
-          "A tainted cluster node XBX1",
-          f,
-          s.id,
-          s.width,
-          s.height,
-          s.x,
-          s.y,
-          t.parent(f)
-        ), d.get(s.id).node = s, P(s);
-      else if (t.children(f).length > 0) {
-        i.info(
-          "A pure cluster node XBX1",
-          f,
-          s.id,
-          s.x,
-          s.y,
-          s.width,
-          s.height,
-          t.parent(f)
-        ), s.height += S, t.node(s.parentId);
-        const g = s?.padding / 2 || 0, p = s?.labelBBox?.height || 0, E = p - g || 0;
-        i.debug("OffsetY", E, "labelHeight", p, "halfPadding", g), await q(c, s), d.get(s.id).node = s;
-      } else {
-        const g = t.node(s.parentId);
-        s.y += S / 2, i.info(
-          "A regular node XBX1 - using the padding",
-          s.id,
-          "parent",
-          s.parentId,
-          s.width,
-          s.height,
-          s.x,
-          s.y,
-          "offsetY",
-          s.offsetY,
-          "parent",
-          g,
-          g?.offsetY,
-          s
-        ), P(s);
-      }
-    })
-  ), t.edges().forEach(function(f) {
-    const s = t.edge(f);
-    i.info("Edge " + f.v + " -> " + f.w + ": " + JSON.stringify(s), s), s.points.forEach((x) => x.y += S / 2);
-    const g = t.node(f.v);
-    var p = t.node(f.w);
-    const E = z(h, s, d, n, g, p, a);
-    K(s, E);
-  }), t.nodes().forEach(function(f) {
-    const s = t.node(f);
-    i.info(f, s.type, s.diff), s.isGroup && (O = s.diff);
-  }), i.warn("Returning from recursive render XAX", u, O), { elem: u, diff: O };
-}, "recursiveRender"), ue = /* @__PURE__ */ w(async (e, t) => {
-  const n = new k({
-    multigraph: !0,
-    compound: !0
-  }).setGraph({
-    rankdir: e.direction,
-    nodesep: e.config?.nodeSpacing || e.config?.flowchart?.nodeSpacing || e.nodeSpacing,
-    ranksep: e.config?.rankSpacing || e.config?.flowchart?.rankSpacing || e.rankSpacing,
-    marginx: 8,
-    marginy: 8
-  }).setDefaultEdgeLabel(function() {
-    return {};
-  }), a = t.select("g");
-  _(a, e.markers, e.type, e.diagramId), Y(), F(), j(), ie(), e.nodes.forEach((o) => {
-    n.setNode(o.id, { ...o }), o.parentId && n.setParent(o.id, o.parentId);
-  }), i.debug("Edges:", e.edges), e.edges.forEach((o) => {
-    if (o.start === o.end) {
-      const l = o.start, u = l + "---" + l + "---1", c = l + "---" + l + "---2", h = n.node(l);
-      n.setNode(u, {
-        domId: u,
-        id: u,
-        parentId: h.parentId,
-        labelStyle: "",
-        label: "",
-        padding: 0,
-        shape: "labelRect",
-        // shape: 'rect',
-        style: "",
-        width: 10,
-        height: 10
-      }), n.setParent(u, h.parentId), n.setNode(c, {
-        domId: c,
-        id: c,
-        parentId: h.parentId,
-        labelStyle: "",
-        padding: 0,
-        // shape: 'rect',
-        shape: "labelRect",
-        label: "",
-        style: "",
-        width: 10,
-        height: 10
-      }), n.setParent(c, h.parentId);
-      const m = structuredClone(o), b = structuredClone(o), X = structuredClone(o);
-      m.label = "", m.arrowTypeEnd = "none", m.endLabelLeft = "", m.endLabelRight = "", m.startLabelLeft = "", m.id = l + "-cyclic-special-1", b.startLabelRight = "", b.startLabelLeft = "", b.endLabelLeft = "", b.endLabelRight = "", b.arrowTypeStart = "none", b.arrowTypeEnd = "none", b.id = l + "-cyclic-special-mid", X.label = "", X.startLabelRight = "", X.startLabelLeft = "", X.arrowTypeStart = "none", h.isGroup && (m.fromCluster = l, X.toCluster = l), X.id = l + "-cyclic-special-2", X.arrowTypeStart = "none", n.setEdge(l, u, m, l + "-cyclic-special-0"), n.setEdge(u, c, b, l + "-cyclic-special-1"), n.setEdge(c, l, X, l + "-cyc<lic-special-2");
-    } else
-      n.setEdge(o.start, o.end, { ...o }, o.id);
-  }), i.warn("Graph at first:", JSON.stringify(v(n))), ae(n), i.warn("Graph after XAX:", JSON.stringify(v(n)));
-  const r = H();
-  await M(
-    a,
-    n,
-    e.type,
-    e.diagramId,
-    void 0,
-    r
-  );
-}, "render");
-export {
-  ue as render
-};
-//# sourceMappingURL=dagre-BM42HDAG-BoPUzTvD.js.map