@aiquants/markdown 5.0.0 → 6.1.0

package/dist/{swimlanes-5IMT3BWC-DujAOwAt.js → swimlanes-5IMT3BWC-D8brzzxb.js}

@@ -1,5 +1,5 @@
-import { c as Er } from "./chunk-RYQCIY6F-DTKYsCgk.js";
-import { b6 as Tr, b7 as wr, b8 as Ar, b9 as Rr, $ as Ke, W as Nr, a_ as Or, aZ as Pr, a$ as Br, bd as kr, bf as Fr, an as _r, bc as Dr, bg as Hr, ac as Oe, bh as Ye, _ as d, bi as Ao } from "./extractHeadings-CGJexznE.js";
+import { c as Tr } from "./chunk-RYQCIY6F-Crmt36sO.js";
+import { a_ as Er, a$ as wr, b0 as Ar, b1 as Rr, O as Ke, J as Nr, aS as Or, aR as Pr, aT as Br, b5 as kr, b7 as Fr, af as _r, b4 as Dr, b8 as Hr, a4 as Oe, b9 as Ye, _ as d, ba as Ao } from "./extractHeadings-CtiYkq2z.js";
 import { G as Xr } from "./graph-DAHC4kPm.js";
 async function Fo(t, e) {
   const n = new Xr({
@@ -22,7 +22,7 @@ async function Fo(t, e) {
   for (const I of o)
     n.setEdge(I.start, I.end, { ...I }, I.id), e.edges.some((p) => p.id === I.id) || e.edges.push(I);
   if (globalThis.mermaidCaptureSizes) {
-    const { captureNodeSizes: I } = await import("./sizeCapture-X5ZJPWSS-CotnTNAA.js");
+    const { captureNodeSizes: I } = await import("./sizeCapture-X5ZJPWSS-DJG85IuR.js");
     I(t, e);
   }
   return {
@@ -164,13 +164,13 @@ function Go(t, e, n) {
     const g = i[l], x = Math.hypot(g.b.x - g.a.x, g.b.y - g.a.y), I = x === 0 ? 0 : (g.b.x - g.a.x) / x, u = x === 0 ? 0 : (g.b.y - g.a.y) / x, p = Ho(g);
     let f = 0;
     if (r && l > 0) {
-      const E = Ln(
+      const T = Ln(
         s[l - 1],
         s[l],
         s[l + 1] ?? s[l],
         Ro
       );
-      E && (f = E.cutLen);
+      T && (f = T.cutLen);
     }
     let y = x, v = null;
     r && l < i.length - 1 && (v = Ln(
@@ -179,18 +179,18 @@ function Go(t, e, n) {
       s[l + 2] ?? s[l + 1],
       Ro
     ), v && (y = x - v.cutLen));
-    const M = [...c.get(l) ?? []].sort((E, T) => E.t - T.t);
-    for (const E of M)
-      E.r = Math.min(E.r, E.d - f, y - E.d);
-    for (let E = 0; E < M.length - 1; E++) {
-      const T = M[E + 1].d - M[E].d;
-      if (M[E].r + M[E + 1].r > T) {
-        const m = T / 2;
-        M[E].r = Math.min(M[E].r, m), M[E + 1].r = Math.min(M[E + 1].r, m);
+    const M = [...c.get(l) ?? []].sort((T, E) => T.t - E.t);
+    for (const T of M)
+      T.r = Math.min(T.r, T.d - f, y - T.d);
+    for (let T = 0; T < M.length - 1; T++) {
+      const E = M[T + 1].d - M[T].d;
+      if (M[T].r + M[T + 1].r > E) {
+        const m = E / 2;
+        M[T].r = Math.min(M[T].r, m), M[T + 1].r = Math.min(M[T + 1].r, m);
       }
     }
-    for (const E of M)
-      E.r < Yr || a.push(...Yo(E, I, u, p, n.jumpStyle));
+    for (const T of M)
+      T.r < Yr || a.push(...Yo(T, I, u, p, n.jumpStyle));
     r && v ? (a.push(`L${re(v.startX)},${re(v.startY)}`), a.push(
       `Q${re(v.ctrlX)},${re(v.ctrlY)} ${re(v.endX)},${re(v.endY)}`
     )) : a.push(`L${we(g.b)}`);
@@ -259,15 +259,15 @@ function jo(t, e, n) {
     if (!u)
       continue;
     if (I === void 0) {
-      const E = u.getAttribute("d") ?? "";
-      if (!$o(E))
+      const T = u.getAttribute("d") ?? "";
+      if (!$o(T))
         continue;
     }
     const p = u.getAttribute("style") ?? "", f = /stroke-dasharray\s*:\s*0\s+([\d.]+)\s+[\d.]+\s+([\d.]+)/.exec(
       p
     ), y = f ? Number.parseFloat(f[1]) : null, v = f ? Number.parseFloat(f[2]) : null, M = Go(l, g, n);
     if (u.setAttribute("d", M), y !== null && v !== null && typeof u.getTotalLength == "function") {
-      const E = u.getTotalLength(), T = Math.max(0, E - y - v), m = `0 ${y} ${T} ${v}`, S = p.replace(/stroke-dasharray\s*:[^;]*;?/g, `stroke-dasharray: ${m};`).replace(/;\s*;+/g, ";");
+      const T = u.getTotalLength(), E = Math.max(0, T - y - v), m = `0 ${y} ${E} ${v}`, S = p.replace(/stroke-dasharray\s*:[^;]*;?/g, `stroke-dasharray: ${m};`).replace(/;\s*;+/g, ";");
       u.setAttribute("style", S);
     }
   }
@@ -374,10 +374,10 @@ function Wo(t, e) {
 }
 d(Wo, "positionEdgeLabel");
 var Mn = "__swimlane_default__", Gr = 21, No = 20;
-function En(t) {
+function Tn(t) {
   return Math.max(t.padding ?? No, No);
 }
-d(En, "topLaneHorizontalPadding");
+d(Tn, "topLaneHorizontalPadding");
 function Ko(t) {
   const { x: e, y: n, width: o, height: s } = t, r = t.swimlaneContentTop;
   if (typeof e != "number" || typeof n != "number" || typeof o != "number" || typeof s != "number" || typeof r != "number" || !Number.isFinite(e) || !Number.isFinite(n) || !Number.isFinite(o) || !Number.isFinite(s) || !Number.isFinite(r) || o <= 0 || s <= 0) {
@@ -455,13 +455,13 @@ function Zo(t, e, n, o) {
     const u = l.filter((M) => M.parentId === I.id);
     let p = 1 / 0, f = -1 / 0, y = 1 / 0, v = -1 / 0;
     for (const M of u) {
-      const E = M.x ?? n.x[M.id], T = M.y ?? n.y[M.id], m = M.width ?? 0, S = M.height ?? 0;
-      E != null && T != null && (p = Math.min(p, E - m / 2), f = Math.max(f, E + m / 2), y = Math.min(y, T - S / 2), v = Math.max(v, T + S / 2));
+      const T = M.x ?? n.x[M.id], E = M.y ?? n.y[M.id], m = M.width ?? 0, S = M.height ?? 0;
+      T != null && E != null && (p = Math.min(p, T - m / 2), f = Math.max(f, T + m / 2), y = Math.min(y, E - S / 2), v = Math.max(v, E + S / 2));
     }
     if (p === 1 / 0 || y === 1 / 0)
       I.x = I.x ?? 0, I.y = I.y ?? 0, I.width = I.width ?? 0, I.height = I.height ?? 0;
     else {
-      const M = I.padding ?? 20, E = I.parentId ? M : 2 * En(I), T = M, m = Math.max(0, f - p) + E, S = Math.max(0, v - y) + T, A = (p + f) / 2, R = (y + v) / 2;
+      const M = I.padding ?? 20, T = I.parentId ? M : 2 * Tn(I), E = M, m = Math.max(0, f - p) + T, S = Math.max(0, v - y) + E, A = (p + f) / 2, R = (y + v) / 2;
       I.x = A, I.y = R, I.width = m, I.height = S, g.set(I.id, { minX: p, maxX: f, minY: y, maxY: v });
     }
   }
@@ -474,18 +474,18 @@ function Zo(t, e, n, o) {
       v && (I = Math.min(I, v.minY), u = Math.max(u, v.maxY));
     }
     if (I !== 1 / 0 && u !== -1 / 0) {
-      const f = Math.max(0, u - I), v = Math.max(p, 36), M = f + 2 * v, E = (I + u) / 2;
+      const f = Math.max(0, u - I), v = Math.max(p, 36), M = f + 2 * v, T = (I + u) / 2;
       for (const k of x)
-        k.y = E, k.height = M, k.swimlaneContentTop = I;
-      const T = [...x].sort((k, O) => {
+        k.y = T, k.height = M, k.swimlaneContentTop = I;
+      const E = [...x].sort((k, O) => {
         const F = k.x ?? 0, H = O.x ?? 0;
         return F - H;
       }), m = [], S = [], A = [];
-      for (const k of T) {
+      for (const k of E) {
         const O = g.get(k.id);
         if (!O)
           continue;
-        const F = Math.max(0, O.maxX - O.minX) + 2 * En(k), H = (O.minX + O.maxX) / 2;
+        const F = Math.max(0, O.maxX - O.minX) + 2 * Tn(k), H = (O.minX + O.maxX) / 2;
         m.push(k.id), S.push(H), A.push(F);
       }
       const R = m.length;
@@ -605,10 +605,10 @@ function ht(t, e, n = _t) {
   return Math.abs(t.y - e.y) < n;
 }
 d(ht, "sameY");
-function Tt(t, e, n = _t) {
+function Et(t, e, n = _t) {
   return ht(t, e, n) && Math.abs(t.x - e.x) > n;
 }
-d(Tt, "isHorizontalSegment");
+d(Et, "isHorizontalSegment");
 function wt(t, e, n = _t) {
   return ft(t, e, n) && Math.abs(t.y - e.y) > n;
 }
@@ -627,7 +627,7 @@ d(ce, "sameAxisSegmentOverlapLength");
 function Re(t, e = _t) {
   const n = [];
   for (let o = 0; o < t.length - 1; o++) {
-    const s = t[o], r = t[o + 1], i = Tt(s, r, e), c = wt(s, r, e);
+    const s = t[o], r = t[o + 1], i = Et(s, r, e), c = wt(s, r, e);
     (i || c) && n.push({ index: o, a: s, b: r, horizontal: i, vertical: c });
   }
   return n;
@@ -654,7 +654,7 @@ function ro(t, e = _t) {
   if (!t || t.length !== 4)
     return;
   const [n, o, s, r] = t;
-  return Tt(n, o, e) && wt(o, s, e) && Tt(s, r, e) ? { kind: "HVH", p0: n, p1: o, p2: s, p3: r } : wt(n, o, e) && Tt(o, s, e) && wt(s, r, e) ? { kind: "VHV", p0: n, p1: o, p2: s, p3: r } : void 0;
+  return Et(n, o, e) && wt(o, s, e) && Et(s, r, e) ? { kind: "HVH", p0: n, p1: o, p2: s, p3: r } : wt(n, o, e) && Et(o, s, e) && wt(s, r, e) ? { kind: "VHV", p0: n, p1: o, p2: s, p3: r } : void 0;
 }
 d(ro, "classifyThreeSegmentRoute");
 function cn(t, e, n, o = 0) {
@@ -674,7 +674,7 @@ function Je(t, e) {
   return t.left < e.right && t.right > e.left && t.top < e.bottom && t.bottom > e.top;
 }
 d(Je, "rectsOverlap");
-function Tn(t, e) {
+function En(t, e) {
   return {
     left: t.left - e,
     right: t.right + e,
@@ -682,7 +682,7 @@ function Tn(t, e) {
     bottom: t.bottom + e
   };
 }
-d(Tn, "inflateRect");
+d(En, "inflateRect");
 function Ae(t, e, n, o) {
   return {
     left: t - n / 2,
@@ -819,8 +819,8 @@ function fo(t, e, n, o, s = _t, r = 1e-6) {
   const g = i ? { a: t, b: e } : { a: n, b: o }, x = c ? { a: t, b: e } : { a: n, b: o }, I = g.a.y, u = Math.min(g.a.x, g.b.x), p = Math.max(g.a.x, g.b.x), f = x.a.x, y = Math.min(x.a.y, x.b.y), v = Math.max(x.a.y, x.b.y);
   if (f < u || f > p || I < y || I > v)
     return !1;
-  const M = Math.abs(f - g.a.x) < r && Math.abs(I - g.a.y) < r || Math.abs(f - g.b.x) < r && Math.abs(I - g.b.y) < r, E = Math.abs(f - x.a.x) < r && Math.abs(I - x.a.y) < r || Math.abs(f - x.b.x) < r && Math.abs(I - x.b.y) < r;
-  return !(M && E);
+  const M = Math.abs(f - g.a.x) < r && Math.abs(I - g.a.y) < r || Math.abs(f - g.b.x) < r && Math.abs(I - g.b.y) < r, T = Math.abs(f - x.a.x) < r && Math.abs(I - x.a.y) < r || Math.abs(f - x.b.x) < r && Math.abs(I - x.b.y) < r;
+  return !(M && T);
 }
 d(fo, "orthogonalSegmentsCross");
 function ns(t, e, n, o, s = _t) {
@@ -1311,19 +1311,19 @@ function ms(t, e = "LR") {
     G > y && (y = G);
   }
   const v = [];
-  let M = 1 / 0, E = -1 / 0;
+  let M = 1 / 0, T = -1 / 0;
   for (const P of u) {
     const G = f.get(P.id) ?? [], j = po(G);
-    j && (M = Math.min(M, j.minX), E = Math.max(E, j.maxX), v.push({
+    j && (M = Math.min(M, j.minX), T = Math.max(T, j.maxX), v.push({
       lane: P,
       contentTop: j.minY,
       contentBottom: j.maxY,
       centerY: (j.minY + j.maxY) / 2
     }));
   }
-  if (M === 1 / 0 || E === -1 / 0)
+  if (M === 1 / 0 || T === -1 / 0)
     return !0;
-  const T = Math.max(0, E - M), m = Math.max(y, 10), S = T + 2 * m, A = c + S, O = (M + E) / 2 - S / 2 - c, F = O + A / 2, H = Math.max(y, c);
+  const E = Math.max(0, T - M), m = Math.max(y, 10), S = E + 2 * m, A = c + S, O = (M + T) / 2 - S / 2 - c, F = O + A / 2, H = Math.max(y, c);
   v.sort((P, G) => P.centerY - G.centerY);
   for (let P = 0; P < v.length; P++) {
     const G = v[P];
@@ -1366,30 +1366,30 @@ function ys(t, e) {
     let y;
     const v = I.rect;
     for (const M of jr) {
-      let E, T, m;
+      let T, E, m;
       if (a) {
         const F = u.cy > I.cy ? v.bottom : v.top, H = I.cx + M;
         if (H <= v.left + se || H >= v.right - se)
           continue;
-        E = { x: H, y: F }, T = { x: H, y: c.y }, m = { x: c.x, y: c.y };
+        T = { x: H, y: F }, E = { x: H, y: c.y }, m = { x: c.x, y: c.y };
       } else {
         const F = u.cx > I.cx ? v.right : v.left, H = I.cy + M;
         if (H <= v.top + se || H >= v.bottom - se)
           continue;
-        E = { x: F, y: H }, T = { x: c.x, y: H }, m = { x: c.x, y: c.y };
+        T = { x: F, y: H }, E = { x: c.x, y: H }, m = { x: c.x, y: c.y };
       }
-      const S = oe(E, T, se), A = oe(T, m, se);
-      if (S && A || !S && At(E, T, o, [g], 1) || !A && At(T, m, o, [x], 1))
+      const S = oe(T, E, se), A = oe(E, m, se);
+      if (S && A || !S && At(T, E, o, [g], 1) || !A && At(E, m, o, [x], 1))
         continue;
-      const R = !S && Ze(E, T, t, s, {
+      const R = !S && Ze(T, E, t, s, {
         epsilon: se,
         skipDegenerateOther: !0
-      }), k = !A && Ze(T, m, t, s, {
+      }), k = !A && Ze(E, m, t, s, {
         epsilon: se,
         skipDegenerateOther: !0
       });
       if (!(R || k)) {
-        S ? y = [T, m] : A ? y = [E, T] : y = [E, T, m];
+        S ? y = [E, m] : A ? y = [T, E] : y = [T, E, m];
         break;
       }
     }
@@ -1416,8 +1416,8 @@ function xs(t, e) {
     const v = I.x - u.x, M = I.y - u.y;
     if (Math.hypot(v, M) < 1e-3)
       continue;
-    const T = Tt(I, x, 1e-3), m = wt(I, x, 1e-3), S = Tt(u, I, 1e-3), A = wt(u, I, 1e-3);
-    if (!(T && A || m && S))
+    const E = Et(I, x, 1e-3), m = wt(I, x, 1e-3), S = Et(u, I, 1e-3), A = wt(u, I, 1e-3);
+    if (!(E && A || m && S))
       continue;
     const R = c.end, k = c.start, O = R ? e.get(R) : void 0;
     if (!O)
@@ -1488,8 +1488,8 @@ var Z = 1e-3, Ft = 8, it = Re, In = /* @__PURE__ */ d((t, e) => ft(t, e, Z) || h
 function bs(t, e) {
   const s = /* @__PURE__ */ d((u, p) => {
     const f = u.x ?? 0, y = u.y ?? 0, v = p.x - f, M = p.y - y;
-    let E = (u.width ?? 0) / 2, T = (u.height ?? 0) / 2;
-    return Math.abs(M) * E > Math.abs(v) * T ? (M < 0 && (T = -T), { x: f + (M === 0 ? 0 : T * v / M), y: y + T }) : (v < 0 && (E = -E), { x: f + E, y: y + (v === 0 ? 0 : E * M / v) });
+    let T = (u.width ?? 0) / 2, E = (u.height ?? 0) / 2;
+    return Math.abs(M) * T > Math.abs(v) * E ? (M < 0 && (E = -E), { x: f + (M === 0 ? 0 : E * v / M), y: y + E }) : (v < 0 && (T = -T), { x: f + T, y: y + (v === 0 ? 0 : T * M / v) });
   }, "rectIntersect"), r = /* @__PURE__ */ d((u, p) => {
     const f = pt(u.points ?? []);
     if (f.length < 2)
@@ -1497,9 +1497,9 @@ function bs(t, e) {
     const y = p ? u.start : u.end, v = y ? e.get(y) : void 0, M = v ? qt(v) : void 0;
     if (!v || !y || !M)
       return;
-    const E = p ? f[0] : f[f.length - 1], T = p ? f[1] : f[f.length - 2], m = s(v, E);
-    let S = E;
-    if (In(T, m) && (S = T), ft(m, S, Z))
+    const T = p ? f[0] : f[f.length - 1], E = p ? f[1] : f[f.length - 2], m = s(v, T);
+    let S = T;
+    if (In(E, m) && (S = E), ft(m, S, Z))
       return {
         edge: u,
         edgeId: String(u.id ?? ""),
@@ -1546,18 +1546,18 @@ function bs(t, e) {
       const S = f.length > 1 && oe(f[1], u.railEnd, Z), A = f.slice(S ? 2 : 1), R = A[0];
       return R && !In(R, v) ? void 0 : [y, v, ...A];
     }
-    const E = f.length > 1 && oe(f[f.length - 2], u.railEnd, Z), T = f.slice(0, E ? -2 : -1), m = T[T.length - 1];
+    const T = f.length > 1 && oe(f[f.length - 2], u.railEnd, Z), E = f.slice(0, T ? -2 : -1), m = E[E.length - 1];
     if (!(m && !In(m, v)))
-      return [...T, v, y];
+      return [...E, v, y];
   }, "shiftedCandidate"), x = /* @__PURE__ */ d((u) => {
     const p = u.edge, f = pt(p.points ?? []);
     if (f.length !== 2)
       return !1;
-    const y = p.start, v = p.end, M = y ? e.get(y) : void 0, E = v ? e.get(v) : void 0;
-    if (!M || !E)
+    const y = p.start, v = p.end, M = y ? e.get(y) : void 0, T = v ? e.get(v) : void 0;
+    if (!M || !T)
       return !1;
-    const T = M.x ?? 0, m = M.y ?? 0, S = E.x ?? 0, A = E.y ?? 0, [R, k] = f;
-    return ht(R, k, Z) && Math.abs(m - A) < 1 && Math.abs(T - S) > 1 || ft(R, k, Z) && Math.abs(T - S) < 1 && Math.abs(m - A) > 1;
+    const E = M.x ?? 0, m = M.y ?? 0, S = T.x ?? 0, A = T.y ?? 0, [R, k] = f;
+    return ht(R, k, Z) && Math.abs(m - A) < 1 && Math.abs(E - S) > 1 || ft(R, k, Z) && Math.abs(E - S) < 1 && Math.abs(m - A) > 1;
   }, "laneIsStraightCollinearConnector"), I = [
     -7,
     7,
@@ -1571,10 +1571,10 @@ function bs(t, e) {
     let f = !1;
     for (let y = 0; y < p.length && !f; y++)
       for (let v = y + 1; v < p.length && !f; v++) {
-        const M = p[y], E = p[v];
-        if (M.edge === E.edge || !(a(M, E) || l(M, E)))
+        const M = p[y], T = p[v];
+        if (M.edge === T.edge || !(a(M, T) || l(M, T)))
           continue;
-        const T = !a(M, E), m = [M, E].sort((S, A) => {
+        const E = !a(M, T), m = [M, T].sort((S, A) => {
           const R = x(S), k = x(A);
           return R !== k ? Number(R) - Number(k) : +!A.atStart - +!S.atStart;
         });
@@ -1585,7 +1585,7 @@ function bs(t, e) {
               continue;
             const k = r({ ...S.edge, points: R }, S.atStart);
             if (!(!k || p.some(
-              (O) => O.edge !== S.edge && (a(k, O) || T && l(k, O))
+              (O) => O.edge !== S.edge && (a(k, O) || E && l(k, O))
             ))) {
               S.edge.points = R, f = !0;
               break;
@@ -1632,12 +1632,12 @@ function Ms(t, e) {
   }, "candidateIsSafe"), i = /* @__PURE__ */ d((c, a) => {
     if (a + 4 >= c.length)
       return;
-    const l = c[a], g = c[a + 1], x = c[a + 2], I = c[a + 3], u = c[a + 4], p = Tt(l, g) && wt(g, x) && Tt(x, I) && wt(I, u) && ft(l, I, Z) && ft(l, u, Z) && ft(g, x, Z) && (g.x - l.x) * (I.x - x.x) < 0, f = wt(l, g) && Tt(g, x) && wt(x, I) && Tt(I, u) && ht(l, I, Z) && ht(l, u, Z) && ht(g, x, Z) && (g.y - l.y) * (I.y - x.y) < 0;
+    const l = c[a], g = c[a + 1], x = c[a + 2], I = c[a + 3], u = c[a + 4], p = Et(l, g) && wt(g, x) && Et(x, I) && wt(I, u) && ft(l, I, Z) && ft(l, u, Z) && ft(g, x, Z) && (g.x - l.x) * (I.x - x.x) < 0, f = wt(l, g) && Et(g, x) && wt(x, I) && Et(I, u) && ht(l, I, Z) && ht(l, u, Z) && ht(g, x, Z) && (g.y - l.y) * (I.y - x.y) < 0;
     if (p || f)
       return pt([...c.slice(0, a + 1), u, ...c.slice(a + 5)]);
     if (a + 5 >= c.length)
       return;
-    const y = c[a + 5], v = wt(l, g) && Tt(g, x) && wt(x, I) && Tt(I, u) && wt(u, y) && ft(l, u, Z) && ft(l, y, Z) && ft(x, I, Z) && (x.x - g.x) * (u.x - I.x) < 0, M = Tt(l, g) && wt(g, x) && Tt(x, I) && wt(I, u) && Tt(u, y) && ht(l, u, Z) && ht(l, y, Z) && ht(x, I, Z) && (x.y - g.y) * (u.y - I.y) < 0;
+    const y = c[a + 5], v = wt(l, g) && Et(g, x) && wt(x, I) && Et(I, u) && wt(u, y) && ft(l, u, Z) && ft(l, y, Z) && ft(x, I, Z) && (x.x - g.x) * (u.x - I.x) < 0, M = Et(l, g) && wt(g, x) && Et(x, I) && wt(I, u) && Et(u, y) && ht(l, u, Z) && ht(l, y, Z) && ht(x, I, Z) && (x.y - g.y) * (u.y - I.y) < 0;
     if (!(!v && !M))
       return pt([...c.slice(0, a + 1), y, ...c.slice(a + 6)]);
   }, "withoutDogleg");
@@ -1671,12 +1671,12 @@ function Xn(t, e) {
     let y = 0;
     for (let v = 0; v < c.length; v++) {
       const M = it(a(c[v], p, f));
-      for (let E = v + 1; E < c.length; E++) {
-        const T = it(
-          a(c[E], p, f)
+      for (let T = v + 1; T < c.length; T++) {
+        const E = it(
+          a(c[T], p, f)
         );
         for (const m of M)
-          for (const S of T)
+          for (const S of E)
             le(
               m.a,
               m.b,
@@ -1710,7 +1710,7 @@ function Xn(t, e) {
       return f.horizontal ? zt(f.a.x, f.b.x, M.left, M.right) >= Ft && f.a.y >= M.top - 2 && f.a.y <= M.bottom + 2 : zt(f.a.y, f.b.y, M.top, M.bottom) >= Ft && f.a.x >= M.left - 2 && f.a.x <= M.right + 2;
     });
   }, "blockingRectsFor"), I = /* @__PURE__ */ d((p, f, y) => {
-    const v = p.map((E) => ({ ...E }));
+    const v = p.map((T) => ({ ...T }));
     if (f.horizontal)
       v[f.index].y = y, v[f.index + 1].y = y;
     else if (f.vertical)
@@ -1721,18 +1721,18 @@ function Xn(t, e) {
     return it(M).length === M.length - 1 ? M : void 0;
   }, "candidateByMovingRail"), u = /* @__PURE__ */ d((p, f, y) => {
     const v = [p.start, p.end].filter(
-      (E) => !!E
+      (T) => !!T
     ), M = it(f);
     if (M.length !== f.length - 1)
       return !1;
-    for (const E of M)
-      if (At(E.a, E.b, r, v, -2) || At(E.a, E.b, i, [], -2))
+    for (const T of M)
+      if (At(T.a, T.b, r, v, -2) || At(T.a, T.b, i, [], -2))
         return !1;
-    for (const E of c)
-      if (E !== p) {
-        for (const T of M)
-          for (const m of it(a(E)))
-            if (ce(T, m, 0.5) >= Ft)
+    for (const T of c)
+      if (T !== p) {
+        for (const E of M)
+          for (const m of it(a(T)))
+            if (ce(E, m, 0.5) >= Ft)
               return !1;
       }
     return l(p, f) <= y;
@@ -1741,21 +1741,21 @@ function Xn(t, e) {
     const f = l();
     let y = !1;
     for (const v of c) {
-      const M = a(v), E = g(M);
-      if (!E)
+      const M = a(v), T = g(M);
+      if (!T)
         continue;
-      const T = x(v, E.segment);
-      if (T.length === 0)
+      const E = x(v, T.segment);
+      if (E.length === 0)
         continue;
-      const m = E.horizontal ? [
-        Math.min(...T.map((S) => S.rect.top)) - 20,
-        Math.max(...T.map((S) => S.rect.bottom)) + 20
+      const m = T.horizontal ? [
+        Math.min(...E.map((S) => S.rect.top)) - 20,
+        Math.max(...E.map((S) => S.rect.bottom)) + 20
       ] : [
-        Math.min(...T.map((S) => S.rect.left)) - 20,
-        Math.max(...T.map((S) => S.rect.right)) + 20
+        Math.min(...E.map((S) => S.rect.left)) - 20,
+        Math.max(...E.map((S) => S.rect.right)) + 20
       ];
       for (const S of m) {
-        const A = I(M, E.segment, S);
+        const A = I(M, T.segment, S);
         if (!(!A || !u(v, A, f))) {
           v.points = A, y = !0;
           break;
@@ -1874,12 +1874,12 @@ function Is(t, e) {
     for (let y = 0; y < s.length; y++) {
       const v = it(r(s[y], p));
       for (let M = y + 1; M < s.length; M++) {
-        const E = it(r(s[M], p));
-        for (const T of v)
-          for (const m of E)
+        const T = it(r(s[M], p));
+        for (const E of v)
+          for (const m of T)
             le(
-              T.a,
-              T.b,
+              E.a,
+              E.b,
               m.a,
               m.b,
               Z
@@ -1895,24 +1895,24 @@ function Is(t, e) {
     if (f.length < 4)
       return;
     const y = f[f.length - 2], v = f[f.length - 1];
-    if (!(!Tt(y, v, Z) && !wt(y, v, Z)))
+    if (!(!Et(y, v, Z) && !wt(y, v, Z)))
       return { tailStart: y, terminal: v };
   }, "terminalTailFor"), l = /* @__PURE__ */ d((p, f) => {
     const y = r(p);
     if (y.length < 3)
       return;
     const v = y[0], M = y[1];
-    let E;
-    if (Tt(v, M, Z))
-      E = { x: M.x, y: f.tailStart.y };
+    let T;
+    if (Et(v, M, Z))
+      T = { x: M.x, y: f.tailStart.y };
     else if (wt(v, M, Z))
-      E = { x: f.tailStart.x, y: M.y };
+      T = { x: f.tailStart.x, y: M.y };
     else
       return;
-    const T = ae(
-      pt([v, M, E, f.tailStart, f.terminal])
+    const E = ae(
+      pt([v, M, T, f.tailStart, f.terminal])
     );
-    return it(T).length === T.length - 1 ? T : void 0;
+    return it(E).length === E.length - 1 ? E : void 0;
   }, "candidateWithDestinationTail"), g = /* @__PURE__ */ d((p, f) => {
     const y = [p.start, p.end].filter(
       (v) => !!v
@@ -1925,8 +1925,8 @@ function Is(t, e) {
     for (const v of s)
       if (v !== p) {
         for (const M of it(f))
-          for (const E of it(r(v, y)))
-            if (ce(M, E, 0.5) >= Ft)
+          for (const T of it(r(v, y)))
+            if (ce(M, T, 0.5) >= Ft)
               return !0;
       }
     return !1;
@@ -1946,11 +1946,11 @@ function Is(t, e) {
     if (f === 0)
       return;
     const y = c();
-    let v, M = f, E = y;
-    for (const T of u().values())
-      for (let m = 0; m < T.length; m++)
-        for (let S = m + 1; S < T.length; S++) {
-          const A = T[m], R = T[S], k = a(A), O = a(R);
+    let v, M = f, T = y;
+    for (const E of u().values())
+      for (let m = 0; m < E.length; m++)
+        for (let S = m + 1; S < E.length; S++) {
+          const A = E[m], R = E[S], k = a(A), O = a(R);
           if (!k || !O)
             continue;
           const F = l(A, O), H = l(R, k);
@@ -1963,26 +1963,26 @@ function Is(t, e) {
           if (!I(A, F, P) || !I(R, H, P))
             continue;
           const G = i(P), j = c(P);
-          G >= f || G > M || G === M && j >= E || (v = P, M = G, E = j);
+          G >= f || G > M || G === M && j >= T || (v = P, M = G, T = j);
         }
     if (!v)
       return;
-    for (const [T, m] of v)
-      T.points = m;
+    for (const [E, m] of v)
+      E.points = m;
   }
 }
 d(Is, "swapDestinationTerminalTailsToReduceCrossings");
 function Ss(t, e) {
   const { realNodeRects: r, labelNodeRects: i } = me(
     e.values()
-  ), c = t.filter((T) => !T.isLayoutOnly), a = /* @__PURE__ */ d((T, m = /* @__PURE__ */ new Map()) => pt(
-    m.get(T) ?? T.points ?? []
-  ), "replacementPointsFor"), l = /* @__PURE__ */ d((T = /* @__PURE__ */ new Map()) => {
+  ), c = t.filter((E) => !E.isLayoutOnly), a = /* @__PURE__ */ d((E, m = /* @__PURE__ */ new Map()) => pt(
+    m.get(E) ?? E.points ?? []
+  ), "replacementPointsFor"), l = /* @__PURE__ */ d((E = /* @__PURE__ */ new Map()) => {
     let m = 0;
     for (let S = 0; S < c.length; S++) {
-      const A = it(a(c[S], T));
+      const A = it(a(c[S], E));
       for (let R = S + 1; R < c.length; R++) {
-        const k = it(a(c[R], T));
+        const k = it(a(c[R], E));
         for (const O of A)
           for (const F of k)
             le(
@@ -1995,21 +1995,21 @@ function Ss(t, e) {
       }
     }
     return m;
-  }, "strictCrossingCount"), g = /* @__PURE__ */ d((T = /* @__PURE__ */ new Map()) => c.reduce(
-    (m, S) => m + Qt(a(S, T)),
+  }, "strictCrossingCount"), g = /* @__PURE__ */ d((E = /* @__PURE__ */ new Map()) => c.reduce(
+    (m, S) => m + Qt(a(S, E)),
     0
-  ), "totalBends"), x = /* @__PURE__ */ d((T) => {
-    const m = T.start, S = T.end, A = m ? e.get(m) : void 0, R = S ? e.get(S) : void 0, k = A ? qt(A) : void 0, O = R ? qt(R) : void 0;
+  ), "totalBends"), x = /* @__PURE__ */ d((E) => {
+    const m = E.start, S = E.end, A = m ? e.get(m) : void 0, R = S ? e.get(S) : void 0, k = A ? qt(A) : void 0, O = R ? qt(R) : void 0;
     return k && O ? { src: k, dst: O } : void 0;
-  }, "endpointRectsFor"), I = /* @__PURE__ */ d((T, m, S) => {
+  }, "endpointRectsFor"), I = /* @__PURE__ */ d((E, m, S) => {
     if (S.index <= 0 || S.index + 1 >= m.length - 1)
       return;
-    const A = x(T);
+    const A = x(E);
     if (A) {
       if (S.vertical) {
         const R = S.a.x, k = Math.min(A.src.left, A.dst.left), O = Math.max(A.src.right, A.dst.right), F = R < k - Z ? "left" : R > O + Z ? "right" : void 0;
         return F ? {
-          edge: T,
+          edge: E,
           points: m,
           segmentIndex: S.index,
           axis: "vertical",
@@ -2022,7 +2022,7 @@ function Ss(t, e) {
       if (S.horizontal) {
         const R = S.a.y, k = Math.min(A.src.top, A.dst.top), O = Math.max(A.src.bottom, A.dst.bottom), F = R < k - Z ? "top" : R > O + Z ? "bottom" : void 0;
         return F ? {
-          edge: T,
+          edge: E,
           points: m,
           segmentIndex: S.index,
           axis: "horizontal",
@@ -2034,46 +2034,46 @@ function Ss(t, e) {
       }
     }
   }, "externalRailForSegment"), u = /* @__PURE__ */ d(() => {
-    const T = [];
+    const E = [];
     for (const m of c) {
       const S = a(m);
       for (const A of it(S)) {
         const R = I(m, S, A);
-        R && T.push(R);
+        R && E.push(R);
       }
     }
-    return T;
-  }, "collectExternalRails"), p = /* @__PURE__ */ d((T, m) => T.edge !== m.edge && T.axis === m.axis && T.side === m.side && zt(T.min, T.max, m.min, m.max) >= Ft, "railsInteract"), f = /* @__PURE__ */ d((T) => {
+    return E;
+  }, "collectExternalRails"), p = /* @__PURE__ */ d((E, m) => E.edge !== m.edge && E.axis === m.axis && E.side === m.side && zt(E.min, E.max, m.min, m.max) >= Ft, "railsInteract"), f = /* @__PURE__ */ d((E) => {
     const m = [], S = /* @__PURE__ */ new Set();
-    for (const A of T) {
+    for (const A of E) {
       if (S.has(A))
         continue;
       const R = [A], k = [];
       for (S.add(A); R.length > 0; ) {
         const O = R.pop();
         k.push(O);
-        for (const F of T)
+        for (const F of E)
           !S.has(F) && p(O, F) && (S.add(F), R.push(F));
       }
       k.length > 1 && m.push(k);
     }
     return m;
-  }, "connectedComponents"), y = /* @__PURE__ */ d((T) => {
+  }, "connectedComponents"), y = /* @__PURE__ */ d((E) => {
     const m = [];
-    for (const S of T)
+    for (const S of E)
       m.some((A) => Math.abs(A - S.coord) < Z) || m.push(S.coord);
-    for (; m.length < T.length; ) {
-      const S = Math.min(...m), A = Math.max(...m), R = T[0].side;
+    for (; m.length < E.length; ) {
+      const S = Math.min(...m), A = Math.max(...m), R = E[0].side;
       m.push(
-        R === "left" || R === "top" ? S - 12 * (T.length - m.length) : A + 12 * (T.length - m.length)
+        R === "left" || R === "top" ? S - 12 * (E.length - m.length) : A + 12 * (E.length - m.length)
       );
     }
     return m;
-  }, "uniqueCoordsFor"), v = /* @__PURE__ */ d((T) => {
-    const m = T.map((R) => R.coord), S = y(T), A = [];
-    if (T.length <= 6) {
+  }, "uniqueCoordsFor"), v = /* @__PURE__ */ d((E) => {
+    const m = E.map((R) => R.coord), S = y(E), A = [];
+    if (E.length <= 6) {
       const R = new Array(S.length).fill(!1), k = [], O = /* @__PURE__ */ d(() => {
-        if (k.length === T.length) {
+        if (k.length === E.length) {
           k.some((F, H) => Math.abs(F - m[H]) >= Z) && A.push([...k]);
           return;
         }
@@ -2088,9 +2088,9 @@ function Ss(t, e) {
         [O[R], O[k]] = [O[k], O[R]], A.push(O);
       }
     return A;
-  }, "coordinateAssignmentsFor"), M = /* @__PURE__ */ d((T, m) => {
+  }, "coordinateAssignmentsFor"), M = /* @__PURE__ */ d((E, m) => {
     const S = /* @__PURE__ */ new Map();
-    for (const [R, k] of T.entries()) {
+    for (const [R, k] of E.entries()) {
       const O = m[R], F = S.get(k.edge) ?? k.points.map((H) => ({ x: H.x, y: H.y }));
       k.axis === "vertical" ? (F[k.segmentIndex].x = O, F[k.segmentIndex + 1].x = O) : (F[k.segmentIndex].y = O, F[k.segmentIndex + 1].y = O), S.set(k.edge, F);
     }
@@ -2102,8 +2102,8 @@ function Ss(t, e) {
       A.set(R, O);
     }
     return A;
-  }, "replacementsForAssignment"), E = /* @__PURE__ */ d((T) => {
-    for (const [m, S] of T) {
+  }, "replacementsForAssignment"), T = /* @__PURE__ */ d((E) => {
+    for (const [m, S] of E) {
       const A = [
         m.start,
         m.end
@@ -2113,12 +2113,12 @@ function Ss(t, e) {
           return !1;
     }
     for (let m = 0; m < c.length; m++) {
-      const S = c[m], A = T.has(S), R = it(a(S, T));
+      const S = c[m], A = E.has(S), R = it(a(S, E));
       for (let k = m + 1; k < c.length; k++) {
         const O = c[k];
-        if (!A && !T.has(O))
+        if (!A && !E.has(O))
           continue;
-        const F = it(a(O, T));
+        const F = it(a(O, E));
         for (const H of R)
           for (const P of F)
             if (ce(H, P, 0.5) >= Ft)
@@ -2127,7 +2127,7 @@ function Ss(t, e) {
     }
     return !0;
   }, "candidateIsSafe");
-  for (let T = 0; T < 4; T++) {
+  for (let E = 0; E < 4; E++) {
     const m = l();
     if (m === 0)
       return;
@@ -2135,7 +2135,7 @@ function Ss(t, e) {
     for (const O of f(u()))
       for (const F of v(O)) {
         const H = M(O, F);
-        if (!H || !E(H))
+        if (!H || !T(H))
           continue;
         const P = l(H);
         if (P >= m)
@@ -2166,14 +2166,14 @@ function Cs(t, e) {
     for (let y = 0; y < r.length; y++) {
       const v = it(i(r[y], u, p));
       for (let M = y + 1; M < r.length; M++) {
-        const E = it(
+        const T = it(
           i(r[M], u, p)
         );
-        for (const T of v)
-          for (const m of E)
+        for (const E of v)
+          for (const m of T)
             le(
-              T.a,
-              T.b,
+              E.a,
+              E.b,
               m.a,
               m.b,
               Z
@@ -2203,10 +2203,10 @@ function Cs(t, e) {
   }, "endpointRectsFor"), x = /* @__PURE__ */ d((u, p) => {
     if (p + 3 >= u.length)
       return [];
-    const f = u[p], y = u[p + 1], v = u[p + 2], M = u[p + 3], E = Tt(f, y, Z) && wt(y, v, Z) && Tt(v, M, Z), T = wt(f, y, Z) && Tt(y, v, Z) && wt(v, M, Z);
-    if (!E && !T)
+    const f = u[p], y = u[p + 1], v = u[p + 2], M = u[p + 3], T = Et(f, y, Z) && wt(y, v, Z) && Et(v, M, Z), E = wt(f, y, Z) && Et(y, v, Z) && wt(v, M, Z);
+    if (!T && !E)
       return [];
-    if (!(E ? Math.sign(y.x - f.x) !== Math.sign(M.x - v.x) : Math.sign(y.y - f.y) !== Math.sign(M.y - v.y)))
+    if (!(T ? Math.sign(y.x - f.x) !== Math.sign(M.x - v.x) : Math.sign(y.y - f.y) !== Math.sign(M.y - v.y)))
       return [];
     const S = ft(f, M, Z) || ht(f, M, Z) ? [] : [
       { x: f.x, y: M.y },
@@ -2227,29 +2227,29 @@ function Cs(t, e) {
       (M) => !!M
     ), v = g(u);
     for (const M of it(p))
-      if (At(M.a, M.b, o, y, -2) || At(M.a, M.b, s, [], -2) || v.some((E) => l(M, E)))
+      if (At(M.a, M.b, o, y, -2) || At(M.a, M.b, s, [], -2) || v.some((T) => l(M, T)))
         return !1;
     for (const M of r)
       if (M !== u) {
-        for (const E of it(p))
-          for (const T of it(i(M)))
-            if (ce(E, T, 0.5) >= Ft)
+        for (const T of it(p))
+          for (const E of it(i(M)))
+            if (ce(T, E, 0.5) >= Ft)
               return !1;
       }
     return a(u, p) <= f;
   }, "candidateIsSafe");
   for (let u = 0; u < 8; u++) {
     const p = a();
-    let f, y, v = p, M = Number.POSITIVE_INFINITY, E = Number.POSITIVE_INFINITY;
-    for (const T of r) {
-      const m = i(T), S = Qt(m, Z), A = c(m);
+    let f, y, v = p, M = Number.POSITIVE_INFINITY, T = Number.POSITIVE_INFINITY;
+    for (const E of r) {
+      const m = i(E), S = Qt(m, Z), A = c(m);
       for (let R = 0; R <= m.length - 4; R++)
         for (const k of x(m, R)) {
           const O = Qt(k, Z), F = c(k);
-          if (!(O < S || O === S && F < A - Z) || !I(T, k, p))
+          if (!(O < S || O === S && F < A - Z) || !I(E, k, p))
             continue;
-          const P = a(T, k);
-          P > v || P === v && (O > M || O === M && F >= E) || (f = T, y = k, v = P, M = O, E = F);
+          const P = a(E, k);
+          P > v || P === v && (O > M || O === M && F >= T) || (f = E, y = k, v = P, M = O, T = F);
         }
     }
     if (!f || !y)
@@ -2337,7 +2337,7 @@ function vs(t, e) {
       }
     }
     return N.count - V + h;
-  }, "crossingCountWithReplacements"), E = /* @__PURE__ */ d((N) => {
+  }, "crossingCountWithReplacements"), T = /* @__PURE__ */ d((N) => {
     const _ = /* @__PURE__ */ new Map();
     for (const h of N.pairs) {
       const b = _.get(h.first) ?? /* @__PURE__ */ new Set();
@@ -2359,14 +2359,14 @@ function vs(t, e) {
       C.sort((L, w) => (I.get(L) ?? 0) - (I.get(w) ?? 0)), C.length > 1 && D.push(C);
     }
     return D;
-  }, "crossingComponents"), T = /* @__PURE__ */ d((N) => [N.start, N.end].filter(
+  }, "crossingComponents"), E = /* @__PURE__ */ d((N) => [N.start, N.end].filter(
     (_) => !!_
   ), "endpointIdsFor"), m = /* @__PURE__ */ d((N) => {
     const _ = [];
-    for (const D of E(N)) {
-      const V = new Set(D), h = new Set(D.flatMap((C) => T(C))), b = [...D];
+    for (const D of T(N)) {
+      const V = new Set(D), h = new Set(D.flatMap((C) => E(C))), b = [...D];
       for (const C of x)
-        V.has(C) || T(C).some((L) => h.has(L)) && b.push(C);
+        V.has(C) || E(C).some((L) => h.has(L)) && b.push(C);
       b.sort((C, L) => (I.get(C) ?? 0) - (I.get(L) ?? 0)), _.push(b);
     }
     return _;
@@ -2538,7 +2538,7 @@ function vs(t, e) {
     if (h.length < 4)
       return [];
     const b = h[0], C = h[1], L = [];
-    return wt(b, C, Z) ? et(L, b, C, V) : Tt(b, C, Z) && at(L, b, C, V), L;
+    return wt(b, C, Z) ? et(L, b, C, V) : Et(b, C, Z) && at(L, b, C, V), L;
   }, "terminalPreservingOuterTrackCandidates"), xt = /* @__PURE__ */ d((N) => {
     const _ = N.start, D = N.end, V = _ ? c.get(_) : void 0, h = D ? c.get(D) : void 0;
     if (!V || !h)
@@ -2723,27 +2723,27 @@ function Ls(t, e) {
     left: Math.min(...o.map((f) => f.rect.left)) - r,
     right: Math.max(...o.map((f) => f.rect.right)) + r
   }, c = /* @__PURE__ */ d((f, y, v, M) => {
-    const E = [], T = co(f, y, v, M, r, pe);
-    return T && E.push(T), y === M && E.push(ao(f, y, v, i[y])), E;
+    const T = [], E = co(f, y, v, M, r, pe);
+    return E && T.push(E), y === M && T.push(ao(f, y, v, i[y])), T;
   }, "buildOrthogonalPathCandidates"), a = /* @__PURE__ */ d((f, y) => {
     for (let v = 0; v < f.length - 1; v++) {
-      const M = f[v], E = f[v + 1];
-      if (At(M, E, o, y, 1))
+      const M = f[v], T = f[v + 1];
+      if (At(M, T, o, y, 1))
         return !0;
     }
     return !1;
   }, "pathHitsNode"), l = /* @__PURE__ */ d((f, y, v = !1) => {
     let M = 0;
-    const E = Re(f, pe), T = y.start, m = y.end;
+    const T = Re(f, pe), E = y.start, m = y.end;
     for (const S of t) {
       if (S === y || S.isLayoutOnly)
         continue;
       const A = S.start, R = S.end;
-      if (!v && T && m && (A === T || A === m || R === T || R === m))
+      if (!v && E && m && (A === E || A === m || R === E || R === m))
         continue;
       const k = S.points;
       if (!(!k || k.length < 2))
-        for (const O of E)
+        for (const O of T)
           for (const F of Re(k, pe)) {
             if (fo(
               O.a,
@@ -2761,9 +2761,9 @@ function Ls(t, e) {
     }
     return M;
   }, "pathConflictCount"), g = 4, x = /* @__PURE__ */ d((f, y) => {
-    const v = Math.abs(f.y - y.rect.top), M = Math.abs(f.y - y.rect.bottom), E = Math.abs(f.x - y.rect.left), T = Math.abs(f.x - y.rect.right);
+    const v = Math.abs(f.y - y.rect.top), M = Math.abs(f.y - y.rect.bottom), T = Math.abs(f.x - y.rect.left), E = Math.abs(f.x - y.rect.right);
     let m = "top", S = v;
-    return M < S && (m = "bottom", S = M), E < S && (m = "left", S = E), T < S && (m = "right", S = T), m;
+    return M < S && (m = "bottom", S = M), T < S && (m = "left", S = T), E < S && (m = "right", S = E), m;
   }, "nearestSideOfRect"), I = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ d((f, y, v) => {
     const M = I.get(f) ?? [];
     M.push({ side: y, edgeId: v }), I.set(f, M);
@@ -2774,14 +2774,14 @@ function Ls(t, e) {
     const y = f.points ?? [];
     if (y.length < 1)
       continue;
-    const v = f.id ?? "", M = f.start, E = f.end;
+    const v = f.id ?? "", M = f.start, T = f.end;
     if (M) {
-      const T = n.get(M);
-      T && u(M, x(y[0], T), v);
+      const E = n.get(M);
+      E && u(M, x(y[0], E), v);
     }
-    if (E) {
-      const T = n.get(E);
-      T && u(E, x(y[y.length - 1], T), v);
+    if (T) {
+      const E = n.get(T);
+      E && u(T, x(y[y.length - 1], E), v);
     }
   }
   const p = /* @__PURE__ */ d((f, y, v) => I.get(f)?.some((M) => M.edgeId !== v && M.side === y) ?? !1, "faceIsClaimed");
@@ -2794,24 +2794,24 @@ function Ls(t, e) {
     const v = Qt(y, pe);
     if (v < g)
       continue;
-    const M = f.start, E = f.end;
-    if (!M || !E)
+    const M = f.start, T = f.end;
+    if (!M || !T)
       continue;
-    const T = n.get(M), m = n.get(E);
-    if (!T || !m)
+    const E = n.get(M), m = n.get(T);
+    if (!E || !m)
       continue;
     const S = f.id ?? "", A = l(y, f, !0), R = l(y, f);
     let k, O = A, F = v;
     for (const H of s) {
       if (p(M, H, S))
         continue;
-      const P = Ie(T, H);
+      const P = Ie(E, H);
       for (const G of s) {
-        if (p(E, G, S))
+        if (p(T, G, S))
           continue;
         const j = Ie(m, G);
         for (const J of c(P, H, j, G)) {
-          if (a(J, [M, E]))
+          if (a(J, [M, T]))
             continue;
           const dt = Qt(J, pe);
           if (A > 0) {
@@ -2832,11 +2832,11 @@ function Ls(t, e) {
         M,
         H.filter((G) => G.edgeId !== S)
       );
-      const P = I.get(E);
+      const P = I.get(T);
       P && I.set(
-        E,
+        T,
         P.filter((G) => G.edgeId !== S)
-      ), u(M, x(k[0], T), S), u(E, x(k[k.length - 1], m), S);
+      ), u(M, x(k[0], E), S), u(T, x(k[k.length - 1], m), S);
     }
   }
 }
@@ -2875,7 +2875,7 @@ function $n(t, e) {
   }
 }
 d($n, "markerClearanceRectFor");
-function Es(t) {
+function Ts(t) {
   return {
     left: Math.min(t.left, t.right),
     right: Math.max(t.left, t.right),
@@ -2883,11 +2883,11 @@ function Es(t) {
     bottom: Math.max(t.top, t.bottom)
   };
 }
-d(Es, "normalizeRect");
+d(Ts, "normalizeRect");
 function zn(t, e) {
   const n = pt(e), o = $n(n, !0), s = $n(n, !1);
   return [o, s].some(
-    (r) => r && Je(t, Es(r))
+    (r) => r && Je(t, Ts(r))
   );
 }
 d(zn, "labelOverlapsOwnMarker");
@@ -2921,13 +2921,13 @@ function Ue(t, e) {
     });
   }
   const r = 3, i = 1, c = 12, a = /* @__PURE__ */ d((p, f) => {
-    const y = Tn(f, r);
+    const y = En(f, r);
     for (const { nodeId: v, rect: M } of o)
       if (v !== p && Je(y, M))
         return !0;
     return !1;
   }, "labelOverlapsForeignNode"), l = /* @__PURE__ */ d((p, f) => {
-    const y = Tn(f, r);
+    const y = En(f, r);
     for (const v of n)
       if (v.edgeId !== p && cn(v.p1, v.p2, y))
         return !0;
@@ -2951,13 +2951,13 @@ function Ue(t, e) {
     const v = p.points;
     if (!v || v.length < 2)
       continue;
-    const M = y.width ?? 0, E = y.height ?? 0;
-    if (M <= 0 || E <= 0)
+    const M = y.width ?? 0, T = y.height ?? 0;
+    if (M <= 0 || T <= 0)
       continue;
-    const T = [];
+    const E = [];
     for (let Q = 0; Q < v.length - 1; Q++) {
       const W = v[Q], et = v[Q + 1], at = Math.abs(W.x - et.x), gt = Math.abs(W.y - et.y);
-      at < Kt && gt < Kt || at >= Kt && gt >= Kt || T.push({
+      at < Kt && gt < Kt || at >= Kt && gt >= Kt || E.push({
         idx: Q,
         length: at + gt,
         orientation: at >= Kt ? "horizontal" : "vertical",
@@ -2965,37 +2965,37 @@ function Ue(t, e) {
         midY: (W.y + et.y) / 2
       });
     }
-    if (T.length === 0)
+    if (E.length === 0)
       continue;
-    const m = T.length >= 3 ? T.filter((Q) => Q.idx > 0 && Q.idx < T.length - 1) : T, S = m.length > 0 ? m : T, A = M >= E ? "horizontal" : "vertical", R = /* @__PURE__ */ d((Q) => [...Q].sort((W, et) => {
+    const m = E.length >= 3 ? E.filter((Q) => Q.idx > 0 && Q.idx < E.length - 1) : E, S = m.length > 0 ? m : E, A = M >= T ? "horizontal" : "vertical", R = /* @__PURE__ */ d((Q) => [...Q].sort((W, et) => {
       const at = W.orientation === A, gt = et.orientation === A;
       if (at !== gt)
         return at ? -1 : 1;
-      const xt = W.length >= (W.orientation === "horizontal" ? M : E) + 2, vt = et.length >= (et.orientation === "horizontal" ? M : E) + 2;
+      const xt = W.length >= (W.orientation === "horizontal" ? M : T) + 2, vt = et.length >= (et.orientation === "horizontal" ? M : T) + 2;
       return xt !== vt ? xt ? -1 : 1 : et.length - W.length;
-    }), "rankSegments"), k = T[0], O = T[T.length - 1], F = [0.5, 0.25, 0.75, 0.05, 0.95, 0.15, 0.85, 0.1, 0.9], H = /* @__PURE__ */ d((Q, W) => {
+    }), "rankSegments"), k = E[0], O = E[E.length - 1], F = [0.5, 0.25, 0.75, 0.05, 0.95, 0.15, 0.85, 0.1, 0.9], H = /* @__PURE__ */ d((Q, W) => {
       const et = v[Q.idx], at = v[Q.idx + 1];
       return {
         midX: et.x + (at.x - et.x) * W,
         midY: et.y + (at.y - et.y) * W
       };
     }, "anchorAtT"), P = /* @__PURE__ */ d((Q, W, et) => Math.min(et, Math.max(W, Q)), "clamp"), G = /* @__PURE__ */ d((Q, W) => Q.midX >= W.left - Kt && Q.midX <= W.right + Kt && Q.midY >= W.top - Kt && Q.midY <= W.bottom + Kt, "pointInsideRectInclusive"), j = /* @__PURE__ */ d((Q) => {
-      const W = Ae(Q.midX, Q.midY, M, E), et = I(W);
+      const W = Ae(Q.midX, Q.midY, M, T), et = I(W);
       if (et)
         return { laneId: et, anchor: Q, rect: W };
       const at = s.find(({ rect: te }) => G(Q, te));
       if (!at)
         return;
-      const gt = at.rect.left + M / 2 + i, xt = at.rect.right - M / 2 - i, vt = at.rect.top + E / 2 + i, Vt = at.rect.bottom - E / 2 - i;
+      const gt = at.rect.left + M / 2 + i, xt = at.rect.right - M / 2 - i, vt = at.rect.top + T / 2 + i, Vt = at.rect.bottom - T / 2 - i;
       if (gt > xt || vt > Vt)
         return;
       const jt = {
         midX: P(Q.midX, gt, xt),
         midY: P(Q.midY, vt, Vt)
-      }, Ut = Ae(jt.midX, jt.midY, M, E);
+      }, Ut = Ae(jt.midX, jt.midY, M, T);
       return G(Q, Ut) ? { laneId: at.id, anchor: jt, rect: Ut } : void 0;
     }, "placementForAnchor"), J = /* @__PURE__ */ d((Q, W, et) => Q.orientation === "horizontal" ? Math.abs(W.midX - et.x) : Math.abs(W.midY - et.y), "distanceAlongSegment"), dt = /* @__PURE__ */ d((Q, W) => {
-      const at = (Q.orientation === "horizontal" ? M / 2 : E / 2) + c;
+      const at = (Q.orientation === "horizontal" ? M / 2 : T / 2) + c;
       if (Q === k) {
         const gt = v[Q.idx];
         if (J(Q, W, gt) + Kt < at)
@@ -3028,10 +3028,10 @@ function Ue(t, e) {
         if (vt && !zn(vt.rect, v) && !u(f, vt.rect) && !a(f, vt.rect) && (et || !l(p.id, vt.rect)))
           return { laneId: vt.laneId, anchor: vt.anchor };
       }
-    }, "findLaneContainingFallback"), Pt = mt(S) ?? (S.length < T.length ? mt(T) : void 0) ?? kt(T, !0) ?? kt(T, !1) ?? kt(T, !1, !0);
+    }, "findLaneContainingFallback"), Pt = mt(S) ?? (S.length < E.length ? mt(E) : void 0) ?? kt(E, !0) ?? kt(E, !1) ?? kt(E, !1, !0);
     if (Pt) {
       y.x = Pt.anchor.midX, y.y = Pt.anchor.midY, y.parentId = Pt.laneId;
-      const Q = Ae(Pt.anchor.midX, Pt.anchor.midY, M, E), W = x.findIndex((et) => et.labelId === f);
+      const Q = Ae(Pt.anchor.midX, Pt.anchor.midY, M, T), W = x.findIndex((et) => et.labelId === f);
       W >= 0 ? x[W] = { labelId: f, rect: Q } : x.push({ labelId: f, rect: Q });
     }
   }
@@ -3042,7 +3042,7 @@ function Vn(t, e) {
   return t < e ? `${t}::${e}` : `${e}::${t}`;
 }
 d(Vn, "pairKey");
-function Ts(t, e) {
+function Es(t, e) {
   const { nodeInfoById: n, realNodeRects: o } = an(e), s = /* @__PURE__ */ new Map();
   for (const i of e) {
     const c = i.id;
@@ -3097,8 +3097,8 @@ function Ts(t, e) {
     }
     if (At(f, y, o, [l, g], 1))
       continue;
-    const M = r(i, l, g, u ? "x" : "y"), E = M > Bo ? M : Bo, T = [0, E, -E];
-    for (const m of T) {
+    const M = r(i, l, g, u ? "x" : "y"), T = M > Bo ? M : Bo, E = [0, T, -T];
+    for (const m of E) {
       const S = { ...f }, A = { ...y };
       if (u) {
         if (S.x += m, A.x += m, S.x <= x.rect.left || S.x >= x.rect.right || A.x <= I.rect.left || A.x >= I.rect.right)
@@ -3112,7 +3112,7 @@ function Ts(t, e) {
     }
   }
 }
-d(Ts, "straightenCollinearSiblingDetours");
+d(Es, "straightenCollinearSiblingDetours");
 function jn(t, e) {
   const { realNodeRects: a, labelNodeRects: l } = me(
     e.values()
@@ -3212,7 +3212,7 @@ function jn(t, e) {
       ],
       1e-3
     );
-  }, "horizontalSourceDetour"), E = /* @__PURE__ */ d((m, S) => {
+  }, "horizontalSourceDetour"), T = /* @__PURE__ */ d((m, S) => {
     const A = y(m);
     if (A) {
       if (m.vertical)
@@ -3234,7 +3234,7 @@ function jn(t, e) {
           A.tail
         );
     }
-  }, "sourceDetourCandidate"), T = [
+  }, "sourceDetourCandidate"), E = [
     -7,
     7,
     -14,
@@ -3252,13 +3252,13 @@ function jn(t, e) {
           continue;
         const H = [O, F].filter((P) => P.interior);
         for (const P of H) {
-          for (const G of T) {
+          for (const G of E) {
             const j = p(P, G);
             if (j && u(P.edge, j)) {
               P.edge.points = j, A = !0;
               break;
             }
-            const J = E(P, G);
+            const J = T(P, G);
             if (J && u(P.edge, J)) {
               P.edge.points = J, A = !0;
               break;
@@ -3352,7 +3352,7 @@ function Rs(t, e) {
       Qe(a)
     ));
   }
-  Ls(o, n), Ts(o, n), ys(o, n);
+  Ls(o, n), Es(o, n), ys(o, n);
   const r = /* @__PURE__ */ new Map();
   for (const c of n)
     r.set(String(c.id), c);
@@ -3598,18 +3598,18 @@ function Bs(t, e) {
       const A = y.get(S);
       A ? A.push(m.id) : y.set(S, [m.id]);
     }
-  const v = [], M = [], E = /* @__PURE__ */ new Set(), T = /* @__PURE__ */ d((m) => {
-    if (!E.has(m)) {
-      E.add(m), v.push(m);
+  const v = [], M = [], T = /* @__PURE__ */ new Set(), E = /* @__PURE__ */ d((m) => {
+    if (!T.has(m)) {
+      T.add(m), v.push(m);
       for (const S of l.get(m) ?? [])
-        T(S);
+        E(S);
       M.push(m);
     }
   }, "walk");
   for (const m of x)
-    T(m);
+    E(m);
   for (const m of i)
-    T(m);
+    E(m);
   return {
     parent: a,
     children: l,
@@ -3692,60 +3692,60 @@ function Hs(t, e, n, o) {
 d(Hs, "popBlock");
 function Xs(t, e, n) {
   const o = [...t.nodes], s = /* @__PURE__ */ new Map();
-  for (const [M, E] of o.entries())
-    s.set(E, M);
+  for (const [M, T] of o.entries())
+    s.set(T, M);
   const r = o.length, i = new Array(r).fill(-1), c = new Array(r).fill(0), a = [], l = /* @__PURE__ */ new Set();
   for (const M of o) {
-    const E = n.parent.get(M) ?? null, T = s.get(M);
-    T != null && E == null && (i[T] = -1, c[T] = 0, l.has(M) || (l.add(M), a.push(M)));
+    const T = n.parent.get(M) ?? null, E = s.get(M);
+    E != null && T == null && (i[E] = -1, c[E] = 0, l.has(M) || (l.add(M), a.push(M)));
   }
   for (; a.length > 0; ) {
-    const M = a.shift(), E = s.get(M);
-    if (E == null)
+    const M = a.shift(), T = s.get(M);
+    if (T == null)
       continue;
-    const T = n.children.get(M) ?? [];
-    for (const m of T) {
+    const E = n.children.get(M) ?? [];
+    for (const m of E) {
       if (l.has(m))
         continue;
       const S = s.get(m);
-      S != null && (i[S] = E, c[S] = c[E] + 1, l.add(m), a.push(m));
+      S != null && (i[S] = T, c[S] = c[T] + 1, l.add(m), a.push(m));
     }
   }
   for (const M of o) {
     if (l.has(M))
       continue;
-    const E = s.get(M);
-    E != null && (i[E] = -1, c[E] = 0, l.add(M));
+    const T = s.get(M);
+    T != null && (i[T] = -1, c[T] = 0, l.add(M));
   }
   const g = Math.max(1, Math.ceil(Math.log2(Math.max(1, r))) + 1), x = Array.from({ length: g }, () => new Array(r).fill(-1));
   for (let M = 0; M < r; M++)
     x[0][M] = i[M];
   for (let M = 1; M < g; M++)
-    for (let E = 0; E < r; E++) {
-      const T = x[M - 1][E];
-      x[M][E] = T === -1 ? -1 : x[M - 1][T];
+    for (let T = 0; T < r; T++) {
+      const E = x[M - 1][T];
+      x[M][T] = E === -1 ? -1 : x[M - 1][E];
     }
-  const I = /* @__PURE__ */ d((M, E) => {
-    if (M === -1 || E === -1)
+  const I = /* @__PURE__ */ d((M, T) => {
+    if (M === -1 || T === -1)
       return -1;
-    c[M] < c[E] && ([M, E] = [E, M]);
-    const T = c[M] - c[E];
+    c[M] < c[T] && ([M, T] = [T, M]);
+    const E = c[M] - c[T];
     for (let m = 0; m < g; m++)
-      if (T >> m & 1 && (M = x[m][M], M === -1))
+      if (E >> m & 1 && (M = x[m][M], M === -1))
         return -1;
-    if (M === E)
+    if (M === T)
       return M;
     for (let m = g - 1; m >= 0; m--) {
-      const S = x[m][M], A = x[m][E];
-      S === -1 || A === -1 || S !== A && (M = S, E = A);
+      const S = x[m][M], A = x[m][T];
+      S === -1 || A === -1 || S !== A && (M = S, T = A);
     }
     return x[0][M];
   }, "lcaIndex"), u = Array.from({ length: r }, () => /* @__PURE__ */ new Map());
   for (const M of t.edges) {
-    let E = M.src, T = M.dst, m = e[E], S = e[T];
-    if (m == null || S == null || (m > S && ([E, T] = [T, E], [m, S] = [S, m]), m == null || S == null || m === S))
+    let T = M.src, E = M.dst, m = e[T], S = e[E];
+    if (m == null || S == null || (m > S && ([T, E] = [E, T], [m, S] = [S, m]), m == null || S == null || m === S))
       continue;
-    const A = s.get(E), R = s.get(T);
+    const A = s.get(T), R = s.get(E);
     if (A == null || R == null)
       continue;
     const k = I(A, R);
@@ -3755,14 +3755,14 @@ function Xs(t, e, n) {
     for (let F = m; F < S; F++)
       O.set(F, (O.get(F) ?? 0) + 1);
   }
-  const p = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ d((M, E) => {
-    if (E.size !== 0)
-      for (const [T, m] of E)
-        M.set(T, (M.get(T) ?? 0) + m);
+  const p = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ d((M, T) => {
+    if (T.size !== 0)
+      for (const [E, m] of T)
+        M.set(E, (M.get(E) ?? 0) + m);
   }, "mergeInto"), y = /* @__PURE__ */ new Set(), v = /* @__PURE__ */ d((M) => {
-    const E = s.get(M);
+    const T = s.get(M);
     y.add(M);
-    const T = E == null ? void 0 : u[E], m = T ? new Map(T) : /* @__PURE__ */ new Map(), S = n.children.get(M) ?? [];
+    const E = T == null ? void 0 : u[T], m = E ? new Map(E) : /* @__PURE__ */ new Map(), S = n.children.get(M) ?? [];
     for (const A of S) {
       const R = v(A), k = e[M];
       if (k != null) {
@@ -3999,18 +3999,18 @@ function Ks(t, e) {
     return !0;
   }), a = Be(n) ?? [...n.nodes], l = [...a].reverse(), g = /* @__PURE__ */ d((p, f) => {
     let y = 0;
-    for (const E of i.get(p) ?? [])
-      y = Math.max(y, (s[E] ?? 0) + 1);
+    for (const T of i.get(p) ?? [])
+      y = Math.max(y, (s[T] ?? 0) + 1);
     let v = Number.POSITIVE_INFINITY;
     const M = c.get(p) ?? [];
-    return M.length > 0 && (v = Math.min(...M.map((E) => (s[E] ?? 0) - 1))), Number.isFinite(v) || (v = Math.max(y, f)), Math.min(Math.max(f, y), v);
+    return M.length > 0 && (v = Math.min(...M.map((T) => (s[T] ?? 0) - 1))), Number.isFinite(v) || (v = Math.max(y, f)), Math.min(Math.max(f, y), v);
   }, "clampFeasible"), x = sn.GRAVITY_ITERATIONS, I = /* @__PURE__ */ d((p) => {
     let f = !1;
     for (const y of p) {
       const v = i.get(y) ?? [], M = c.get(y) ?? [];
       if (v.length === 0 && M.length === 0)
         continue;
-      const E = v.length > 0 ? v.reduce((A, R) => A + (s[R] ?? 0) + 1, 0) / v.length : s[y] ?? 0, T = M.length > 0 ? M.reduce((A, R) => A + (s[R] ?? 0) - 1, 0) / M.length : s[y] ?? 0, m = Math.round((E + T) / 2), S = g(y, m);
+      const T = v.length > 0 ? v.reduce((A, R) => A + (s[R] ?? 0) + 1, 0) / v.length : s[y] ?? 0, E = M.length > 0 ? M.reduce((A, R) => A + (s[R] ?? 0) - 1, 0) / M.length : s[y] ?? 0, m = Math.round((T + E) / 2), S = g(y, m);
       S !== s[y] && (s[y] = S, f = !0);
     }
     return f;
@@ -4061,8 +4061,8 @@ function Js(t, e) {
     let u = 0;
     if (I.length > 0)
       for (const v of I) {
-        const M = v.src, E = i[M] ?? 0;
-        u = Math.max(u, E + a(M, g));
+        const M = v.src, T = i[M] ?? 0;
+        u = Math.max(u, T + a(M, g));
       }
     const p = r(g), f = c.get(p) ?? 0, y = Math.max(u, f);
     i[g] = y, c.set(p, y + 1);
@@ -4088,9 +4088,9 @@ function Zs(t, e) {
       continue;
     }
     let y = u.src;
-    for (let M = p + 1, E = 0; M < f; M++, E++) {
-      const T = a(M);
-      g.push({ id: `${u.id}#${E}`, src: y, dst: T, weight: u.weight, ref: u.ref }), y = T;
+    for (let M = p + 1, T = 0; M < f; M++, T++) {
+      const E = a(M);
+      g.push({ id: `${u.id}#${T}`, src: y, dst: E, weight: u.weight, ref: u.ref }), y = E;
     }
     const v = f - p - 2;
     g.push({
@@ -4197,8 +4197,8 @@ function Zn(t, e, n, o, s) {
     u = !1;
     for (let f = 0; f + 1 < r.length; f++) {
       if (I) {
-        const M = I.get(r[f]), E = I.get(r[f + 1]);
-        if (M !== E)
+        const M = I.get(r[f]), T = I.get(r[f + 1]);
+        if (M !== T)
           continue;
       }
       const y = p;
@@ -4234,10 +4234,10 @@ function nr(t, e, n) {
   for (const O of a)
     for (const F of O)
       M.add(p(F));
-  const E = M.has(null), T = f.filter((O) => M.has(O)), m = [...E ? [null] : [], ...T], S = /* @__PURE__ */ Object.create(null);
-  for (const O of T)
+  const T = M.has(null), E = f.filter((O) => M.has(O)), m = [...T ? [null] : [], ...E], S = /* @__PURE__ */ Object.create(null);
+  for (const O of E)
     S[O] = 0;
-  E && (S.null = 0);
+  T && (S.null = 0);
   for (const O of a) {
     const F = /* @__PURE__ */ Object.create(null), H = [];
     for (const P of O) {
@@ -4248,7 +4248,7 @@ function nr(t, e, n) {
       const j = G.reduce((J, dt) => J + I(dt), 0) + s * Math.max(0, G.length - 1);
       S[P] = Math.max(S[P] ?? 0, j);
     }
-    if (E && H.length) {
+    if (T && H.length) {
       const P = H.reduce((G, j) => G + I(j), 0) + s * Math.max(0, H.length - 1);
       S.null = Math.max(S.null ?? 0, P);
     }
@@ -4451,7 +4451,7 @@ function ur(t, e) {
   };
 }
 d(ur, "sugiyamaLayout");
-var ct = qr.EPSILON, Jr = 8, be = 15, Te = 15, je = 25, ne = 20, Cn = 10;
+var ct = qr.EPSILON, Jr = 8, be = 15, Ee = 15, je = 25, ne = 20, Cn = 10;
 function eo(t, e, n) {
   const o = t.x ?? 0, s = t.y ?? 0, r = e.x - o, i = e.y - s, c = Math.abs(r), a = Math.abs(i);
   return c < ct && a < ct ? n : a > ct && a * 3 >= c ? i > 0 ? "bottom" : "top" : c > ct ? r > 0 ? "right" : "left" : n;
@@ -4536,7 +4536,7 @@ function hr(t, e) {
         Y.edgeIndex === h || Y.orientation !== "horizontal" || Y.pipe.coord < q || Y.pipe.coord > z || Y.from - ct <= U && Y.to + ct >= U && (B += v);
     }
     return B;
-  }, "crossingPenalty"), E = s.map((h, b) => {
+  }, "crossingPenalty"), T = s.map((h, b) => {
     if (!h.start || !h.end)
       return { idx: b, crossLane: 0, dx: 0, dy: 0 };
     const C = r.get(h.start), L = r.get(h.end), w = i.get(h.start), B = i.get(h.end), U = w && B && w.id !== B.id ? 1 : 0, q = C && L ? Math.abs((L.x ?? 0) - (C.x ?? 0)) : 0, z = C && L ? Math.abs((L.y ?? 0) - (C.y ?? 0)) : 0;
@@ -4546,7 +4546,7 @@ function hr(t, e) {
       return b.crossLane - h.crossLane;
     const C = h.dx + h.dy, L = b.dx + b.dy;
     return Math.abs(C - L) > 1 ? C - L : h.idx - b.idx;
-  }).map((h) => h.idx), T = /* @__PURE__ */ d((h, b, C, L) => {
+  }).map((h) => h.idx), E = /* @__PURE__ */ d((h, b, C, L) => {
     const w = Math.min(h.x, b.x), B = Math.max(h.x, b.x), U = Math.min(h.y, b.y), q = Math.max(h.y, b.y);
     return !!g.find((Y) => C && Y.nodeId === C || L && Y.nodeId === L ? !1 : Math.abs(h.x - b.x) > ct ? Y.minY < h.y && Y.maxY > h.y && Y.maxX > w && Y.minX < B : Y.minX < h.x && Y.maxX > h.x && Y.maxY > U && Y.minY < q);
   }, "isSegmentBlocked"), m = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map();
@@ -4648,7 +4648,7 @@ function hr(t, e) {
     const ot = J.get(`${h}:src`), rt = J.get(`${h}:dst`);
     return ot !== void 0 && (z = Pt(z, U, ot)), rt !== void 0 && (Y = Pt(Y, q, rt)), { pSrcPort: z, pDstPort: Y, srcSide: U, dstSide: q };
   }, "portsForEdge");
-  for (const h of E) {
+  for (const h of T) {
     const b = s[h];
     if (f[h] = [], !b.start || !b.end || b.points && b.points.length > 0 || b.start === b.end)
       continue;
@@ -4685,14 +4685,14 @@ function hr(t, e) {
         const Nt = X.y > ($.y ?? 0);
         return {
           x: (K.x ?? 0) >= X.x ? lt.maxX + be : lt.minX - be,
-          y: Nt ? lt.maxY + Te : lt.minY - Te,
+          y: Nt ? lt.maxY + Ee : lt.minY - Ee,
           leavesPositiveSide: Nt
         };
       }
-      const bt = X.x > ($.x ?? 0), Et = (K.y ?? 0) >= X.y;
+      const bt = X.x > ($.x ?? 0), Tt = (K.y ?? 0) >= X.y;
       return {
         x: bt ? lt.maxX + be : lt.minX - be,
-        y: Et ? lt.maxY + Te : lt.minY - Te,
+        y: Tt ? lt.maxY + Ee : lt.minY - Ee,
         leavesPositiveSide: bt
       };
     }, "obstacleDetour");
@@ -4748,8 +4748,8 @@ function hr(t, e) {
       }
     }
     if (yt.length === 0 && Dt.length === 0) {
-      const X = be, $ = Math.abs(z.x - Y.x) < X, K = Math.abs(z.y - Y.y) < X, lt = J.get(`${h}:src`) !== void 0 || J.get(`${h}:dst`) !== void 0, Ct = (m.get(`${b.start ?? ""}:${U}:src`)?.length ?? 0) + (m.get(`${b.start ?? ""}:${U}:dst`)?.length ?? 0), bt = (m.get(`${b.end ?? ""}:${q}:src`)?.length ?? 0) + (m.get(`${b.end ?? ""}:${q}:dst`)?.length ?? 0), Et = Ct > 1 || bt > 1, Nt = S.get(b.start ?? "") ?? 0, ut = S.get(b.end ?? "") ?? 0, Yt = Ct > 1 && kt(b.start, U) || bt > 1 && kt(b.end, q), ee = Ct <= 1 || Nt <= 2, Bt = bt <= 1 || ut <= 2;
-      if (($ || K) && !lt && (!Et || Et && !Yt && ee && Bt) && !T(w, B, b.start, b.end)) {
+      const X = be, $ = Math.abs(z.x - Y.x) < X, K = Math.abs(z.y - Y.y) < X, lt = J.get(`${h}:src`) !== void 0 || J.get(`${h}:dst`) !== void 0, Ct = (m.get(`${b.start ?? ""}:${U}:src`)?.length ?? 0) + (m.get(`${b.start ?? ""}:${U}:dst`)?.length ?? 0), bt = (m.get(`${b.end ?? ""}:${q}:src`)?.length ?? 0) + (m.get(`${b.end ?? ""}:${q}:dst`)?.length ?? 0), Tt = Ct > 1 || bt > 1, Nt = S.get(b.start ?? "") ?? 0, ut = S.get(b.end ?? "") ?? 0, Yt = Ct > 1 && kt(b.start, U) || bt > 1 && kt(b.end, q), ee = Ct <= 1 || Nt <= 2, Bt = bt <= 1 || ut <= 2;
+      if (($ || K) && !lt && (!Tt || Tt && !Yt && ee && Bt) && !E(w, B, b.start, b.end)) {
         b.points = [{ ...w }, { ...z }, { ...Y }, { ...B }], y.add(h);
         const Mt = K ? "horizontal" : "vertical", $t = K ? w.y : w.x, It = K ? Math.min(w.x, B.x) : Math.min(w.y, B.y), St = K ? Math.max(w.x, B.x) : Math.max(w.y, B.y), Wt = {
           id: `fast-path-${Mt}-${$t.toFixed(0)}-${h}`,
@@ -4785,7 +4785,7 @@ function hr(t, e) {
         continue;
       const $ = be;
       x("horizontal", X.minY - $, ue, he), x("horizontal", X.maxY + $, ue, he);
-      const K = Te;
+      const K = Ee;
       x("vertical", X.minX - K, ve, Le), x("vertical", X.maxX + K, ve, Le);
     }
     x("horizontal", z.y, ue, he), x("horizontal", Y.y, ue, he);
@@ -4800,7 +4800,7 @@ function hr(t, e) {
       pt: z
     }), De.add(Fe);
     let Ht = [];
-    const ge = /* @__PURE__ */ d((X, $) => T(X, $, b.start, b.end), "checkSegmentBlocked"), yn = { x: Y.x, y: z.y }, br = ge(z, yn), Mr = ge(yn, Y), Ir = br || Mr, xn = { x: z.x, y: Y.y }, Sr = ge(z, xn), Cr = ge(xn, Y);
+    const ge = /* @__PURE__ */ d((X, $) => E(X, $, b.start, b.end), "checkSegmentBlocked"), yn = { x: Y.x, y: z.y }, br = ge(z, yn), Mr = ge(yn, Y), Ir = br || Mr, xn = { x: z.x, y: Y.y }, Sr = ge(z, xn), Cr = ge(xn, Y);
     if (Ir ? Sr || Cr || (Math.abs(z.x - Y.x) < ct ? Ht = [z, Y] : Ht = [z, xn, Y]) : Math.abs(z.y - Y.y) < ct || Math.abs(z.x - Y.x) < ct ? Ht = [z, Y] : Ht = [z, yn, Y], Ht.length === 0)
       for (; xe.length > 0; ) {
         xe.sort((ut, Yt) => ut.f - Yt.f);
@@ -4813,22 +4813,22 @@ function hr(t, e) {
           }
           break;
         }
-        const $ = X.pt.x, K = X.pt.y, lt = xr.sort((ut, Yt) => ut.coord - Yt.coord), Ct = lt.findIndex((ut) => Math.abs(ut.coord - $) < 1), bt = yr.sort((ut, Yt) => ut.coord - Yt.coord), Et = bt.findIndex((ut) => Math.abs(ut.coord - K) < 1), Nt = [];
-        Ct > 0 && Nt.push({ x: lt[Ct - 1].coord, y: K }), Ct >= 0 && Ct < lt.length - 1 && Nt.push({ x: lt[Ct + 1].coord, y: K }), Et > 0 && Nt.push({ x: $, y: bt[Et - 1].coord }), Et >= 0 && Et < bt.length - 1 && Nt.push({ x: $, y: bt[Et + 1].coord });
+        const $ = X.pt.x, K = X.pt.y, lt = xr.sort((ut, Yt) => ut.coord - Yt.coord), Ct = lt.findIndex((ut) => Math.abs(ut.coord - $) < 1), bt = yr.sort((ut, Yt) => ut.coord - Yt.coord), Tt = bt.findIndex((ut) => Math.abs(ut.coord - K) < 1), Nt = [];
+        Ct > 0 && Nt.push({ x: lt[Ct - 1].coord, y: K }), Ct >= 0 && Ct < lt.length - 1 && Nt.push({ x: lt[Ct + 1].coord, y: K }), Tt > 0 && Nt.push({ x: $, y: bt[Tt - 1].coord }), Tt >= 0 && Tt < bt.length - 1 && Nt.push({ x: $, y: bt[Tt + 1].coord });
         for (const ut of Nt) {
           const Yt = Math.min($, ut.x), ee = Math.max($, ut.x), Bt = Math.min(K, ut.y), Gt = Math.max(K, ut.y);
           if (g.some((Zt) => Zt.nodeId === b.start || Zt.nodeId === b.end ? !1 : Yt !== ee ? Zt.minY < K && Zt.maxY > K && Zt.maxX > Yt && Zt.minX < ee : Zt.minX < $ && Zt.maxX > $ && Zt.maxY > Bt && Zt.minY < Gt))
             continue;
           const Mt = ke(ut.x, ut.y), $t = Math.abs(ut.x - $) + Math.abs(ut.y - K), It = M(h, X.pt, ut);
           let St = 0;
-          const Wt = Y.x - z.x, Ee = Y.y - z.y, He = ut.x - $, bn = ut.y - K;
-          (Ee > 10 && bn < -5 || Ee < -10 && bn > 5) && (St = Math.abs(bn) * 100), (Wt > 10 && He < -5 || Wt < -10 && He > 5) && (St += Math.abs(He) * 50);
+          const Wt = Y.x - z.x, Te = Y.y - z.y, He = ut.x - $, bn = ut.y - K;
+          (Te > 10 && bn < -5 || Te < -10 && bn > 5) && (St = Math.abs(bn) * 100), (Wt > 10 && He < -5 || Wt < -10 && He > 5) && (St += Math.abs(He) * 50);
           let Lo = 0;
-          const Eo = mn.get(X.key) ?? "n", To = Math.abs(He) > ct ? "h" : "v";
-          Eo !== "n" && Eo !== To && (Lo = 50);
+          const To = mn.get(X.key) ?? "n", Eo = Math.abs(He) > ct ? "h" : "v";
+          To !== "n" && To !== Eo && (Lo = 50);
           const vr = $t + It + St + Lo, Xe = (_e.get(X.key) ?? 1 / 0) + vr, wo = Math.abs(Y.x - ut.x) + Math.abs(Y.y - ut.y);
           if (Xe < (_e.get(Mt) ?? 1 / 0))
-            if (pn.set(Mt, X.pt), _e.set(Mt, Xe), mn.set(Mt, To), !De.has(Mt))
+            if (pn.set(Mt, X.pt), _e.set(Mt, Xe), mn.set(Mt, Eo), !De.has(Mt))
               xe.push({ key: Mt, f: Xe + wo, pt: ut }), De.add(Mt);
             else {
               const Zt = xe.findIndex((Lr) => Lr.key === Mt);
@@ -4841,10 +4841,10 @@ function hr(t, e) {
       let K = Math.min(X.x, $.x), lt = Math.max(X.x, $.x), Ct = Math.min(X.y, $.y), bt = Math.max(X.y, $.y);
       for (const Bt of Ht)
         K = Math.min(K, Bt.x), lt = Math.max(lt, Bt.x), Ct = Math.min(Ct, Bt.y), bt = Math.max(bt, Bt.y);
-      const Et = lt > Math.max(X.x, $.x), Nt = K < Math.min(X.x, $.x);
+      const Tt = lt > Math.max(X.x, $.x), Nt = K < Math.min(X.x, $.x);
       if (a) {
-        const Bt = Te;
-        if (Et) {
+        const Bt = Ee;
+        if (Tt) {
           const Gt = Math.max(X.x, $.x), Ot = Math.min(X.y, $.y), Mt = Math.max(X.y, $.y), $t = g.filter(
             (It) => It.minX < Gt && It.maxX > Gt && // obstacle's x-range contains the path x
             It.minY < Mt && It.maxY > Ot
@@ -4856,8 +4856,8 @@ function hr(t, e) {
               const Wt = (St.minX + St.maxX) / 2;
               if (St.visualXHalfExtent === void 0 || isNaN(St.visualXHalfExtent))
                 continue;
-              const Ee = Wt + St.visualXHalfExtent + Bt;
-              It = Math.max(It, Ee);
+              const Te = Wt + St.visualXHalfExtent + Bt;
+              It = Math.max(It, Te);
             }
             isNaN(It) || (lt = It);
           }
@@ -4904,9 +4904,9 @@ function hr(t, e) {
         }
         return $.y;
       }, "findBestReturnY"), Yt = /* @__PURE__ */ d((Bt) => {
-        const Gt = ut(Bt), Ot = { x: Bt, y: X.y }, Mt = { x: Bt, y: Gt }, $t = { x: $.x, y: Gt }, It = ge(X, Ot), St = ge(Ot, Mt), Wt = ge(Mt, $t), Ee = Gt !== $.y ? ge($t, $) : !1;
-        return !It && !St && !Wt && !Ee ? Math.abs(Gt - $.y) < ct ? [X, Ot, Mt, $] : [X, Ot, Mt, $t, $] : null;
-      }, "trySimplifyWithDetourX"), ee = Et && !Nt ? Yt(lt) : Nt && !Et ? Yt(K) : null;
+        const Gt = ut(Bt), Ot = { x: Bt, y: X.y }, Mt = { x: Bt, y: Gt }, $t = { x: $.x, y: Gt }, It = ge(X, Ot), St = ge(Ot, Mt), Wt = ge(Mt, $t), Te = Gt !== $.y ? ge($t, $) : !1;
+        return !It && !St && !Wt && !Te ? Math.abs(Gt - $.y) < ct ? [X, Ot, Mt, $] : [X, Ot, Mt, $t, $] : null;
+      }, "trySimplifyWithDetourX"), ee = Tt && !Nt ? Yt(lt) : Nt && !Tt ? Yt(K) : null;
       ee && (Ht = ee);
     }
     const Xt = [
@@ -4920,11 +4920,11 @@ function hr(t, e) {
     if (Xt.length >= 3) {
       const X = Xt[Xt.length - 1], $ = Xt[Xt.length - 2], K = Xt[Xt.length - 3], lt = Math.abs(K.y - $.y) < ct && Math.abs($.y - X.y) < ct, Ct = Math.abs(K.x - $.x) < ct && Math.abs($.x - X.x) < ct;
       if (lt) {
-        const bt = Math.sign($.x - K.x), Et = Math.sign(X.x - K.x);
-        bt !== 0 && bt === Et && Math.abs($.x - K.x) > Math.abs(X.x - K.x) && Xt.splice(-2, 1);
+        const bt = Math.sign($.x - K.x), Tt = Math.sign(X.x - K.x);
+        bt !== 0 && bt === Tt && Math.abs($.x - K.x) > Math.abs(X.x - K.x) && Xt.splice(-2, 1);
       } else if (Ct) {
-        const bt = Math.sign($.y - K.y), Et = Math.sign(X.y - K.y);
-        bt !== 0 && bt === Et && Math.abs($.y - K.y) > Math.abs(X.y - K.y) && Xt.splice(-2, 1);
+        const bt = Math.sign($.y - K.y), Tt = Math.sign(X.y - K.y);
+        bt !== 0 && bt === Tt && Math.abs($.y - K.y) > Math.abs(X.y - K.y) && Xt.splice(-2, 1);
       }
     }
     const ie = [Xt[0]];
@@ -4954,7 +4954,7 @@ function hr(t, e) {
     }
     ie.push(Xt[Xt.length - 1]);
     for (let X = 0; X < ie.length - 1; X++) {
-      const $ = ie[X], K = ie[X + 1], lt = Math.abs($.x - K.x) < ct ? "vertical" : "horizontal", Ct = lt === "vertical" ? $.x : $.y, bt = lt === "vertical" ? Math.min($.y, K.y) : Math.min($.x, K.x), Et = lt === "vertical" ? Math.max($.y, K.y) : Math.max($.x, K.x), Nt = x(lt, Ct, bt, Et), ut = {
+      const $ = ie[X], K = ie[X + 1], lt = Math.abs($.x - K.x) < ct ? "vertical" : "horizontal", Ct = lt === "vertical" ? $.x : $.y, bt = lt === "vertical" ? Math.min($.y, K.y) : Math.min($.x, K.x), Tt = lt === "vertical" ? Math.max($.y, K.y) : Math.max($.x, K.x), Nt = x(lt, Ct, bt, Tt), ut = {
         edgeIndex: h,
         segmentIndex: X,
         orientation: lt,
@@ -4962,13 +4962,13 @@ function hr(t, e) {
         trackIndex: 0,
         // Initial track
         from: bt,
-        to: Et
+        to: Tt
       };
       p.push(ut), f[h].push(p.length - 1), Nt.tracks[0] || (Nt.tracks[0] = { index: 0, coord: Nt.coord, segments: [] }), Nt.tracks[0].segments.push({
         edgeIndex: h,
         segmentIndex: X,
         from: bt,
-        to: Et
+        to: Tt
       });
     }
   }
@@ -5320,7 +5320,7 @@ function pr(t) {
 d(pr, "runSwimlaneLayoutCore");
 async function Zr(t, e) {
   const n = e.select("g");
-  Tr(n, t.markers, t.type, t.diagramId), wr(), Ar(), Rr(), Er(), qo(t);
+  Er(n, t.markers, t.type, t.diagramId), wr(), Ar(), Rr(), Tr(), qo(t);
   const o = Qo(t);
   t.nodes = o.nodes, t.edges = o.edges;
   const { groups: s } = await Fo(n, t);