@g1cloud/bpmn-modeler-next 5.0.0-beta.60 → 5.0.0-beta.62

package/dist/bpmn-modeler.js

@@ -414,7 +414,7 @@ class Qb {
     const b = !!v && !y(m), E = b ? r.filter((k) => k !== m && w(k) && !y(k)) : [], A = () => {
       let k = c.extensionElements;
       return k || (k = this.moddle.create("bpmn:ExtensionElements", { values: [] }), k.$parent = c, c.extensionElements = k, u.push(() => delete c.extensionElements)), k.get("values");
-    }, N = (k, H) => {
+    }, I = (k, H) => {
       const F = A();
       let G = F.find((ee) => {
         var se;
@@ -433,15 +433,15 @@ class Qb {
       if (m === o && l) {
         if (f && !p.some((H) => H.body === f)) {
           const H = a && a !== o ? a : void 0;
-          H && N(H, f);
+          H && I(H, f);
         }
         const k = Object.prototype.hasOwnProperty.call(l.target, l.key);
         l.target[l.key] = i, u.push(() => {
           k ? l.target[l.key] = f : delete l.target[l.key];
         });
       }
-      N(m, i);
-    } else (p.some((k) => Dn(k) === m) || !f && m !== d) && N(m, i);
+      I(m, i);
+    } else (p.some((k) => Dn(k) === m) || !f && m !== d) && I(m, i);
     if (!b) for (const k of Nr(c).filter((H) => H.locale === m)) P(k);
     for (const k of E) {
       const H = A(), F = this.moddle.create(wd, { locale: k, sourceLocale: m, previous: v });
@@ -1318,7 +1318,7 @@ function lw(e) {
   if (!this)
     return new lw(e);
   var t = e && e.proxy, n, i, o, r, a = MR, s, c, l, u, p = Hc, f = !1, d = !1, g = "", h = !1, m = !1, w = null, y = !1, v, b, E, A;
-  function N(F) {
+  function I(F) {
     F instanceof Error || (F = zo(F)), w = F, a(F, p);
   }
   function P(F) {
@@ -1388,7 +1388,7 @@ function lw(e) {
     y = !0;
   };
   function H(F, G = !1) {
-    var ee = null, se = null, ie, ve = 0, fe = !1, ge = !1, _e = 0, U = 0, le, K, Q, de, Ee, Fe, $, C, R, W = "", q = 0, pe;
+    var ee = null, se = null, ie, ve = 0, de = !1, me = !1, _e = 0, U = 0, le, K, Q, he, Ee, Fe, $, C, R, W = "", q = 0, pe;
     function Te(_t, Jt) {
       var En = _t.indexOf(":");
       if (En === -1)
@@ -1483,9 +1483,9 @@ function lw(e) {
         if (G)
           return F.substring(U);
         if (E.length)
-          return N("unexpected end of file");
+          return I("unexpected end of file");
         if (!d)
-          return N("missing start tag");
+          return I("missing start tag");
         U < F.length && F.substring(U).trim() && P(Hm);
         return;
       }
@@ -1496,10 +1496,10 @@ function lw(e) {
         } else if (F.substring(U, _e).trim() && (P(Hm), y))
           return;
       }
-      if (de = F.charCodeAt(_e + 1), de === 33) {
+      if (he = F.charCodeAt(_e + 1), he === 33) {
         if (Q = F.charCodeAt(_e + 2), Q === 91 && F.substr(_e + 3, 6) === "CDATA[") {
           if (U = F.indexOf("]]>", _e), U === -1)
-            return G ? F.substring(_e) : N("unclosed cdata");
+            return G ? F.substring(_e) : I("unclosed cdata");
           if (r && (r(F.substring(_e + 9, U), p), y))
             return;
           U += 3;
@@ -1507,16 +1507,16 @@ function lw(e) {
         }
         if (Q === 45 && F.charCodeAt(_e + 3) === 45) {
           if (U = F.indexOf("-->", _e), U === -1)
-            return G ? F.substring(_e) : N("unclosed comment");
+            return G ? F.substring(_e) : I("unclosed comment");
           if (c && (c(F.substring(_e + 4, U), Tr, p), y))
             return;
           U += 3;
           continue;
         }
       }
-      if (de === 63) {
+      if (he === 63) {
         if (U = F.indexOf("?>", _e), U === -1)
-          return G ? F.substring(_e) : N("unclosed question");
+          return G ? F.substring(_e) : I("unclosed question");
         if (l && (l(F.substring(_e, U + 2), p), y))
           return;
         U += 2;
@@ -1524,7 +1524,7 @@ function lw(e) {
       }
       for (le = _e + 1; ; le++) {
         if (Ee = F.charCodeAt(le), isNaN(Ee))
-          return G ? F.substring(_e) : (U = -1, N("unclosed tag"));
+          return G ? F.substring(_e) : (U = -1, I("unclosed tag"));
         if (Ee === 34)
           Q = F.indexOf('"', le + 1), le = Q !== -1 ? Q : le;
         else if (Ee === 39)
@@ -1534,54 +1534,54 @@ function lw(e) {
           break;
         }
       }
-      if (de === 33) {
+      if (he === 33) {
         if (u && (u(F.substring(_e, U + 1), Tr, p), y))
           return;
         U += 1;
         continue;
       }
-      if (pe = {}, de === 47) {
-        if (fe = !1, ge = !0, !E.length)
-          return N("missing open tag");
+      if (pe = {}, he === 47) {
+        if (de = !1, me = !0, !E.length)
+          return I("missing open tag");
         if (le = $ = E.pop(), Q = _e + 2 + le.length, F.substring(_e + 2, Q) !== le)
-          return N("closing tag mismatch");
+          return I("closing tag mismatch");
         for (; Q < U; Q++)
-          if (de = F.charCodeAt(Q), !(de === 32 || de > 8 && de < 14))
-            return N("close tag");
+          if (he = F.charCodeAt(Q), !(he === 32 || he > 8 && he < 14))
+            return I("close tag");
       } else {
-        if (F.charCodeAt(U - 1) === 47 ? (le = $ = F.substring(_e + 1, U - 1), fe = !0, ge = !0) : (le = $ = F.substring(_e + 1, U), fe = !0, ge = !1), !(de > 96 && de < 123 || de > 64 && de < 91 || de === 95 || de === 58))
-          return N("illegal first char nodeName");
+        if (F.charCodeAt(U - 1) === 47 ? (le = $ = F.substring(_e + 1, U - 1), de = !0, me = !0) : (le = $ = F.substring(_e + 1, U), de = !0, me = !1), !(he > 96 && he < 123 || he > 64 && he < 91 || he === 95 || he === 58))
+          return I("illegal first char nodeName");
         for (Q = 1, K = le.length; Q < K; Q++)
-          if (de = le.charCodeAt(Q), !(de > 96 && de < 123 || de > 64 && de < 91 || de > 47 && de < 59 || de === 45 || de === 95 || de == 46)) {
-            if (de === 32 || de < 14 && de > 8) {
+          if (he = le.charCodeAt(Q), !(he > 96 && he < 123 || he > 64 && he < 91 || he > 47 && he < 59 || he === 45 || he === 95 || he == 46)) {
+            if (he === 32 || he < 14 && he > 8) {
               $ = le.substring(0, Q), pe = null;
               break;
             }
-            return N("invalid nodeName");
+            return I("invalid nodeName");
           }
-        ge || E.push($);
+        me || E.push($);
       }
       if (m) {
-        ie = b, fe && (ge || v.push(ie), pe === null && (h = le.indexOf("xmlns", Q) !== -1) && (q = Q, W = le, Qe(), h = !1)), C = $, se !== b && (ee = b[zm], ee === void 0 && (ee = b[zm] = /* @__PURE__ */ Object.create(null)), se = b);
+        ie = b, de && (me || v.push(ie), pe === null && (h = le.indexOf("xmlns", Q) !== -1) && (q = Q, W = le, Qe(), h = !1)), C = $, se !== b && (ee = b[zm], ee === void 0 && (ee = b[zm] = /* @__PURE__ */ Object.create(null)), se = b);
         var jt = ee[$];
         if (jt !== void 0)
           $ = jt;
         else {
-          if (de = $.indexOf(":"), de !== -1) {
-            if (Fe = b[$.substring(0, de)], !Fe)
-              return N("missing namespace on <" + C + ">");
-            $ = $.substr(de + 1);
+          if (he = $.indexOf(":"), he !== -1) {
+            if (Fe = b[$.substring(0, he)], !Fe)
+              return I("missing namespace on <" + C + ">");
+            $ = $.substr(he + 1);
           } else
             Fe = b.xmlns;
           Fe && ($ = Fe + ":" + $), ee[C] = $;
         }
       }
-      if (fe && (q = Q, W = le, i && (t ? i(R, Tr, ge, p) : i($, Qe, Tr, ge, p), y)))
+      if (de && (q = Q, W = le, i && (t ? i(R, Tr, me, p) : i($, Qe, Tr, me, p), y)))
         return;
-      if (ge) {
-        if (o && (o(t ? R : $, Tr, fe, p), y))
+      if (me) {
+        if (o && (o(t ? R : $, Tr, de, p), y))
           return;
-        m && (fe ? b = ie : b = v.pop());
+        m && (de ? b = ie : b = v.pop());
       }
       U += 1;
     }
@@ -1819,14 +1819,14 @@ Pd.prototype.fromXML = function(e, t, n) {
   t instanceof qn ? (i = t, t = {}) : typeof t == "string" ? (i = this.handler(t), t = {}) : typeof i == "string" && (i = this.handler(i));
   var o = this.model, r = this.lax, a = new OR(Y({}, t, { rootHandler: i })), s = new lw({ proxy: !0 }), c = DR();
   i.context = a, c.push(i);
-  function l(E, A, N) {
+  function l(E, A, I) {
     var P = A(), k = P.line, H = P.column, F = P.data;
     F.charAt(0) === "<" && F.indexOf(" ") !== -1 && (F = F.slice(0, F.indexOf(" ")) + ">");
     var G = "unparsable content " + (F ? F + " " : "") + `detected
 	line: ` + k + `
 	column: ` + H + `
 	nested error: ` + E.message;
-    if (N)
+    if (I)
       return a.addWarning({
         message: G,
         error: E
@@ -1837,8 +1837,8 @@ Pd.prototype.fromXML = function(e, t, n) {
     return l(E, A, !0);
   }
   function p() {
-    var E = a.elementsById, A = a.references, N, P;
-    for (N = 0; P = A[N]; N++) {
+    var E = a.elementsById, A = a.references, I, P;
+    for (I = 0; P = A[I]; I++) {
       var k = P.element, H = E[P.id], F = wo(k).propertiesByName[P.property];
       if (H || a.addWarning({
         message: "unresolved reference <" + P.id + ">",
@@ -1858,16 +1858,16 @@ Pd.prototype.fromXML = function(e, t, n) {
   var d = /^<\?xml /i, g = / encoding="([^"]+)"/i, h = /^utf-8$/i;
   function m(E) {
     if (d.test(E)) {
-      var A = g.exec(E), N = A && A[1];
-      !N || h.test(N) || a.addWarning({
-        message: "unsupported document encoding <" + N + ">, falling back to UTF-8"
+      var A = g.exec(E), I = A && A[1];
+      !I || h.test(I) || a.addWarning({
+        message: "unsupported document encoding <" + I + ">, falling back to UTF-8"
       });
     }
   }
   function w(E, A) {
-    var N = c.peek();
+    var I = c.peek();
     try {
-      c.push(N.handleNode(E));
+      c.push(I.handleNode(E));
     } catch (P) {
       l(P, A, r) && c.push(new Cd());
     }
@@ -1875,8 +1875,8 @@ Pd.prototype.fromXML = function(e, t, n) {
   function y(E, A) {
     try {
       c.peek().handleText(E);
-    } catch (N) {
-      u(N, A);
+    } catch (I) {
+      u(I, A);
     }
   }
   function v(E, A) {
@@ -1884,10 +1884,10 @@ Pd.prototype.fromXML = function(e, t, n) {
   }
   var b = o.getPackages().reduce(function(E, A) {
     return E[A.uri] = A.prefix, E;
-  }, Object.entries(Of).reduce(function(E, [A, N]) {
-    return E[N] = A, E;
+  }, Object.entries(Of).reduce(function(E, [A, I]) {
+    return E[I] = A, E;
   }, o.config && o.config.nsMap || {}));
-  return s.ns(b).on("openTag", function(E, A, N, P) {
+  return s.ns(b).on("openTag", function(E, A, I, P) {
     var k = E.attrs || {}, H = Object.keys(k).reduce(function(G, ee) {
       var se = A(k[ee]);
       return G[ee] = se, G;
@@ -1898,19 +1898,19 @@ Pd.prototype.fromXML = function(e, t, n) {
       ns: E.ns
     };
     w(F, P);
-  }).on("question", m).on("closeTag", f).on("cdata", y).on("text", function(E, A, N) {
-    v(A(E), N);
+  }).on("question", m).on("closeTag", f).on("cdata", y).on("text", function(E, A, I) {
+    v(A(E), I);
   }).on("error", l).on("warn", u), new Promise(function(E, A) {
-    var N;
+    var I;
     try {
       s.parse(e), p();
     } catch (G) {
-      N = G;
+      I = G;
     }
     var P = i.element;
-    !N && !P && (N = Qo("failed to parse document as <" + i.type.$descriptor.name + ">"));
+    !I && !P && (I = Qo("failed to parse document as <" + i.type.$descriptor.name + ">"));
     var k = a.warnings, H = a.references, F = a.elementsById;
-    return N ? (N.warnings = k, A(N)) : E({
+    return I ? (I.warnings = k, A(I)) : E({
       rootElement: P,
       elementsById: F,
       references: H,
@@ -6520,7 +6520,7 @@ function pt(e, t = {}) {
       if (!b) continue;
       const A = e.shapes.find((H) => H.id === b);
       if (!A || A.container) continue;
-      const N = Math.max(A.x - E.x, E.x - (A.x + A.width), 0), P = Math.max(A.y - E.y, E.y - (A.y + A.height), 0), k = Math.hypot(N, P);
+      const I = Math.max(A.x - E.x, E.x - (A.x + A.width), 0), P = Math.max(A.y - E.y, E.y - (A.y + A.height), 0), k = Math.hypot(I, P);
       k > pM && n.push({ kind: "edge-endpoint-detached", edge: y.id, shape: b, distance: Math.round(k) });
     }
   }
@@ -6538,8 +6538,8 @@ function pt(e, t = {}) {
   );
   for (let y = 0; y < a.length; y++)
     for (let v = y + 1; v < a.length; v++) {
-      const b = a[y], E = a[v], A = Math.min(b.x + b.width, E.x + E.width) - Math.max(b.x, E.x), N = Math.min(b.y + b.height, E.y + E.height) - Math.max(b.y, E.y);
-      if (A <= zc || N <= zc) continue;
+      const b = a[y], E = a[v], A = Math.min(b.x + b.width, E.x + E.width) - Math.max(b.x, E.x), I = Math.min(b.y + b.height, E.y + E.height) - Math.max(b.y, E.y);
+      if (A <= zc || I <= zc) continue;
       const P = b.id < E.id ? [b.id, E.id] : [E.id, b.id], k = new Set(E.members);
       if (b.members.some((F) => k.has(F))) {
         const F = Ym(e, a, {
@@ -6571,13 +6571,13 @@ function pt(e, t = {}) {
   for (const y of a) {
     const v = new Set(c(y).map((k) => k.id)), b = new Set(y.members), E = new Set([...v].filter((k) => !b.has(k) && s.has(k)));
     if (!E.size) continue;
-    let A = !1, N = !1, P = !1;
+    let A = !1, I = !1, P = !1;
     for (const k of e.edges) {
       if (k.type !== "bpmn:SequenceFlow" || !k.source || !k.target) continue;
       const H = E.has(k.source), F = E.has(k.target);
-      !H && F && !v.has(k.source) ? A = !0 : H && !F && !v.has(k.target) ? N = !0 : H && F && (P = !0);
+      !H && F && !v.has(k.source) ? A = !0 : H && !F && !v.has(k.target) ? I = !0 : H && F && (P = !0);
     }
-    A && N && P && n.push({
+    A && I && P && n.push({
       kind: "group-overlap-unreadable",
       reason: "throughpass",
       group: y.id,
@@ -6595,10 +6595,10 @@ function pt(e, t = {}) {
           bottom: Math.min(...E.map((k) => k.y + k.height))
         };
         if (A.right - A.x <= zc || A.bottom - A.y <= zc) continue;
-        const N = Ym(e, [], A);
-        if (!N.length) continue;
+        const I = Ym(e, [], A);
+        if (!I.length) continue;
         const P = E.map((k) => k.id).sort();
-        n.push({ kind: "group-stack-unreadable", groups: P, shapes: N });
+        n.push({ kind: "group-stack-unreadable", groups: P, shapes: I });
       }
   for (const y of e.shapes.filter((v) => v.type === "bpmn:Group"))
     for (const v of e.shapes) {
@@ -6609,10 +6609,10 @@ function pt(e, t = {}) {
         ["left", y.x, "v", y.y, y.y + y.height],
         ["right", y.x + y.width, "v", y.y, y.y + y.height]
       ];
-      for (const [E, A, N, P, k] of b) {
-        const H = N === "h" ? v.x : v.y, F = N === "h" ? v.x + v.width : v.y + v.height;
+      for (const [E, A, I, P, k] of b) {
+        const H = I === "h" ? v.x : v.y, F = I === "h" ? v.x + v.width : v.y + v.height;
         if (!(H < k && P < F)) continue;
-        const G = N === "h" ? v.y : v.x, ee = N === "h" ? v.y + v.height : v.x + v.width;
+        const G = I === "h" ? v.y : v.x, ee = I === "h" ? v.y + v.height : v.x + v.width;
         if (!(G < A && A < ee)) continue;
         const se = Math.min(A - G, ee - A);
         se < aM || n.push({ kind: "group-cuts-shape", group: y.id, shape: v.id, side: E, depth: se });
@@ -6628,19 +6628,19 @@ function pt(e, t = {}) {
       const b = xn(v);
       if (b.length)
         for (const E of u) {
-          const A = E.x + E.width, N = E.y + E.height, P = v.endpoints.some((H) => {
+          const A = E.x + E.width, I = E.y + E.height, P = v.endpoints.some((H) => {
             const F = y.get(H);
-            return !!F && E.x < F.x && F.x < A && E.y < F.y && F.y < N;
+            return !!F && E.x < F.x && F.x < A && E.y < F.y && F.y < I;
           });
           let k = null;
           for (const H of b) {
-            const [F, G, ee] = H.axis === "v" ? [E.y, N, [["left", E.x], ["right", A]]] : [E.x, A, [["top", E.y], ["bottom", N]]], se = Math.min(H.hi, G) - Math.max(H.lo, F);
+            const [F, G, ee] = H.axis === "v" ? [E.y, I, [["left", E.x], ["right", A]]] : [E.x, A, [["top", E.y], ["bottom", I]]], se = Math.min(H.hi, G) - Math.max(H.lo, F);
             if (se < _w) continue;
-            const ie = H.axis === "v" ? E.x < H.at && H.at < A : E.y < H.at && H.at < N;
+            const ie = H.axis === "v" ? E.x < H.at && H.at < A : E.y < H.at && H.at < I;
             if (!(ie && P))
-              for (const [ve, fe] of ee) {
-                const ge = Math.abs(H.at - fe);
-                ge <= Cs && (!k || ge < k.distance) && (k = { side: ve, inside: ie, distance: ge, length: se });
+              for (const [ve, de] of ee) {
+                const me = Math.abs(H.at - de);
+                me <= Cs && (!k || me < k.distance) && (k = { side: ve, inside: ie, distance: me, length: se });
               }
           }
           k && n.push({
@@ -6664,15 +6664,15 @@ function pt(e, t = {}) {
         ["left", y.x, v.x, E],
         ["right", y.x + y.width, v.x + v.width, E]
       ];
-      for (const [N, P, k, H] of A)
-        H && Math.abs(P - k) <= Gm && n.push({ kind: "group-on-container-boundary", group: y.id, container: v.id, side: N });
+      for (const [I, P, k, H] of A)
+        H && Math.abs(P - k) <= Gm && n.push({ kind: "group-on-container-boundary", group: y.id, container: v.id, side: I });
     }
   const f = e.shapes.filter((y) => y.type === "bpmn:Group");
   for (let y = 0; y < f.length; y++)
     for (let v = y + 1; v < f.length; v++) {
-      const b = f[y], E = f[v], A = b.x < E.x + E.width && E.x < b.x + b.width, N = b.y < E.y + E.height && E.y < b.y + b.height, P = [
-        ["x", b.x + b.width, E.x, N],
-        ["x", E.x + E.width, b.x, N],
+      const b = f[y], E = f[v], A = b.x < E.x + E.width && E.x < b.x + b.width, I = b.y < E.y + E.height && E.y < b.y + b.height, P = [
+        ["x", b.x + b.width, E.x, I],
+        ["x", E.x + E.width, b.x, I],
         ["y", b.y + b.height, E.y, A],
         ["y", E.y + E.height, b.y, A]
       ];
@@ -6690,10 +6690,10 @@ function pt(e, t = {}) {
     for (let v = y + 1; v < e.edges.length; v++) {
       const b = e.edges[y], E = e.edges[v], A = ja(b, E);
       if (!A) continue;
-      const N = b.id < E.id ? [b.id, E.id] : [E.id, b.id];
+      const I = b.id < E.id ? [b.id, E.id] : [E.id, b.id];
       n.push({
         kind: A.kind === "opposite" ? "edge-overlap-opposite" : A.kind === "mixed" ? "edge-overlap-mixed" : "edge-overlap-unrelated",
-        edges: N,
+        edges: I,
         axis: A.axis,
         length: Math.round(A.length)
       });
@@ -6792,7 +6792,7 @@ function PM(e) {
       if (!w) continue;
       const y = typeof (m == null ? void 0 : m.$type) == "string" ? m.$type : "", v = Ft(h.bounds);
       if (v) {
-        const E = h.isExpanded === !1 && y !== "bpmn:Participant", A = Ft((l = Ft(h.label)) == null ? void 0 : l.bounds), N = {
+        const E = h.isExpanded === !1 && y !== "bpmn:Participant", A = Ft((l = Ft(h.label)) == null ? void 0 : l.bounds), I = {
           id: w,
           type: y,
           x: Qt(v.x),
@@ -6805,7 +6805,7 @@ function PM(e) {
           ...A ? { label: { x: Qt(A.x), y: Qt(A.y), width: Qt(A.width), height: Qt(A.height) } } : {},
           ...y === "bpmn:Group" ? Pw(Aw(m)) : {}
         }, P = h.isHorizontal !== !1, k = typeof (m == null ? void 0 : m.name) == "string" ? m.name : "";
-        r.has(w) && P && k && (N.label = Sw(N, k)), t.push(N);
+        r.has(w) && P && k && (I.label = Sw(I, k)), t.push(I);
         continue;
       }
       const b = h.waypoint;
@@ -6815,8 +6815,8 @@ function PM(e) {
           id: w,
           type: y,
           waypoints: b.map((A) => {
-            var N, P;
-            return { x: Qt((N = Ft(A)) == null ? void 0 : N.x), y: Qt((P = Ft(A)) == null ? void 0 : P.y) };
+            var I, P;
+            return { x: Qt((I = Ft(A)) == null ? void 0 : I.x), y: Qt((P = Ft(A)) == null ? void 0 : P.y) };
           }),
           endpoints: CM(m),
           ...MM(m),
@@ -7161,22 +7161,22 @@ function FM(e, t, n) {
         [u, l]
       ]) {
         if (n.has(p)) continue;
-        const d = s.edges.find((N) => N.id === p), g = s.edges.find((N) => N.id === f);
+        const d = s.edges.find((I) => I.id === p), g = s.edges.find((I) => I.id === f);
         if (!d || !g) continue;
         const h = i.get(p);
         if (!h) continue;
         const m = Ql(h), w = $M(g), y = [...Nd(d, a) ?? []], v = Bd(d, [...a, ...w], m, r.edges);
         v && y.push(v);
-        for (let N = 0; N + 1 < d.waypoints.length; N++)
+        for (let I = 0; I + 1 < d.waypoints.length; I++)
           for (const P of w)
-            for (const k of Lf(d.waypoints[N], d.waypoints[N + 1], P) ?? [])
-              y.push(If(d.waypoints, N, k));
-        const b = s.edges.filter((N) => N.id !== p), E = (N) => ({
+            for (const k of Lf(d.waypoints[I], d.waypoints[I + 1], P) ?? [])
+              y.push(If(d.waypoints, I, k));
+        const b = s.edges.filter((I) => I.id !== p), E = (I) => ({
           ...s,
-          edges: s.edges.map((P) => P.id === p ? { ...P, waypoints: N } : P)
-        }), A = y.find((N) => {
-          const P = { ...d, waypoints: N };
-          return jp(P, g) || !Nf(N, m) || b.some((k) => k.id !== f && !jp(d, k) && jp(P, k)) ? !1 : pt(E(N)).every((k) => c.has(ft(k)));
+          edges: s.edges.map((P) => P.id === p ? { ...P, waypoints: I } : P)
+        }), A = y.find((I) => {
+          const P = { ...d, waypoints: I };
+          return jp(P, g) || !Nf(I, m) || b.some((k) => k.id !== f && !jp(d, k) && jp(P, k)) ? !1 : pt(E(I)).every((k) => c.has(ft(k)));
         });
         if (A) {
           o.updateWaypoints(h, A), s = E(A);
@@ -7238,14 +7238,14 @@ function WM(e, t, n) {
     if (!g || g.container) continue;
     const h = i.get(l), m = i.get(u);
     if (!h || !m) continue;
-    const w = (k) => n.has(k.id) ? [k.waypoints] : [k.waypoints, ...VM(k, g, a)], y = (k) => k.length - 2, v = w(p).flatMap((k) => w(f).map((H) => ({ pa: k, pb: H }))).filter(({ pa: k, pb: H }) => k !== p.waypoints || H !== f.waypoints).map((k) => ({ ...k, cost: ey(k.pa) + ey(k.pb) + HM * (y(k.pa) + y(k.pb)) })).sort((k, H) => k.cost - H.cost), b = Ql(h), E = Ql(m), A = to(c).length, N = new Set(er(c).map(([k, H]) => `${k}|${H}`)), P = v.find(({ pa: k, pb: H }) => {
+    const w = (k) => n.has(k.id) ? [k.waypoints] : [k.waypoints, ...VM(k, g, a)], y = (k) => k.length - 2, v = w(p).flatMap((k) => w(f).map((H) => ({ pa: k, pb: H }))).filter(({ pa: k, pb: H }) => k !== p.waypoints || H !== f.waypoints).map((k) => ({ ...k, cost: ey(k.pa) + ey(k.pb) + HM * (y(k.pa) + y(k.pb)) })).sort((k, H) => k.cost - H.cost), b = Ql(h), E = Ql(m), A = to(c).length, I = new Set(er(c).map(([k, H]) => `${k}|${H}`)), P = v.find(({ pa: k, pb: H }) => {
       const F = { ...p, waypoints: k }, G = { ...f, waypoints: H };
       if (to({ edges: [F, G] }).length || ja(F, G) || !Nf(k, b) || !Nf(H, E)) return !1;
       const ee = {
         ...c,
         edges: c.edges.map((se) => se.id === l ? F : se.id === u ? G : se)
       };
-      return to(ee).length >= A || er(ee).some(([se, ie]) => !N.has(`${se}|${ie}`)) ? !1 : pt(ee).every((se) => s.has(ft(se)));
+      return to(ee).length >= A || er(ee).some(([se, ie]) => !I.has(`${se}|${ie}`)) ? !1 : pt(ee).every((se) => s.has(ft(se)));
     });
     P && (P.pa !== p.waypoints && o.updateWaypoints(h, P.pa), P.pb !== f.waypoints && o.updateWaypoints(m, P.pb), c = {
       ...c,
@@ -7278,7 +7278,7 @@ function YM(e, t, n) {
     if (!d || d.type === "bpmn:Participant") continue;
     const g = d.x + d.width / 2;
     if (g >= f.x + 10 && g <= f.x + f.width - 10) continue;
-    const h = g > f.x + f.width, m = f.y > d.y, w = m ? d.y + d.height : d.y, y = m ? f.y : f.y + f.height, v = Math.round((w + y) / 2), b = (H) => f === u ? [...H].reverse() : H, E = (l.waypoints ?? []).map((H) => ({ x: H.x, y: H.y })), A = r(l.id), N = a(l.id, E) ?? /* @__PURE__ */ new Set(), P = h ? f.x + f.width : f.x, k = f.x + f.width / 2;
+    const h = g > f.x + f.width, m = f.y > d.y, w = m ? d.y + d.height : d.y, y = m ? f.y : f.y + f.height, v = Math.round((w + y) / 2), b = (H) => f === u ? [...H].reverse() : H, E = (l.waypoints ?? []).map((H) => ({ x: H.x, y: H.y })), A = r(l.id), I = a(l.id, E) ?? /* @__PURE__ */ new Set(), P = h ? f.x + f.width : f.x, k = f.x + f.width / 2;
     for (let H = Math.min(UM, f.width / 4); h ? P - H > k : P + H < k; H += qM) {
       const F = Math.round(h ? P - H : P + H), G = b([
         { x: g, y: w },
@@ -7286,7 +7286,7 @@ function YM(e, t, n) {
         { x: F, y: v },
         { x: F, y }
       ]), ee = a(l.id, G);
-      if (!ee || [...ee].some((ie) => !N.has(ie))) continue;
+      if (!ee || [...ee].some((ie) => !I.has(ie))) continue;
       o.updateWaypoints(l, G);
       const se = r(l.id);
       if (se.crossings <= A.crossings && se.shared <= A.shared && se.mine <= A.mine && [...se.keys].every((ie) => A.keys.has(ie)))
@@ -7314,9 +7314,9 @@ function XM(e, t) {
   if (!u.length) return null;
   const p = u[0], f = u[u.length - 1], d = (c.y + c.height + p.y) / 2, g = (f.y + f.height + l.y) / 2, h = s ? d : g, m = s ? g : d, w = e.waypoints[0], y = e.waypoints[e.waypoints.length - 1], v = Un(t), b = t.edges.filter((G) => G.id !== e.id), E = Pi(e, b), A = Ht(e, v).length;
   if (E === 0 && A === 0 || A === 0 && e.waypoints.length === 2) return null;
-  const N = Math.min(...u.map((G) => G.x)), P = Math.max(...u.map((G) => G.x + G.width)), k = (w.x + y.x) / 2, H = (G) => G.filter((ee, se) => se === 0 || !(Ye(ee.x, G[se - 1].x) && Ye(ee.y, G[se - 1].y)));
+  const I = Math.min(...u.map((G) => G.x)), P = Math.max(...u.map((G) => G.x + G.width)), k = (w.x + y.x) / 2, H = (G) => G.filter((ee, se) => se === 0 || !(Ye(ee.x, G[se - 1].x) && Ye(ee.y, G[se - 1].y)));
   let F;
-  for (let G = N; G <= P; G += KM) {
+  for (let G = I; G <= P; G += KM) {
     const ee = H([w, { x: w.x, y: h }, { x: G, y: h }, { x: G, y: m }, { x: y.x, y: m }, y]), se = { ...e, waypoints: ee };
     if (Ht(se, v).length > 0) continue;
     const ie = Pi(se, b), ve = Math.abs(G - k);
@@ -7337,7 +7337,7 @@ function JM(e, t, n) {
     const w = h.x - d.x, y = h.y - d.y;
     if (Ye(w, 0) && Ye(y, 0) || !Ye(m.x - g.x, w) || !Ye(m.y - g.y, y)) continue;
     const v = p.waypoints.map((A) => ({ x: A.x + w, y: A.y + y })), b = f.waypoints.map((A) => ({ x: A.x, y: A.y }));
-    b.length === v.length && b.every((A, N) => Ye(A.x, v[N].x) && Ye(A.y, v[N].y)) || b.length === 2 && (Ye(b[0].x, b[1].x) || Ye(b[0].y, b[1].y)) && Ht({ ...p, waypoints: b }, c).length === 0 || Ht({ ...p, waypoints: v }, c).length > 0 || o.updateWaypoints(f, v);
+    b.length === v.length && b.every((A, I) => Ye(A.x, v[I].x) && Ye(A.y, v[I].y)) || b.length === 2 && (Ye(b[0].x, b[1].x) || Ye(b[0].y, b[1].y)) && Ht({ ...p, waypoints: b }, c).length === 0 || Ht({ ...p, waypoints: v }, c).length > 0 || o.updateWaypoints(f, v);
   }
 }
 function QM(e, t) {
@@ -7407,8 +7407,8 @@ function oA(e, t, n, i, o) {
   }
   const v = (ie, ve) => {
     if (Math.abs(ve - ie) < 2 * ji) return [];
-    const fe = Math.min(ie, ve) + ji, ge = Math.max(ie, ve) - ji;
-    return Vp(Math.round((ie + ve) / 2), fe, ge);
+    const de = Math.min(ie, ve) + ji, me = Math.max(ie, ve) - ji;
+    return Vp(Math.round((ie + ve) / 2), de, me);
   };
   if (!a && n)
     for (const ie of v(l, c ? n.y + n.height : n.y))
@@ -7417,22 +7417,22 @@ function oA(e, t, n, i, o) {
     for (const ie of v(u, c ? i.y : i.y + i.height))
       r.push([{ x: y, y: l }, { x: y, y: ie }, { x: f, y: ie }, { x: f, y: u }]);
   const b = Math.min(y, w), E = Math.max(y, w), A = [];
-  for (const [ie, ve] of o.filter((fe) => fe.x < E && fe.x + fe.width > b).map((fe) => [fe.y, fe.y + fe.height]).sort((fe, ge) => fe[0] - ge[0])) {
-    const fe = A[A.length - 1];
-    fe && ie <= fe[1] ? fe[1] = Math.max(fe[1], ve) : A.push([ie, ve]);
+  for (const [ie, ve] of o.filter((de) => de.x < E && de.x + de.width > b).map((de) => [de.y, de.y + de.height]).sort((de, me) => de[0] - me[0])) {
+    const de = A[A.length - 1];
+    de && ie <= de[1] ? de[1] = Math.max(de[1], ve) : A.push([ie, ve]);
   }
-  const N = [];
+  const I = [];
   for (let ie = 1; ie < A.length; ie++)
-    A[ie][0] - A[ie - 1][1] >= tA && N.push(Math.round((A[ie - 1][1] + A[ie][0]) / 2));
-  A.length && N.push(A[0][0] - iy, A[A.length - 1][1] + iy);
-  const P = (ie, ve) => ve < ie.y ? ie.y : ve > ie.y + ie.height ? ie.y + ie.height : void 0, k = new Set([a ? e.id : n == null ? void 0 : n.id, s ? t.id : i == null ? void 0 : i.id].filter((ie) => !!ie)), H = e.y + e.height / 2, F = t.y + t.height / 2, G = F > H ? 1 : -1, ee = (ie, ve, fe) => o.some(
-    (ge) => !k.has(ge.id) && ge.x < ie && ie < ge.x + ge.width && ge.y < Math.max(ve, fe) - 1 && ge.y + ge.height > Math.min(ve, fe) + 1
+    A[ie][0] - A[ie - 1][1] >= tA && I.push(Math.round((A[ie - 1][1] + A[ie][0]) / 2));
+  A.length && I.push(A[0][0] - iy, A[A.length - 1][1] + iy);
+  const P = (ie, ve) => ve < ie.y ? ie.y : ve > ie.y + ie.height ? ie.y + ie.height : void 0, k = new Set([a ? e.id : n == null ? void 0 : n.id, s ? t.id : i == null ? void 0 : i.id].filter((ie) => !!ie)), H = e.y + e.height / 2, F = t.y + t.height / 2, G = F > H ? 1 : -1, ee = (ie, ve, de) => o.some(
+    (me) => !k.has(me.id) && me.x < ie && ie < me.x + me.width && me.y < Math.max(ve, de) - 1 && me.y + me.height > Math.min(ve, de) + 1
   ), se = [];
-  for (const ie of N) {
-    const ve = P(e, ie), fe = P(t, ie);
-    ve === void 0 || fe === void 0 || (ie - H) * G < 0 && ee(y, ve, ie) || (ie - F) * G > 0 && ee(w, fe, ie) || se.push({
-      pts: [{ x: y, y: ve }, { x: y, y: ie }, { x: w, y: ie }, { x: w, y: fe }],
-      len: Math.abs(ie - ve) + (E - b) + Math.abs(fe - ie)
+  for (const ie of I) {
+    const ve = P(e, ie), de = P(t, ie);
+    ve === void 0 || de === void 0 || (ie - H) * G < 0 && ee(y, ve, ie) || (ie - F) * G > 0 && ee(w, de, ie) || se.push({
+      pts: [{ x: y, y: ve }, { x: y, y: ie }, { x: w, y: ie }, { x: w, y: de }],
+      len: Math.abs(ie - ve) + (E - b) + Math.abs(de - ie)
     });
   }
   return { inPools: r, outside: se.sort((ie, ve) => ie.len - ve.len).map((ie) => ie.pts) };
@@ -7452,11 +7452,11 @@ function rA(e, t, n) {
   }, l = (d, g) => d.length === g.length && d.every((h, m) => Ye(h.x, g[m].x) && Ye(h.y, g[m].y)), u = (d) => {
     const g = d.source, h = d.target;
     if (!g || !h) return "skip";
-    const m = We(i), w = new Map(m.shapes.map((U) => [U.id, U])), y = s(g), v = s(h), b = new Set([y, v].filter((U) => !!U)), E = m.shapes.filter((U) => U.type === "bpmn:Participant"), A = (d.waypoints ?? []).map((U) => ({ x: U.x, y: U.y })), N = Gp(A, b, E);
-    if (N < Hp) return "skip";
+    const m = We(i), w = new Map(m.shapes.map((U) => [U.id, U])), y = s(g), v = s(h), b = new Set([y, v].filter((U) => !!U)), E = m.shapes.filter((U) => U.type === "bpmn:Participant"), A = (d.waypoints ?? []).map((U) => ({ x: U.x, y: U.y })), I = Gp(A, b, E);
+    if (I < Hp) return "skip";
     if (t.has(d.id)) {
       const U = r.get(d.id);
-      if (U && l(U, A) || N - (U ? Gp(U, b, a) : 0) < Hp) return "skip";
+      if (U && l(U, A) || I - (U ? Gp(U, b, a) : 0) < Hp) return "skip";
     }
     const P = w.get(g.id), k = w.get(h.id), H = m.edges.find((U) => U.id === d.id);
     if (!P || !k || !H) return "skip";
@@ -7469,14 +7469,14 @@ function rA(e, t, n) {
       y ? w.get(y) : void 0,
       v ? w.get(v) : void 0,
       E
-    ), fe = (U) => U.map((le, K) => ({ pts: le, i: K, key: le.length * 2 + (ie(le) ? 1 : 0) })).sort((le, K) => le.key - K.key || le.i - K.i).map((le) => le.pts), ge = [...fe(ve.inPools), ...fe(ve.outside)], _e = c();
-    for (const U of ge) {
+    ), de = (U) => U.map((le, K) => ({ pts: le, i: K, key: le.length * 2 + (ie(le) ? 1 : 0) })).sort((le, K) => le.key - K.key || le.i - K.i).map((le) => le.pts), me = [...de(ve.inPools), ...de(ve.outside)], _e = c();
+    for (const U of me) {
       if (Gp(U, b, E) >= Hp) continue;
       const le = { ...H, waypoints: U };
-      if (Ht(le, F).some((de) => !G.has(de.id)) || xn(le).some((de) => iA(de, m.shapes) || ee.some((Ee) => io(Ee.rect, de)))) continue;
+      if (Ht(le, F).some((he) => !G.has(he.id)) || xn(le).some((he) => iA(he, m.shapes) || ee.some((Ee) => io(Ee.rect, he)))) continue;
       o.updateWaypoints(d, U);
       const Q = c();
-      if (Q.crossings <= _e.crossings && Q.shared <= _e.shared && [...Q.keys].every((de) => _e.keys.has(de))) return "fixed";
+      if (Q.crossings <= _e.crossings && Q.shared <= _e.shared && [...Q.keys].every((he) => _e.keys.has(he))) return "fixed";
       o.updateWaypoints(d, A);
     }
     return "stuck";
@@ -7610,32 +7610,32 @@ function uA(e, t) {
   if (e.type !== "bpmn:SequenceFlow") return null;
   const n = t.shapes.filter((A) => A.container), i = new Map(t.shapes.map((A) => [A.id, A])), o = Un(t), r = t.edges.filter((A) => A.id !== e.id), a = Ai(e, r), s = Pi(e, r), c = (A) => lA(A, t.shapes, e.endpoints) + (oy(A, n) ? 1 : 0), l = c(e.waypoints), u = (A) => {
     if (!A) return;
-    const N = A.x + A.width / 2, P = A.y + A.height / 2;
-    return n.find((k) => k.type === "bpmn:Lane" && N >= k.x && N <= k.x + k.width && P >= k.y && P <= k.y + k.height);
+    const I = A.x + A.width / 2, P = A.y + A.height / 2;
+    return n.find((k) => k.type === "bpmn:Lane" && I >= k.x && I <= k.x + k.width && P >= k.y && P <= k.y + k.height);
   }, p = u(i.get(e.endpoints[0] ?? "")), f = u(i.get(e.endpoints[1] ?? "")), d = !!p && !!f && p.id !== f.id, g = (A) => {
     if (!d || !f) return !1;
-    for (let N = 1; N < A.length - 2; N++) {
-      const P = A[N], k = A[N + 1];
+    for (let I = 1; I < A.length - 2; I++) {
+      const P = A[I], k = A[I + 1];
       if (Ye(P.y, k.y) && !Ye(P.x, k.x) && P.y > f.y && P.y < f.y + f.height) return !0;
     }
     return !1;
   }, h = g(e.waypoints), w = ((A) => {
     if (!A) return;
-    const N = A.x + A.width / 2, P = A.y + A.height / 2;
-    return n.filter((k) => k.type === "bpmn:Participant" && N >= k.x && N <= k.x + k.width && P >= k.y && P <= k.y + k.height).sort((k, H) => k.width * k.height - H.width * H.height)[0];
+    const I = A.x + A.width / 2, P = A.y + A.height / 2;
+    return n.filter((k) => k.type === "bpmn:Participant" && I >= k.x && I <= k.x + k.width && P >= k.y && P <= k.y + k.height).sort((k, H) => k.width * k.height - H.width * H.height)[0];
   })(i.get(e.endpoints[0] ?? "")), y = (A) => {
     if (!w) return 0;
-    let N = 0;
+    let I = 0;
     for (let P = 1; P < A.length - 1; P++) {
       const k = A[P];
-      (k.x < w.x || k.x > w.x + w.width || k.y < w.y || k.y > w.y + w.height) && N++;
+      (k.x < w.x || k.x > w.x + w.width || k.y < w.y || k.y > w.y + w.height) && I++;
     }
-    return N;
+    return I;
   }, v = y(e.waypoints);
   if (!oy(e.waypoints, n) && !(d && !h) && v === 0) return null;
-  const b = (A) => A.reduce((N, P, k) => k ? N + Math.abs(P.x - A[k - 1].x) + Math.abs(P.y - A[k - 1].y) : 0, 0);
+  const b = (A) => A.reduce((I, P, k) => k ? I + Math.abs(P.x - A[k - 1].x) + Math.abs(P.y - A[k - 1].y) : 0, 0);
   let E;
-  for (const { pts: A, cost: N } of Cu(e, i)) {
+  for (const { pts: A, cost: I } of Cu(e, i)) {
     const P = { ...e, waypoints: A };
     if (Ht(P, o).length > 0) continue;
     const k = Ai(P, r);
@@ -7647,7 +7647,7 @@ function uA(e, t) {
     const G = c(A), ee = g(A);
     if (!F && !(ee && !h) && G >= l) continue;
     const ie = ee ? 0 : 1, ve = b(A);
-    (!E || H < E.out || H === E.out && (ie < E.lane || ie === E.lane && (k < E.opp || k === E.opp && (G < E.sc || G === E.sc && (N < E.cost || N === E.cost && ve < E.len))))) && (E = { pts: A, out: H, sc: G, lane: ie, opp: k, cost: N, len: ve });
+    (!E || H < E.out || H === E.out && (ie < E.lane || ie === E.lane && (k < E.opp || k === E.opp && (G < E.sc || G === E.sc && (I < E.cost || I === E.cost && ve < E.len))))) && (E = { pts: A, out: H, sc: G, lane: ie, opp: k, cost: I, len: ve });
   }
   return (E == null ? void 0 : E.pts) ?? null;
 }
@@ -8035,12 +8035,12 @@ function PA(e, t, n = /* @__PURE__ */ new Set()) {
     const p = u.wps, f = i.get(l), d = f == null ? void 0 : f.label;
     if (!d || !(f != null && f.waypoints)) continue;
     const g = f.waypoints[0].x - p[0].x, h = f.waypoints[0].y - p[0].y;
-    if (!(f.waypoints.length === p.length && f.waypoints.every((N, P) => N.x - p[P].x === g && N.y - p[P].y === h))) {
+    if (!(f.waypoints.length === p.length && f.waypoints.every((I, P) => I.x - p[P].x === g && I.y - p[P].y === h))) {
       if (((s = f.source) == null ? void 0 : s.id) === u.source && ((c = f.target) == null ? void 0 : c.id) === u.target) continue;
-      const N = r.edges.find((G) => G.id === l);
-      if (!(N != null && N.label) || !Zl(N.label, r).length && !n.has(l)) continue;
-      let P = { ...N.label, x: u.label.x, y: u.label.y };
-      if ((Zl(P, r).length || py(P, N.waypoints) > uy) && (P = null), !P && py(N.label, N.waypoints) > uy && (P = AA(N, r)), !P) continue;
+      const I = r.edges.find((G) => G.id === l);
+      if (!(I != null && I.label) || !Zl(I.label, r).length && !n.has(l)) continue;
+      let P = { ...I.label, x: u.label.x, y: u.label.y };
+      if ((Zl(P, r).length || py(P, I.waypoints) > uy) && (P = null), !P && py(I.label, I.waypoints) > uy && (P = AA(I, r)), !P) continue;
       const k = P;
       if (k.x === d.x && k.y === d.y) continue;
       const H = { ...r, edges: r.edges.map((G) => G.id === l ? { ...G, label: k } : G) }, F = pt(H);
@@ -8050,10 +8050,10 @@ function PA(e, t, n = /* @__PURE__ */ new Set()) {
     }
     const w = u.label.x + g - d.x, y = u.label.y + h - d.y;
     if (w === 0 && y === 0) continue;
-    const v = r.edges.find((N) => N.id === l);
+    const v = r.edges.find((I) => I.id === l);
     if (!(v != null && v.label)) continue;
-    const b = { ...v.label, x: v.label.x + w, y: v.label.y + y }, E = { ...r, edges: r.edges.map((N) => N.id === l ? { ...N, label: b } : N) }, A = pt(E);
-    A.some((N) => !a.has(ft(N))) || (o.moveElements([d], { x: w, y }), r = E, a = new Set(A.map(ft)));
+    const b = { ...v.label, x: v.label.x + w, y: v.label.y + y }, E = { ...r, edges: r.edges.map((I) => I.id === l ? { ...I, label: b } : I) }, A = pt(E);
+    A.some((I) => !a.has(ft(I))) || (o.moveElements([d], { x: w, y }), r = E, a = new Set(A.map(ft)));
   }
 }
 function TA(e, t, n = /* @__PURE__ */ new Set()) {
@@ -8556,13 +8556,13 @@ function jA(e, t, n = {}) {
         break;
       }
       case "sequenceFlow.add": {
-        const { id: v, source: b, target: E, name: A, condition: N } = h.flow, P = u(m, b, "source", ["flowNode"]), k = u(m, E, "target", ["flowNode"]);
-        P && k && l(b) !== l(E) && o.push({ kind: "flow-cross-pool", opIndex: m, id: v }), A !== void 0 && N !== void 0 && o.push({ kind: "condition-name-conflict", opIndex: m, id: v });
+        const { id: v, source: b, target: E, name: A, condition: I } = h.flow, P = u(m, b, "source", ["flowNode"]), k = u(m, E, "target", ["flowNode"]);
+        P && k && l(b) !== l(E) && o.push({ kind: "flow-cross-pool", opIndex: m, id: v }), A !== void 0 && I !== void 0 && o.push({ kind: "condition-name-conflict", opIndex: m, id: v });
         break;
       }
       case "messageFlow.add": {
-        const { id: v, source: b, target: E } = h.flow, A = u(m, b, "source", ["flowNode", "participant"]), N = u(m, E, "target", ["flowNode", "participant"]);
-        if (A && N) {
+        const { id: v, source: b, target: E } = h.flow, A = u(m, b, "source", ["flowNode", "participant"]), I = u(m, E, "target", ["flowNode", "participant"]);
+        if (A && I) {
           const P = l(b), k = l(E);
           P !== void 0 && P === k && o.push({ kind: "message-flow-same-pool", opIndex: m, id: v });
         }
@@ -8589,14 +8589,14 @@ function jA(e, t, n = {}) {
       case "dataAssociation.add": {
         const { source: v, target: b } = h.association, E = u(m, v, "source"), A = u(m, b, "target");
         if (E && A) {
-          const N = /* @__PURE__ */ new Set([E, A]);
-          N.has("dataStore") && N.has("flowNode") || o.push({ kind: "data-association-ends", opIndex: m, source: v, target: b });
+          const I = /* @__PURE__ */ new Set([E, A]);
+          I.has("dataStore") && I.has("flowNode") || o.push({ kind: "data-association-ends", opIndex: m, source: v, target: b });
         }
         break;
       }
       case "association.add": {
-        const { id: v, source: b, target: E } = h.association, A = u(m, b, "source"), N = u(m, E, "target");
-        A && N && A !== "annotation" && N !== "annotation" && o.push({
+        const { id: v, source: b, target: E } = h.association, A = u(m, b, "source"), I = u(m, E, "target");
+        A && I && A !== "annotation" && I !== "annotation" && o.push({
           kind: "association-detached",
           opIndex: m,
           annotation: v ?? `${b}->${E}`
@@ -8639,8 +8639,8 @@ function jA(e, t, n = {}) {
             b.includes(P) || o.push({ kind: "lane-shrink-unsupported", opIndex: m, participant: h.id, lane: P });
           for (const P of b)
             t.categoryOf(P) !== void 0 && !v.includes(P) && o.push({ kind: "id-duplicate", opIndex: m, id: P });
-          const E = b.filter((P) => v.includes(P)), A = (P) => E.every((k, H) => k === P[H]), N = (((y = t.laneDeclarationOrderOf) == null ? void 0 : y.call(t, h.id)) ?? v).filter((P) => v.includes(P));
-          E.length === v.length && !A(v) && !A(N) && o.push({ kind: "lane-reorder-unsupported", opIndex: m, participant: h.id });
+          const E = b.filter((P) => v.includes(P)), A = (P) => E.every((k, H) => k === P[H]), I = (((y = t.laneDeclarationOrderOf) == null ? void 0 : y.call(t, h.id)) ?? v).filter((P) => v.includes(P));
+          E.length === v.length && !A(v) && !A(I) && o.push({ kind: "lane-reorder-unsupported", opIndex: m, participant: h.id });
         }
         break;
       }
@@ -8655,8 +8655,8 @@ function jA(e, t, n = {}) {
       case "sequenceFlow.update": {
         if (g(m, h.id, "sequenceFlow") === void 0) break;
         if (h.name !== void 0 && h.condition !== void 0 && o.push({ kind: "condition-name-conflict", opIndex: m, id: h.id }), h.source !== void 0 || h.target !== void 0) {
-          const v = h.source === void 0 || u(m, h.source, "source", ["flowNode"]) !== void 0, b = h.target === void 0 || u(m, h.target, "target", ["flowNode"]) !== void 0, E = t.endpointsOf(h.id), A = h.source ?? (E == null ? void 0 : E.source), N = h.target ?? (E == null ? void 0 : E.target);
-          v && b && A !== void 0 && N !== void 0 && (/* @__PURE__ */ new Set([l(A), l(N), l(h.id)])).size > 1 && o.push({ kind: "flow-cross-pool", opIndex: m, id: h.id });
+          const v = h.source === void 0 || u(m, h.source, "source", ["flowNode"]) !== void 0, b = h.target === void 0 || u(m, h.target, "target", ["flowNode"]) !== void 0, E = t.endpointsOf(h.id), A = h.source ?? (E == null ? void 0 : E.source), I = h.target ?? (E == null ? void 0 : E.target);
+          v && b && A !== void 0 && I !== void 0 && (/* @__PURE__ */ new Set([l(A), l(I), l(h.id)])).size > 1 && o.push({ kind: "flow-cross-pool", opIndex: m, id: h.id });
         }
         break;
       }
@@ -8765,13 +8765,13 @@ function Lw(e, t, n) {
 const tu = (e, t, n) => e.y - t.height / 2 >= n.y && e.y + t.height / 2 <= n.y + n.height;
 function nu(e, t, n, i, o) {
   const r = n, a = Lw(e, t, i), s = a ?? i, c = (ee, se, ie = s) => {
-    const [ve, fe] = eu[ee];
-    let ge = {
+    const [ve, de] = eu[ee];
+    let me = {
       x: t.x + t.width / 2 + ve * (t.width / 2 + r.width / 2 + se),
-      y: t.y + t.height / 2 + fe * (t.height / 2 + r.height / 2 + se)
+      y: t.y + t.height / 2 + de * (t.height / 2 + r.height / 2 + se)
     };
-    const _e = ie.x + Pn + r.width / 2, U = ie.x + ie.width - Pn - r.width / 2, le = ie.y + Pn + r.height / 2, K = ie.y + ie.height - Pn - r.height / 2, Q = { x: Math.min(U, Math.max(_e, ge.x)), y: Math.min(K, Math.max(le, ge.y)) };
-    return (Q.x !== ge.x || Q.y !== ge.y) && (ge = Math.abs(Q.x - (t.x + t.width / 2)) < (t.width + r.width) / 2 + Pn && Math.abs(Q.y - (t.y + t.height / 2)) < (t.height + r.height) / 2 + Pn ? { x: t.x + t.width + Pn + r.width / 2, y: Q.y } : Q), ge;
+    const _e = ie.x + Pn + r.width / 2, U = ie.x + ie.width - Pn - r.width / 2, le = ie.y + Pn + r.height / 2, K = ie.y + ie.height - Pn - r.height / 2, Q = { x: Math.min(U, Math.max(_e, me.x)), y: Math.min(K, Math.max(le, me.y)) };
+    return (Q.x !== me.x || Q.y !== me.y) && (me = Math.abs(Q.x - (t.x + t.width / 2)) < (t.width + r.width) / 2 + Pn && Math.abs(Q.y - (t.y + t.height / 2)) < (t.height + r.height) / 2 + Pn ? { x: t.x + t.width + Pn + r.width / 2, y: Q.y } : Q), me;
   }, l = (i.children ?? []).filter(
     (ee) => !("waypoints" in ee && ee.waypoints) && ee.type !== "bpmn:Lane" && ee.type !== "label" && typeof ee.x == "number" && ee.id !== o.selfId
   ), u = We(e), p = (ee) => {
@@ -8807,26 +8807,26 @@ function nu(e, t, n, i, o) {
     );
   }, b = (ee) => h(ee) || m(ee) || w(ee) || v(ee), E = (ee) => ee.x - r.width / 2 >= i.x && ee.x + r.width / 2 <= i.x + i.width && ee.y - r.height / 2 >= i.y && ee.y + r.height / 2 <= i.y + i.height, A = (ee) => E(ee) && (!a || tu(ee, r, a));
   if (o.placement) {
-    const ee = (_e) => _e.startsWith("top") ? _e.replace(/^top/, "bottom") : _e.replace(/^bottom/, "top"), se = (_e) => _e.endsWith("left") ? _e.replace(/left$/, "right") : _e.replace(/right$/, "left"), ie = o.placement.side, ve = [ie, ee(ie), se(ie), ee(se(ie)), "top", "bottom", "left", "right", "top-left", "top-right", "bottom-left", "bottom-right"], fe = o.placement.offset ?? 50;
-    let ge = c(ie, fe);
-    if (b(ge) || a && !tu(ge, r, a)) {
+    const ee = (_e) => _e.startsWith("top") ? _e.replace(/^top/, "bottom") : _e.replace(/^bottom/, "top"), se = (_e) => _e.endsWith("left") ? _e.replace(/left$/, "right") : _e.replace(/right$/, "left"), ie = o.placement.side, ve = [ie, ee(ie), se(ie), ee(se(ie)), "top", "bottom", "left", "right", "top-left", "top-right", "bottom-left", "bottom-right"], de = o.placement.offset ?? 50;
+    let me = c(ie, de);
+    if (b(me) || a && !tu(me, r, a)) {
       const _e = (U, le) => {
         const K = /* @__PURE__ */ new Set();
         for (const Q of ve) {
           if (K.has(Q)) continue;
           K.add(Q);
-          const de = c(Q, fe, U);
-          if (le(de) && !b(de))
-            return ge = de, !0;
+          const he = c(Q, de, U);
+          if (le(he) && !b(he))
+            return me = he, !0;
         }
         return !1;
       };
       !_e(s, A) && a && _e(i, E);
     }
-    return ge;
+    return me;
   }
-  const N = o.from, P = s.x + Pn + r.width / 2, k = s.x + s.width - Pn - r.width / 2, H = s.y + Pn + r.height / 2, F = s.y + s.height - Pn - r.height / 2;
-  let G = { x: Math.min(k, Math.max(P, N.x)), y: Math.min(F, Math.max(H, N.y)) };
+  const I = o.from, P = s.x + Pn + r.width / 2, k = s.x + s.width - Pn - r.width / 2, H = s.y + Pn + r.height / 2, F = s.y + s.height - Pn - r.height / 2;
+  let G = { x: Math.min(k, Math.max(P, I.x)), y: Math.min(F, Math.max(H, I.y)) };
   if (b(G)) {
     const ee = (t.width + r.width) / 2 + Pn, ie = [
       { x: G.x + ee, y: G.y },
@@ -8881,12 +8881,12 @@ function qA(e, t) {
     (_) => !("waypoints" in _ && _.waypoints) && _.type !== "bpmn:Lane" && _.type !== "label" && typeof _.x == "number"
   ))
     h.set(x.id, { x: x.x, y: x.y });
-  const m = Bt(e, "participant.add"), w = Bt(e, "node.add"), y = Bt(e, "sequenceFlow.add"), v = Bt(e, "messageFlow.add"), b = Bt(e, "dataStore.add"), E = Bt(e, "dataAssociation.add"), A = Bt(e, "annotation.add"), N = Bt(e, "group.add"), P = new Map(w.map((x) => [x.node.id, x])), k = Iw(e, (x) => {
+  const m = Bt(e, "participant.add"), w = Bt(e, "node.add"), y = Bt(e, "sequenceFlow.add"), v = Bt(e, "messageFlow.add"), b = Bt(e, "dataStore.add"), E = Bt(e, "dataAssociation.add"), A = Bt(e, "annotation.add"), I = Bt(e, "group.add"), P = new Map(w.map((x) => [x.node.id, x])), k = Iw(e, (x) => {
     var _, S;
     return (S = (_ = f(x)) == null ? void 0 : _.source) == null ? void 0 : S.id;
   }), H = new Set([...k.values()].map((x) => x.flow.id)), F = y.filter((x) => !H.has(x.flow.id)), G = new Set([...k.values()].map((x) => x.flow.target)), ee = (x) => Bt(e, "sequenceFlow.update").filter((_) => _.target === x).length + (G.has(x) ? 1 : 0), se = (x, _, S) => {
     var L;
-    const O = x.businessObject, I = (((L = O.extensionElements) == null ? void 0 : L.values) ?? []).filter((D) => D.$type !== _), T = S ? [...I, i.create(_, S)] : I;
+    const O = x.businessObject, N = (((L = O.extensionElements) == null ? void 0 : L.values) ?? []).filter((D) => D.$type !== _), T = S ? [...N, i.create(_, S)] : N;
     if (!T.length) {
       O.extensionElements && n.updateProperties(x, { extensionElements: void 0 });
       return;
@@ -8911,7 +8911,7 @@ function qA(e, t) {
       var S;
       return _.type === "bpmn:Lane" && ((S = g(_)) == null ? void 0 : S.id) === x;
     }
-  ).sort((_, S) => _.y - S.y), fe = [];
+  ).sort((_, S) => _.y - S.y), de = [];
   for (const x of Bt(e, "participant.update")) {
     const _ = d(x.id);
     if (x.name !== void 0 && n.updateProperties(_, { name: x.name ?? void 0 }), !x.lanes) continue;
@@ -8920,23 +8920,23 @@ function qA(e, t) {
       n.splitLane(_, x.lanes.length), ve(x.id).forEach((T, B) => {
         const L = x.lanes[B];
         L && n.updateProperties(T, { id: L.id, name: L.name });
-      }), fe.push({ pool: x.id, lanes: new Set(x.lanes.map((T) => T.id)) });
+      }), de.push({ pool: x.id, lanes: new Set(x.lanes.map((T) => T.id)) });
       continue;
     }
-    const O = new Set(S.map((T) => T.id)), I = x.lanes.reduce((T, B, L) => O.has(B.id) ? L : T, -1);
+    const O = new Set(S.map((T) => T.id)), N = x.lanes.reduce((T, B, L) => O.has(B.id) ? L : T, -1);
     x.lanes.forEach((T, B) => {
       if (O.has(T.id)) {
         n.updateProperties(d(T.id), { name: T.name });
         return;
       }
-      const L = B === I + 1 && I >= 0, D = B === 0 ? n.addLane(ve(x.id)[0], "top") : L ? n.addLane(ve(x.id).at(-1), "bottom") : n.addLane(d(x.lanes[B - 1].id), "bottom");
+      const L = B === N + 1 && N >= 0, D = B === 0 ? n.addLane(ve(x.id)[0], "top") : L ? n.addLane(ve(x.id).at(-1), "bottom") : n.addLane(d(x.lanes[B - 1].id), "bottom");
       n.updateProperties(D, { id: T.id, name: T.name });
     });
   }
-  const ge = 150, _e = 130, U = 80, le = 90, K = 180, Q = 30, de = 30, Ee = 10, Fe = 300, $ = 5, C = (x, _, S, O, I) => {
+  const me = 150, _e = 130, U = 80, le = 90, K = 180, Q = 30, he = 30, Ee = 10, Fe = 300, $ = 5, C = (x, _, S, O, N) => {
     const T = S - _.width / 2, B = O - _.height / 2;
     return (x.children ?? []).find(
-      (L) => !("waypoints" in L && L.waypoints) && L.type !== "bpmn:Lane" && L.type !== "label" && !(I != null && I.has(L.id)) && typeof L.x == "number" && T < L.x + L.width + de && T + _.width + de > L.x && B < L.y + L.height && B + _.height > L.y
+      (L) => !("waypoints" in L && L.waypoints) && L.type !== "bpmn:Lane" && L.type !== "label" && !(N != null && N.has(L.id)) && typeof L.x == "number" && T < L.x + L.width + he && T + _.width + he > L.x && B < L.y + L.height && B + _.height > L.y
     );
   }, R = /* @__PURE__ */ new Set();
   for (const x of m) {
@@ -8952,39 +8952,39 @@ function qA(e, t) {
   const q = /* @__PURE__ */ new Map();
   for (const [x, _] of W) {
     if (!R.has(x)) continue;
-    const S = [..._].sort((T, B) => T - B), O = S.map((T, B) => B === 0 ? 0 : B % 2 === 1 ? Math.ceil(B / 2) : -(B / 2)), I = Math.min(...O);
-    q.set(x, new Map(S.map((T, B) => [T, O[B] - I])));
+    const S = [..._].sort((T, B) => T - B), O = S.map((T, B) => B === 0 ? 0 : B % 2 === 1 ? Math.ceil(B / 2) : -(B / 2)), N = Math.min(...O);
+    q.set(x, new Map(S.map((T, B) => [T, O[B] - N])));
   }
   {
     const x = /* @__PURE__ */ new Map();
     for (const _ of m) (_.participant.lanes ?? []).forEach((S, O) => x.set(S.id, O));
     for (const [_, S] of q) {
       if (!x.has(_) || S.size < 2) continue;
-      const O = x.get(_), I = S.get(0) ?? 0, T = /* @__PURE__ */ new Set();
+      const O = x.get(_), N = S.get(0) ?? 0, T = /* @__PURE__ */ new Set();
       for (const ne of w) {
         if (ne.node.lane !== _ || (ne.band ?? 0) !== 0 || !ne.node.type.endsWith("Gateway")) continue;
         const ce = { in: /* @__PURE__ */ new Set(), out: /* @__PURE__ */ new Set(), cross: /* @__PURE__ */ new Set() };
         for (const ae of F) {
           const oe = ae.flow.source === ne.node.id;
           if (!oe && ae.flow.target !== ne.node.id) continue;
-          const me = P.get(oe ? ae.flow.target : ae.flow.source);
-          if (!me || me.node.participant !== ne.node.participant || !me.node.lane) continue;
-          let he, te = !1;
-          if (me.node.lane !== _) {
-            const Z = x.get(me.node.lane);
+          const ye = P.get(oe ? ae.flow.target : ae.flow.source);
+          if (!ye || ye.node.participant !== ne.node.participant || !ye.node.lane) continue;
+          let ge, te = !1;
+          if (ye.node.lane !== _) {
+            const Z = x.get(ye.node.lane);
             if (Z === void 0) continue;
-            he = Z > O ? "down" : "up", te = !0;
+            ge = Z > O ? "down" : "up", te = !0;
           } else {
-            const Z = S.get(me.band ?? 0) ?? I;
-            he = Z > I ? "down" : Z < I ? "up" : void 0;
+            const Z = S.get(ye.band ?? 0) ?? N;
+            ge = Z > N ? "down" : Z < N ? "up" : void 0;
           }
-          he && (ce[oe ? "out" : "in"].add(he), te && ce.cross.add(he));
+          ge && (ce[oe ? "out" : "in"].add(ge), te && ce.cross.add(ge));
         }
         for (const ae of ["up", "down"]) ce.in.has(ae) && ce.out.has(ae) && ce.cross.has(ae) && T.add(ae);
       }
       if (T.size !== 1) continue;
       const [B] = T, L = Math.max(...S.values()), D = B === "down" ? L : 0;
-      if (I === D) continue;
+      if (N === D) continue;
       const z = [...S.entries()].filter(([ne]) => ne !== 0).sort((ne, ce) => ne[1] - ce[1]), j = [...Array(L + 1).keys()].filter((ne) => ne !== D), X = /* @__PURE__ */ new Map([[0, D]]);
       z.forEach(([ne], ce) => X.set(ne, j[ce])), q.set(_, X);
     }
@@ -9002,37 +9002,37 @@ function qA(e, t) {
     const x = /* @__PURE__ */ new Map();
     for (const O of F) x.set(O.flow.target, (x.get(O.flow.target) ?? 0) + 1);
     const _ = (O) => {
-      const I = [], T = /* @__PURE__ */ new Set([O]), B = [O];
+      const N = [], T = /* @__PURE__ */ new Set([O]), B = [O];
       for (; B.length; ) {
         const L = B.shift();
-        I.push(L);
+        N.push(L);
         for (const D of F)
           D.flow.source !== L || T.has(D.flow.target) || (x.get(D.flow.target) ?? 0) !== 1 || (T.add(D.flow.target), B.push(D.flow.target));
       }
-      return I;
-    }, S = (O, I) => {
+      return N;
+    }, S = (O, N) => {
       var T;
-      return ((T = q.get(O)) == null ? void 0 : T.get(I)) ?? I;
+      return ((T = q.get(O)) == null ? void 0 : T.get(N)) ?? N;
     };
     for (const O of w) {
       if (!O.node.type.endsWith("Gateway")) continue;
-      const I = O.node.lane ?? `pool:${O.node.participant ?? ""}`, T = q.get(I);
+      const N = O.node.lane ?? `pool:${O.node.participant ?? ""}`, T = q.get(N);
       if (!T || T.size < 2) continue;
       const B = at(O);
-      if (B === void 0 || S(I, B) !== S(I, 0)) continue;
-      const L = S(I, B), D = F.filter((ae) => ae.flow.source === O.node.id).map((ae) => P.get(ae.flow.target)).filter((ae) => !!ae && (ae.node.lane ?? `pool:${ae.node.participant ?? ""}`) === I), z = D.filter((ae) => {
+      if (B === void 0 || S(N, B) !== S(N, 0)) continue;
+      const L = S(N, B), D = F.filter((ae) => ae.flow.source === O.node.id).map((ae) => P.get(ae.flow.target)).filter((ae) => !!ae && (ae.node.lane ?? `pool:${ae.node.participant ?? ""}`) === N), z = D.filter((ae) => {
         const oe = at(ae);
-        return oe !== void 0 && S(I, oe) === L && (x.get(ae.node.id) ?? 0) === 1;
+        return oe !== void 0 && S(N, oe) === L && (x.get(ae.node.id) ?? 0) === 1;
       }), j = D.some((ae) => {
         const oe = at(ae);
-        return oe !== void 0 && S(I, oe) > L;
+        return oe !== void 0 && S(N, oe) > L;
       });
       if (z.length !== 1 || !j) continue;
       const X = new Set(D.flatMap((ae) => _(ae.node.id)));
       if (!F.some((ae) => ae.flow.target === O.node.id && X.has(ae.flow.source))) continue;
       const ce = /* @__PURE__ */ new Map();
       for (const [ae, oe] of T) ce.set(ae, oe + 1);
-      ce.set(-1, 0), q.set(I, ce);
+      ce.set(-1, 0), q.set(N, ce);
       for (const ae of _(z[0].node.id)) P.has(ae) && (Qe.set(ae, -1), _t.add(ae));
       jt.add(O.node.id);
     }
@@ -9040,7 +9040,7 @@ function qA(e, t) {
   {
     const x = (j) => j.node.lane ?? `pool:${j.node.participant ?? ""}`, _ = (j) => at(j) ?? 0, S = new Map(
       m.map((j, X) => ({ id: j.participant.id, order: j.order ?? Number.POSITIVE_INFINITY, declared: X })).sort((j, X) => j.order !== X.order ? j.order - X.order : j.declared - X.declared).map((j, X) => [j.id, X])
-    ), O = (j) => j === void 0 ? void 0 : S.get(j) ?? -1, I = (j) => {
+    ), O = (j) => j === void 0 ? void 0 : S.get(j) ?? -1, N = (j) => {
       var ce;
       const X = P.get(j);
       if (X) return X.node.participant;
@@ -9066,8 +9066,8 @@ function qA(e, t) {
       for (const ae of v) {
         const oe = X.has(ae.flow.source) ? ae.flow.target : X.has(ae.flow.target) ? ae.flow.source : void 0;
         if (oe === void 0) continue;
-        const me = O(I(oe));
-        me === void 0 || me === ne || ce.add(me < ne ? "up" : "down");
+        const ye = O(N(oe));
+        ye === void 0 || ye === ne || ce.add(ye < ne ? "up" : "down");
       }
       return ce.size === 1 ? [...ce][0] : void 0;
     }, D = /* @__PURE__ */ new Map();
@@ -9075,23 +9075,23 @@ function qA(e, t) {
       const j = /* @__PURE__ */ new Map();
       for (const oe of F) {
         if (!P.has(oe.flow.source) || !P.has(oe.flow.target)) continue;
-        const me = j.get(oe.flow.source) ?? [];
-        me.push(oe.flow.target), j.set(oe.flow.source, me);
+        const ye = j.get(oe.flow.source) ?? [];
+        ye.push(oe.flow.target), j.set(oe.flow.source, ye);
       }
       const X = /* @__PURE__ */ new Map(), ne = [], ce = /* @__PURE__ */ new Set(), ae = (oe) => {
         X.set(oe, "open");
-        for (const me of j.get(oe) ?? []) {
-          const he = X.get(me);
-          he === "open" ? ce.add(`${oe}>${me}`) : he || ae(me);
+        for (const ye of j.get(oe) ?? []) {
+          const ge = X.get(ye);
+          ge === "open" ? ce.add(`${oe}>${ye}`) : ge || ae(ye);
         }
         X.set(oe, "done"), ne.push(oe);
       };
       for (const oe of w) X.has(oe.node.id) || ae(oe.node.id);
       for (const oe of ne.reverse()) {
-        const me = D.get(oe) ?? 0;
-        D.set(oe, me);
-        for (const he of j.get(oe) ?? [])
-          !ce.has(`${oe}>${he}`) && (D.get(he) ?? -1) < me + 1 && D.set(he, me + 1);
+        const ye = D.get(oe) ?? 0;
+        D.set(oe, ye);
+        for (const ge of j.get(oe) ?? [])
+          !ce.has(`${oe}>${ge}`) && (D.get(ge) ?? -1) < ye + 1 && D.set(ge, ye + 1);
       }
     }
     let z = -1e3;
@@ -9104,15 +9104,15 @@ function qA(e, t) {
         return { root: te, subtree: Z, dir: L(Z) };
       });
       if (oe.some((te) => te.dir === "up") && oe.some((te) => te.dir === "down")) continue;
-      const me = F.some((te) => {
+      const ye = F.some((te) => {
         const Z = te.flow.source === j.node.id ? P.get(te.flow.target) : void 0;
         return !!Z && x(Z) === X && ae(Z) === 0;
       });
-      let he = !1;
-      if (!me) {
-        const te = F.filter((ye) => ye.flow.source === j.node.id).map((ye) => P.get(ye.flow.target)).filter((ye) => !!ye && x(ye) === X && (!!ye.node.lane || Te(ye) !== void 0) && ae(ye) < 0), Z = te.length ? Math.max(...te.map(ae)) : void 0, re = te.filter((ye) => ae(ye) === Z);
+      let ge = !1;
+      if (!ye) {
+        const te = F.filter((fe) => fe.flow.source === j.node.id).map((fe) => P.get(fe.flow.target)).filter((fe) => !!fe && x(fe) === X && (!!fe.node.lane || Te(fe) !== void 0) && ae(fe) < 0), Z = te.length ? Math.max(...te.map(ae)) : void 0, re = te.filter((fe) => ae(fe) === Z);
         if (!At(j.node.id) && re.length === 1 && (T.get(re[0].node.id) ?? 0) === 1 && !jt.has(j.node.id)) continue;
-        he = !0;
+        ge = !0;
       }
       for (const te of oe) {
         const Z = te.dir;
@@ -9124,15 +9124,15 @@ function qA(e, t) {
           const Be = ae(Pe);
           return Z === "up" ? Be < 0 : Be > 0;
         })) continue;
-        const ye = [...ne].map(([Re, Pe]) => ({ band: Re, rel: Pe - ce })).filter((Re) => Z === "up" ? Re.rel < 0 : Re.rel > 0).sort((Re, Pe) => Math.abs(Pe.rel) - Math.abs(Re.rel));
-        if (!ye.length && Z === "down") continue;
+        const fe = [...ne].map(([Re, Pe]) => ({ band: Re, rel: Pe - ce })).filter((Re) => Z === "up" ? Re.rel < 0 : Re.rel > 0).sort((Re, Pe) => Math.abs(Pe.rel) - Math.abs(Re.rel));
+        if (!fe.length && Z === "down") continue;
         const Ne = _(te.root), ke = te.subtree.filter((Re) => x(Re) === X && _(Re) === Ne), qe = new Set(te.subtree.map((Re) => Re.node.id)), Ce = ke.map((Re) => D.get(Re.node.id) ?? 0), Me = Math.min(...Ce) - 1, Se = Math.max(...Ce) + 1, Ae = (Re) => !w.some((Pe) => {
           if (qe.has(Pe.node.id) || x(Pe) !== X || _(Pe) !== Re) return !1;
           if (!Jt.has(Re)) return !0;
           const Be = D.get(Pe.node.id) ?? 0;
           return Be >= Me && Be <= Se;
         });
-        let ue = he ? _(j) : (lm = ye.find((Re) => Ae(Re.band))) == null ? void 0 : lm.band;
+        let ue = ge ? _(j) : (lm = fe.find((Re) => Ae(Re.band))) == null ? void 0 : lm.band;
         if (ue === void 0) {
           if (ue = z--, Jt.add(ue), Z === "up") {
             const Re = /* @__PURE__ */ new Map();
@@ -9146,67 +9146,67 @@ function qA(e, t) {
     }
     {
       const j = (oe) => {
-        const me = F.find((he) => he.flow.target === oe.node.id);
-        return me ? P.get(me.flow.source) : void 0;
+        const ye = F.find((ge) => ge.flow.target === oe.node.id);
+        return ye ? P.get(ye.flow.source) : void 0;
       }, X = (oe) => {
-        const me = j(oe);
-        if (!me || !me.node.type.endsWith("Gateway") || x(me) !== x(oe)) return !1;
-        const he = q.get(x(me));
-        if (!he) return !1;
-        const te = he.get(_(me)) ?? 0, Z = (ke) => x(ke) === x(me) ? (he.get(_(ke)) ?? 0) - te : Number.NaN, re = F.filter((ke) => ke.flow.source === me.node.id).map((ke) => P.get(ke.flow.target)).filter((ke) => !!ke && (!!ke.node.lane || Te(ke) !== void 0));
+        const ye = j(oe);
+        if (!ye || !ye.node.type.endsWith("Gateway") || x(ye) !== x(oe)) return !1;
+        const ge = q.get(x(ye));
+        if (!ge) return !1;
+        const te = ge.get(_(ye)) ?? 0, Z = (ke) => x(ke) === x(ye) ? (ge.get(_(ke)) ?? 0) - te : Number.NaN, re = F.filter((ke) => ke.flow.source === ye.node.id).map((ke) => P.get(ke.flow.target)).filter((ke) => !!ke && (!!ke.node.lane || Te(ke) !== void 0));
         if (re.some((ke) => Z(ke) === 0)) return !1;
-        const J = re.filter((ke) => ke.node.lane === me.node.lane && Z(ke) < 0);
+        const J = re.filter((ke) => ke.node.lane === ye.node.lane && Z(ke) < 0);
         if (!J.length) return !1;
-        const ye = Math.max(...J.map(Z)), Ne = J.filter((ke) => Z(ke) === ye);
-        return Ne.length === 1 && Ne[0] === oe && (T.get(oe.node.id) ?? 0) === 1 && !At(me.node.id) && !jt.has(me.node.id);
+        const fe = Math.max(...J.map(Z)), Ne = J.filter((ke) => Z(ke) === fe);
+        return Ne.length === 1 && Ne[0] === oe && (T.get(oe.node.id) ?? 0) === 1 && !At(ye.node.id) && !jt.has(ye.node.id);
       }, ne = /* @__PURE__ */ new Set();
       for (const oe of w) {
         if (!oe.node.type.endsWith("Gateway") || At(oe.node.id)) continue;
-        const me = q.get(x(oe));
-        if (!me) continue;
-        const he = me.get(_(oe)) ?? 0;
+        const ye = q.get(x(oe));
+        if (!ye) continue;
+        const ge = ye.get(_(oe)) ?? 0;
         let te;
         for (const Z of F) {
           if (Z.flow.source !== oe.node.id) continue;
           const re = P.get(Z.flow.target);
           if (!re || x(re) !== x(oe) || !re.node.lane && Te(re) === void 0) continue;
-          const J = me.get(_(re)) ?? 0;
-          J <= he || (!te || J > te.row ? te = { id: re.node.id, row: J, count: 1 } : J === te.row && te.count++);
+          const J = ye.get(_(re)) ?? 0;
+          J <= ge || (!te || J > te.row ? te = { id: re.node.id, row: J, count: 1 } : J === te.row && te.count++);
         }
         te && te.count === 1 && (T.get(te.id) ?? 0) === 1 && ne.add(te.id);
       }
-      const ce = /* @__PURE__ */ new Set(), ae = [...w].sort((oe, me) => Number(ne.has(oe.node.id)) - Number(ne.has(me.node.id)));
+      const ce = /* @__PURE__ */ new Set(), ae = [...w].sort((oe, ye) => Number(ne.has(oe.node.id)) - Number(ne.has(ye.node.id)));
       for (const oe of ae) {
-        const me = x(oe), he = q.get(me);
-        if (!he) continue;
+        const ye = x(oe), ge = q.get(ye);
+        if (!ge) continue;
         const te = oe.node.id, Z = v.filter((xt) => xt.flow.target === te);
         if (Z.length !== 1 || !(T.get(te) ?? 0) || !oe.node.lane && Te(oe) === void 0 || _t.has(te) || En.has(te)) continue;
         const re = (pm = P.get(Z[0].flow.source)) == null ? void 0 : pm.node.participant;
         if (!re || re === oe.node.participant) continue;
-        const J = O(oe.node.participant), ye = O(re);
-        if (J === void 0 || ye === void 0 || J === ye) continue;
-        const Ne = ye < J, ke = he.get(0) ?? 0, qe = (he.get(_(oe)) ?? ke) - ke;
+        const J = O(oe.node.participant), fe = O(re);
+        if (J === void 0 || fe === void 0 || J === fe) continue;
+        const Ne = fe < J, ke = ge.get(0) ?? 0, qe = (ge.get(_(oe)) ?? ke) - ke;
         if (qe === 0 || (Ne ? qe < 0 : qe > 0) || X(oe)) continue;
         let Ce;
-        for (const [xt, tn] of he) {
+        for (const [xt, tn] of ge) {
           if (Jt.has(xt)) continue;
           const Gt = tn - ke;
           (Ne ? Gt < 0 && (!Ce || Gt < Ce.row) : Gt > 0 && (!Ce || Gt > Ce.row)) && (Ce = { band: xt, row: Gt });
         }
         if (!Ce) continue;
-        const Me = _(oe), Se = B(oe).filter((xt) => x(xt) === me && _(xt) === Me && !_t.has(xt.node.id)), Ae = j(oe), ue = Ae != null && Ae.node.type.endsWith("Gateway") ? `${Ae.node.id}|${me}|${Ce.band}` : void 0, Re = Ce, Pe = !!ue && ne.has(te) && F.some((xt) => {
+        const Me = _(oe), Se = B(oe).filter((xt) => x(xt) === ye && _(xt) === Me && !_t.has(xt.node.id)), Ae = j(oe), ue = Ae != null && Ae.node.type.endsWith("Gateway") ? `${Ae.node.id}|${ye}|${Ce.band}` : void 0, Re = Ce, Pe = !!ue && ne.has(te) && F.some((xt) => {
           if (xt.flow.source !== Ae.node.id || xt.flow.target === te) return !1;
           const tn = P.get(xt.flow.target);
-          return !!tn && x(tn) === me && !Se.includes(tn) && _(tn) === Re.band;
+          return !!tn && x(tn) === ye && !Se.includes(tn) && _(tn) === Re.band;
         });
         let Be = Ce.band;
         if (ue && (ce.has(ue) || Pe)) {
           if (Be = z--, Jt.add(Be), Ne) {
             const xt = /* @__PURE__ */ new Map();
-            for (const [tn, Gt] of he) xt.set(tn, Gt + 1);
-            xt.set(Be, 0), q.set(me, xt);
-          } else he.set(Be, Math.max(...he.values()) + 1);
-          (fm = W.get(me)) == null || fm.add(Be);
+            for (const [tn, Gt] of ge) xt.set(tn, Gt + 1);
+            xt.set(Be, 0), q.set(ye, xt);
+          } else ge.set(Be, Math.max(...ge.values()) + 1);
+          (fm = W.get(ye)) == null || fm.add(Be);
         }
         ue && ce.add(ue);
         for (const xt of Se)
@@ -9219,51 +9219,51 @@ function qA(e, t) {
     var S;
     return ((S = q.get(x)) == null ? void 0 : S.get(_)) ?? _;
   }, fn = (x, _, S, O) => {
-    const I = x ? f(x) : _ ? f(_) : void 0;
-    if (!I) return !1;
-    const T = x ? I.y + Math.min(I.height / 2, le) : I.y + U;
-    return Math.abs(T + Nt(x ?? `pool:${_ ?? ""}`, S) * ge - O) <= ge / 2;
+    const N = x ? f(x) : _ ? f(_) : void 0;
+    if (!N) return !1;
+    const T = x ? N.y + Math.min(N.height / 2, le) : N.y + U;
+    return Math.abs(T + Nt(x ?? `pool:${_ ?? ""}`, S) * me - O) <= me / 2;
   }, Io = /* @__PURE__ */ new Map();
   for (const [x, _] of W) {
     let S = 0;
     for (const O of _) S = Math.max(S, Nt(x, O));
     Io.set(x, S);
   }
-  const Kn = (x) => K + ge * x, Xn = (x, _, S) => {
-    const O = p().children.filter(
-      (I) => !("waypoints" in I && I.waypoints) && I.type !== "label" && I.id !== _ && typeof I.y == "number" && I.y >= x
+  const Kn = (x) => K + me * x, Xn = (x, _, S, O) => {
+    const N = p().children.filter(
+      (T) => !("waypoints" in T && T.waypoints) && T.type !== "label" && T.id !== _ && !(O != null && O.has(T.id)) && typeof T.y == "number" && T.y >= x
     );
-    O.length && n.moveElements(O, { x: 0, y: S });
+    N.length && n.moveElements(N, { x: 0, y: S });
   }, di = (x, _, S) => {
     const O = x.type === "bpmn:Participant" ? x : void 0;
     if (!O || O.children.some((L) => L.type === "bpmn:Lane")) return;
-    const I = S + _.height / 2 + Q - O.y;
-    if (O.height >= I) return;
-    const T = I - O.height, B = O.y + O.height;
-    n.resizeShape(O, { x: O.x, y: O.y, width: O.width, height: I }), Xn(B, O.id, T);
+    const N = S + _.height / 2 + Q - O.y;
+    if (O.height >= N) return;
+    const T = N - O.height, B = O.y + O.height;
+    n.resizeShape(O, { x: O.x, y: O.y, width: O.width, height: N }), Xn(B, O.id, T);
   }, on = (x, _) => {
     const S = _ - x.height;
-    if (S <= 0) return;
-    const O = g(x) ?? x, I = [], T = (D) => {
-      I.push(D);
+    if (S <= 0) return /* @__PURE__ */ new Set();
+    const O = g(x) ?? x, N = [], T = (D) => {
+      N.push(D);
       for (const z of D.children ?? []) T(z);
     };
     T(O);
-    const B = x.y + x.height - 10, L = l.calculateAdjustments(I, "y", S, B);
-    l.makeSpace(L.movingShapes, L.resizingShapes, { x: 0, y: S }, "s", B);
+    const B = x.y + x.height - 10, L = l.calculateAdjustments(N, "y", S, B);
+    return l.makeSpace(L.movingShapes, L.resizingShapes, { x: 0, y: S }, "s", B), new Set(L.movingShapes.map((D) => D.id));
   }, go = (x, _, S) => {
     if (x) {
       const B = d(x), L = Kn(_);
       if (B.height >= L) return;
-      const D = L - B.height, z = g(B), j = z ? z.y + z.height : B.y + B.height;
-      on(B, L), Xn(j, z == null ? void 0 : z.id, D);
+      const D = L - B.height, z = g(B), j = z ? z.y + z.height : B.y + B.height, X = on(B, L);
+      Xn(j, z == null ? void 0 : z.id, D, X);
       return;
     }
     if (!S) return;
-    const O = ge * (_ + 1);
+    const O = me * (_ + 1);
     if (S.height >= O) return;
-    const I = O - S.height, T = S.y + S.height;
-    n.resizeShape(S, { x: S.x, y: S.y, width: S.width, height: O }), Xn(T, S.id, I);
+    const N = O - S.height, T = S.y + S.height;
+    n.resizeShape(S, { x: S.x, y: S.y, width: S.width, height: O }), Xn(T, S.id, N);
   }, ta = /* @__PURE__ */ new Map();
   for (const x of F) ta.set(x.flow.target, (ta.get(x.flow.target) ?? 0) + 1);
   const ei = (x) => (ta.get(x) ?? 0) <= 1, vt = new Set(
@@ -9274,65 +9274,70 @@ function qA(e, t) {
     if (!x) return;
     const S = f(x);
     if (!S || S.height >= Kn(_)) return;
-    const O = S.y + S.height - 10, I = g(S);
-    if (I)
+    const O = S.y + S.height - 10, N = g(S);
+    if (N)
       return new Set(
-        (I.children ?? []).filter((T) => T.type !== "bpmn:Lane" && typeof T.y == "number" && T.y > O).map((T) => T.id)
+        (N.children ?? []).filter((T) => T.type !== "bpmn:Lane" && typeof T.y == "number" && T.y > O).map((T) => T.id)
       );
   }, Pc = (x, _, S) => {
     if (!x) return !0;
     const O = f(x);
     return O ? S - _.height / 2 >= O.y && S + _.height / 2 <= O.y + O.height : !0;
   }, U1 = 10, q1 = /(Task|Event|Gateway|CallActivity|SubProcess|Transaction)$/;
-  for (const { pool: x, lanes: _ } of fe) {
+  for (const { pool: x, lanes: _ } of de) {
     const S = f(x), O = ve(x);
     if (!S || O.length < 2) continue;
-    const I = Kn(0), T = U1, B = new Set(
+    const N = Kn(0), T = U1, B = new Set(
       Bt(e, "node.update").filter((J) => J.lane !== void 0 && _.has(J.lane)).map((J) => J.id)
     ), L = S.children ?? [], D = L.filter(
       (J) => !("waypoints" in J && J.waypoints) && J.type !== "bpmn:Lane" && J.type !== "label" && typeof J.y == "number"
     ), z = [];
     for (const J of D) {
       z.push([J.y, J.y + J.height]);
-      const ye = J.label;
-      ye && z.push([ye.y, ye.y + ye.height]);
+      const fe = J.label;
+      fe && z.push([fe.y, fe.y + fe.height]);
     }
     for (const J of L) {
-      const ye = "waypoints" in J && J.waypoints ? J.label : void 0;
-      ye && ye.y + ye.height > S.y && ye.y < S.y + S.height && z.push([ye.y, ye.y + ye.height]);
+      const fe = "waypoints" in J && J.waypoints ? J.label : void 0;
+      fe && fe.y + fe.height > S.y && fe.y < S.y + S.height && z.push([fe.y, fe.y + fe.height]);
     }
-    z.sort((J, ye) => J[0] - ye[0]);
+    for (const J of p().children) {
+      if (J.type !== "bpmn:TextAnnotation") continue;
+      const fe = J;
+      fe.x < S.x + S.width && fe.x + fe.width > S.x && fe.y < S.y + S.height && fe.y + fe.height > S.y && z.push([fe.y, fe.y + fe.height]);
+    }
+    z.sort((J, fe) => J[0] - fe[0]);
     const j = S.y, X = S.y + S.height, ne = [];
     let ce = j;
-    for (const [J, ye] of z)
-      J > ce && ne.push([ce, J]), ce = Math.max(ce, ye);
-    const ae = D.filter((J) => q1.test(J.type) && !B.has(J.id)), oe = (J, ye) => ae.some((Ne) => Ne.y + Ne.height / 2 >= J && Ne.y + Ne.height / 2 <= ye), me = (J) => z.some(([ye, Ne]) => ye < J - 0.5 && J + 0.5 < Ne), he = [];
+    for (const [J, fe] of z)
+      J > ce && ne.push([ce, J]), ce = Math.max(ce, fe);
+    const ae = D.filter((J) => q1.test(J.type) && !B.has(J.id)), oe = (J, fe) => ae.some((Ne) => Ne.y + Ne.height / 2 >= J && Ne.y + Ne.height / 2 <= fe), ye = (J) => z.some(([fe, Ne]) => fe < J - 0.5 && J + 0.5 < Ne), ge = [];
     let te = j;
-    for (const J of O.slice(1).map((ye) => ye.y)) {
-      const ye = te + 2 * T, Ne = !me(J) && J >= ye && J <= X - 2 * T ? [J] : [];
+    for (const J of O.slice(1).map((fe) => fe.y)) {
+      const fe = te + 2 * T, Ne = !ye(J) && J >= fe && J <= X - 2 * T ? [J] : [];
       for (const [qe, Ce] of ne) {
-        const Me = Math.max(qe + T, ye), Se = Math.min(Ce - T, X - 2 * T);
+        const Me = Math.max(qe + T, fe), Se = Math.min(Ce - T, X - 2 * T);
         Me <= Se && Ne.push(Math.min(Math.max(J, Me), Se));
       }
-      Ne.push(Math.max(ce + T, ye));
+      Ne.push(Math.max(ce + T, fe));
       let ke;
       for (const qe of Ne) {
-        const Ce = !oe(te, qe) && qe - te < I ? D.filter((Ae) => Ae.y >= qe).length : 0, Me = Math.abs(qe - J), Se = ke ? Math.abs(ke.y - J) : 0;
+        const Ce = !oe(te, qe) && qe - te < N ? D.filter((Ae) => Ae.y >= qe).length : 0, Me = Math.abs(qe - J), Se = ke ? Math.abs(ke.y - J) : 0;
         (!ke || Ce < ke.cost || Ce === ke.cost && (Me < Se || Me === Se && qe > ke.y)) && (ke = { y: qe, cost: Ce });
       }
-      he.push(ke.y), te = ke.y;
+      ge.push(ke.y), te = ke.y;
     }
-    const Z = he[he.length - 1] + 2 * T - X;
+    const Z = ge[ge.length - 1] + 2 * T - X;
     Z > 0 && (n.resizeShape(S, { x: S.x, y: S.y, width: S.width, height: S.height + Z }), Xn(X, S.id, Z));
-    const re = [j, ...he, S.y + S.height];
-    O.forEach((J, ye) => {
-      const Ne = re[ye], ke = re[ye + 1] - Ne;
+    const re = [j, ...ge, S.y + S.height];
+    O.forEach((J, fe) => {
+      const Ne = re[fe], ke = re[fe + 1] - Ne;
       (J.y !== Ne || J.height !== ke) && n.resizeShape(J, { x: J.x, y: Ne, width: J.width, height: ke });
     });
     for (const J of O) {
-      if (J.height >= I || oe(J.y, J.y + J.height)) continue;
-      const ye = I - J.height, Ne = S.y + S.height;
-      on(J, I), Xn(Ne, S.id, ye);
+      if (J.height >= N || oe(J.y, J.y + J.height)) continue;
+      const fe = N - J.height, Ne = S.y + S.height, ke = on(J, N);
+      Xn(Ne, S.id, fe, ke);
     }
   }
   const Tc = m.map((x, _) => ({ op: x, declared: _ }));
@@ -9347,13 +9352,13 @@ function qA(e, t) {
     (x) => x.type === "bpmn:Participant" && x.parent === p()
   ), Y1 = (() => {
     if (!Ep.length) return;
-    const x = Ep.filter((I) => !$w(I)), _ = x.length ? x : Ep, S = Math.min(..._.map((I) => I.x)), O = Math.max(..._.map((I) => I.x + I.width));
+    const x = Ep.filter((N) => !$w(N)), _ = x.length ? x : Ep, S = Math.min(..._.map((N) => N.x)), O = Math.max(..._.map((N) => N.x + N.width));
     return O > S ? { x: S, width: O - S } : void 0;
   })();
   for (const { op: x } of Tc) {
-    const _ = x.participant, S = w.filter((oe) => oe.node.participant === _.id).length, O = ((dm = _.lanes) == null ? void 0 : dm.length) ?? 0, I = Math.max(1200, S * 160 + 300), T = (_.lanes ?? []).map((oe) => Kn(Io.get(oe.id) ?? 0)), B = T.reduce((oe, me) => oe + me, 0);
+    const _ = x.participant, S = w.filter((oe) => oe.node.participant === _.id).length, O = ((dm = _.lanes) == null ? void 0 : dm.length) ?? 0, N = Math.max(1200, S * 160 + 300), T = (_.lanes ?? []).map((oe) => Kn(Io.get(oe.id) ?? 0)), B = T.reduce((oe, ye) => oe + ye, 0);
     O && B < 300 && (T[O - 1] += 300 - B);
-    const L = Math.max(300, ge * ((Io.get(`pool:${_.id}`) ?? 0) + 1)), D = _.blackBox || S + O === 0 ? 120 : O ? Math.max(300, B) : L, z = _.blackBox ? Y1 : void 0, j = (z == null ? void 0 : z.x) ?? 100, X = (z == null ? void 0 : z.width) ?? I, ne = o.createShape({
+    const L = Math.max(300, me * ((Io.get(`pool:${_.id}`) ?? 0) + 1)), D = _.blackBox || S + O === 0 ? 120 : O ? Math.max(300, B) : L, z = _.blackBox ? Y1 : void 0, j = (z == null ? void 0 : z.x) ?? 100, X = (z == null ? void 0 : z.width) ?? N, ne = o.createShape({
       type: "bpmn:Participant",
       businessObject: i.create("bpmn:Participant", {
         id: _.id,
@@ -9371,19 +9376,19 @@ function qA(e, t) {
     }), ce = n.createShape(ne, { x: j + X / 2, y: ts + D / 2 }, p()), ae = _.lanes ?? [];
     if (ae.length && n.splitLane(ce, ae.length), ae.length) {
       const oe = r.filter(
-        (me) => {
-          var he;
-          return me.type === "bpmn:Lane" && ((he = g(me)) == null ? void 0 : he.id) === _.id;
+        (ye) => {
+          var ge;
+          return ye.type === "bpmn:Lane" && ((ge = g(ye)) == null ? void 0 : ge.id) === _.id;
         }
-      ).sort((me, he) => me.y - he.y);
-      if (oe.forEach((me, he) => {
-        const te = ae[he];
-        te && n.updateProperties(me, { id: te.id, name: te.name });
-      }), T.some((me) => me !== ce.height / O)) {
-        let me = ce.y;
-        oe.forEach((he, te) => {
+      ).sort((ye, ge) => ye.y - ge.y);
+      if (oe.forEach((ye, ge) => {
+        const te = ae[ge];
+        te && n.updateProperties(ye, { id: te.id, name: te.name });
+      }), T.some((ye) => ye !== ce.height / O)) {
+        let ye = ce.y;
+        oe.forEach((ge, te) => {
           const Z = T[te];
-          n.resizeShape(he, { x: he.x, y: me, width: he.width, height: Z }), me += Z;
+          n.resizeShape(ge, { x: ge.x, y: ye, width: ge.width, height: Z }), ye += Z;
         });
       }
     }
@@ -9426,30 +9431,30 @@ function qA(e, t) {
   ], Rp = (x) => x.endsWith("Gateway");
   for (const x of X1) {
     const _ = ns.get(x), S = x ? d(x) : void 0, O = S ? S.x + 150 : 250;
-    let I = S ? S.y + 80 : 120;
+    let N = S ? S.y + 80 : 120;
     const T = (Z, re, J) => {
       if (Z) {
-        const ye = d(Z);
-        return ye.y + Math.min(ye.height / 2, le) + Nt(Z, re ?? 0) * ge;
+        const fe = d(Z);
+        return fe.y + Math.min(fe.height / 2, le) + Nt(Z, re ?? 0) * me;
       }
-      return re !== void 0 && S ? S.y + U + Nt(`pool:${x}`, re) * ge : J;
+      return re !== void 0 && S ? S.y + U + Nt(`pool:${x}`, re) * me : J;
     }, B = (Z, re, J) => {
       if (Z) {
-        const ye = d(Z);
-        return ye.y + Math.min(ye.height / 2, le) + re * ge;
+        const fe = d(Z);
+        return fe.y + Math.min(fe.height / 2, le) + re * me;
       }
-      return S ? S.y + U + re * ge : J;
-    }, L = (Z) => Z.participant ? d(Z.participant) : p(), D = (Z, re, J, ye, Ne, ke, qe, Ce) => {
-      const Me = J !== void 0 || ye !== void 0, Se = (Pe) => {
+      return S ? S.y + U + re * me : J;
+    }, L = (Z) => Z.participant ? d(Z.participant) : p(), D = (Z, re, J, fe, Ne, ke, qe, Ce) => {
+      const Me = J !== void 0 || fe !== void 0, Se = (Pe) => {
         const Be = () => go(J, Pe, S);
         Ce ? Ce(Be) : Be();
-      }, Ae = Nt(J ?? `pool:${x}`, ye ?? 0);
+      }, Ae = Nt(J ?? `pool:${x}`, fe ?? 0);
       if (
         // ── B-89. band 를 **줘도** 그것이 상류 행의 슬롯을 가리키면 승계한다 ──
         // 🔴 종전엔 `band === undefined` 만 승계했는데, 사람 문서에서는 *"상류와 같은 행"* 을
         // 가리키는 band 가 **아예 없다**(격자 밖 92%). ⇒ band 를 주는 것이 승계를 **끄는**
         // 부작용을 냈다(표본 65 = 에이전트가 band 3 을 정확히 계산했는데 그 때문에 30px 어긋났다).
-        (ye === void 0 || fn(J, x, ye, qe ?? Number.NaN)) && qe !== void 0 && Pc(J, re, qe) && !C(Z, re, Ne, qe)
+        (fe === void 0 || fn(J, x, fe, qe ?? Number.NaN)) && qe !== void 0 && Pc(J, re, qe) && !C(Z, re, Ne, qe)
       )
         return { x: Ne, y: qe };
       if (Me)
@@ -9458,7 +9463,7 @@ function qA(e, t) {
           if (!C(Z, re, Ne, Be, kg(J, Ae + Pe)))
             return Se(Ae + Pe), { x: Ne, y: Be };
         }
-      const ue = T(J, ye, ke);
+      const ue = T(J, fe, ke);
       Me ? Se(Ae) : Ce ? Ce(() => di(Z, re, re.y + re.height / 2)) : di(Z, re, ue);
       let Re = Ne;
       for (let Pe = 0; Pe < 64; Pe++) {
@@ -9468,16 +9473,16 @@ function qA(e, t) {
       }
       return { x: Re, y: ue };
     }, z = (Z, re, J) => {
-      const ye = r.getAll().filter(
+      const fe = r.getAll().filter(
         (ke) => {
           var qe;
           return /Association$/.test(ke.type) && (((qe = ke.waypoints) == null ? void 0 : qe.length) ?? 0) >= 2;
         }
       );
-      if (!ye.length) return J;
+      if (!fe.length) return J;
       const Ne = (ke) => {
         const qe = { id: re.id, type: re.type, x: ke - re.width / 2, y: J.y - re.height / 2, width: re.width, height: re.height };
-        return ye.some(
+        return fe.some(
           (Ce) => Ce.waypoints.some((Me, Se) => !!Ce.waypoints[Se + 1] && la(Me, Ce.waypoints[Se + 1], qe) <= Ee)
         );
       };
@@ -9494,14 +9499,14 @@ function qA(e, t) {
         return re.x + re.width + _e;
     }, ce = (Z) => {
       if (ee(Z) > 0) return;
-      const re = _.flows.filter((ye) => ye.flow.source === Z);
+      const re = _.flows.filter((fe) => fe.flow.source === Z);
       if (re.length !== 1) return;
       const J = r.get(re[0].flow.target);
       return J && typeof J.y == "number" && typeof J.height == "number" ? J.y + J.height / 2 : void 0;
     };
     for (const Z of _.nodes) {
       if (j.has(Z.node.id)) continue;
-      const re = Sp(Z.node, Z.band, Z.afterColumn), J = Te(Z), ye = Z.node.lane ? `${Z.node.lane}|${J ?? ""}` : J !== void 0 ? `band:${J}` : "", Ne = L(Z.node), ke = X.get(ye) ?? O, qe = ne(Z.afterColumn), Ce = qe === void 0 ? ke : Math.max(ke, qe);
+      const re = Sp(Z.node, Z.band, Z.afterColumn), J = Te(Z), fe = Z.node.lane ? `${Z.node.lane}|${J ?? ""}` : J !== void 0 ? `band:${J}` : "", Ne = L(Z.node), ke = X.get(fe) ?? O, qe = ne(Z.afterColumn), Ce = qe === void 0 ? ke : Math.max(ke, qe);
       let Me;
       const Se = D(
         Ne,
@@ -9509,7 +9514,7 @@ function qA(e, t) {
         Z.node.lane,
         J,
         Ce,
-        I,
+        N,
         ce(Z.node.id),
         vt.has(Z.node.id) && Z.node.participant !== void 0 ? (Ae) => Me = Ae : void 0
       );
@@ -9517,13 +9522,13 @@ function qA(e, t) {
         const Ae = Z.node.lane ? d(Z.node.lane) : Ne;
         Et.set(Z.node.id, { container: Ae, relCy: Se.y - Ae.y, grow: Me });
       }
-      X.set(ye, Se.x + re.width + _e), !Z.node.lane && J === void 0 && (I += 160);
+      X.set(fe, Se.x + re.width + _e), !Z.node.lane && J === void 0 && (N += 160);
     }
-    const ae = /* @__PURE__ */ new Set(), oe = /* @__PURE__ */ new Map(), me = /* @__PURE__ */ new Map();
+    const ae = /* @__PURE__ */ new Set(), oe = /* @__PURE__ */ new Map(), ye = /* @__PURE__ */ new Map();
     if (x && R.has(`pool:${x}`)) {
       const Z = /* @__PURE__ */ new Map();
       for (const Ce of _.flows) Z.set(Ce.flow.target, (Z.get(Ce.flow.target) ?? 0) + 1);
-      const re = (Ce) => T(Ce.node.lane, at(Ce), Number.NaN), J = /* @__PURE__ */ new Set(), ye = (Ce) => {
+      const re = (Ce) => T(Ce.node.lane, at(Ce), Number.NaN), J = /* @__PURE__ */ new Set(), fe = (Ce) => {
         var Ae;
         const Me = (Ae = P.get(Ce)) == null ? void 0 : Ae.node.participant;
         if (Me) return f(Me);
@@ -9545,7 +9550,7 @@ function qA(e, t) {
         let Se = !1, Ae = !1;
         for (const ue of v) {
           if (!Me.has(ue.flow.source)) continue;
-          const Re = ye(ue.flow.target);
+          const Re = fe(ue.flow.target);
           !Re || Re.id === S.id || (Re.y < S.y ? Se = !0 : Ae = !0);
         }
         return Se && !Ae ? "up" : Ae && !Se ? "down" : void 0;
@@ -9584,7 +9589,7 @@ function qA(e, t) {
         let Se = !1, Ae = !1;
         for (const ue of v) {
           if (!Me.has(ue.flow.target)) continue;
-          const Re = ye(ue.flow.source);
+          const Re = fe(ue.flow.source);
           !Re || Re.id === S.id || (Re.y < S.y ? Se = !0 : Ae = !0);
         }
         return Se && !Ae ? "up" : Ae && !Se ? "down" : void 0;
@@ -9633,21 +9638,21 @@ function qA(e, t) {
         Me && !J.has(Me) && ae.add(Ce);
       }
     }
-    const he = /* @__PURE__ */ new Set();
+    const ge = /* @__PURE__ */ new Set();
     let te = 0;
     for (; te++ < _.nodes.length + 2; ) {
       for (let J = 0; J < _.nodes.length + _.flows.length + 2; J++) {
-        let ye = !1;
+        let fe = !1;
         for (const Ne of _.flows) {
           const ke = Ne.flow;
-          if (he.has(ke.id)) continue;
+          if (ge.has(ke.id)) continue;
           const qe = f(ke.source);
           if (!qe) continue;
           const Ce = f(ke.target), Me = P.get(ke.target);
           if (!Ce && Me) {
             const Se = Sp(Me.node, Me.band), Ae = at(Me);
             if (Me.node.lane || Ae !== void 0) {
-              const ue = L(Me.node), Re = qe, Pe = Re.x + (me.get(ke.source) ?? 0) + Re.width + _e, Be = oe.get(ke.target), xt = D(
+              const ue = L(Me.node), Re = qe, Pe = Re.x + (ye.get(ke.source) ?? 0) + Re.width + _e, Be = oe.get(ke.target), xt = D(
                 ue,
                 Se,
                 Be ? Be.lane : Me.node.lane,
@@ -9658,7 +9663,7 @@ function qA(e, t) {
                 // 합류(유입 ≥ 2)는 물려받을 행이 유일하지 않다(위 `inheritsRowFrom` 주석).
                 Be || !ei(ke.target) ? void 0 : Re.y + Re.height / 2
               ), tn = P.has(ke.source) ? xt : z(ue, Se, xt), Gt = n.createShape(Se, tn, ue);
-              ae.has(ke.target) && me.set(ke.target, Pe - (Gt.x + Gt.width / 2)), n.connect(qe, Gt, { type: "bpmn:SequenceFlow", businessObject: kc(ke) });
+              ae.has(ke.target) && ye.set(ke.target, Pe - (Gt.x + Gt.width / 2)), n.connect(qe, Gt, { type: "bpmn:SequenceFlow", businessObject: kc(ke) });
             } else
               s.append(qe, Se, {
                 connection: { type: "bpmn:SequenceFlow", businessObject: kc(ke) }
@@ -9667,16 +9672,16 @@ function qA(e, t) {
             n.connect(qe, Ce, { type: "bpmn:SequenceFlow", businessObject: kc(ke) });
           else
             continue;
-          he.add(ke.id), ye = !0;
+          ge.add(ke.id), fe = !0;
         }
-        if (!ye) break;
+        if (!fe) break;
       }
       const Z = _.nodes.filter((J) => !f(J.node.id));
       if (!Z.length) break;
       const re = Z[0];
       {
-        const J = Sp(re.node, re.band), ye = L(re.node), Ne = Te(re);
-        n.createShape(J, D(ye, J, re.node.lane, Ne, O, I), ye), !re.node.lane && Ne === void 0 && (I += 160);
+        const J = Sp(re.node, re.band), fe = L(re.node), Ne = Te(re);
+        n.createShape(J, D(fe, J, re.node.lane, Ne, O, N), fe), !re.node.lane && Ne === void 0 && (N += 160);
       }
     }
   }
@@ -9684,14 +9689,14 @@ function qA(e, t) {
   for (const [x, _] of k) {
     const S = f(x), O = f(_.flow.target);
     if (!(S != null && S.target) || !O) continue;
-    const I = S.label && { x: S.label.x, y: S.label.y, width: S.label.width, height: S.label.height };
-    Dg.set(x, { waypoints: S.waypoints.map((L) => ({ x: L.x, y: L.y })), label: I });
+    const N = S.label && { x: S.label.x, y: S.label.y, width: S.label.width, height: S.label.height };
+    Dg.set(x, { waypoints: S.waypoints.map((L) => ({ x: L.x, y: L.y })), label: N });
     const T = S.target, B = (L) => ({ x: L.x + L.width / 2, y: L.y + L.height / 2 });
     n.reconnect(S, O, T, [B(O), B(T)]), n.layoutConnection(S, { waypoints: [] });
   }
   const Lg = /* @__PURE__ */ new Set();
   {
-    const x = (T) => T.endsWith("Task") || T === "bpmn:CallActivity" || T === "bpmn:SubProcess", _ = (T) => x(T) || T === "bpmn:EndEvent" || T === "bpmn:IntermediateThrowEvent" || T === "bpmn:IntermediateCatchEvent", S = (T) => (T ?? []).filter((B) => B.type === "bpmn:SequenceFlow"), O = Bt(e, "sequenceFlow.update"), I = (T, B) => {
+    const x = (T) => T.endsWith("Task") || T === "bpmn:CallActivity" || T === "bpmn:SubProcess", _ = (T) => x(T) || T === "bpmn:EndEvent" || T === "bpmn:IntermediateThrowEvent" || T === "bpmn:IntermediateCatchEvent", S = (T) => (T ?? []).filter((B) => B.type === "bpmn:SequenceFlow"), O = Bt(e, "sequenceFlow.update"), N = (T, B) => {
       if (!T) return;
       const L = B.x + B.width / 2, D = B.y + B.height / 2;
       let z;
@@ -9710,24 +9715,24 @@ function qA(e, t) {
       if (!B) continue;
       const L = T.source !== void 0 ? f(T.source) : B.source, D = T.target !== void 0 ? f(T.target) : B.target;
       if (!L || !D || L.id === D.id || P.has(L.id) || P.has(D.id) || !x(L.type) || !_(D.type) || L.parent !== D.parent || S(D.incoming).some((te) => te.id !== B.id) || S(D.outgoing).some((te) => te.id !== B.id) || O.some((te) => te !== T && (te.target === D.id || te.source === D.id)) || D.x >= L.x + L.width) continue;
-      const z = L.parent, j = g(L), X = L.x + L.width + _e, ne = L.y + L.height / 2, ce = D.y + D.height / 2, ae = I(j, L) === I(j, D), oe = /* @__PURE__ */ new Set([D.id]), me = [ae ? ne : ce, ce].find((te) => !C(z, D, X, te, oe));
-      if (me === void 0) continue;
-      if (n.moveElements([D], { x: X - (D.x + D.width / 2), y: me - ce }), j) {
+      const z = L.parent, j = g(L), X = L.x + L.width + _e, ne = L.y + L.height / 2, ce = D.y + D.height / 2, ae = N(j, L) === N(j, D), oe = /* @__PURE__ */ new Set([D.id]), ye = [ae ? ne : ce, ce].find((te) => !C(z, D, X, te, oe));
+      if (ye === void 0) continue;
+      if (n.moveElements([D], { x: X - (D.x + D.width / 2), y: ye - ce }), j) {
         const te = D.x + D.width + $f - (j.x + j.width);
         te > 0 && iu(n, j, j.width + te);
       }
-      const he = (te) => ({ x: te.x + te.width / 2, y: te.y + te.height / 2 });
-      n.reconnect(B, L, D, [he(L), he(D)]), Math.abs(he(L).y - he(D).y) > 1 && n.layoutConnection(B, { waypoints: [] }), Lg.add(T.id);
+      const ge = (te) => ({ x: te.x + te.width / 2, y: te.y + te.height / 2 });
+      n.reconnect(B, L, D, [ge(L), ge(D)]), Math.abs(ge(L).y - ge(D).y) > 1 && n.layoutConnection(B, { waypoints: [] }), Lg.add(T.id);
     }
   }
   const No = 40, Z1 = 10, Oc = (x) => {
     const _ = (j) => j.kind === "label-over-line" || j.kind === "label-over-shape" || j.kind === "label-on-shared-segment" ? j.edge === x.id : j.kind === "annotation-over-label" || j.kind === "pool-name-over-label" ? j.label === x.id : !1, S = () => new Map(
       pt(We(r)).filter((j) => !_(j)).map((j) => [ft(j), j])
-    ), O = S(), I = (j) => [...j].filter(([X]) => !O.has(X)).map(([, X]) => X), T = (j) => I(j).length <= [...O.keys()].filter((X) => !j.has(X)).length, B = x.waypoints.map((j) => ({ x: j.x, y: j.y })), L = x.label, D = L && { x: L.x, y: L.y };
+    ), O = S(), N = (j) => [...j].filter(([X]) => !O.has(X)).map(([, X]) => X), T = (j) => N(j).length <= [...O.keys()].filter((X) => !j.has(X)).length, B = x.waypoints.map((j) => ({ x: j.x, y: j.y })), L = x.label, D = L && { x: L.x, y: L.y };
     n.layoutConnection(x, { waypoints: [] });
     const z = S();
     if (!T(z)) {
-      if (I(z).every((j) => j.kind === "edge-crosses-shape" && j.edge === x.id)) {
+      if (N(z).every((j) => j.kind === "edge-crosses-shape" && j.edge === x.id)) {
         const j = We(r), X = j.edges.find((oe) => oe.id === x.id), ne = Un(j), ce = X ? Ht(X, ne) : [], ae = X && ce.length && !ce.every((oe) => oe.type === "bpmn:TextAnnotation") ? Bd(X, ne, Ql(x), j.edges) : null;
         if (ae && (n.updateWaypoints(x, ae), T(S())))
           return;
@@ -9739,12 +9744,12 @@ function qA(e, t) {
     ...v.map((x) => x.flow.id),
     ...Bt(e, "sequenceFlow.update").map((x) => x.id),
     ...Bt(e, "messageFlow.update").map((x) => x.id)
-  ].filter((x) => !!x)), J1 = (x, _, S, O, I, T) => {
+  ].filter((x) => !!x)), J1 = (x, _, S, O, N, T) => {
     const B = new Set(x.map((te) => te.id)), L = Math.min(...x.map((te) => te.x)) + _ - vi, D = Math.max(...x.map((te) => te.x + te.width)) + _ + Ig + vi, z = Math.min(...x.map((te) => te.y + Math.min(0, ...S))) - vi, j = Math.max(...x.map((te) => te.y + te.height + Math.max(0, ...S))) + vi, X = r.getAll().filter((te) => {
       if (te.type !== "bpmn:SequenceFlow" && te.type !== "bpmn:MessageFlow") return !1;
       const Z = te;
-      return is.has(Z.id) || !Z.waypoints || Z.waypoints.length < 2 || [Z.source, Z.target].some((J) => !J || B.has(J.id) || J.x >= O) ? !1 : Z.waypoints.some((J, ye) => {
-        const Ne = Z.waypoints[ye + 1];
+      return is.has(Z.id) || !Z.waypoints || Z.waypoints.length < 2 || [Z.source, Z.target].some((J) => !J || B.has(J.id) || J.x >= O) ? !1 : Z.waypoints.some((J, fe) => {
+        const Ne = Z.waypoints[fe + 1];
         return !!Ne && Math.max(J.x, Ne.x) >= L && Math.min(J.x, Ne.x) <= D && Math.max(J.y, Ne.y) >= z && Math.min(J.y, Ne.y) <= j;
       });
     });
@@ -9753,10 +9758,10 @@ function qA(e, t) {
       const Z = /* @__PURE__ */ new Map();
       for (const re of x)
         for (const J of S) {
-          const ye = { id: re.id, type: re.type, x: re.x + _ + te, y: re.y + J, width: re.width, height: re.height };
+          const fe = { id: re.id, type: re.type, x: re.x + _ + te, y: re.y + J, width: re.width, height: re.height };
           for (const Ne of X) {
             let ke = 1 / 0;
-            for (let Ce = 0; Ce + 1 < Ne.waypoints.length; Ce++) ke = Math.min(ke, la(Ne.waypoints[Ce], Ne.waypoints[Ce + 1], ye));
+            for (let Ce = 0; Ce + 1 < Ne.waypoints.length; Ce++) ke = Math.min(ke, la(Ne.waypoints[Ce], Ne.waypoints[Ce + 1], fe));
             const qe = `${Ne.id}|${re.id}`;
             Z.set(qe, Math.min(Z.get(qe) ?? 1 / 0, ke));
           }
@@ -9773,25 +9778,25 @@ function qA(e, t) {
       }
     }
     if (!ae) return 0;
-    const oe = Math.min(...x.map((te) => te.x)) + _ + ae, me = new Set(ce.map((te) => te.slice(0, te.indexOf("|"))));
+    const oe = Math.min(...x.map((te) => te.x)) + _ + ae, ye = new Set(ce.map((te) => te.slice(0, te.indexOf("|"))));
     return X.some(
-      (te) => te.type === "bpmn:SequenceFlow" && me.has(te.id) && te.waypoints.some((Z, re) => {
+      (te) => te.type === "bpmn:SequenceFlow" && ye.has(te.id) && te.waypoints.some((Z, re) => {
         const J = te.waypoints[re + 1];
         if (!J || Math.min(Z.y, J.y) > T || Math.max(Z.y, J.y) < T || Z.y === J.y) return !1;
-        const ye = Z.x + (T - Z.y) * (J.x - Z.x) / (J.y - Z.y);
-        return ye > I && ye < oe;
+        const fe = Z.x + (T - Z.y) * (J.x - Z.x) / (J.y - Z.y);
+        return fe > N && fe < oe;
       })
     ) ? 0 : ae;
   }, Bo = (x, _ = () => !0) => {
     const S = f(x);
     if (!S) return [];
-    const O = [S], I = /* @__PURE__ */ new Set([x]);
+    const O = [S], N = /* @__PURE__ */ new Set([x]);
     for (let T = 0; T < O.length; T++) {
       const B = O[T].id;
       for (const L of F) {
         const D = L.flow.target;
-        if (L.flow.source !== B || I.has(D) || !P.has(D)) continue;
-        I.add(D);
+        if (L.flow.source !== B || N.has(D) || !P.has(D)) continue;
+        N.add(D);
         const z = f(D);
         z && _(z) && O.push(z);
       }
@@ -9800,13 +9805,13 @@ function qA(e, t) {
   }, Q1 = (x, _ = () => !0) => {
     const S = f(x);
     if (!S) return [];
-    const O = [S], I = /* @__PURE__ */ new Set([x]);
+    const O = [S], N = /* @__PURE__ */ new Set([x]);
     for (let T = 0; T < O.length; T++) {
       const B = O[T].id;
       for (const L of F) {
         const D = L.flow.source;
-        if (L.flow.target !== B || I.has(D) || !P.has(D)) continue;
-        I.add(D);
+        if (L.flow.target !== B || N.has(D) || !P.has(D)) continue;
+        N.add(D);
         const z = f(D);
         z && _(z) && O.push(z);
       }
@@ -9822,7 +9827,7 @@ function qA(e, t) {
         )
       )) return null;
     }
-    const I = x.map((D) => D.pool.width), T = S ? r.filter((D) => Array.isArray(D.waypoints)).map((D) => ({
+    const N = x.map((D) => D.pool.width), T = S ? r.filter((D) => Array.isArray(D.waypoints)).map((D) => ({
       c: D,
       wps: D.waypoints.map((z) => ({ x: z.x, y: z.y }))
     })) : [], B = r.filter((D) => D.type === "label").map((D) => ({
@@ -9843,7 +9848,7 @@ function qA(e, t) {
         x.flatMap((D) => D.subtree),
         { x: -_, y: 0 }
       ), x.forEach((D, z) => {
-        L[z] > 0 && na(D.pool, I[z]);
+        L[z] > 0 && na(D.pool, N[z]);
       });
       for (const { c: D, wps: z } of T) {
         const j = D.waypoints ?? [];
@@ -9859,7 +9864,7 @@ function qA(e, t) {
       }
     };
   }, Mp = (x) => {
-    var I, T;
+    var N, T;
     const _ = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map();
     for (const B of r.getAll()) {
       if (B.type !== "bpmn:Participant") continue;
@@ -9868,7 +9873,7 @@ function qA(e, t) {
     }
     for (const B of r.getAll()) {
       if (B.type !== "bpmn:MessageFlow") continue;
-      const L = B, D = (I = L.source) == null ? void 0 : I.id, z = (T = L.target) == null ? void 0 : T.id;
+      const L = B, D = (N = L.source) == null ? void 0 : N.id, z = (T = L.target) == null ? void 0 : T.id;
       D && z && S.has(D) && S.get(D).push(z), D && z && S.has(z) && S.get(z).push(D);
     }
     const O = [];
@@ -9879,9 +9884,9 @@ function qA(e, t) {
     if (!x.length) return null;
     const S = new Set(x.map((j) => j.id)), O = r.getAll().filter(
       (j) => j.type === "bpmn:Participant" && !S.has(j.id)
-    ), I = Math.min(
+    ), N = Math.min(
       ...O.filter((j) => (j.children ?? []).length > 0).map((j) => j.x)
-    ), T = new Set(x.filter((j) => Math.abs(j.x - I) <= 2).map((j) => j.id));
+    ), T = new Set(x.filter((j) => Math.abs(j.x - N) <= 2).map((j) => j.id));
     if (x.some((j) => {
       const X = T.has(j.id) ? j.x : j.x + _, ne = T.has(j.id) ? j.width + _ : j.width;
       return O.some(
@@ -9908,34 +9913,34 @@ function qA(e, t) {
       }
     };
   }, Bg = (x, _, S) => {
-    const O = S.x + S.width / 2, I = _.y > S.y, T = I ? S.y + S.height : S.y, B = I ? _.y : _.y + _.height, L = x.source === _ ? [{ x: O, y: B }, { x: O, y: T }] : [{ x: O, y: T }, { x: O, y: B }], D = We(r), z = { ...D.edges.find((j) => j.id === x.id), waypoints: L };
+    const O = S.x + S.width / 2, N = _.y > S.y, T = N ? S.y + S.height : S.y, B = N ? _.y : _.y + _.height, L = x.source === _ ? [{ x: O, y: B }, { x: O, y: T }] : [{ x: O, y: T }, { x: O, y: B }], D = We(r), z = { ...D.edges.find((j) => j.id === x.id), waypoints: L };
     return Ht(z, Un(D)).length ? !1 : (n.updateWaypoints(x, L), !0);
   }, eS = () => {
     const x = r.filter((B) => B.type === "bpmn:Participant"), _ = Math.min(...x.filter((B) => (B.children ?? []).length > 0).map((B) => B.x)), S = (B) => m.some((L) => L.participant.id === B.id), O = (B) => !!B && B.type === "bpmn:Participant" && !(B.children ?? []).length && Math.abs(B.x - _) <= 2 && // B-130 과 같은 판별자 — 폭이 아니라 좌변 관계
-    !S(B), I = (B) => !!B && B.type === "bpmn:Participant" && (B.children ?? []).length > 0 && !S(B), T = /* @__PURE__ */ new Set();
+    !S(B), N = (B) => !!B && B.type === "bpmn:Participant" && (B.children ?? []).length > 0 && !S(B), T = /* @__PURE__ */ new Set();
     for (const B of r.getAll()) {
       if (B.type !== "bpmn:MessageFlow") continue;
       const L = B;
       if ((L.waypoints ?? []).length !== 2) continue;
-      const D = [L.source, L.target].find((X) => O(X) || I(X)), z = D === L.source ? L.target : L.source;
+      const D = [L.source, L.target].find((X) => O(X) || N(X)), z = D === L.source ? L.target : L.source;
       if (!D || !z || z.type === "bpmn:Participant") continue;
       const j = z.x + z.width / 2;
-      I(D) && (j < D.x || j > D.x + D.width) || T.add(L.id);
+      N(D) && (j < D.x || j > D.x + D.width) || T.add(L.id);
     }
     return T;
   }, tS = (x) => {
     var S;
     const _ = /* @__PURE__ */ new Map();
     for (const O of x) {
-      const I = r.get(O);
-      if (!I || (I.waypoints ?? []).length === 2) continue;
-      const T = ((S = I.source) == null ? void 0 : S.type) === "bpmn:Participant" ? I.source : I.target, B = T === I.source ? I.target : I.source;
+      const N = r.get(O);
+      if (!N || (N.waypoints ?? []).length === 2) continue;
+      const T = ((S = N.source) == null ? void 0 : S.type) === "bpmn:Participant" ? N.source : N.target, B = T === N.source ? N.target : N.source;
       if (B.x + B.width / 2 <= T.x + T.width) continue;
       const L = _.get(T.id) ?? { pool: T, msgs: [] };
-      L.msgs.push({ conn: I, other: B }), _.set(T.id, L);
+      L.msgs.push({ conn: N, other: B }), _.set(T.id, L);
     }
-    for (const { pool: O, msgs: I } of _.values()) {
-      const T = Math.max(...I.map(({ other: ae }) => ae.x + ae.width / 2)) + Wp;
+    for (const { pool: O, msgs: N } of _.values()) {
+      const T = Math.max(...N.map(({ other: ae }) => ae.x + ae.width / 2)) + Wp;
       if (r.getAll().some((ae) => {
         if (ae.type !== "bpmn:Participant" || ae.id === O.id) return !1;
         const oe = ae;
@@ -9946,18 +9951,18 @@ function qA(e, t) {
         return oe ? [{ label: oe, x: oe.x, y: oe.y }] : [];
       }), X = $o();
       na(O, T - O.x);
-      const ne = I.filter(({ conn: ae, other: oe }) => Bg(ae, O, oe)).length, ce = $o();
+      const ne = N.filter(({ conn: ae, other: oe }) => Bg(ae, O, oe)).length, ce = $o();
       if (!(ne > 0 && ce.messages > X.messages && ce.lines >= X.lines)) {
         na(O, L.width);
         for (const { c: ae, wps: oe } of z) {
-          const me = ae.waypoints ?? [];
-          me.length === oe.length && me.every((te, Z) => Math.abs(te.x - oe[Z].x) <= 0.5 && Math.abs(te.y - oe[Z].y) <= 0.5) || n.updateWaypoints(ae, oe.map((te) => ({ x: te.x, y: te.y })));
+          const ye = ae.waypoints ?? [];
+          ye.length === oe.length && ye.every((te, Z) => Math.abs(te.x - oe[Z].x) <= 0.5 && Math.abs(te.y - oe[Z].y) <= 0.5) || n.updateWaypoints(ae, oe.map((te) => ({ x: te.x, y: te.y })));
         }
         for (let ae = 0; ae < 3; ae++) {
           let oe = 0;
-          for (const me of j) {
-            const he = me.x - me.label.x, te = me.y - me.label.y;
-            Math.abs(he) <= 0.5 && Math.abs(te) <= 0.5 || (n.moveElements([me.label], { x: he, y: te }), oe++);
+          for (const ye of j) {
+            const ge = ye.x - ye.label.x, te = ye.y - ye.label.y;
+            Math.abs(ge) <= 0.5 && Math.abs(te) <= 0.5 || (n.moveElements([ye.label], { x: ge, y: te }), oe++);
           }
           if (!oe) break;
         }
@@ -10001,8 +10006,8 @@ function qA(e, t) {
     const _ = (x.children ?? []).filter(bi);
     let S = 0;
     for (let O = 0; O < _.length; O++)
-      for (let I = O + 1; I < _.length; I++) {
-        const T = _[O], B = _[I];
+      for (let N = O + 1; N < _.length; N++) {
+        const T = _[O], B = _[N];
         T.x < B.x + B.width && T.x + T.width > B.x && T.y < B.y + B.height && T.y + T.height > B.y && S++;
       }
     return S;
@@ -10016,9 +10021,9 @@ function qA(e, t) {
     const _ = /* @__PURE__ */ new Map();
     for (const O of r.getAll()) {
       if (O.type !== "bpmn:MessageFlow") continue;
-      const I = O;
-      if (!I.waypoints || I.waypoints.length !== 2) continue;
-      const T = I.source, B = I.target;
+      const N = O;
+      if (!N.waypoints || N.waypoints.length !== 2) continue;
+      const T = N.source, B = N.target;
       if (!T || !B) continue;
       const L = x.has(T.id);
       if (L === x.has(B.id)) continue;
@@ -10028,9 +10033,9 @@ function qA(e, t) {
       j ? D.x < j.minX && (j.minX = D.x) : _.set(z.id, { pool: z, minX: D.x });
     }
     const S = [];
-    for (const { pool: O, minX: I } of _.values()) {
+    for (const { pool: O, minX: N } of _.values()) {
       const T = (O.children ?? []).filter(
-        (B) => bi(B) && !x.has(B.id) && B.x >= I
+        (B) => bi(B) && !x.has(B.id) && B.x >= N
       );
       T.length && S.push({ subtree: T, pool: O });
     }
@@ -10038,16 +10043,16 @@ function qA(e, t) {
   }, iS = (x, _, S) => {
     const O = new Map(
       _.map((B) => [B.pool.id, { subtree: [...B.subtree], pool: B.pool }])
-    ), I = new Set(x);
-    for (const B of _) for (const L of B.subtree) I.add(L.id);
+    ), N = new Set(x);
+    for (const B of _) for (const L of B.subtree) N.add(L.id);
     let T = !1;
     for (; ; ) {
       let B = 0;
-      for (const L of zg(I)) {
+      for (const L of zg(N)) {
         if (L.pool === S) continue;
         const D = O.get(L.pool.id);
         D ? D.subtree.push(...L.subtree) : O.set(L.pool.id, { subtree: [...L.subtree], pool: L.pool });
-        for (const z of L.subtree) I.add(z.id);
+        for (const z of L.subtree) N.add(z.id);
         B += L.subtree.length;
       }
       if (!B) break;
@@ -10056,9 +10061,9 @@ function qA(e, t) {
     return T ? [...O.values()] : null;
   }, oS = (x, _) => {
     const S = /* @__PURE__ */ new Map();
-    for (const I of r.getAll()) {
-      if (I.type !== "bpmn:DataInputAssociation" && I.type !== "bpmn:DataOutputAssociation") continue;
-      const T = I, B = T.waypoints;
+    for (const N of r.getAll()) {
+      if (N.type !== "bpmn:DataInputAssociation" && N.type !== "bpmn:DataOutputAssociation") continue;
+      const T = N, B = T.waypoints;
       if (!B || B.length < 2 || !B.every((ce) => Math.abs(ce.x - B[0].x) < 1)) continue;
       const L = T.source, D = T.target;
       if (!L || !D) continue;
@@ -10070,18 +10075,18 @@ function qA(e, t) {
       ne ? j.x < ne.minX && (ne.minX = j.x) : S.set(X.id, { pool: X, minX: j.x });
     }
     const O = [];
-    for (const { pool: I, minX: T } of S.values()) {
-      const B = (I.children ?? []).filter(
+    for (const { pool: N, minX: T } of S.values()) {
+      const B = (N.children ?? []).filter(
         (L) => bi(L) && !x.has(L.id) && L.x >= T
       );
-      B.length && O.push({ subtree: B, pool: I });
+      B.length && O.push({ subtree: B, pool: N });
     }
     return O;
   }, Gg = (x) => {
-    const _ = We(r), S = _.shapes.filter((I) => x.has(I.id)), O = /* @__PURE__ */ new Set();
-    for (const I of _.edges)
-      if (!(I.type !== "bpmn:SequenceFlow" && I.type !== "bpmn:MessageFlow"))
-        for (const T of Ht(I, S)) O.add(`${I.id}|${T.id}`);
+    const _ = We(r), S = _.shapes.filter((N) => x.has(N.id)), O = /* @__PURE__ */ new Set();
+    for (const N of _.edges)
+      if (!(N.type !== "bpmn:SequenceFlow" && N.type !== "bpmn:MessageFlow"))
+        for (const T of Ht(N, S)) O.add(`${N.id}|${T.id}`);
     return O;
   }, Ap = /* @__PURE__ */ new Map(), rS = Bt(e, "sequenceFlow.update").flatMap(
     (x) => {
@@ -10096,16 +10101,16 @@ function qA(e, t) {
     if (!_) continue;
     const S = f(x.target), O = f(x.id);
     if (!S || !O) continue;
-    const I = x.source !== void 0 ? f(x.source) : O.source, T = O.target;
-    if (!I || !T || T.id === S.id) continue;
-    const B = Dg.get(O.id) ?? { waypoints: O.waypoints, label: O.label }, L = B.waypoints && B.waypoints.length >= 3 && Math.abs(B.waypoints[0].x - B.waypoints[1].x) < 1 && Math.abs(B.waypoints[0].y - B.waypoints[1].y) > 1 ? { x: B.waypoints[0].x, y: B.waypoints[0].y } : void 0, D = L ? B.waypoints[1].y : void 0, z = L && B.label ? { x: B.label.x, y: B.label.y } : void 0, j = z && B.label && Math.abs(z.y + B.label.height / 2 - D) <= ge / 5 && z.x + B.label.width > L.x ? z.x + B.label.width + 6 : void 0, X = (I.outgoing ?? []).filter(
+    const N = x.source !== void 0 ? f(x.source) : O.source, T = O.target;
+    if (!N || !T || T.id === S.id) continue;
+    const B = Dg.get(O.id) ?? { waypoints: O.waypoints, label: O.label }, L = B.waypoints && B.waypoints.length >= 3 && Math.abs(B.waypoints[0].x - B.waypoints[1].x) < 1 && Math.abs(B.waypoints[0].y - B.waypoints[1].y) > 1 ? { x: B.waypoints[0].x, y: B.waypoints[0].y } : void 0, D = L ? B.waypoints[1].y : void 0, z = L && B.label ? { x: B.label.x, y: B.label.y } : void 0, j = z && B.label && Math.abs(z.y + B.label.height / 2 - D) <= me / 5 && z.x + B.label.width > L.x ? z.x + B.label.width + 6 : void 0, X = (N.outgoing ?? []).filter(
       (Oe) => Oe.type === "bpmn:SequenceFlow" && Oe.id !== O.id && Oe.target && !is.has(Oe.id)
     ), ne = new Set(X.map((Oe) => Oe.target.id)), ce = (Oe) => {
       const St = { type: "bpmn:Task", x: Oe.x + 2, y: Oe.y + 2, width: Oe.width - 4, height: Oe.height - 4 };
       return X.find(
         (ht) => (ht.waypoints ?? []).some((Wt, $e) => !!ht.waypoints[$e + 1] && la(Wt, ht.waypoints[$e + 1], St) === 0)
       );
-    }, ae = Bo(x.target), oe = new Set(ae.map((Oe) => Oe.id)), me = Et.has(x.target) ? { autoResize: !1 } : void 0, he = Math.min(...ae.map((Oe) => Oe.x)), te = Math.max(...ae.map((Oe) => Oe.x + Oe.width)), Z = I.x + I.width, re = T.x + T.width <= I.x, J = (() => {
+    }, ae = Bo(x.target), oe = new Set(ae.map((Oe) => Oe.id)), ye = Et.has(x.target) ? { autoResize: !1 } : void 0, ge = Math.min(...ae.map((Oe) => Oe.x)), te = Math.max(...ae.map((Oe) => Oe.x + Oe.width)), Z = N.x + N.width, re = T.x + T.width <= N.x, J = (() => {
       if (!re) return;
       const Oe = g(S), St = ((Oe == null ? void 0 : Oe.children) ?? []).filter(
         (He) => bi(He) && !oe.has(He.id) && He.type !== "bpmn:Group" && He.type !== "bpmn:Participant"
@@ -10123,19 +10128,19 @@ function qA(e, t) {
             if (la(Vn.waypoints[qi], Vn.waypoints[qi + 1], bt) < vi) return !1;
           return !0;
         });
-      }), Ue = I.x + I.width / 2, dt = I.y + I.height / 2, tt = B.waypoints ?? [], Ct = tt.length >= 2 && Math.abs(tt[0].y - tt[1].y) < 1 && tt[1].x < tt[0].x;
+      }), Ue = N.x + N.width / 2, dt = N.y + N.height / 2, tt = B.waypoints ?? [], Ct = tt.length >= 2 && Math.abs(tt[0].y - tt[1].y) < 1 && tt[1].x < tt[0].x;
       return [
         ...D !== void 0 ? [{ cx: Ue, cy: D }] : [],
-        ...Ct ? [{ cx: I.x - No - S.width / 2, cy: tt[0].y }] : [],
-        { cx: Ue, cy: dt + ge },
-        { cx: Ue, cy: dt - ge }
+        ...Ct ? [{ cx: N.x - No - S.width / 2, cy: tt[0].y }] : [],
+        { cx: Ue, cy: dt + me },
+        { cx: Ue, cy: dt - me }
       ].find((He) => $e(He.cx - (S.x + S.width / 2), He.cy - (S.y + S.height / 2)));
-    })(), ye = re && !J ? Z : T.x, Ne = (() => {
+    })(), fe = re && !J ? Z : T.x, Ne = (() => {
       var dt;
       if (L || re) return 0;
       const Oe = B.label, St = ((dt = O.businessObject) == null ? void 0 : dt.name) ?? "";
       if (!Oe || Oe.width == null || !St.trim()) return 0;
-      const ht = Z + No, Wt = I.y + I.height / 2 - S.height / 2;
+      const ht = Z + No, Wt = N.y + N.height / 2 - S.height / 2;
       if (Math.min(Oe.y + Oe.height, Wt + S.height) - Math.max(Oe.y, Wt) < 3 || Oe.x + Oe.width - ht < 3) return 0;
       const Ue = Oe.x + Oe.width + Z1 - ht;
       return Ue <= S.width ? Ue : 0;
@@ -10143,25 +10148,25 @@ function qA(e, t) {
     Ne > 0 && u.add(O.id);
     const ke = S.y + S.height / 2, qe = J1(
       ae,
-      Z + No + Ne - he,
-      [0, I.y + I.height / 2 - ke, T.y + T.height / 2 - ke],
-      ye,
+      Z + No + Ne - ge,
+      [0, N.y + N.height / 2 - ke, T.y + T.height / 2 - ke],
+      fe,
       Z,
-      I.y + I.height / 2
+      N.y + N.height / 2
     ), Ce = Z + No + Ne + qe, Me = (() => {
       if (j === void 0) return 0;
-      const Oe = Z + No, St = I.y + I.height / 2 - S.height / 2, ht = { x: Oe, y: St, width: te - he, height: S.height }, Wt = g(I);
+      const Oe = Z + No, St = N.y + N.height / 2 - S.height / 2, ht = { x: Oe, y: St, width: te - ge, height: S.height }, Wt = g(N);
       return ((Wt == null ? void 0 : Wt.children) ?? []).some(
-        (Ue) => bi(Ue) && !oe.has(Ue.id) && Ue.id !== I.id && Ue.id !== T.id && Ue.type !== "bpmn:Group" && Ue.type !== "bpmn:Participant" && Ue.x < ht.x + ht.width && Ue.x + Ue.width > ht.x && Ue.y < ht.y + ht.height && Ue.y + Ue.height > ht.y
+        (Ue) => bi(Ue) && !oe.has(Ue.id) && Ue.id !== N.id && Ue.id !== T.id && Ue.type !== "bpmn:Group" && Ue.type !== "bpmn:Participant" && Ue.x < ht.x + ht.width && Ue.x + Ue.width > ht.x && Ue.y < ht.y + ht.height && Ue.y + Ue.height > ht.y
       ) || ce(ht) ? Math.max(0, j - Oe) : 0;
-    })(), Se = J ? 0 : te - he + No * 2 + qe + Me + Ne - (re ? 0 : T.x - Z);
+    })(), Se = J ? 0 : te - ge + No * 2 + qe + Me + Ne - (re ? 0 : T.x - Z);
     let Ae = [];
     if (Se > 0) {
       const Oe = g(S), St = (Oe == null ? void 0 : Oe.children) ?? [], ht = (tt) => tt.type === "bpmn:Lane";
       Ae = (() => {
         const tt = /* @__PURE__ */ new Set();
         for (const ze of St)
-          bi(ze) && !oe.has(ze.id) && ze.id !== I.id && ze.x >= ye && tt.add(ze.id);
+          bi(ze) && !oe.has(ze.id) && ze.id !== N.id && ze.x >= fe && tt.add(ze.id);
         const Ct = [];
         for (const ze of St) {
           if (ze.type !== "bpmn:DataStoreReference" && ze.type !== "bpmn:DataObjectReference") continue;
@@ -10171,7 +10176,7 @@ function qA(e, t) {
         return Ct;
       })();
       const $e = St.filter(
-        (tt) => !("waypoints" in tt && tt.waypoints) && !ht(tt) && tt.type !== "label" && !oe.has(tt.id) && tt.id !== I.id && tt.x >= ye
+        (tt) => !("waypoints" in tt && tt.waypoints) && !ht(tt) && tt.type !== "label" && !oe.has(tt.id) && tt.id !== N.id && tt.x >= fe
       ), Ue = $e.flatMap((tt) => tt.labels ?? []), dt = Oe ? [Oe, ...St.filter((tt) => ht(tt))] : [];
       if ($e.length) {
         const tt = new Set($e.map((it) => it.id)), Ct = zg(tt), ze = Ct.length ? iS(tt, Ct, Oe) : null, He = (it) => {
@@ -10193,7 +10198,7 @@ function qA(e, t) {
           const wt = it.labelTarget;
           return it.type === "label" && !!wt && "waypoints" in wt && !!wt.source && !!wt.target && Fi.has(wt.source.id) && Fi.has(wt.target.id);
         }), bn = eS();
-        n.createSpace([...$e, ...Ue, ...yt], dt, { x: Se, y: 0 }, "e", ye - 1);
+        n.createSpace([...$e, ...Ue, ...yt], dt, { x: Se, y: 0 }, "e", fe - 1);
         const Ut = (it, wt, Lt) => {
           const mo = $o(), Bc = Lt ? Gg(Lt) : null, $c = ia(it, Se, !!Lt);
           if (!$c) return !1;
@@ -10247,12 +10252,12 @@ function qA(e, t) {
       if (!ue) return !0;
       const St = Oe.y + Oe.height / 2;
       return St >= ue.y && St <= ue.y + ue.height;
-    }, Pe = !Re(I) && Re(T), Be = (Oe) => Oe.y + Oe.height / 2, xt = () => {
-      const Oe = I.x + I.width, St = T.x, ht = Be(T) - S.height / 2, Wt = Be(T) + S.height / 2;
+    }, Pe = !Re(N) && Re(T), Be = (Oe) => Oe.y + Oe.height / 2, xt = () => {
+      const Oe = N.x + N.width, St = T.x, ht = Be(T) - S.height / 2, Wt = Be(T) + S.height / 2;
       return !r.getAll().some(
-        ($e) => bi($e) && $e.type !== "bpmn:Participant" && $e.type !== "bpmn:Group" && $e.type !== "bpmn:TextAnnotation" && $e.id !== I.id && $e.id !== T.id && $e.id !== S.id && $e.x < St && $e.x + $e.width > Oe && $e.y < Wt && $e.y + $e.height > ht
+        ($e) => bi($e) && $e.type !== "bpmn:Participant" && $e.type !== "bpmn:Group" && $e.type !== "bpmn:TextAnnotation" && $e.id !== N.id && $e.id !== T.id && $e.id !== S.id && $e.x < St && $e.x + $e.width > Oe && $e.y < Wt && $e.y + $e.height > ht
       );
-    }, tn = !Pe && _.band !== void 0 && Re(T) && !fn(_.node.lane, _.node.participant, _.band, Be(I)) && fn(_.node.lane, _.node.participant, _.band, Be(T)) && T.x >= I.x + I.width && xt(), Gt = Pe || tn ? T : I, Vt = Gt.y + Gt.height / 2, Cn = Vt - (S.y + S.height / 2), dn = _.band !== void 0, Nc = dn ? [S] : ae, Np = (
+    }, tn = !Pe && _.band !== void 0 && Re(T) && !fn(_.node.lane, _.node.participant, _.band, Be(N)) && fn(_.node.lane, _.node.participant, _.band, Be(T)) && T.x >= N.x + N.width && xt(), Gt = Pe || tn ? T : N, Vt = Gt.y + Gt.height / 2, Cn = Vt - (S.y + S.height / 2), dn = _.band !== void 0, Nc = dn ? [S] : ae, Np = (
       // ── B-89. 삽입도 같은 축이다 — band 가 **상류 행의 슬롯**을 가리키면 승계한다 ──
       // 🔁 「add/update 경로 갈림」의 동형이라 `freeSpot` 과 **같은 술어**를 쓴다(한쪽만 넓히면 구멍).
       (_.band === void 0 || fn(_.node.lane, _.node.participant, _.band, Vt)) && ei(x.target) && Nc.every(
@@ -10261,15 +10266,15 @@ function qA(e, t) {
           return Pc((St = P.get(Oe.id)) == null ? void 0 : St.node.lane, Oe, Oe.y + Oe.height / 2 + Cn);
         }
       )
-    ), PS = (Oe) => Math.abs(Oe.y + Oe.height / 2 - (S.y + S.height / 2)) <= ge / 2;
+    ), PS = (Oe) => Math.abs(Oe.y + Oe.height / 2 - (S.y + S.height / 2)) <= me / 2;
     if (Np && dn) {
-      const Oe = Math.abs(Cn) <= ge / 2 ? ae.filter(($e) => $e.id !== S.id && PS($e)) : [], St = S.y + S.height / 2, Wt = _.band !== void 0 && !fn(_.node.lane, _.node.participant, _.band, St) ? ae.filter(
+      const Oe = Math.abs(Cn) <= me / 2 ? ae.filter(($e) => $e.id !== S.id && PS($e)) : [], St = S.y + S.height / 2, Wt = _.band !== void 0 && !fn(_.node.lane, _.node.participant, _.band, St) ? ae.filter(
         ($e) => {
           var Ue, dt;
-          return $e.id !== S.id && !Oe.includes($e) && ((Ue = P.get($e.id)) == null ? void 0 : Ue.band) === _.band && ((dt = P.get($e.id)) == null ? void 0 : dt.node.lane) === _.node.lane && (Math.abs($e.y + $e.height / 2 - St) <= ge / 2 || fn(_.node.lane, _.node.participant, _.band, $e.y + $e.height / 2));
+          return $e.id !== S.id && !Oe.includes($e) && ((Ue = P.get($e.id)) == null ? void 0 : Ue.band) === _.band && ((dt = P.get($e.id)) == null ? void 0 : dt.node.lane) === _.node.lane && (Math.abs($e.y + $e.height / 2 - St) <= me / 2 || fn(_.node.lane, _.node.participant, _.band, $e.y + $e.height / 2));
         }
       ).map(($e) => ({ t: $e, dy: Vt - ($e.y + $e.height / 2) })).filter(({ dy: $e }) => $e !== 0) : [];
-      if (n.moveElements(ae, { x: Ce - he, y: 0 }, void 0, me), n.moveElements([S], { x: 0, y: Cn }, void 0, me), Oe.length) {
+      if (n.moveElements(ae, { x: Ce - ge, y: 0 }, void 0, ye), n.moveElements([S], { x: 0, y: Cn }, void 0, ye), Oe.length) {
         const $e = () => new Set(pt(We(r)).map((He) => ft(He))), Ue = $e(), dt = r.filter((He) => He.type === "label").map((He) => ({
           label: He,
           x: He.x,
@@ -10294,23 +10299,23 @@ function qA(e, t) {
       n.moveElements(
         ae,
         {
-          x: Ce - he,
+          x: Ce - ge,
           y: Np ? Cn : 0
         },
         void 0,
-        me
+        ye
       );
     const $i = g(S);
     if (!Np && _.node.lane === void 0 && _.band !== void 0 && $i) {
-      const Oe = $i.y + U + Nt(`pool:${_.node.participant ?? ""}`, _.band) * ge, St = Oe - (S.y + S.height / 2);
-      St !== 0 && !C($i, S, S.x + S.width / 2, Oe, oe) && n.moveElements([S], { x: 0, y: St }, void 0, me);
+      const Oe = $i.y + U + Nt(`pool:${_.node.participant ?? ""}`, _.band) * me, St = Oe - (S.y + S.height / 2);
+      St !== 0 && !C($i, S, S.x + S.width / 2, Oe, oe) && n.moveElements([S], { x: 0, y: St }, void 0, ye);
     }
     if (J)
       n.moveElements(
         ae,
         { x: J.cx - (S.x + S.width / 2), y: J.cy - (S.y + S.height / 2) },
         void 0,
-        me
+        ye
       );
     else if ($i) {
       const Oe = ($i.children ?? []).filter(
@@ -10359,10 +10364,10 @@ function qA(e, t) {
             x: it.x,
             y: it.y
           }));
-          n.moveElements(ae, { x: Fi.dx, y: Fi.dy }, void 0, me);
+          n.moveElements(ae, { x: Fi.dx, y: Fi.dy }, void 0, ye);
           const Ar = bn(), Yi = [...Ar].filter((it) => !Ut.has(it)).length, ca = [...Ut].filter((it) => !Ar.has(it)).length;
           if (Yi > ca) {
-            n.moveElements(ae, { x: -Fi.dx, y: -Fi.dy }, void 0, me);
+            n.moveElements(ae, { x: -Fi.dx, y: -Fi.dy }, void 0, ye);
             for (const it of ti) {
               const wt = it.x - it.label.x, Lt = it.y - it.label.y;
               (wt !== 0 || Lt !== 0) && n.moveElements([it.label], { x: wt, y: Lt });
@@ -10420,16 +10425,16 @@ function qA(e, t) {
   for (const [x, _] of Et) {
     const S = f(x);
     if (!S) continue;
-    const O = _.container, I = Math.abs(S.y + S.height / 2 - O.y - _.relCy) >= 0.5, T = S.label, B = Math.min(S.y, T && !T.hidden ? T.y : S.y), L = Math.max(S.y + S.height, T && !T.hidden ? T.y + T.height : 0);
-    if (I && B >= O.y && L <= O.y + O.height) continue;
+    const O = _.container, N = Math.abs(S.y + S.height / 2 - O.y - _.relCy) >= 0.5, T = S.label, B = Math.min(S.y, T && !T.hidden ? T.y : S.y), L = Math.max(S.y + S.height, T && !T.hidden ? T.y + T.height : 0);
+    if (N && B >= O.y && L <= O.y + O.height) continue;
     const D = S.y;
     _.grow(), S.y !== D && n.moveElements([S], { x: 0, y: D - S.y }, void 0, { autoResize: !1 });
   }
   const Vg = (x, _) => {
-    const S = _.target === x, O = d(_.source), I = d(_.target), T = S ? "bpmn:DataOutputAssociation" : "bpmn:DataInputAssociation";
+    const S = _.target === x, O = d(_.source), N = d(_.target), T = S ? "bpmn:DataOutputAssociation" : "bpmn:DataInputAssociation";
     n.connect(
       O,
-      I,
+      N,
       _.id ? { type: T, businessObject: i.create(T, { id: _.id }) } : { type: T }
     );
   }, Wg = (x) => {
@@ -10462,28 +10467,28 @@ function qA(e, t) {
             (z) => L ? z.y + z.height <= T.y + 5 : z.y >= T.y + T.height - 5
           );
           if (D.length) {
-            const z = [...D.reduce((re, J) => re.set(J.y, (re.get(J.y) ?? 0) + 1), /* @__PURE__ */ new Map())].sort((re, J) => J[1] - re[1] || (L ? J[0] - re[0] : re[0] - J[0]))[0][0], j = Math.min(S.width, zA), X = GA, ne = O.map((re) => re.x + re.width / 2), ce = Math.round(B(ne) - j / 2), ae = Math.max(...ne) + Wp, oe = (re) => ({ x: re, width: Math.max(j, ae - re) }), me = D.filter((re) => Math.min(re.y + re.height, z + X) - Math.max(re.y, z) > 0), he = (re) => {
+            const z = [...D.reduce((re, J) => re.set(J.y, (re.get(J.y) ?? 0) + 1), /* @__PURE__ */ new Map())].sort((re, J) => J[1] - re[1] || (L ? J[0] - re[0] : re[0] - J[0]))[0][0], j = Math.min(S.width, zA), X = GA, ne = O.map((re) => re.x + re.width / 2), ce = Math.round(B(ne) - j / 2), ae = Math.max(...ne) + Wp, oe = (re) => ({ x: re, width: Math.max(j, ae - re) }), ye = D.filter((re) => Math.min(re.y + re.height, z + X) - Math.max(re.y, z) > 0), ge = (re) => {
               const J = oe(re);
-              return me.some((ye) => ye.x < J.x + J.width && J.x < ye.x + ye.width);
+              return ye.some((fe) => fe.x < J.x + J.width && J.x < fe.x + fe.width);
             }, te = (re) => {
               const J = oe(re);
-              return ne.filter((ye) => ye >= J.x + 10 && ye <= J.x + J.width - 10).length;
+              return ne.filter((fe) => fe >= J.x + 10 && fe <= J.x + J.width - 10).length;
             }, Z = (() => {
-              if (!he(ce)) return ce;
+              if (!ge(ce)) return ce;
               const re = te(ce);
-              return me.flatMap((J) => [J.x + J.width + hy, J.x - hy - j]).map((J) => Math.round(J)).filter((J) => !he(J) && te(J) >= re).sort((J, ye) => Math.abs(J - ce) - Math.abs(ye - ce))[0] ?? ce;
+              return ye.flatMap((J) => [J.x + J.width + hy, J.x - hy - j]).map((J) => Math.round(J)).filter((J) => !ge(J) && te(J) >= re).sort((J, fe) => Math.abs(J - ce) - Math.abs(fe - ce))[0] ?? ce;
             })();
             if (Z !== S.x || z !== S.y || j !== S.width || X !== S.height) {
-              const re = () => new Set(pt(We(r)).map((Ce) => ft(Ce))), J = re(), ye = { x: S.x, y: S.y, width: S.width, height: S.height };
+              const re = () => new Set(pt(We(r)).map((Ce) => ft(Ce))), J = re(), fe = { x: S.x, y: S.y, width: S.width, height: S.height };
               n.resizeShape(S, { x: Z, y: z, width: j, height: X });
               const Ne = re(), ke = [...Ne].filter((Ce) => !J.has(Ce)).length, qe = [...J].filter((Ce) => !Ne.has(Ce)).length;
-              ke > qe && n.resizeShape(S, ye);
+              ke > qe && n.resizeShape(S, fe);
             }
           }
         }
       }
-      const I = Math.max(...O.map((T) => T.x + T.width / 2)) + Wp;
-      if (I > S.x + S.width && n.resizeShape(S, { x: S.x, y: S.y, width: I - S.x, height: S.height }), !!x)
+      const N = Math.max(...O.map((T) => T.x + T.width / 2)) + Wp;
+      if (N > S.x + S.width && n.resizeShape(S, { x: S.x, y: S.y, width: N - S.x, height: S.height }), !!x)
         for (const T of v) {
           const B = f(T.flow.id), L = T.flow.source === _.participant.id ? T.flow.target : T.flow.target === _.participant.id ? T.flow.source : void 0, D = L ? f(L) : void 0;
           if (!B || !D || D.type === "bpmn:Participant") continue;
@@ -10505,9 +10510,9 @@ function qA(e, t) {
       [...F.map((D) => D.flow.id), ...v.map((D) => D.flow.id)].filter(
         (D) => !!D
       )
-    ), O = r.filter((D) => !!D.waypoints), I = (D, z) => Math.abs(z.x - D.x) < 2 ? "L" : Math.abs(z.x - (D.x + D.width)) < 2 ? "R" : Math.abs(z.y - D.y) < 2 ? "T" : Math.abs(z.y - (D.y + D.height)) < 2 ? "B" : void 0, T = /* @__PURE__ */ new Map(), B = (D, z, j) => {
+    ), O = r.filter((D) => !!D.waypoints), N = (D, z) => Math.abs(z.x - D.x) < 2 ? "L" : Math.abs(z.x - (D.x + D.width)) < 2 ? "R" : Math.abs(z.y - D.y) < 2 ? "T" : Math.abs(z.y - (D.y + D.height)) < 2 ? "B" : void 0, T = /* @__PURE__ */ new Map(), B = (D, z, j) => {
       if (!D || !z || typeof D.x != "number") return;
-      const X = I(D, z);
+      const X = N(D, z);
       if (!X) return;
       let ne = T.get(D.id);
       ne || T.set(D.id, ne = /* @__PURE__ */ new Map()), ne.set(X, [...ne.get(X) ?? [], j]);
@@ -10531,16 +10536,16 @@ function qA(e, t) {
       const ce = g(j);
       if (!ce || L.has(ce.id) || (ce.children ?? []).some((te) => te.type === "bpmn:Lane")) continue;
       const ae = (gm = z.get("T")) != null && gm.length ? (mm = z.get("B")) != null && mm.length ? void 0 : "B" : "T";
-      if (!ae || (ae === "T" ? j.y - ce.y : ce.y + ce.height - (j.y + j.height)) >= ge) continue;
-      const me = (ce.children ?? []).filter(
+      if (!ae || (ae === "T" ? j.y - ce.y : ce.y + ce.height - (j.y + j.height)) >= me) continue;
+      const ye = (ce.children ?? []).filter(
         (te) => !("waypoints" in te && te.waypoints) && te.type !== "label" && typeof te.x == "number"
-      ), he = ce.y + ce.height;
+      ), ge = ce.y + ce.height;
       n.resizeShape(ce, {
         x: ce.x,
         y: ce.y,
         width: ce.width,
-        height: ce.height + ge
-      }), Xn(he, ce.id, ge), ae === "T" && me.length && n.moveElements(me, { x: 0, y: ge }), L.add(ce.id);
+        height: ce.height + me
+      }), Xn(ge, ce.id, me), ae === "T" && ye.length && n.moveElements(ye, { x: 0, y: me }), L.add(ce.id);
     }
   }
   const Pp = 20, Ug = 4, aS = 3, sS = 2, cS = 2, lS = [10, 30, 80], Er = () => {
@@ -10563,8 +10568,8 @@ function qA(e, t) {
     return S ? Ht(S, Un(_)).length : 0;
   }, os = (x) => Fo(x) > 0, oa = (x) => We(r).edges.filter(
     (_) => _.type === "bpmn:MessageFlow" && _.id !== x && _.waypoints.length === 2
-  ).length, qg = (x, _, S) => ia([{ subtree: x, pool: _ }], S), Yg = (x, _) => _.bad > x.bad || _.crossings > x.crossings && _.straight <= x.straight && _.bad >= x.bad, ra = (x, _) => Yg(x, _) || _.straight < x.straight, jo = (x, _, S = () => !0, O = Yg, I = !1) => {
-    const T = Er(), B = ia(x, _, I);
+  ).length, qg = (x, _, S) => ia([{ subtree: x, pool: _ }], S), Yg = (x, _) => _.bad > x.bad || _.crossings > x.crossings && _.straight <= x.straight && _.bad >= x.bad, ra = (x, _) => Yg(x, _) || _.straight < x.straight, jo = (x, _, S = () => !0, O = Yg, N = !1) => {
+    const T = Er(), B = ia(x, _, N);
     if (!B) return !1;
     const L = Er();
     return O(T, L) || !S() ? (B(), !1) : !0;
@@ -10579,27 +10584,27 @@ function qA(e, t) {
   }
   const rs = [...aa.keys()], Tp = new Set(F.map((x) => x.flow.target)), Kg = (x) => Tc.findIndex(({ op: _ }) => _.participant.id === x);
   rs.sort((x, _) => {
-    var I, T;
+    var N, T;
     const S = Tp.has(x) ? 1 : 0, O = Tp.has(_) ? 1 : 0;
-    return S !== O ? S - O : Kg((I = P.get(x)) == null ? void 0 : I.node.participant) - Kg((T = P.get(_)) == null ? void 0 : T.node.participant);
+    return S !== O ? S - O : Kg((N = P.get(x)) == null ? void 0 : N.node.participant) - Kg((T = P.get(_)) == null ? void 0 : T.node.participant);
   });
   const Ho = (x) => x.x + x.width / 2, pS = (x) => {
     const _ = /* @__PURE__ */ new Map();
-    for (const I of r.getAll()) {
-      const T = I;
+    for (const N of r.getAll()) {
+      const T = N;
       if (!T.waypoints || !T.source || !T.target) continue;
       (_.get(T.source.id) ?? _.set(T.source.id, []).get(T.source.id)).push(T.target.id);
     }
     const S = /* @__PURE__ */ new Set([x]), O = [x];
-    for (let I = 0; I < O.length; I++)
-      for (const T of _.get(O[I]) ?? [])
+    for (let N = 0; N < O.length; N++)
+      for (const T of _.get(O[N]) ?? [])
         S.has(T) || (S.add(T), O.push(T));
     return S;
   }, fS = (x, _) => {
     const S = pS(_);
     let O;
-    for (const I of r.getAll()) {
-      const T = I;
+    for (const N of r.getAll()) {
+      const T = N;
       if (T.type !== "bpmn:MessageFlow" || !T.source || !T.target || T.target.id !== x || S.has(T.source.id)) continue;
       const B = T.source;
       if (typeof B.x != "number" || B.type === "bpmn:Participant") continue;
@@ -10624,7 +10629,7 @@ function qA(e, t) {
   }, hS = (x) => {
     const _ = dS(x);
     return _ !== void 0 && Math.abs(_) < Pp;
-  }, Dc = (x, _, S, O, I) => {
+  }, Dc = (x, _, S, O, N) => {
     var T;
     for (let B = !0; B; ) {
       B = !1;
@@ -10633,31 +10638,31 @@ function qA(e, t) {
         const D = _.has(L.flow.source), z = _.has(L.flow.target);
         if (D === z || O(D ? L.flow.source : L.flow.target)) continue;
         const j = D ? L.flow.target : L.flow.source;
-        if (I(j) || !Sr(j)) continue;
+        if (N(j) || !Sr(j)) continue;
         const X = f(L.flow.id);
         if (!(X != null && X.waypoints) || X.waypoints.length !== 2) continue;
         const ne = f(j), ce = (T = P.get(j)) == null ? void 0 : T.node.participant;
         if (!ne || !ce) continue;
         const ae = Bo(j, (oe) => oe.x >= ne.x).filter((oe) => !_.has(oe.id));
-        if (!(!ae.length || ae.some((oe) => I(oe.id)))) {
+        if (!(!ae.length || ae.some((oe) => N(oe.id)))) {
           for (const oe of ae) _.add(oe.id);
           x.set(ce, [...x.get(ce) ?? [], ...ae]), B = !0;
         }
       }
     }
     return [...x].map(([B, L]) => ({ subtree: L, pool: d(B) }));
-  }, Zg = (x, _, S, O, I) => Dc(
+  }, Zg = (x, _, S, O, N) => Dc(
     /* @__PURE__ */ new Map([[_, [...x]]]),
     new Set(x.map((T) => T.id)),
     O,
     (T) => T === S,
-    (T) => T === I
+    (T) => T === N
   ), Op = (x) => {
     const _ = Xg(x);
     if (!_) return null;
-    const S = f(x), O = f(_.flow.source), I = kp(_, x);
-    if (!S || !O || I === void 0) return null;
-    const T = I - Ho(S);
+    const S = f(x), O = f(_.flow.source), N = kp(_, x);
+    if (!S || !O || N === void 0) return null;
+    const T = N - Ho(S);
     if (T >= Pp) {
       const B = P.get(x).node.participant, L = Bo(x, (D) => D.x >= S.x);
       return { groups: Zg(L, B, x, _.flow.id, _.flow.source), dx: T };
@@ -10672,18 +10677,18 @@ function qA(e, t) {
   ).map((x) => x.id);
   for (let x = 0; x < 3; x++) {
     const _ = Er(), S = [];
-    for (const I of Jg()) {
-      const T = Op(I);
+    for (const N of Jg()) {
+      const T = Op(N);
       if (!T) continue;
       const B = ia(T.groups, T.dx);
       B && S.push(B);
     }
     if (!S.length) break;
     if (!ra(_, Er())) continue;
-    for (const I of S.reverse()) I();
+    for (const N of S.reverse()) N();
     let O = !1;
-    for (const I of Jg()) {
-      const T = Op(I);
+    for (const N of Jg()) {
+      const T = Op(N);
       T && jo(T.groups, T.dx, () => !0, ra) && (O = !0);
     }
     if (!O) break;
@@ -10694,16 +10699,16 @@ function qA(e, t) {
     if (!_ || _.node.lane !== void 0) continue;
     const S = Te(_);
     if (S === void 0) continue;
-    const O = f(x), I = O ? g(O) : void 0;
-    if (!O || !I) continue;
-    const T = I.y + U + Nt(`pool:${_.node.participant ?? ""}`, S) * ge, B = T - (O.y + O.height / 2);
-    B !== 0 && !C(I, O, O.x + O.width / 2, T) && n.moveElements([O], { x: 0, y: B });
+    const O = f(x), N = O ? g(O) : void 0;
+    if (!O || !N) continue;
+    const T = N.y + U + Nt(`pool:${_.node.participant ?? ""}`, S) * me, B = T - (O.y + O.height / 2);
+    B !== 0 && !C(N, O, O.x + O.width / 2, T) && n.moveElements([O], { x: 0, y: B });
   }
   const Lc = () => {
     const x = r.filter((O) => O.type === "bpmn:Participant"), _ = new Map(x.map((O) => [O.id, O]));
     let S = 0;
-    for (const { pools: [O, I] } of Tw(x)) {
-      const T = _.get(O), B = _.get(I);
+    for (const { pools: [O, N] } of Tw(x)) {
+      const T = _.get(O), B = _.get(N);
       S += (Math.min(T.x + T.width, B.x + B.width) - Math.max(T.x, B.x)) * (Math.min(T.y + T.height, B.y + B.height) - Math.max(T.y, B.y));
     }
     return S;
@@ -10714,10 +10719,10 @@ function qA(e, t) {
       if (Dp.has(S.flow.id) || !os(S.flow.id)) continue;
       const O = f(S.flow.target);
       if (!O) continue;
-      const I = d(P.get(S.flow.target).node.participant), T = Bo(S.flow.target, (j) => j.x >= O.x), B = O.width + _e, L = Fo(S.flow.id), D = oa(S.flow.id), z = Lc();
+      const N = d(P.get(S.flow.target).node.participant), T = Bo(S.flow.target, (j) => j.x >= O.x), B = O.width + _e, L = Fo(S.flow.id), D = oa(S.flow.id), z = Lc();
       for (let j = 1; j <= Ug; j++) {
         const X = () => Fo(S.flow.id) >= L || Lc() > z ? !1 : oa(S.flow.id) >= D ? !0 : (Qg.add(S.flow.id), !1);
-        if (uS(T, I, B * j, X)) {
+        if (uS(T, N, B * j, X)) {
           Dp.add(S.flow.id), _ = !0;
           break;
         }
@@ -10732,11 +10737,11 @@ function qA(e, t) {
     if (Dp.has(x.flow.id) || !Qg.has(x.flow.id) || !os(x.flow.id)) continue;
     const _ = f(x.flow.target);
     if (!_) continue;
-    const S = d(P.get(x.flow.target).node.participant), O = Bo(x.flow.target, (ne) => ne.x >= _.x), I = new Set(O.map((ne) => ne.id)), T = /* @__PURE__ */ new Map();
+    const S = d(P.get(x.flow.target).node.participant), O = Bo(x.flow.target, (ne) => ne.x >= _.x), N = new Set(O.map((ne) => ne.id)), T = /* @__PURE__ */ new Map();
     for (const ne of r.filter((ce) => ce.type === "bpmn:MessageFlow")) {
       if (((ym = ne.waypoints) == null ? void 0 : ym.length) !== 2 || !ne.source || !ne.target) continue;
-      const ce = I.has(ne.source.id);
-      if (ce === I.has(ne.target.id)) continue;
+      const ce = N.has(ne.source.id);
+      if (ce === N.has(ne.target.id)) continue;
       const ae = ce ? ne.target : ne.source, oe = (vm = P.get(ae.id)) == null ? void 0 : vm.node.participant;
       !oe || T.has(ae.id) || T.set(ae.id, { subtree: [ae], pool: d(oe) });
     }
@@ -10752,16 +10757,16 @@ function qA(e, t) {
     if (!os(x.id)) continue;
     const _ = f(x.source), S = f(x.target);
     if (!_ || !S) continue;
-    let O, I, T;
+    let O, N, T;
     if (x.preexisting) {
       const [L, D] = _.type === "bpmn:Participant" ? [S, _] : [_, S];
       if (O = Ho(L), O < D.x || O > D.x + D.width) continue;
-      [I, T] = L.y < D.y ? [L.y + L.height, D.y] : [D.y + D.height, L.y];
+      [N, T] = L.y < D.y ? [L.y + L.height, D.y] : [D.y + D.height, L.y];
     } else {
       if (_.type === "bpmn:Participant" || S.type === "bpmn:Participant" || (O = _.x + _.width / 2, Math.abs(O - (S.x + S.width / 2)) > 15)) continue;
-      [I, T] = _.y < S.y ? [_.y + _.height, S.y] : [S.y + S.height, _.y];
+      [N, T] = _.y < S.y ? [_.y + _.height, S.y] : [S.y + S.height, _.y];
     }
-    const B = [...P.values()].map((L) => f(L.node.id)).filter((L) => !!L && L.id !== _.id && L.id !== S.id).filter((L) => L.x <= O && O <= L.x + L.width && L.y + L.height > I && L.y < T).sort((L, D) => L.x - D.x);
+    const B = [...P.values()].map((L) => f(L.node.id)).filter((L) => !!L && L.id !== _.id && L.id !== S.id).filter((L) => L.x <= O && O <= L.x + L.width && L.y + L.height > N && L.y < T).sort((L, D) => L.x - D.x);
     for (const L of B) {
       const D = (xm = P.get(L.id)) == null ? void 0 : xm.node.participant, z = D ? f(D) : void 0;
       if (!D || !z) continue;
@@ -10781,11 +10786,11 @@ function qA(e, t) {
           )
         );
       }
-      const ae = L.width + _e, oe = Fo(x.id), me = oa(x.id), he = () => Fo(x.id) < oe && oa(x.id) >= me;
+      const ae = L.width + _e, oe = Fo(x.id), ye = oa(x.id), ge = () => Fo(x.id) < oe && oa(x.id) >= ye;
       let te = !1;
       for (const Z of ce) {
         for (let re = 1; re <= Ug; re++)
-          if (jo(Z, ae * re, he)) {
+          if (jo(Z, ae * re, ge)) {
             te = !0;
             break;
           }
@@ -10804,10 +10809,10 @@ function qA(e, t) {
     var _, S;
     return Fo(x) === 0 && ((S = (_ = f(x)) == null ? void 0 : _.waypoints) == null ? void 0 : S.length) === 2;
   }, mS = (x, _, S) => {
-    const O = new Set(x.flatMap((T) => T.subtree.map((B) => B.id))), I = [...Ic()].filter((T) => !S.has(T)).map((T) => T.split(">")[1]);
-    return [...new Set(I)].filter((T) => O.has(T) && T !== _.source && T !== _.target);
-  }, yS = (x, _, S, O, I) => {
-    const T = x.map((z) => ({ ...z, subtree: z.subtree.filter((j) => !I.includes(j.id)) })).filter((z) => z.subtree.length), B = new Set(T.flatMap((z) => z.subtree.map((j) => j.id))), L = () => I.every((z) => {
+    const O = new Set(x.flatMap((T) => T.subtree.map((B) => B.id))), N = [...Ic()].filter((T) => !S.has(T)).map((T) => T.split(">")[1]);
+    return [...new Set(N)].filter((T) => O.has(T) && T !== _.source && T !== _.target);
+  }, yS = (x, _, S, O, N) => {
+    const T = x.map((z) => ({ ...z, subtree: z.subtree.filter((j) => !N.includes(j.id)) })).filter((z) => z.subtree.length), B = new Set(T.flatMap((z) => z.subtree.map((j) => j.id))), L = () => N.every((z) => {
       const j = f(z);
       return !!j && F.filter((X) => X.flow.target === z && B.has(X.flow.source)).every((X) => {
         const ne = f(X.flow.source);
@@ -10822,19 +10827,19 @@ function qA(e, t) {
     if (((bm = _ == null ? void 0 : _.waypoints) == null ? void 0 : bm.length) !== 2) continue;
     const S = f(x.flow.source), O = f(x.flow.target);
     if (!S || !O || S.type === "bpmn:Participant" || O.type === "bpmn:Participant" || !Sr(x.flow.source) || !Sr(x.flow.target) || Math.abs(Ho(S) - Ho(O)) > cS) continue;
-    const I = Ho(S), T = _.waypoints.map((oe) => oe.y), [B, L] = [Math.min(...T), Math.max(...T)], D = Un(We(r)).filter(
-      (oe) => oe.id !== S.id && oe.id !== O.id && oe.x < I && I < oe.x + oe.width && B < oe.y + oe.height && oe.y < L
+    const N = Ho(S), T = _.waypoints.map((oe) => oe.y), [B, L] = [Math.min(...T), Math.max(...T)], D = Un(We(r)).filter(
+      (oe) => oe.id !== S.id && oe.id !== O.id && oe.x < N && N < oe.x + oe.width && B < oe.y + oe.height && oe.y < L
     );
     if (!D.length) continue;
     const z = (wm = P.get(x.flow.source)) == null ? void 0 : wm.node.participant, j = (_m = P.get(x.flow.target)) == null ? void 0 : _m.node.participant;
     if (!z || !j) continue;
     const X = /* @__PURE__ */ new Map();
-    for (const [oe, me, he] of [
+    for (const [oe, ye, ge] of [
       [x.flow.source, S, z],
       [x.flow.target, O, j]
     ]) {
-      const te = X.get(he) ?? [], Z = Bo(oe, (re) => re.x >= me.x).filter((re) => !te.some((J) => J.id === re.id));
-      X.set(he, [...te, ...Z]);
+      const te = X.get(ge) ?? [], Z = Bo(oe, (re) => re.x >= ye.x).filter((re) => !te.some((J) => J.id === re.id));
+      X.set(ge, [...te, ...Z]);
     }
     const ne = new Set([...X.values()].flat().map((oe) => oe.id)), ce = Dc(
       X,
@@ -10844,13 +10849,13 @@ function qA(e, t) {
       () => !1
     ), ae = Math.max(...D.map((oe) => oe.x + oe.width));
     for (const oe of lS) {
-      const me = ae + oe - I;
-      if (me <= 0) continue;
-      const he = Er().bad, te = Ic();
+      const ye = ae + oe - N;
+      if (ye <= 0) continue;
+      const ge = Er().bad, te = Ic();
       let Z = [], re = !0;
-      const J = () => !nm(x.flow.id) || re && (Z = mS(ce, x.flow, te), Z.length) ? !1 : !gS(he, te);
-      if (jo(ce, me, J, ra)) break;
-      if (Z.length && (yS(ce, me, x.flow, te, Z) || (re = !1, jo(ce, me, J, ra))))
+      const J = () => !nm(x.flow.id) || re && (Z = mS(ce, x.flow, te), Z.length) ? !1 : !gS(ge, te);
+      if (jo(ce, ye, J, ra)) break;
+      if (Z.length && (yS(ce, ye, x.flow, te, Z) || (re = !1, jo(ce, ye, J, ra))))
         break;
     }
   }
@@ -10875,16 +10880,16 @@ function qA(e, t) {
           }
       }
       return D;
-    }, O = () => ({ ...Er(), grazes: S() }), I = [];
+    }, O = () => ({ ...Er(), grazes: S() }), N = [];
     for (const T of P.keys()) {
       if (!Sr(T)) continue;
       const B = F.filter((z) => z.flow.target === T);
       if (B.length !== 1) continue;
       const L = f(B[0].flow.source), D = f(T);
-      !L || !D || !P.has(L.id) || Math.abs(x(L) - x(D)) > 1 || D.x - (L.x + L.width) <= _e + 1 || I.push({ id: T, pred: L, node: D });
+      !L || !D || !P.has(L.id) || Math.abs(x(L) - x(D)) > 1 || D.x - (L.x + L.width) <= _e + 1 || N.push({ id: T, pred: L, node: D });
     }
-    I.sort((T, B) => T.node.x - B.node.x);
-    for (const { id: T } of I) {
+    N.sort((T, B) => T.node.x - B.node.x);
+    for (const { id: T } of N) {
       const B = P.get(T), L = f(T), D = f(F.find((Z) => Z.flow.target === T).flow.source);
       if (!L || !D) continue;
       const z = L.x - (D.x + D.width);
@@ -10895,21 +10900,21 @@ function qA(e, t) {
         "",
         () => !1,
         () => !1
-      ), oe = ae.some((Z) => Z.pool !== j) || ae.reduce((Z, re) => Z + re.subtree.length, 0) > X.length, me = O(), he = qg(X, j, ne);
-      if (!he) continue;
+      ), oe = ae.some((Z) => Z.pool !== j) || ae.reduce((Z, re) => Z + re.subtree.length, 0) > X.length, ye = O(), ge = qg(X, j, ne);
+      if (!ge) continue;
       const te = O();
-      if (oe && !ce(me, te)) {
-        he();
+      if (oe && !ce(ye, te)) {
+        ge();
         const Z = ia(ae, ne);
         if (Z) {
           const re = O();
-          if (!ce(me, re) && re.bad <= te.bad && re.crossings <= te.crossings) continue;
+          if (!ce(ye, re) && re.bad <= te.bad && re.crossings <= te.crossings) continue;
           Z();
         }
         qg(X, j, ne);
         continue;
       }
-      ce(me, te) && he();
+      ce(ye, te) && ge();
     }
   }
   Wg(!0);
@@ -10917,18 +10922,18 @@ function qA(e, t) {
     (x) => x.type === "bpmn:DataStoreReference" && h.has(x.id)
   ), _S = (x, _) => {
     const S = x.x + x.width / 2, O = x.y + x.height / 2;
-    let I;
+    let N;
     for (const T of wS) {
       if ((g(T) ?? p()) !== _ || T.y < x.y + x.height) continue;
       const B = Math.abs(T.x + T.width / 2 - S);
       B > xS || B < T.width || !bS(T).some(
         (D) => D.height === x.height && Math.abs(D.y + D.height / 2 - O) <= vS && T.y >= D.y + D.height
-      ) || (!I || B < I.dx || B === I.dx && T.id < I.id) && (I = { dx: B, id: T.id, cy: T.y + T.height / 2 });
+      ) || (!N || B < N.dx || B === N.dx && T.id < N.id) && (N = { dx: B, id: T.id, cy: T.y + T.height / 2 });
     }
-    return I == null ? void 0 : I.cy;
+    return N == null ? void 0 : N.cy;
   };
   for (const x of b) {
-    const _ = x.associations ?? [], S = _.map((T) => T.source === x.dataStore.id ? T.target : T.source).map(f).find(Boolean), O = S ? g(S) ?? p() : p(), I = S ? {
+    const _ = x.associations ?? [], S = _.map((T) => T.source === x.dataStore.id ? T.target : T.source).map(f).find(Boolean), O = S ? g(S) ?? p() : p(), N = S ? {
       x: S.x + S.width / 2,
       y: _S(S, O) ?? S.y + S.height + 110
     } : { x: 200, y: ts + 60 };
@@ -10940,7 +10945,7 @@ function qA(e, t) {
           name: x.dataStore.name
         })
       },
-      I,
+      N,
       O
     );
     for (const T of _) Vg(x.dataStore.id, T);
@@ -10965,17 +10970,17 @@ function qA(e, t) {
       Math.abs(x.x + x.width - ce) < z && (x.width = ce - z - x.x);
     }
     if (!S.length) return;
-    const O = Math.min(...S.map((D) => D.y)), I = Math.max(...S.map((D) => D.y + D.height)), T = O - x.y, B = x.y + x.height - I, L = om - Rr;
+    const O = Math.min(...S.map((D) => D.y)), N = Math.max(...S.map((D) => D.y + D.height)), T = O - x.y, B = x.y + x.height - N, L = om - Rr;
     if (T > 0 != B > 0)
       if (T > 0 && T < L) {
         const D = T + Rr;
         x.y += D, x.height -= D;
       } else B > 0 && B < L && (x.height -= B + Rr);
   }, SS = (x, _) => {
-    const S = Rr, O = 30, I = r.filter(
+    const S = Rr, O = 30, N = r.filter(
       (T) => T.type === "bpmn:Group" && T.id !== _
     );
-    for (const T of I) {
+    for (const T of N) {
       const B = T.x, L = T.x + T.width, D = T.y, z = T.y + T.height, j = x.y < z && D < x.y + x.height, X = x.x < L && B < x.x + x.width;
       if (j) {
         if (Math.abs(x.x - L) < S) {
@@ -10999,11 +11004,11 @@ function qA(e, t) {
       }
     }
   }, Ip = (x, _) => {
-    const S = om, O = Math.min(...x.map((D) => D.x)) - S, I = Math.min(...x.map((D) => D.y)) - S, T = Math.max(...x.map((D) => D.x + D.width)) + S, B = Math.max(...x.map((D) => D.y + D.height)) + S, L = { x: O, y: I, width: T - O, height: B - I };
+    const S = om, O = Math.min(...x.map((D) => D.x)) - S, N = Math.min(...x.map((D) => D.y)) - S, T = Math.max(...x.map((D) => D.x + D.width)) + S, B = Math.max(...x.map((D) => D.y + D.height)) + S, L = { x: O, y: N, width: T - O, height: B - N };
     return ES(L, x), SS(L, _), L;
   };
-  for (const x of N) {
-    const _ = (x.group.members ?? []).map(f).filter((I) => !!I);
+  for (const x of I) {
+    const _ = (x.group.members ?? []).map(f).filter((N) => !!N);
     let S;
     _.length ? S = Ip(_, x.group.id) : (S = { x: 300 + im * 350, y: 40, width: 300, height: 200 }, im++);
     const O = n.createShape(
@@ -11019,41 +11024,41 @@ function qA(e, t) {
     x.group.name && n.updateLabel(O, x.group.name), (Em = x.group.members) != null && Em.length && se(O, "bwl:Members", { refs: x.group.members.join(" ") });
   }
   {
-    const x = r.filter((I) => !!I.waypoints), _ = /* @__PURE__ */ new Map(), S = (I, T) => {
-      !I || !T || (_.has(I) || _.set(I, /* @__PURE__ */ new Set()), _.get(I).add(T));
+    const x = r.filter((N) => !!N.waypoints), _ = /* @__PURE__ */ new Map(), S = (N, T) => {
+      !N || !T || (_.has(N) || _.set(N, /* @__PURE__ */ new Set()), _.get(N).add(T));
     };
-    for (const I of x) {
-      const T = (Sm = I.source) == null ? void 0 : Sm.id, B = (Rm = I.target) == null ? void 0 : Rm.id;
-      S(T, B), ((Cm = I.type) != null && Cm.includes("DataOutputAssociation") || (Mm = I.type) != null && Mm.includes("DataInputAssociation") || I.type === "bpmn:Association") && S(B, T);
+    for (const N of x) {
+      const T = (Sm = N.source) == null ? void 0 : Sm.id, B = (Rm = N.target) == null ? void 0 : Rm.id;
+      S(T, B), ((Cm = N.type) != null && Cm.includes("DataOutputAssociation") || (Mm = N.type) != null && Mm.includes("DataInputAssociation") || N.type === "bpmn:Association") && S(B, T);
     }
-    const O = r.filter((I) => I.type === "bpmn:Group");
-    for (const I of O) {
-      const B = (((Am = I.businessObject.extensionElements) == null ? void 0 : Am.values) ?? []).find((he) => he.$type === "bwl:Members"), L = ((B == null ? void 0 : B.refs) ?? "").split(" ").filter(Boolean);
+    const O = r.filter((N) => N.type === "bpmn:Group");
+    for (const N of O) {
+      const B = (((Am = N.businessObject.extensionElements) == null ? void 0 : Am.values) ?? []).find((ge) => ge.$type === "bwl:Members"), L = ((B == null ? void 0 : B.refs) ?? "").split(" ").filter(Boolean);
       if (!L.length) continue;
       const D = new Set(L), z = [...L];
       for (; z.length; ) {
-        const he = z.shift();
-        for (const te of _.get(he) ?? []) D.has(te) || (D.add(te), z.push(te));
+        const ge = z.shift();
+        for (const te of _.get(ge) ?? []) D.has(te) || (D.add(te), z.push(te));
       }
-      const j = I.x, X = I.x + I.width, ne = I.y, ce = I.y + I.height, ae = (he) => F.filter((te) => te.flow.target === he).length, oe = (he) => {
+      const j = N.x, X = N.x + N.width, ne = N.y, ce = N.y + N.height, ae = (ge) => F.filter((te) => te.flow.target === ge).length, oe = (ge) => {
         var Z;
-        const te = ((Z = f(he)) == null ? void 0 : Z.type) ?? "";
-        if (te === "bpmn:StartEvent" && ae(he) === 0) return !1;
+        const te = ((Z = f(ge)) == null ? void 0 : Z.type) ?? "";
+        if (te === "bpmn:StartEvent" && ae(ge) === 0) return !1;
         if (te.endsWith("Gateway")) {
-          const re = F.filter((J) => J.flow.target === he).map((J) => J.flow.source);
+          const re = F.filter((J) => J.flow.target === ge).map((J) => J.flow.source);
           if (re.length && re.every((J) => {
-            var ye;
-            return ((ye = f(J)) == null ? void 0 : ye.type) === "bpmn:StartEvent" && ae(J) === 0;
+            var fe;
+            return ((fe = f(J)) == null ? void 0 : fe.type) === "bpmn:StartEvent" && ae(J) === 0;
           }))
             return !1;
         }
         return !0;
-      }, me = r.filter((he) => bi(he)).filter(
-        (he) => he.type !== "bpmn:Group" && he.type !== "bpmn:Participant" && he.type !== "bpmn:TextAnnotation" && !D.has(he.id) && Sr(he.id) && oe(he.id) && he.x < X && he.x + he.width > j && he.y < ce && he.y + he.height > ne
+      }, ye = r.filter((ge) => bi(ge)).filter(
+        (ge) => ge.type !== "bpmn:Group" && ge.type !== "bpmn:Participant" && ge.type !== "bpmn:TextAnnotation" && !D.has(ge.id) && Sr(ge.id) && oe(ge.id) && ge.x < X && ge.x + ge.width > j && ge.y < ce && ge.y + ge.height > ne
       );
-      if (me.length)
-        for (const he of [-1, 1]) {
-          const te = me.filter((Me) => (Me.x + Me.width - j <= X - Me.x ? -1 : 1) === he);
+      if (ye.length)
+        for (const ge of [-1, 1]) {
+          const te = ye.filter((Me) => (Me.x + Me.width - j <= X - Me.x ? -1 : 1) === ge);
           if (!te.length) continue;
           const Z = [];
           for (const Me of te) {
@@ -11062,28 +11067,28 @@ function qA(e, t) {
           }
           const re = /* @__PURE__ */ new Map();
           for (const Me of Z) {
-            let Se = he < 0 ? j - Rr : X + Rr;
-            for (const Ae of [...Me].sort((ue, Re) => he < 0 ? Re.x - ue.x : ue.x - Re.x)) {
-              const ue = he < 0 ? Math.min(Ae.x, Se - Ae.width) : Math.max(Ae.x, Se);
-              Se = he < 0 ? ue - xi : ue + Ae.width + xi, ue !== Ae.x && Math.sign(ue - Ae.x) === he && re.set(Ae.id, ue - Ae.x);
+            let Se = ge < 0 ? j - Rr : X + Rr;
+            for (const Ae of [...Me].sort((ue, Re) => ge < 0 ? Re.x - ue.x : ue.x - Re.x)) {
+              const ue = ge < 0 ? Math.min(Ae.x, Se - Ae.width) : Math.max(Ae.x, Se);
+              Se = ge < 0 ? ue - xi : ue + Ae.width + xi, ue !== Ae.x && Math.sign(ue - Ae.x) === ge && re.set(Ae.id, ue - Ae.x);
             }
           }
-          const J = /* @__PURE__ */ new Map(), ye = (Me) => J.get(Me) === Me || !J.get(Me) ? Me : ye(J.get(Me));
+          const J = /* @__PURE__ */ new Map(), fe = (Me) => J.get(Me) === Me || !J.get(Me) ? Me : fe(J.get(Me));
           for (const Me of te) J.set(Me.id, Me.id);
           for (const Me of v) {
             const Se = re.has(Me.flow.source) ? Me.flow.source : void 0, Ae = re.has(Me.flow.target) ? Me.flow.target : void 0;
             if (!Se || !Ae) continue;
             const ue = f(Me.flow.id);
-            ((Pm = ue == null ? void 0 : ue.waypoints) == null ? void 0 : Pm.length) === 2 && J.set(ye(Se), ye(Ae));
+            ((Pm = ue == null ? void 0 : ue.waypoints) == null ? void 0 : Pm.length) === 2 && J.set(fe(Se), fe(Ae));
           }
           const Ne = /* @__PURE__ */ new Map();
           for (const Me of te) {
             if (!re.has(Me.id)) continue;
-            const Se = ye(Me.id);
+            const Se = fe(Me.id);
             Ne.set(Se, [...Ne.get(Se) ?? [], Me]);
           }
           const ke = [...Ne.values()].sort(
-            (Me, Se) => he < 0 ? Math.min(...Me.map((Ae) => Ae.x)) - Math.min(...Se.map((Ae) => Ae.x)) : Math.max(...Se.map((Ae) => Ae.x)) - Math.max(...Me.map((Ae) => Ae.x))
+            (Me, Se) => ge < 0 ? Math.min(...Me.map((Ae) => Ae.x)) - Math.min(...Se.map((Ae) => Ae.x)) : Math.max(...Se.map((Ae) => Ae.x)) - Math.max(...Me.map((Ae) => Ae.x))
           ), qe = [];
           let Ce = !0;
           for (const Me of ke) {
@@ -11106,25 +11111,25 @@ function qA(e, t) {
   }
   {
     const x = /* @__PURE__ */ new Set([
-      ...N.map((_) => _.group.id),
+      ...I.map((_) => _.group.id),
       ...Bt(e, "group.update").map((_) => _.id)
     ]);
     for (const _ of r.filter((S) => S.type === "bpmn:Group")) {
       if (x.has(_.id)) continue;
-      const O = (((Tm = _.businessObject.extensionElements) == null ? void 0 : Tm.values) ?? []).find((L) => L.$type === "bwl:Members"), I = ((O == null ? void 0 : O.refs) ?? "").split(" ").filter(Boolean).map(f).filter((L) => !!L);
-      !I.length || !I.some((L) => {
+      const O = (((Tm = _.businessObject.extensionElements) == null ? void 0 : Tm.values) ?? []).find((L) => L.$type === "bwl:Members"), N = ((O == null ? void 0 : O.refs) ?? "").split(" ").filter(Boolean).map(f).filter((L) => !!L);
+      !N.length || !N.some((L) => {
         const D = h.get(L.id);
         return !D || D.x !== L.x || D.y !== L.y;
-      }) || !I.some((L) => L.x < _.x || L.y < _.y || L.x + L.width > _.x + _.width || L.y + L.height > _.y + _.height) || n.resizeShape(_, Ip(I, _.id));
+      }) || !N.some((L) => L.x < _.x || L.y < _.y || L.x + L.width > _.x + _.width || L.y + L.height > _.y + _.height) || n.resizeShape(_, Ip(N, _.id));
     }
   }
   {
-    const _ = new Map(Fr(We(r)).map((L) => [L.owner, L.rect])), S = r.filter((L) => !!L.waypoints), O = /* @__PURE__ */ new Map(), I = (L, D) => {
+    const _ = new Map(Fr(We(r)).map((L) => [L.owner, L.rect])), S = r.filter((L) => !!L.waypoints), O = /* @__PURE__ */ new Map(), N = (L, D) => {
       !L || !D || (O.has(L) || O.set(L, /* @__PURE__ */ new Set()), O.get(L).add(D));
     };
     for (const L of S) {
       const D = (km = L.source) == null ? void 0 : km.id, z = (Om = L.target) == null ? void 0 : Om.id;
-      I(D, z), ((Dm = L.type) != null && Dm.includes("DataOutputAssociation") || (Lm = L.type) != null && Lm.includes("DataInputAssociation") || L.type === "bpmn:Association") && I(z, D);
+      N(D, z), ((Dm = L.type) != null && Dm.includes("DataOutputAssociation") || (Lm = L.type) != null && Lm.includes("DataInputAssociation") || L.type === "bpmn:Association") && N(z, D);
     }
     const T = (L) => F.filter((D) => D.flow.target === L).length, B = (L) => {
       var z;
@@ -11144,7 +11149,7 @@ function qA(e, t) {
       const z = (((Im = L.businessObject.extensionElements) == null ? void 0 : Im.values) ?? []).find((ue) => ue.$type === "bwl:Members"), j = ((z == null ? void 0 : z.refs) ?? "").split(" ").filter(Boolean);
       if (!j.length) continue;
       const X = j.map(f).filter((ue) => !!ue);
-      if (!X.length || !(N.some((ue) => ue.group.id === L.id) || Bt(e, "group.update").some((ue) => ue.id === L.id) || X.some((ue) => {
+      if (!X.length || !(I.some((ue) => ue.group.id === L.id) || Bt(e, "group.update").some((ue) => ue.id === L.id) || X.some((ue) => {
         const Re = h.get(ue.id);
         return !Re || Re.x !== ue.x || Re.y !== ue.y;
       }))) continue;
@@ -11153,16 +11158,16 @@ function qA(e, t) {
         const ue = ae.shift();
         for (const Re of O.get(ue) ?? []) ce.has(Re) || (ce.add(Re), ae.push(Re));
       }
-      const oe = L.x, me = L.x + L.width, he = L.y, te = L.y + L.height, Z = (ue) => {
+      const oe = L.x, ye = L.x + L.width, ge = L.y, te = L.y + L.height, Z = (ue) => {
         const Re = _.get(ue.id), Pe = { x: ue.x, y: ue.y, width: ue.width, height: ue.height };
         return Re ? [Pe, { x: Re.x, y: Re.y, width: Re.width, height: Re.height }] : [Pe];
-      }, re = X.flatMap(Z), J = Math.min(...re.map((ue) => ue.x)), ye = Math.max(...re.map((ue) => ue.x + ue.width)), Ne = Math.min(...re.map((ue) => ue.y)), ke = Math.max(...re.map((ue) => ue.y + ue.height)), qe = { L: J - oe, R: me - ye, T: Ne - he, B: te - ke }, Ce = new Set(j), Me = (ue) => ue.x >= oe && ue.x + ue.width <= me && ue.y >= he && ue.y + ue.height <= te, Se = r.filter((ue) => bi(ue)).filter(
-        (ue) => ue.type !== "bpmn:Group" && ue.type !== "bpmn:Participant" && ue.type !== "bpmn:TextAnnotation" && !Ce.has(ue.id) && (!ce.has(ue.id) || !Me(ue)) && B(ue.id) && ue.x < me && ue.x + ue.width > oe && ue.y < te && ue.y + ue.height > he
+      }, re = X.flatMap(Z), J = Math.min(...re.map((ue) => ue.x)), fe = Math.max(...re.map((ue) => ue.x + ue.width)), Ne = Math.min(...re.map((ue) => ue.y)), ke = Math.max(...re.map((ue) => ue.y + ue.height)), qe = { L: J - oe, R: ye - fe, T: Ne - ge, B: te - ke }, Ce = new Set(j), Me = (ue) => ue.x >= oe && ue.x + ue.width <= ye && ue.y >= ge && ue.y + ue.height <= te, Se = r.filter((ue) => bi(ue)).filter(
+        (ue) => ue.type !== "bpmn:Group" && ue.type !== "bpmn:Participant" && ue.type !== "bpmn:TextAnnotation" && !Ce.has(ue.id) && (!ce.has(ue.id) || !Me(ue)) && B(ue.id) && ue.x < ye && ue.x + ue.width > oe && ue.y < te && ue.y + ue.height > ge
       );
       if (!Se.length) continue;
       const Ae = { L: 0, R: 0, T: 0, B: 0 };
       for (const ue of Se) {
-        const Re = Z(ue), Pe = Math.min(...Re.map((dn) => dn.x)), Be = Math.max(...Re.map((dn) => dn.x + dn.width)), xt = Math.min(...Re.map((dn) => dn.y)), tn = Math.max(...Re.map((dn) => dn.y + dn.height)), Gt = { L: Be - oe, R: me - Pe, T: tn - he, B: te - xt }, Vt = ["L", "R", "T", "B"].filter((dn) => Gt[dn] <= qe[dn] + 1e-3);
+        const Re = Z(ue), Pe = Math.min(...Re.map((dn) => dn.x)), Be = Math.max(...Re.map((dn) => dn.x + dn.width)), xt = Math.min(...Re.map((dn) => dn.y)), tn = Math.max(...Re.map((dn) => dn.y + dn.height)), Gt = { L: Be - oe, R: ye - Pe, T: tn - ge, B: te - xt }, Vt = ["L", "R", "T", "B"].filter((dn) => Gt[dn] <= qe[dn] + 1e-3);
         if (!Vt.length) continue;
         const Cn = Vt.reduce((dn, Nc) => Gt[Nc] < Gt[dn] ? Nc : dn, Vt[0]);
         Ae[Cn] = Math.max(Ae[Cn], Math.min(Gt[Cn] + 10, qe[Cn]));
@@ -11187,24 +11192,24 @@ function qA(e, t) {
   let as = 0;
   const am = 12, sm = 14, RS = 15, CS = 300, MS = (x) => {
     const _ = x.split(`
-`), S = Math.max(..._.map((T) => $s(T, am))), O = Math.max(100, Math.min(CS, Math.ceil(S) + sm)), I = _.reduce((T, B) => T + Math.max(1, Math.ceil(($s(B, am) + sm) / O)), 0);
-    return { width: O, height: Math.max(30, I * RS + 10) };
+`), S = Math.max(..._.map((T) => $s(T, am))), O = Math.max(100, Math.min(CS, Math.ceil(S) + sm)), N = _.reduce((T, B) => T + Math.max(1, Math.ceil(($s(B, am) + sm) / O)), 0);
+    return { width: O, height: Math.max(30, N * RS + 10) };
   };
   for (const x of A) {
-    const _ = x.association, S = ((Nm = x.placement) == null ? void 0 : Nm.anchor) ?? (_ ? _.source === x.annotation.id ? _.target : _.source : void 0), O = S ? f(S) : void 0, I = O ? rm(O) : void 0, T = MS(x.annotation.text ?? "");
+    const _ = x.association, S = ((Nm = x.placement) == null ? void 0 : Nm.anchor) ?? (_ ? _.source === x.annotation.id ? _.target : _.source : void 0), O = S ? f(S) : void 0, N = O ? rm(O) : void 0, T = MS(x.annotation.text ?? "");
     let B;
-    if (I && x.placement) {
+    if (N && x.placement) {
       const [j, X] = eu[x.placement.side], ne = x.placement.offset ?? 50;
       B = {
-        x: I.x + I.width / 2 + j * (I.width / 2 + T.width / 2 + ne),
-        y: I.y + I.height / 2 + X * (I.height / 2 + T.height / 2 + ne)
+        x: N.x + N.width / 2 + j * (N.width / 2 + T.width / 2 + ne),
+        y: N.y + N.height / 2 + X * (N.height / 2 + T.height / 2 + ne)
       };
-    } else I ? (B = {
-      x: I.x + I.width / 2 + 180 + as % 3 * 260,
-      y: I.y - 110 - as % 2 * 95
+    } else N ? (B = {
+      x: N.x + N.width / 2 + 180 + as % 3 * 260,
+      y: N.y - 110 - as % 2 * 95
     }, as++) : (B = { x: 300 + as * 260, y: 60 }, as++);
     const L = O ? g(O) ?? p() : p(), D = L;
-    I && typeof D.x == "number" && typeof D.width == "number" && D.type === "bpmn:Participant" && (B = nu(r, I, T, D, x.placement ? { placement: x.placement } : { from: B }));
+    N && typeof D.x == "number" && typeof D.width == "number" && D.type === "bpmn:Participant" && (B = nu(r, N, T, D, x.placement ? { placement: x.placement } : { from: B }));
     const z = n.createShape(
       {
         type: "bpmn:TextAnnotation",
@@ -11243,16 +11248,16 @@ function qA(e, t) {
     );
   }
   const AS = (x, _, S, O) => {
-    const I = x.parent;
-    if (!I) return O;
+    const N = x.parent;
+    if (!N) return O;
     const T = x.x + x.width / 2, B = /* @__PURE__ */ new Set([x.id]);
-    if (!C(I, x, T, O, B)) return O;
+    if (!C(N, x, T, O, B)) return O;
     const L = _ ? _.y + Math.min(_.height / 2, le) : S ? S.y + U : void 0;
     if (L === void 0) return O;
-    const D = Math.floor((O - L) / ge + 1e-6);
+    const D = Math.floor((O - L) / me + 1e-6);
     for (let z = 1; z <= 3; z++) {
-      const j = D + z, X = L + j * ge, ne = kg(_ == null ? void 0 : _.id, j);
-      if (!C(I, x, T, X, ne ? /* @__PURE__ */ new Set([...B, ...ne]) : B))
+      const j = D + z, X = L + j * me, ne = kg(_ == null ? void 0 : _.id, j);
+      if (!C(N, x, T, X, ne ? /* @__PURE__ */ new Set([...B, ...ne]) : B))
         return go(_ == null ? void 0 : _.id, j, S), X;
     }
     return O;
@@ -11260,7 +11265,7 @@ function qA(e, t) {
   for (const x of Bt(e, "node.update")) {
     let _ = d(x.id);
     if (x.type && qc(x.type) !== _.type) {
-      const S = _.x + _.width / 2, O = _.y + _.height / 2, I = cm();
+      const S = _.x + _.width / 2, O = _.y + _.height / 2, N = cm();
       _ = c.replaceElement(
         _,
         {
@@ -11268,7 +11273,7 @@ function qA(e, t) {
           ...x.eventDefinition ? { eventDefinitionType: Cf[x.eventDefinition] } : {}
         }
       );
-      const T = cm(), B = [...I].filter((z) => z !== x.id && !T.has(z));
+      const T = cm(), B = [...N].filter((z) => z !== x.id && !T.has(z));
       if (B.length)
         throw new Nw({
           kind: "type-change-drops-elements",
@@ -11285,13 +11290,13 @@ function qA(e, t) {
     }
     if (x.name !== void 0 && n.updateProperties(_, { name: x.name ?? void 0 }), x.lane || x.band !== void 0) {
       x.band !== void 0 && n.updateProperties(_, { "bwl:band": x.band });
-      const S = _.y + _.height / 2, O = g(_), I = x.lane ? d(x.lane) : ((O == null ? void 0 : O.children) ?? []).find(
+      const S = _.y + _.height / 2, O = g(_), N = x.lane ? d(x.lane) : ((O == null ? void 0 : O.children) ?? []).find(
         (B) => B.type === "bpmn:Lane" && S >= B.y && S <= B.y + B.height
       );
-      x.band !== void 0 && go(I == null ? void 0 : I.id, x.band, O);
-      const T = I ? I.y + (x.band === void 0 ? I.height / 2 : Math.min(I.height / 2, le) + Nt(I.id, x.band) * ge) : x.band !== void 0 && O ? O.y + U + Nt(`pool:${O.id}`, x.band) * ge : void 0;
+      x.band !== void 0 && go(N == null ? void 0 : N.id, x.band, O);
+      const T = N ? N.y + (x.band === void 0 ? N.height / 2 : Math.min(N.height / 2, le) + Nt(N.id, x.band) * me) : x.band !== void 0 && O ? O.y + U + Nt(`pool:${O.id}`, x.band) * me : void 0;
       if (T !== void 0) {
-        const B = AS(_, I, O, T), L = B === T ? T - S : B - (_.y + _.height / 2);
+        const B = AS(_, N, O, T), L = B === T ? T - S : B - (_.y + _.height / 2);
         L !== 0 && n.moveElements([_], { x: 0, y: L });
       }
     }
@@ -11299,20 +11304,20 @@ function qA(e, t) {
   for (const x of Bt(e, "sequenceFlow.update")) {
     const _ = d(x.id), S = k.get(x.id);
     if (S) {
-      const O = (z) => ({ x: z.x + z.width / 2, y: z.y + z.height / 2 }), I = d(S.flow.source), T = d(S.flow.target), B = n.connect(I, T, { type: "bpmn:SequenceFlow", businessObject: kc(S.flow) }), L = Ap.get(x.id), D = T.y + T.height / 2;
-      L && T.x > L.exit.x && Math.abs(D - L.exit.y) > 1 ? n.updateWaypoints(B, [L.exit, { x: L.exit.x, y: D }, { x: T.x, y: D }]) : (n.reconnect(B, I, T, [O(I), O(T)]), Math.abs(D - (I.y + I.height / 2)) > 1 && Oc(B));
+      const O = (z) => ({ x: z.x + z.width / 2, y: z.y + z.height / 2 }), N = d(S.flow.source), T = d(S.flow.target), B = n.connect(N, T, { type: "bpmn:SequenceFlow", businessObject: kc(S.flow) }), L = Ap.get(x.id), D = T.y + T.height / 2;
+      L && T.x > L.exit.x && Math.abs(D - L.exit.y) > 1 ? n.updateWaypoints(B, [L.exit, { x: L.exit.x, y: D }, { x: T.x, y: D }]) : (n.reconnect(B, N, T, [O(N), O(T)]), Math.abs(D - (N.y + N.height / 2)) > 1 && Oc(B));
     } else if ((x.source !== void 0 || x.target !== void 0) && !Lg.has(x.id)) {
-      const O = _, I = x.source !== void 0 ? d(x.source) : O.source, T = x.target !== void 0 ? d(x.target) : O.target, B = (z) => ({ x: z.x + z.width / 2, y: z.y + z.height / 2 });
-      n.reconnect(O, I, T, [B(I), B(T)]);
+      const O = _, N = x.source !== void 0 ? d(x.source) : O.source, T = x.target !== void 0 ? d(x.target) : O.target, B = (z) => ({ x: z.x + z.width / 2, y: z.y + z.height / 2 });
+      n.reconnect(O, N, T, [B(N), B(T)]);
       const L = Ap.get(O.id), D = T.y + T.height / 2;
       if (L && T.x > L.exit.x && Math.abs(D - L.exit.y) > 1) {
         n.updateWaypoints(O, [L.exit, { x: L.exit.x, y: D }, { x: T.x, y: D }]);
         const z = O.label;
         if (z && L.label) {
-          const X = Math.abs(L.label.y + z.height / 2 - L.channelY) <= ge / 5 && L.label.x + z.width > L.exit.x, ne = L.exit.x + 6, ce = T.x - 6 - z.width, ae = X ? ce >= ne ? { x: Math.max(ne, Math.min(L.label.x, ce)), y: L.label.y + (D - L.channelY) } : void 0 : L.label;
+          const X = Math.abs(L.label.y + z.height / 2 - L.channelY) <= me / 5 && L.label.x + z.width > L.exit.x, ne = L.exit.x + 6, ce = T.x - 6 - z.width, ae = X ? ce >= ne ? { x: Math.max(ne, Math.min(L.label.x, ce)), y: L.label.y + (D - L.channelY) } : void 0 : L.label;
           ae && (ae.x !== z.x || ae.y !== z.y) && n.moveElements([z], { x: ae.x - z.x, y: ae.y - z.y });
         }
-      } else Math.abs(D - (I.y + I.height / 2)) > 1 && Oc(O);
+      } else Math.abs(D - (N.y + N.height / 2)) > 1 && Oc(O);
     }
     x.name !== void 0 && n.updateProperties(_, { name: x.name ?? void 0 }), x.condition !== void 0 && n.updateProperties(_, { name: ((Bm = x.condition) == null ? void 0 : Bm.label) ?? void 0 });
   }
@@ -11325,10 +11330,10 @@ function qA(e, t) {
     if (x.text !== void 0 && n.updateProperties(_, { text: x.text }), x.placement === null)
       se(_, "bwl:Placement", null);
     else if (x.placement) {
-      const S = d(x.placement.anchor), O = rm(S), I = g(S) ?? p(), T = typeof I.x == "number" && typeof I.width == "number" && I.type === "bpmn:Participant", [B, L] = eu[x.placement.side], D = x.placement.offset ?? 50, z = {
+      const S = d(x.placement.anchor), O = rm(S), N = g(S) ?? p(), T = typeof N.x == "number" && typeof N.width == "number" && N.type === "bpmn:Participant", [B, L] = eu[x.placement.side], D = x.placement.offset ?? 50, z = {
         x: O.x + O.width / 2 + B * (O.width / 2 + _.width / 2 + D),
         y: O.y + O.height / 2 + L * (O.height / 2 + _.height / 2 + D)
-      }, j = T ? nu(r, O, { width: _.width, height: _.height }, I, { placement: x.placement, selfId: x.id }) : z;
+      }, j = T ? nu(r, O, { width: _.width, height: _.height }, N, { placement: x.placement, selfId: x.id }) : z;
       n.moveElements([_], { x: j.x - (_.x + _.width / 2), y: j.y - (_.y + _.height / 2) }), se(_, "bwl:Placement", ie(x.placement));
     }
   }
@@ -11392,11 +11397,11 @@ function KA(e, t, n) {
         g = g.parent;
       }
       if (!h) {
-        const ve = d.x + d.width / 2, fe = d.y + d.height / 2;
-        h = i.getAll().find((ge) => {
-          if (ge.type !== "bpmn:Participant") return !1;
-          const _e = ge;
-          return typeof _e.x == "number" && typeof _e.width == "number" && ve >= _e.x && ve <= _e.x + _e.width && fe >= _e.y && fe <= _e.y + _e.height;
+        const ve = d.x + d.width / 2, de = d.y + d.height / 2;
+        h = i.getAll().find((me) => {
+          if (me.type !== "bpmn:Participant") return !1;
+          const _e = me;
+          return typeof _e.x == "number" && typeof _e.width == "number" && ve >= _e.x && ve <= _e.x + _e.width && de >= _e.y && de <= _e.y + _e.height;
         });
       }
       if (!h || typeof h.x != "number" || typeof h.width != "number") continue;
@@ -11404,31 +11409,31 @@ function KA(e, t, n) {
         (ve) => ve.type === "bpmn:Association"
       ), v = (w != null && w.anchor ? i.get(w.anchor) : void 0) ?? (y ? ((p = y.source) == null ? void 0 : p.id) === f ? y.target : y.source : void 0);
       if (!v) continue;
-      const b = v.waypoints, E = b != null && b.length ? { x: b[Math.floor((b.length - 1) / 2)].x, y: b[Math.floor((b.length - 1) / 2)].y, width: 0, height: 0 } : { x: v.x, y: v.y, width: v.width, height: v.height }, A = { width: d.width, height: d.height }, N = { x: d.x + d.width / 2, y: d.y + d.height / 2 }, P = w == null ? void 0 : w.side, k = Lw(i, E, h), H = [];
-      if (P && P in eu && H.push(nu(i, E, A, h, { placement: { side: P, offset: (w == null ? void 0 : w.offset) ?? null }, selfId: f })), k && !tu(N, A, k))
+      const b = v.waypoints, E = b != null && b.length ? { x: b[Math.floor((b.length - 1) / 2)].x, y: b[Math.floor((b.length - 1) / 2)].y, width: 0, height: 0 } : { x: v.x, y: v.y, width: v.width, height: v.height }, A = { width: d.width, height: d.height }, I = { x: d.x + d.width / 2, y: d.y + d.height / 2 }, P = w == null ? void 0 : w.side, k = Lw(i, E, h), H = [];
+      if (P && P in eu && H.push(nu(i, E, A, h, { placement: { side: P, offset: (w == null ? void 0 : w.offset) ?? null }, selfId: f })), k && !tu(I, A, k))
         for (const ve of WA)
           H.push(nu(i, E, A, h, { placement: { side: ve, offset: null }, selfId: f }));
-      for (const [ve, fe] of [[-1, 0], [1, 0], [0, -1], [0, 1]])
-        for (let ge = 1; ge <= VA; ge++)
-          H.push({ x: N.x + ve * gy * ge, y: N.y + fe * gy * ge });
+      for (const [ve, de] of [[-1, 0], [1, 0], [0, -1], [0, 1]])
+        for (let me = 1; me <= VA; me++)
+          H.push({ x: I.x + ve * gy * me, y: I.y + de * gy * me });
       const F = { ...s, edges: s.edges.filter((ve) => ve.id !== (y == null ? void 0 : y.id)) }, G = r(F), ee = G.filter((ve) => Up(ve).includes(f)).length;
       if (!ee) continue;
       let se, ie = !1;
       for (const ve of H) {
-        const fe = ve.x - N.x, ge = ve.y - N.y;
-        if (!fe && !ge || ve.x - A.width / 2 < h.x || ve.x + A.width / 2 > h.x + h.width || ve.y - A.height / 2 < h.y || ve.y + A.height / 2 > h.y + h.height || k && !tu(ve, A, k)) continue;
+        const de = ve.x - I.x, me = ve.y - I.y;
+        if (!de && !me || ve.x - A.width / 2 < h.x || ve.x + A.width / 2 > h.x + h.width || ve.y - A.height / 2 < h.y || ve.y + A.height / 2 > h.y + h.height || k && !tu(ve, A, k)) continue;
         const _e = {
           ...F,
-          shapes: F.shapes.map((Q) => Q.id === f ? { ...Q, x: Q.x + fe, y: Q.y + ge } : Q)
+          shapes: F.shapes.map((Q) => Q.id === f ? { ...Q, x: Q.x + de, y: Q.y + me } : Q)
         }, U = r(_e), le = U.filter((Q) => Up(Q).includes(f)).length;
         if (le >= ee || U.length > G.length) continue;
-        const K = Math.abs(fe) + Math.abs(ge);
-        if (ie || ((!se || le < se.mine || le === se.mine && (U.length < se.all || U.length === se.all && K < se.dist)) && (se = { x: ve.x, y: ve.y, mine: le, all: U.length, dist: K }), se.mine === 0 && se.all < G.length && (ie = !0)), le === 0 && U.length < G.length && YA(e, d, fe, ge) === 0) {
+        const K = Math.abs(de) + Math.abs(me);
+        if (ie || ((!se || le < se.mine || le === se.mine && (U.length < se.all || U.length === se.all && K < se.dist)) && (se = { x: ve.x, y: ve.y, mine: le, all: U.length, dist: K }), se.mine === 0 && se.all < G.length && (ie = !0)), le === 0 && U.length < G.length && YA(e, d, de, me) === 0) {
           se = { x: ve.x, y: ve.y, mine: le, all: U.length, dist: K };
           break;
         }
       }
-      se && o.moveElements([d], { x: se.x - N.x, y: se.y - N.y });
+      se && o.moveElements([d], { x: se.x - I.x, y: se.y - I.y });
     }
 }
 const XA = 60;
@@ -11447,21 +11452,21 @@ function ZA(e, t, n) {
     if (!s.get(w)) return [w];
     const v = /* @__PURE__ */ new Set(), b = /* @__PURE__ */ new Set([w]);
     for (let A = 0; A < 4; A++) {
-      let N = !1;
+      let I = !1;
       for (const P of n.shapes)
         P.type !== "bpmn:Group" || v.has(P.id) || [...b].some((k) => {
           const H = s.get(k);
           return H && c(P, H);
-        }) && (v.add(P.id), N = !0);
+        }) && (v.add(P.id), I = !0);
       for (const P of n.shapes)
         P.type !== "bpmn:Participant" || b.has(P.id) || [...v].some((k) => {
           const H = s.get(k);
           return H && c(H, P);
-        }) && (b.add(P.id), N = !0);
-      if (!N) break;
+        }) && (b.add(P.id), I = !0);
+      if (!I) break;
     }
-    const E = n.shapes.filter((A) => !A.parent && !b.has(A.id) && !v.has(A.id) && A.type !== "bpmn:Group" && A.type !== "bpmn:Participant").filter((A) => [...v].some((N) => {
-      const P = s.get(N);
+    const E = n.shapes.filter((A) => !A.parent && !b.has(A.id) && !v.has(A.id) && A.type !== "bpmn:Group" && A.type !== "bpmn:Participant").filter((A) => [...v].some((I) => {
+      const P = s.get(I);
       return P && c(P, A);
     })).map((A) => A.id);
     return [...b, ...v, ...E];
@@ -11480,7 +11485,7 @@ function ZA(e, t, n) {
       if (!G || !ee) continue;
       const [se, ie] = G.x <= ee.x ? [G, ee] : [ee, G];
       if (k.contained) continue;
-      const ve = s.get(se.id), fe = s.get(ie.id), ge = ve && fe ? Math.max(fe.x - (ve.x + ve.width), 0) : XA, _e = se.x + se.width + ge - ie.x;
+      const ve = s.get(se.id), de = s.get(ie.id), me = ve && de ? Math.max(de.x - (ve.x + ve.width), 0) : XA, _e = se.x + se.width + me - ie.x;
       if (_e <= 0) continue;
       const U = l(ie.id).filter((le) => i.get(le));
       U.length && (!E || _e > E.dx) && (E = { movers: U, dx: _e });
@@ -11489,8 +11494,8 @@ function ZA(e, t, n) {
     const A = E.movers.map((k) => i.get(k)).filter((k) => !!k && typeof k.x == "number");
     if (!A.length) break;
     o.moveElements(A, { x: E.dx, y: 0 }), d.push({ els: A, dx: E.dx });
-    const N = r(We(i)), P = a(N).length;
-    P < p && N.length <= f && (P < h || P === h && N.length < m || g === 0) && (g = d.length, h = P, m = N.length);
+    const I = r(We(i)), P = a(I).length;
+    P < p && I.length <= f && (P < h || P === h && I.length < m || g === 0) && (g = d.length, h = P, m = I.length);
   }
   for (const { els: w, dx: y } of d.slice(g).reverse()) o.moveElements(w, { x: -y, y: 0 });
 }
@@ -11618,8 +11623,8 @@ function nP(e, t, n, i) {
     if (!(!m || Math.abs(m.x - h.x) >= 0.5 || Math.abs(m.y - h.y) >= 0.5 || Math.abs(m.width - h.width) >= 0.5 || Math.abs(m.height - h.height) >= 0.5)) continue;
     const y = h.members.map((Fe) => o.get(Fe)).filter((Fe) => !!Fe && typeof Fe.x == "number");
     if (!y.length) continue;
-    const v = Math.min(...y.map((Fe) => Fe.x)), b = Math.min(...y.map((Fe) => Fe.y)), E = Math.max(...y.map((Fe) => Fe.x + Fe.width)), A = Math.max(...y.map((Fe) => Fe.y + Fe.height)), N = h.x, P = h.y, k = h.x + h.width, H = h.y + h.height;
-    let F = N, G = P, ee = k, se = H;
+    const v = Math.min(...y.map((Fe) => Fe.x)), b = Math.min(...y.map((Fe) => Fe.y)), E = Math.max(...y.map((Fe) => Fe.x + Fe.width)), A = Math.max(...y.map((Fe) => Fe.y + Fe.height)), I = h.x, P = h.y, k = h.x + h.width, H = h.y + h.height;
+    let F = I, G = P, ee = k, se = H;
     for (const Fe of g) {
       const $ = s.edges.find((R) => R.id === Fe.edge);
       if (!$) continue;
@@ -11627,17 +11632,17 @@ function nP(e, t, n, i) {
         const W = s.shapes.find((Te) => Te.id === R);
         if (!W || W.container) return !1;
         const q = W.x + W.width / 2, pe = W.y + W.height / 2;
-        return N < q && q < k && P < pe && pe < H;
+        return I < q && q < k && P < pe && pe < H;
       });
       for (const R of xn($)) {
-        const W = R.axis === "v" ? [P, H] : [N, k];
-        Math.min(R.hi, W[1]) - Math.max(R.lo, W[0]) < _w || (R.axis === "v" ? N < R.at && R.at < k : P < R.at && R.at < H) && C || (R.axis === "v" ? (Math.abs(R.at - N) <= Cs && (F = Math.max(F, R.at + Yc)), Math.abs(R.at - k) <= Cs && (ee = Math.min(ee, R.at - Yc))) : (Math.abs(R.at - P) <= Cs && (G = Math.max(G, R.at + Yc)), Math.abs(R.at - H) <= Cs && (se = Math.min(se, R.at - Yc))));
+        const W = R.axis === "v" ? [P, H] : [I, k];
+        Math.min(R.hi, W[1]) - Math.max(R.lo, W[0]) < _w || (R.axis === "v" ? I < R.at && R.at < k : P < R.at && R.at < H) && C || (R.axis === "v" ? (Math.abs(R.at - I) <= Cs && (F = Math.max(F, R.at + Yc)), Math.abs(R.at - k) <= Cs && (ee = Math.min(ee, R.at - Yc))) : (Math.abs(R.at - P) <= Cs && (G = Math.max(G, R.at + Yc)), Math.abs(R.at - H) <= Cs && (se = Math.min(se, R.at - Yc))));
       }
     }
-    if (F > v - Kc && (F = N), G > b - Kc && (G = P), ee < E + Kc && (ee = k), se < A + Kc && (se = H), F === N && G === P && ee === k && se === H) continue;
-    const ie = o.get(d), ve = { x: ie.x, y: ie.y, width: ie.width, height: ie.height }, fe = We(o), ge = new Set(pt(fe).map(ft)), _e = a(fe);
+    if (F > v - Kc && (F = I), G > b - Kc && (G = P), ee < E + Kc && (ee = k), se < A + Kc && (se = H), F === I && G === P && ee === k && se === H) continue;
+    const ie = o.get(d), ve = { x: ie.x, y: ie.y, width: ie.width, height: ie.height }, de = We(o), me = new Set(pt(de).map(ft)), _e = a(de);
     r.resizeShape(ie, { x: F, y: G, width: ee - F, height: se - G });
-    let U = We(o), le = pt(U).filter((Fe) => !ge.has(ft(Fe)));
+    let U = We(o), le = pt(U).filter((Fe) => !me.has(ft(Fe)));
     const K = [];
     if (le.length > 0 && le.every(
       (Fe) => Fe.kind === "label-over-line" && !i.has(Fe.edge) && U.edges.some(($) => $.id === Fe.edge)
@@ -11649,10 +11654,10 @@ function nP(e, t, n, i) {
         const W = C.x - R.x, q = C.y - R.y;
         r.moveElements([R], { x: W, y: q }), K.push({ label: R, dx: W, dy: q });
       }
-      U = We(o), le = pt(U).filter((Fe) => !ge.has(ft(Fe)));
+      U = We(o), le = pt(U).filter((Fe) => !me.has(ft(Fe)));
     }
-    const de = a(U), Ee = [...de].some((Fe) => !_e.has(Fe));
-    if (le.length || Ee || de.size >= _e.size) {
+    const he = a(U), Ee = [...he].some((Fe) => !_e.has(Fe));
+    if (le.length || Ee || he.size >= _e.size) {
       for (const Fe of K.reverse()) r.moveElements([Fe.label], { x: -Fe.dx, y: -Fe.dy });
       r.resizeShape(ie, ve);
     }
@@ -11690,29 +11695,29 @@ function oP(e, t, n = {}) {
   };
   if (s.length) return { ok: !1, issues: s, findings: [], stats: c };
   const l = BA(t, a, i), u = i && l.writes.size ? iP(l.writes, r.elementRegistry, r.canvas, i) : void 0, p = We(r.elementRegistry), f = new Set(pt(p).map(ft)), d = new Set(pt(p, { includeObservationOnly: !0 }).map(ft)), g = new Set(
-    Iw(l.ops, (fe) => {
-      var ge, _e;
-      return (_e = (ge = r.elementRegistry.get(fe)) == null ? void 0 : ge.source) == null ? void 0 : _e.id;
+    Iw(l.ops, (de) => {
+      var me, _e;
+      return (_e = (me = r.elementRegistry.get(de)) == null ? void 0 : me.source) == null ? void 0 : _e.id;
     }).keys()
-  ), h = new Set(p.edges.map((fe) => fe.id).filter((fe) => !g.has(fe))), m = new Set(
+  ), h = new Set(p.edges.map((de) => de.id).filter((de) => !g.has(de))), m = new Set(
     t.flatMap(
-      (fe) => fe.kind === "sequenceFlow.update" && (fe.source !== void 0 || fe.target !== void 0) ? [fe.id] : []
+      (de) => de.kind === "sequenceFlow.update" && (de.source !== void 0 || de.target !== void 0) ? [de.id] : []
     )
   ), w = () => new Set(
-    p.edges.filter((fe) => {
+    p.edges.filter((de) => {
       var _e;
-      const ge = (_e = r.elementRegistry.get(fe.id)) == null ? void 0 : _e.waypoints;
-      return ge ? !(ge.length === fe.waypoints.length && fe.waypoints.every((U, le) => Math.round(U.x) === Math.round(ge[le].x) && Math.round(U.y) === Math.round(ge[le].y))) : !1;
-    }).map((fe) => fe.id)
-  ), y = (fe, ge) => new Set([...fe].filter((_e) => !ge.has(_e))), v = new Set(p.shapes.map((fe) => fe.id)), b = er(p), E = b.length, A = new Set(b.map(([fe, ge]) => `${fe}|${ge}`)), N = to(p), P = new Set(N.map(([fe, ge]) => `${fe}|${ge}`)), k = /* @__PURE__ */ new Map();
-  for (const fe of r.elementRegistry.filter(
-    (ge) => "waypoints" in ge && !!ge.waypoints
+      const me = (_e = r.elementRegistry.get(de.id)) == null ? void 0 : _e.waypoints;
+      return me ? !(me.length === de.waypoints.length && de.waypoints.every((U, le) => Math.round(U.x) === Math.round(me[le].x) && Math.round(U.y) === Math.round(me[le].y))) : !1;
+    }).map((de) => de.id)
+  ), y = (de, me) => new Set([...de].filter((_e) => !me.has(_e))), v = new Set(p.shapes.map((de) => de.id)), b = er(p), E = b.length, A = new Set(b.map(([de, me]) => `${de}|${me}`)), I = to(p), P = new Set(I.map(([de, me]) => `${de}|${me}`)), k = /* @__PURE__ */ new Map();
+  for (const de of r.elementRegistry.filter(
+    (me) => "waypoints" in me && !!me.waypoints
   ))
-    fe.label && k.set(fe.id, {
-      wps: fe.waypoints.map((ge) => ({ x: ge.x, y: ge.y })),
-      label: { x: fe.label.x, y: fe.label.y },
-      source: (ie = fe.source) == null ? void 0 : ie.id,
-      target: (ve = fe.target) == null ? void 0 : ve.id
+    de.label && k.set(de.id, {
+      wps: de.waypoints.map((me) => ({ x: me.x, y: me.y })),
+      label: { x: de.label.x, y: de.label.y },
+      source: (ie = de.source) == null ? void 0 : ie.id,
+      target: (ve = de.target) == null ? void 0 : ve.id
     });
   const H = e.get("commandStack");
   try {
@@ -11720,29 +11725,29 @@ function oP(e, t, n = {}) {
       o(l.ops, r);
       for (const U of (u == null ? void 0 : u.contexts()) ?? []) H.execute(ew, U);
       ZA(r, f, p), JA(r, p), tP(r, f, p), JM(r, p, m), YM(r, h, v), QM(r, h);
-      const fe = Zm(r, f);
+      const de = Zm(r, f);
       FM(r, A, h);
-      const ge = w(), _e = EA(
+      const me = w(), _e = EA(
         r,
         f,
-        y(h, ge),
-        ge
+        y(h, me),
+        me
       );
-      dA(r, h), fA(r, h, m), bA(r, f, h), _A(r, f, h), WM(r, P, h), rA(r, h, p), kA(r, f, y(h, w())), TA(r, h, /* @__PURE__ */ new Set([...m, ..._e])), DA(r, v), KA(r, f, v), Zm(r, f, fe), nP(r, d, p, h), IA(r, f), PA(r, k, UA(r));
+      dA(r, h), fA(r, h, m), bA(r, f, h), _A(r, f, h), WM(r, P, h), rA(r, h, p), kA(r, f, y(h, w())), TA(r, h, /* @__PURE__ */ new Set([...m, ..._e])), DA(r, v), KA(r, f, v), Zm(r, f, de), nP(r, d, p, h), IA(r, f), PA(r, k, UA(r));
     });
-  } catch (fe) {
+  } catch (de) {
     return {
       ok: !1,
       // 하강 중에야 드러나는 거부 중 **구조화할 수 있는 것**은 그 issue 를 그대로 낸다(B-128) — 나머지는 자유 문장
       issues: [
-        fe instanceof Nw ? fe.issue : { kind: "lower-failed", message: fe instanceof Error ? fe.message : String(fe) }
+        de instanceof Nw ? de.issue : { kind: "lower-failed", message: de instanceof Error ? de.message : String(de) }
       ],
       findings: [],
       stats: c
     };
   }
   const F = We(r.elementRegistry), G = pt(F, { includeObservationOnly: !0 }).filter(
-    (fe) => !d.has(ft(fe))
+    (de) => !d.has(ft(de))
   ), ee = xM(F), se = to(F);
   return {
     ok: !0,
@@ -11759,7 +11764,7 @@ function oP(e, t, n = {}) {
         crossPoolMessages: ee.crossPoolMessages
       },
       sharedEndpointCrossings: {
-        before: N.length,
+        before: I.length,
         after: se.length,
         pairs: se
       }
@@ -11794,7 +11799,7 @@ function sP(e, t = {}) {
     n.filter((U) => U.$type === "bpmn:Process").map((U) => [U.id, U])
   ), r = [], a = [], s = [], c = [], l = [], u = [], p = { poolOrders: {}, bands: {}, placements: {}, afterColumns: {} }, f = [], d = [], g = [], h = [], m = [], w = [], y = [], v = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Set(), E = /* @__PURE__ */ new Set(), A = (U) => {
     U && b.add(U);
-  }, N = (U) => {
+  }, I = (U) => {
     b.add(U), E.add(U);
   }, P = (U) => {
     const le = yy(U, "bwl:Placement");
@@ -11811,7 +11816,7 @@ function sP(e, t = {}) {
     for (const K of U)
       switch (A(K.id), K.$type) {
         case "bpmn:TextAnnotation":
-          N(K.id), v.set(K.id, K), c.push({ id: K.id, text: typeof K.text == "string" ? K.text : "" }), P(K);
+          I(K.id), v.set(K.id, K), c.push({ id: K.id, text: typeof K.text == "string" ? K.text : "" }), P(K);
           break;
         case "bpmn:Association":
           g.push({
@@ -11822,7 +11827,7 @@ function sP(e, t = {}) {
           });
           break;
         case "bpmn:Group": {
-          N(K.id), v.set(K.id, K);
+          I(K.id), v.set(K.id, K);
           const Q = (le = K.categoryValueRef) == null ? void 0 : le.value;
           l.push({ id: K.id, ...typeof Q == "string" && Q ? { name: Q } : {} }), k(K);
           break;
@@ -11836,12 +11841,12 @@ function sP(e, t = {}) {
     for (const le of U.artifacts ?? [])
       A(le.id), u.push({ id: le.id, type: le.$type, reason: "inside-container" });
   }, G = (U, le) => {
-    const K = U.flowElements ?? [], Q = (U.laneSets ?? []).flatMap((Ee) => Ee.lanes ?? []), de = /* @__PURE__ */ new Map();
+    const K = U.flowElements ?? [], Q = (U.laneSets ?? []).flatMap((Ee) => Ee.lanes ?? []), he = /* @__PURE__ */ new Map();
     for (const Ee of Q) {
       A(Ee.id), v.set(Ee.id, Ee);
       for (const Fe of Ee.flowNodeRef ?? []) {
         const $ = Hi(Fe);
-        $ && de.set($, Ee.id);
+        $ && he.set($, Ee.id);
       }
     }
     for (const Ee of K) {
@@ -11855,7 +11860,7 @@ function sP(e, t = {}) {
         continue;
       }
       if (Ee.$type === "bpmn:DataStoreReference") {
-        N(Ee.id), s.push({ id: Ee.id, ...Ee.name ? { name: Ee.name } : {} });
+        I(Ee.id), s.push({ id: Ee.id, ...Ee.name ? { name: Ee.name } : {} });
         continue;
       }
       const Fe = rP(Ee.$type), $ = Fe === "intermediateCatchEvent" ? Wb((Ee.eventDefinitions ?? []).map((q) => q.$type)) : void 0;
@@ -11863,14 +11868,14 @@ function sP(e, t = {}) {
         u.push({ id: Ee.id, type: Ee.$type, reason: "type-outside-mvp" });
         continue;
       }
-      N(Ee.id);
+      I(Ee.id);
       const C = Fe === "boundaryEvent" ? Hi(Ee.attachedToRef) : void 0;
       a.push({
         id: Ee.id,
         type: Fe,
         ...Ee.name ? { name: Ee.name } : {},
         ...le ? { participant: le } : {},
-        ...de.has(Ee.id) ? { lane: de.get(Ee.id) } : {},
+        ...he.has(Ee.id) ? { lane: he.get(Ee.id) } : {},
         ...C ? { attachedTo: C } : {},
         ...$ ? { eventDefinition: $ } : {}
       }), Fe === "subProcess" && F(Ee);
@@ -11899,12 +11904,12 @@ function sP(e, t = {}) {
   if (i) {
     const U = /* @__PURE__ */ new Set();
     for (const le of i.participants ?? []) {
-      N(le.id), v.set(le.id, le);
+      I(le.id), v.set(le.id, le);
       const K = Hi(le.processRef);
       K && U.add(K);
-      const Q = K ? o.get(K) : void 0, de = ((Q == null ? void 0 : Q.laneSets) ?? []).flatMap((C) => C.lanes ?? []), Ee = de.map((C) => ({ id: C.id, ...C.name ? { name: C.name } : {} }));
-      for (const C of Ee) N(C.id);
-      const Fe = !Q || (Q.flowElements ?? []).length === 0 && de.length === 0 && (Q.artifacts ?? []).length === 0;
+      const Q = K ? o.get(K) : void 0, he = ((Q == null ? void 0 : Q.laneSets) ?? []).flatMap((C) => C.lanes ?? []), Ee = he.map((C) => ({ id: C.id, ...C.name ? { name: C.name } : {} }));
+      for (const C of Ee) I(C.id);
+      const Fe = !Q || (Q.flowElements ?? []).length === 0 && he.length === 0 && (Q.artifacts ?? []).length === 0;
       r.push({
         id: le.id,
         ...le.name ? { name: le.name } : {},
@@ -11926,38 +11931,38 @@ function sP(e, t = {}) {
       !U.has(le) && (K.flowElements ?? []).length > 0 && u.push({ id: le, type: K.$type, reason: "unreachable-process" });
   } else
     for (const U of o.values()) G(U);
-  const ee = [], se = [], ie = [], ve = [], fe = (U, le) => !!U && !!le && E.has(U) && E.has(le);
+  const ee = [], se = [], ie = [], ve = [], de = (U, le) => !!U && !!le && E.has(U) && E.has(le);
   for (const U of f) {
-    if (!fe(U.source, U.target)) {
+    if (!de(U.source, U.target)) {
       u.push({ id: U.id, type: "bpmn:SequenceFlow", reason: "endpoint-outside-mvp" });
       continue;
     }
     ee.push({ id: U.id, source: U.source, target: U.target, ...U.name ? { name: U.name } : {} }), E.add(U.id);
   }
   for (const U of d) {
-    if (!fe(U.source, U.target)) {
+    if (!de(U.source, U.target)) {
       u.push({ id: U.id, type: "bpmn:MessageFlow", reason: "endpoint-outside-mvp" });
       continue;
     }
     se.push({ id: U.id, source: U.source, target: U.target, ...U.name ? { name: U.name } : {} }), E.add(U.id);
   }
   for (const U of h) {
-    if (!fe(U.source, U.target)) {
+    if (!de(U.source, U.target)) {
       u.push({ id: U.id ?? "", type: U.type, reason: "endpoint-outside-mvp" });
       continue;
     }
     ve.push({ ...U.id ? { id: U.id } : {}, source: U.source, target: U.target }), U.id && E.add(U.id);
   }
   for (const U of g) {
-    if (!fe(U.source, U.target)) {
+    if (!de(U.source, U.target)) {
       u.push({ id: U.id ?? "", type: U.type, reason: "endpoint-outside-mvp" });
       continue;
     }
     ie.push({ ...U.id ? { id: U.id } : {}, source: U.source, target: U.target });
   }
-  const ge = new Map(l.map((U) => [U.id, U]));
+  const me = new Map(l.map((U) => [U.id, U]));
   for (const { owner: U, refs: le } of y) {
-    const K = le.filter((de) => b.has(de)), Q = ge.get(U);
+    const K = le.filter((he) => b.has(he)), Q = me.get(U);
     Q && K.length && (Q.members = K);
   }
   for (const U of m)
@@ -13108,7 +13113,7 @@ function Zw(e, t) {
         v = Tl(v.slice());
       else
         throw s(`Cannot invoke "${v}". Expected a function!`);
-    const A = (v.$inject || aT(v)).map((N) => Jp(b, N) ? b[N] : c(N));
+    const A = (v.$inject || aT(v)).map((I) => Jp(b, I) ? b[I] : c(I));
     return {
       fn: v,
       dependencies: A
@@ -13124,19 +13129,19 @@ function Zw(e, t) {
   function p(v, b, E) {
     const {
       fn: A,
-      dependencies: N
+      dependencies: I
     } = l(v, E);
-    return A.apply(b, N);
+    return A.apply(b, I);
   }
   function f(v) {
     return Tl((b) => v.get(b));
   }
   function d(v, b) {
     if (b && b.length) {
-      const E = /* @__PURE__ */ Object.create(null), A = /* @__PURE__ */ Object.create(null), N = [], P = [], k = [];
+      const E = /* @__PURE__ */ Object.create(null), A = /* @__PURE__ */ Object.create(null), I = [], P = [], k = [];
       let H, F, G, ee;
       for (let se in o)
-        H = o[se], b.indexOf(se) !== -1 && (H[2] === "private" ? (F = N.indexOf(H[3]), F === -1 ? (G = H[3].createChild([], b), ee = f(G), N.push(H[3]), P.push(G), k.push(ee), E[se] = [ee, se, "private", G]) : E[se] = [k[F], se, "private", P[F]]) : E[se] = [H[2], H[1]], A[se] = !0), (H[2] === "factory" || H[2] === "type") && H[1].$scope && b.forEach((ie) => {
+        H = o[se], b.indexOf(se) !== -1 && (H[2] === "private" ? (F = I.indexOf(H[3]), F === -1 ? (G = H[3].createChild([], b), ee = f(G), I.push(H[3]), P.push(G), k.push(ee), E[se] = [ee, se, "private", G]) : E[se] = [k[F], se, "private", P[F]]) : E[se] = [H[2], H[1]], A[se] = !0), (H[2] === "factory" || H[2] === "type") && H[1].$scope && b.forEach((ie) => {
           H[1].$scope.indexOf(ie) !== -1 && (E[se] = [H[2], H[1]], A[ie] = !0);
         });
       b.forEach((se) => {
@@ -13164,7 +13169,7 @@ function Zw(e, t) {
   function m(v) {
     const b = v.__exports__;
     if (b) {
-      const E = v.__modules__, A = Object.keys(v).reduce((F, G) => (G !== "__exports__" && G !== "__modules__" && G !== "__init__" && G !== "__depends__" && (F[G] = v[G]), F), /* @__PURE__ */ Object.create(null)), N = (E || []).concat(A), P = d(N), k = Tl(function(F) {
+      const E = v.__modules__, A = Object.keys(v).reduce((F, G) => (G !== "__exports__" && G !== "__modules__" && G !== "__init__" && G !== "__depends__" && (F[G] = v[G]), F), /* @__PURE__ */ Object.create(null)), I = (E || []).concat(A), P = d(I), k = Tl(function(F) {
         return P.get(F);
       });
       b.forEach(function(F) {
@@ -13188,8 +13193,8 @@ function Zw(e, t) {
         o[E] = A;
         return;
       }
-      const N = A[0], P = A[1];
-      o[E] = [g[N], sT(N, P), N];
+      const I = A[0], P = A[1];
+      o[E] = [g[I], sT(I, P), I];
     }), h(v, a);
   }
   function w(v, b) {
@@ -13623,11 +13628,11 @@ function TT(e, t, n) {
     h = Ly(...t, d / c), u[d] = { x: h.x, y: h.y, t: d / c };
   for (d = 0; d < s; d++)
     for (g = 0; g < c; g++) {
-      var m = l[d], w = l[d + 1], y = u[g], v = u[g + 1], b = Xo(w.x - m.x) < 0.01 ? "y" : "x", E = Xo(v.x - y.x) < 0.01 ? "y" : "x", A = PT(m.x, m.y, w.x, w.y, y.x, y.y, v.x, v.y), N;
+      var m = l[d], w = l[d + 1], y = u[g], v = u[g + 1], b = Xo(w.x - m.x) < 0.01 ? "y" : "x", E = Xo(v.x - y.x) < 0.01 ? "y" : "x", A = PT(m.x, m.y, w.x, w.y, y.x, y.y, v.x, v.y), I;
       if (A) {
-        if (N = A.x.toFixed(9) + "#" + A.y.toFixed(9), p[N])
+        if (I = A.x.toFixed(9) + "#" + A.y.toFixed(9), p[I])
           continue;
-        p[N] = !0;
+        p[I] = !0;
         var P = m.t + Xo((A[b] - m[b]) / (w[b] - m[b])) * (w.t - m.t), k = y.t + Xo((A[E] - y[E]) / (v[E] - y[E])) * (v.t - y.t);
         P >= 0 && P <= 1 && k >= 0 && k <= 1 && f.push({
           x: A.x,
@@ -13742,27 +13747,27 @@ function t_(e, t, n, i, o, r, a, s, c, l) {
     return { x: W, y: q };
   });
   if (l)
-    N = l[0], P = l[1], E = l[2], A = l[3];
+    I = l[0], P = l[1], E = l[2], A = l[3];
   else {
     d = g(e, t, -p), e = d.x, t = d.y, d = g(s, c, -p), s = d.x, c = d.y;
     var h = (e - s) / 2, m = (t - c) / 2, w = h * h / (n * n) + m * m / (i * i);
     w > 1 && (w = rn.sqrt(w), n = w * n, i = w * i);
-    var y = n * n, v = i * i, b = (r == a ? -1 : 1) * rn.sqrt(Xo((y * v - y * m * m - v * h * h) / (y * m * m + v * h * h))), E = b * n * m / i + (e + s) / 2, A = b * -i * h / n + (t + c) / 2, N = rn.asin(((t - A) / i).toFixed(9)), P = rn.asin(((c - A) / i).toFixed(9));
-    N = e < E ? Go - N : N, P = s < E ? Go - P : P, N < 0 && (N = Go * 2 + N), P < 0 && (P = Go * 2 + P), a && N > P && (N = N - Go * 2), !a && P > N && (P = P - Go * 2);
+    var y = n * n, v = i * i, b = (r == a ? -1 : 1) * rn.sqrt(Xo((y * v - y * m * m - v * h * h) / (y * m * m + v * h * h))), E = b * n * m / i + (e + s) / 2, A = b * -i * h / n + (t + c) / 2, I = rn.asin(((t - A) / i).toFixed(9)), P = rn.asin(((c - A) / i).toFixed(9));
+    I = e < E ? Go - I : I, P = s < E ? Go - P : P, I < 0 && (I = Go * 2 + I), P < 0 && (P = Go * 2 + P), a && I > P && (I = I - Go * 2), !a && P > I && (P = P - Go * 2);
   }
-  var k = P - N;
+  var k = P - I;
   if (Xo(k) > u) {
     var H = P, F = s, G = c;
-    P = N + u * (a && P > N ? 1 : -1), s = E + n * rn.cos(P), c = A + i * rn.sin(P), f = t_(s, c, n, i, o, 0, a, F, G, [P, H, E, A]);
+    P = I + u * (a && P > I ? 1 : -1), s = E + n * rn.cos(P), c = A + i * rn.sin(P), f = t_(s, c, n, i, o, 0, a, F, G, [P, H, E, A]);
   }
-  k = P - N;
-  var ee = rn.cos(N), se = rn.sin(N), ie = rn.cos(P), ve = rn.sin(P), fe = rn.tan(k / 4), ge = 4 / 3 * n * fe, _e = 4 / 3 * i * fe, U = [e, t], le = [e + ge * se, t - _e * ee], K = [s + ge * ve, c - _e * ie], Q = [s, c];
+  k = P - I;
+  var ee = rn.cos(I), se = rn.sin(I), ie = rn.cos(P), ve = rn.sin(P), de = rn.tan(k / 4), me = 4 / 3 * n * de, _e = 4 / 3 * i * de, U = [e, t], le = [e + me * se, t - _e * ee], K = [s + me * ve, c - _e * ie], Q = [s, c];
   if (le[0] = 2 * U[0] - le[0], le[1] = 2 * U[1] - le[1], l)
     return [le, K, Q].concat(f);
   f = [le, K, Q].concat(f).join().split(",");
-  for (var de = [], Ee = 0, Fe = f.length; Ee < Fe; Ee++)
-    de[Ee] = Ee % 2 ? g(f[Ee - 1], f[Ee], p).y : g(f[Ee], f[Ee + 1], p).x;
-  return de;
+  for (var he = [], Ee = 0, Fe = f.length; Ee < Fe; Ee++)
+    he[Ee] = Ee % 2 ? g(f[Ee - 1], f[Ee], p).y : g(f[Ee], f[Ee + 1], p).x;
+  return he;
 }
 function DT(e, t, n, i, o, r, a, s) {
   for (var c = [], l = [[], []], u, p, f, d, g, h, m, w, y = 0; y < 2; ++y) {
@@ -14837,8 +14842,8 @@ function r2(e) {
 function a2(e) {
   var t = {}, n = [], i = {};
   function o(K, Q) {
-    return function(de) {
-      K(de, Q);
+    return function(he) {
+      K(he, Q);
     };
   }
   function r(K) {
@@ -14848,8 +14853,8 @@ function a2(e) {
     return t[K.id];
   }
   function s(K, Q) {
-    var de = K.gfx;
-    if (de)
+    var he = K.gfx;
+    if (he)
       throw new Error(
         `already rendered ${jn(K)}`
       );
@@ -14860,8 +14865,8 @@ function a2(e) {
   }
   function l(K, Q) {
     try {
-      var de = i[K.id] && s(K, Q);
-      return r(K), de;
+      var he = i[K.id] && s(K, Q);
+      return r(K), he;
     } catch (Ee) {
       u(Ee.message, { element: K, error: Ee }), console.error(`failed to import ${jn(K)}`, Ee);
     }
@@ -14870,11 +14875,11 @@ function a2(e) {
     e.error(K, Q);
   }
   var p = this.registerDi = function(Q) {
-    var de = Q.bpmnElement;
-    de ? i[de.id] ? u(
-      `multiple DI elements defined for ${jn(de)}`,
-      { element: de }
-    ) : i[de.id] = Q : u(
+    var he = Q.bpmnElement;
+    he ? i[he.id] ? u(
+      `multiple DI elements defined for ${jn(he)}`,
+      { element: he }
+    ) : i[he.id] = Q : u(
       `no bpmnElement referenced in ${jn(Q)}`,
       { element: Q }
     );
@@ -14888,17 +14893,17 @@ function a2(e) {
   function g(K) {
     p(K);
   }
-  this.handleDefinitions = function(Q, de) {
+  this.handleDefinitions = function(Q, he) {
     var Ee = Q.diagrams;
-    if (de && Ee.indexOf(de) === -1)
+    if (he && Ee.indexOf(he) === -1)
       throw new Error("diagram not part of <bpmn:Definitions />");
-    if (!de && Ee && Ee.length && (de = Ee[0]), !de)
+    if (!he && Ee && Ee.length && (he = Ee[0]), !he)
       throw new Error("no diagram to display");
-    i = {}, f(de);
-    var Fe = de.plane;
+    i = {}, f(he);
+    var Fe = he.plane;
     if (!Fe)
       throw new Error(
-        `no plane for ${jn(de)}`
+        `no plane for ${jn(he)}`
       );
     var $ = Fe.bpmnElement;
     if (!$)
@@ -14924,13 +14929,13 @@ function a2(e) {
       Q = n.shift(), Q();
   };
   function m(K, Q) {
-    fe(K, Q), k(K.ioSpecification, Q), P(K.artifacts, Q), r(K);
+    de(K, Q), k(K.ioSpecification, Q), P(K.artifacts, Q), r(K);
   }
   function w(K, Q) {
-    var de = st(K, function(Ee) {
+    var he = st(K, function(Ee) {
       return !a(Ee) && Zn(Ee, "bpmn:Process") && Ee.laneSets;
     });
-    de.forEach(o(m, Q));
+    he.forEach(o(m, Q));
   }
   function y(K, Q) {
     l(K, Q);
@@ -14947,25 +14952,25 @@ function a2(e) {
   function A(K, Q) {
     l(K, Q);
   }
-  function N(K, Q) {
+  function I(K, Q) {
     l(K, Q);
   }
   function P(K, Q) {
-    V(K, function(de) {
-      Zn(de, "bpmn:Association") ? n.push(function() {
-        N(de, Q);
-      }) : N(de, Q);
+    V(K, function(he) {
+      Zn(he, "bpmn:Association") ? n.push(function() {
+        I(he, Q);
+      }) : I(he, Q);
     });
   }
   function k(K, Q) {
     K && (V(K.dataInputs, o(E, Q)), V(K.dataOutputs, o(A, Q)));
   }
-  var H = this.handleSubProcess = function(Q, de) {
-    fe(Q, de), P(Q.artifacts, de);
+  var H = this.handleSubProcess = function(Q, he) {
+    de(Q, he), P(Q.artifacts, he);
   };
   function F(K, Q) {
-    var de = l(K, Q);
-    Zn(K, "bpmn:SubProcess") && H(K, de || Q), Zn(K, "bpmn:Activity") && k(K.ioSpecification, Q), n.push(function() {
+    var he = l(K, Q);
+    Zn(K, "bpmn:SubProcess") && H(K, he || Q), Zn(K, "bpmn:Activity") && k(K.ioSpecification, Q), n.push(function() {
       V(K.dataInputAssociations, o(b, Q)), V(K.dataOutputAssociations, o(b, Q));
     });
   }
@@ -14977,8 +14982,8 @@ function a2(e) {
   }
   function se(K, Q) {
     n.push(function() {
-      var de = l(K, Q);
-      K.childLaneSet && ie(K.childLaneSet, de || Q), le(K);
+      var he = l(K, Q);
+      K.childLaneSet && ie(K.childLaneSet, he || Q), le(K);
     });
   }
   function ie(K, Q) {
@@ -14987,27 +14992,27 @@ function a2(e) {
   function ve(K, Q) {
     V(K, o(ie, Q));
   }
-  function fe(K, Q) {
-    ge(K.flowElements, Q), K.laneSets && ve(K.laneSets, Q);
-  }
-  function ge(K, Q) {
-    V(K, function(de) {
-      Zn(de, "bpmn:SequenceFlow") ? n.push(function() {
-        G(de, Q);
-      }) : Zn(de, "bpmn:BoundaryEvent") ? n.unshift(function() {
-        F(de, Q);
-      }) : Zn(de, "bpmn:FlowNode") ? F(de, Q) : Zn(de, "bpmn:DataObject") || (Zn(de, "bpmn:DataStoreReference") || Zn(de, "bpmn:DataObjectReference") ? ee(de, Q) : u(
-        `unrecognized flowElement ${jn(de)} in context ${jn(Q && Q.businessObject)}`,
+  function de(K, Q) {
+    me(K.flowElements, Q), K.laneSets && ve(K.laneSets, Q);
+  }
+  function me(K, Q) {
+    V(K, function(he) {
+      Zn(he, "bpmn:SequenceFlow") ? n.push(function() {
+        G(he, Q);
+      }) : Zn(he, "bpmn:BoundaryEvent") ? n.unshift(function() {
+        F(he, Q);
+      }) : Zn(he, "bpmn:FlowNode") ? F(he, Q) : Zn(he, "bpmn:DataObject") || (Zn(he, "bpmn:DataStoreReference") || Zn(he, "bpmn:DataObjectReference") ? ee(he, Q) : u(
+        `unrecognized flowElement ${jn(he)} in context ${jn(Q && Q.businessObject)}`,
         {
-          element: de,
+          element: he,
           context: Q
         }
       ));
     });
   }
   function _e(K, Q) {
-    var de = l(K, Q), Ee = K.processRef;
-    Ee && m(Ee, de || Q);
+    var he = l(K, Q), Ee = K.processRef;
+    Ee && m(Ee, he || Q);
   }
   function U(K, Q) {
     V(K.participants, o(_e, Q)), n.push(function() {
@@ -15016,8 +15021,8 @@ function a2(e) {
   }
   function le(K) {
     V(K.flowNodeRef, function(Q) {
-      var de = Q.get("lanes");
-      de && de.push(K);
+      var he = Q.get("lanes");
+      he && he.push(K);
     });
   }
 }
@@ -15779,7 +15784,7 @@ function Kr(e, t, n, i, o, r, a) {
   function A($) {
     return Fe[$];
   }
-  function N($) {
+  function I($) {
     return function(C, R, W) {
       return A($)(C, R, W);
     };
@@ -16229,7 +16234,7 @@ function Kr(e, t, n, i, o, r, a) {
       Ol(pe, 0, -Te, 270);
     }
   }
-  function fe($, C, R = {}) {
+  function de($, C, R = {}) {
     var {
       width: W,
       height: q
@@ -16241,7 +16246,7 @@ function Kr(e, t, n, i, o, r, a) {
       stroke: Le(C, c, R.stroke)
     });
   }
-  function ge($, C, R = {}) {
+  function me($, C, R = {}) {
     var W = we(C), q = ct(C, s, R.fill), pe = Le(C, c, R.stroke);
     return (W.get("associationDirection") === "One" || W.get("associationDirection") === "Both") && (R.markerEnd = d($, "association-end", q, pe)), W.get("associationDirection") === "Both" && (R.markerStart = d($, "association-start", q, pe)), R = gt(R, [
       "markerStart",
@@ -16315,17 +16320,17 @@ function Kr(e, t, n, i, o, r, a) {
     return W;
   }
   function Q($, C, R = {}) {
-    var W = fe($, C, R), q = lt(C);
+    var W = de($, C, R), q = lt(C);
     if (zn(C) && (De(W, {
       strokeDasharray: "0, 5.5",
       strokeWidth: 2.5
     }), !q)) {
       var pe = we(C).flowElements || [], Te = pe.filter((Qe) => M(Qe, "bpmn:StartEvent"));
-      Te.length === 1 && de(Te[0], $, R, C);
+      Te.length === 1 && he(Te[0], $, R, C);
     }
     return se($, C, q ? "center-top" : "center-middle", R), q ? G($, C, void 0, R) : G($, C, ["SubProcessMarker"], R), W;
   }
-  function de($, C, R, W) {
+  function he($, C, R, W) {
     var q = 22, pe = {
       fill: ct(W, s, R.fill),
       stroke: Le(W, c, R.stroke),
@@ -16341,7 +16346,7 @@ function Kr(e, t, n, i, o, r, a) {
     }), k($, C, pe, W);
   }
   function Ee($, C, R = {}) {
-    var W = fe($, C, R);
+    var W = de($, C, R);
     return se($, C, "center-middle", R), G($, C, void 0, R), W;
   }
   var Fe = this.handlers = {
@@ -16360,7 +16365,7 @@ function Kr(e, t, n, i, o, r, a) {
       return R = gt(R, [
         "fill",
         "stroke"
-      ]), ge($, C, R);
+      ]), me($, C, R);
     },
     "bpmn:BoundaryEvent": function($, C, R = {}) {
       var { renderIcon: W = !0 } = R;
@@ -16455,7 +16460,7 @@ function Kr(e, t, n, i, o, r, a) {
       return R = gt(R, [
         "fill",
         "stroke"
-      ]), ge($, C, {
+      ]), me($, C, {
         ...R,
         markerEnd: d($, "association-end", ct(C, s, R.fill), Le(C, c, R.stroke))
       });
@@ -16466,7 +16471,7 @@ function Kr(e, t, n, i, o, r, a) {
         "stroke"
       ]), _e($, C, R);
     },
-    "bpmn:DataObjectReference": N("bpmn:DataObject"),
+    "bpmn:DataObjectReference": I("bpmn:DataObject"),
     "bpmn:DataOutput": function($, C, R = {}) {
       R = gt(R, [
         "fill",
@@ -16483,7 +16488,7 @@ function Kr(e, t, n, i, o, r, a) {
       return R = gt(R, [
         "fill",
         "stroke"
-      ]), ge($, C, {
+      ]), me($, C, {
         ...R,
         markerEnd: d($, "association-end", ct(C, s, R.fill), Le(C, c, R.stroke))
       });
@@ -16645,8 +16650,8 @@ function Kr(e, t, n, i, o, r, a) {
         strokeWidth: 1.5
       }), W && k(C, $, R), q;
     },
-    "bpmn:IntermediateCatchEvent": N("bpmn:IntermediateEvent"),
-    "bpmn:IntermediateThrowEvent": N("bpmn:IntermediateEvent"),
+    "bpmn:IntermediateCatchEvent": I("bpmn:IntermediateEvent"),
+    "bpmn:IntermediateThrowEvent": I("bpmn:IntermediateEvent"),
     "bpmn:Lane": function($, C, R = {}) {
       return R = gt(R, [
         "fill",
@@ -21177,7 +21182,7 @@ function E0(e, t, n) {
       throw new Error("invalid hit type <" + k + ">");
     return De(P, H), P;
   }
-  function N(P, k) {
+  function I(P, k) {
     et(P, k);
   }
   this.removeHits = function(P) {
@@ -21191,14 +21196,14 @@ function E0(e, t, n) {
     }));
   }, this.createWaypointsHit = function(P, k) {
     var H = tc(k);
-    return A(H, "stroke"), N(P, H), H;
+    return A(H, "stroke"), I(P, H), H;
   }, this.createBoxHit = function(P, k, H) {
     H = Y({
       x: 0,
       y: 0
     }, H);
     var F = je("rect");
-    return A(F, k), De(F, H), N(P, F), F;
+    return A(F, k), De(F, H), I(P, F), F;
   }, this.updateDefaultHit = function(P, k) {
     var H = Rt(".djs-hit", k);
     if (H)
@@ -21423,7 +21428,7 @@ function P0(e, t, n, i) {
     b.length && n.select(b);
   }
   function l(v, b) {
-    var E = r.payload, A = r.displacement, N = r.globalStart, P = Hr(v), k = Gi(P, N), H = r.localStart, F = a(P), G = Gi(F, H);
+    var E = r.payload, A = r.displacement, I = r.globalStart, P = Hr(v), k = Gi(P, I), H = r.localStart, F = a(P), G = Gi(F, H);
     if (!r.active && (b || HD(k) > r.threshold)) {
       if (Y(E, {
         x: va(H.x + A.x),
@@ -21479,10 +21484,10 @@ function P0(e, t, n, i) {
   }
   function y(v, b, E, A) {
     r && m(!1), typeof b == "string" && (A = E, E = b, b = null), A = Y({}, o, A || {});
-    var N = A.data || {}, P, k, H, F, G;
+    var I = A.data || {}, P, k, H, F, G;
     if (A.trapClick ? F = f : F = u, v ? (P = Va(v) || v, k = Hr(v), tf(v), P.type === "dragstart" && Or(P)) : (P = null, k = { x: 0, y: 0 }), H = a(k), b || (b = H), G = jD(P), r = Y({
       prefix: E,
-      data: N,
+      data: I,
       payload: {},
       globalStart: k,
       displacement: Gi(b, H),
@@ -22673,10 +22678,10 @@ function mL(e, t, n, i, o) {
         return !kt(G) && !ot(G) && !u.has(G) && !p.has(G);
       }), w = st(g, function(G) {
         return !kt(G) && !ot(G) && u.has(G);
-      }), y, v, b, E = [], A = [], N, P, k, H;
+      }), y, v, b, E = [], A = [], I, P, k, H;
       m.length && (v = Gv(Ve(ln(m))), y = i - h[qo[n]] + v[qo[n]], n === "n" ? s.bottom = l = Ke(l) ? Math.min(l, y) : y : n === "w" ? s.right = l = Ke(l) ? Math.min(l, y) : y : n === "s" ? s.top = c = Ke(c) ? Math.max(c, y) : y : n === "e" && (s.left = c = Ke(c) ? Math.max(c, y) : y)), w.length && (b = Gv(Ve(ln(w))), y = i - b[qo[ll[n]]] + h[qo[ll[n]]], n === "n" ? s.bottom = l = Ke(l) ? Math.min(l, y) : y : n === "w" ? s.right = l = Ke(l) ? Math.min(l, y) : y : n === "s" ? s.top = c = Ke(c) ? Math.max(c, y) : y : n === "e" && (s.left = c = Ke(c) ? Math.max(c, y) : y)), d && d.length && (d.forEach(function(G) {
         u.has(G) ? E.push(G) : A.push(G);
-      }), E.length && (N = Ve(ln(E.map(Xe))), P = h[qo[ll[n]]] - (N[qo[ll[n]]] - i)), A.length && (k = Ve(ln(A.map(Xe))), H = k[qo[n]] - (h[qo[n]] - i)), n === "n" ? (y = Math.min(P || 1 / 0, H || 1 / 0), s.bottom = l = Ke(l) ? Math.min(l, y) : y) : n === "w" ? (y = Math.min(P || 1 / 0, H || 1 / 0), s.right = l = Ke(l) ? Math.min(l, y) : y) : n === "s" ? (y = Math.max(P || -1 / 0, H || -1 / 0), s.top = c = Ke(c) ? Math.max(c, y) : y) : n === "e" && (y = Math.max(P || -1 / 0, H || -1 / 0), s.left = c = Ke(c) ? Math.max(c, y) : y));
+      }), E.length && (I = Ve(ln(E.map(Xe))), P = h[qo[ll[n]]] - (I[qo[ll[n]]] - i)), A.length && (k = Ve(ln(A.map(Xe))), H = k[qo[n]] - (h[qo[n]] - i)), n === "n" ? (y = Math.min(P || 1 / 0, H || 1 / 0), s.bottom = l = Ke(l) ? Math.min(l, y) : y) : n === "w" ? (y = Math.min(P || 1 / 0, H || 1 / 0), s.right = l = Ke(l) ? Math.min(l, y) : y) : n === "s" ? (y = Math.max(P || -1 / 0, H || -1 / 0), s.top = c = Ke(c) ? Math.max(c, y) : y) : n === "e" && (y = Math.max(P || -1 / 0, H || -1 / 0), s.left = c = Ke(c) ? Math.max(c, y) : y));
       var F = o && o[f.id];
       F && (n === "n" ? (y = i + f[yo[t]] - F[yo[t]], s.bottom = l = Ke(l) ? Math.min(l, y) : y) : n === "w" ? (y = i + f[yo[t]] - F[yo[t]], s.right = l = Ke(l) ? Math.min(l, y) : y) : n === "s" ? (y = i - f[yo[t]] + F[yo[t]], s.top = c = Ke(c) ? Math.max(c, y) : y) : n === "e" && (y = i - f[yo[t]] + F[yo[t]], s.left = c = Ke(c) ? Math.max(c, y) : y));
     }), s;
@@ -22722,8 +22727,8 @@ function $0(e, t, n, i, o) {
         });
         var h = /* @__PURE__ */ new Set(), m = s.movingConnections = [];
         g.forEach(function(A) {
-          V(A.outgoing, function(N) {
-            h.has(N) || !kt(N) || !g.has(N.target) || (h.add(N), m.push(N));
+          V(A.outgoing, function(I) {
+            h.has(I) || !kt(I) || !g.has(I.target) || (h.add(I), m.push(I));
           });
         }), r(m, d), s.dragGroup = d;
       }
@@ -22732,9 +22737,9 @@ function $0(e, t, n, i, o) {
         De(w, i.cls("djs-frame-group", ["no-events"])), et(n.getActiveLayer(), w);
         var y = [];
         V(p, function(A) {
-          var N = o.addFrame(A, w), P = N.getBBox();
+          var I = o.addFrame(A, w), P = I.getBBox();
           y.push({
-            element: N,
+            element: I,
             initialBounds: P
           }), n.addMarker(A, Wv);
         }), s.frameGroup = w, s.frames = y;
@@ -22746,15 +22751,15 @@ function $0(e, t, n, i, o) {
       De(c, { d: v[l] });
       var b = { x: "y", y: "x" }, E = { x: a.dx, y: a.dy };
       E[b[s.axis]] = 0, Ln(s.dragGroup, E.x, E.y), V(s.frames, function(A) {
-        var N = A.element, P = A.initialBounds, k, H;
-        s.direction === "e" ? De(N, {
+        var I = A.element, P = A.initialBounds, k, H;
+        s.direction === "e" ? De(I, {
           width: pl(P.width + E.x, 5)
-        }) : (k = pl(P.width - E.x, 5), De(N, {
+        }) : (k = pl(P.width - E.x, 5), De(I, {
           width: k,
           x: P.x + P.width - k
-        })), s.direction === "s" ? De(N, {
+        })), s.direction === "s" ? De(I, {
           height: pl(P.height + E.y, 5)
-        }) : (H = pl(P.height - E.y, 5), De(N, {
+        }) : (H = pl(P.height - E.y, 5), De(I, {
           height: H,
           y: P.y + P.height - H
         }));
@@ -24832,8 +24837,8 @@ bc.prototype._computeUpdates = function(e, t) {
       var b = cf(y), E = f.get(b) || [], A = Pa(
         E,
         y
-      ), N = Object.keys(A).length > 0;
-      N && (v = u(y));
+      ), I = Object.keys(A).length > 0;
+      I && (v = u(y));
     }
     s(y, v, !0);
   }), t.forEach(function(y) {
@@ -24846,19 +24851,19 @@ bc.prototype._computeUpdates = function(e, t) {
     var b = y.present;
     if (b) {
       var E = m.get(b.root) || [], A = Pa(E, v);
-      E.forEach(function(N) {
-        if (A[N.id]) {
-          var P = h.get(N);
-          P || (P = /* @__PURE__ */ new Set(), h.set(N, P)), P.add(b.categoryValue);
+      E.forEach(function(I) {
+        if (A[I.id]) {
+          var P = h.get(I);
+          P || (P = /* @__PURE__ */ new Set(), h.set(I, P)), P.add(b.categoryValue);
         }
       });
     }
   });
   var w = d.reduce(function(y, v) {
-    var b = o.get(v), E = b.get(ig), A = new Set(E), N = h.get(v) || /* @__PURE__ */ new Set(), P = Array.from(N).filter(function(H) {
+    var b = o.get(v), E = b.get(ig), A = new Set(E), I = h.get(v) || /* @__PURE__ */ new Set(), P = Array.from(I).filter(function(H) {
       return !A.has(H);
     }), k = E.filter(function(H) {
-      return g.has(H) && !N.has(H);
+      return g.has(H) && !I.has(H);
     });
     return (P.length || k.length) && y.push({
       businessObject: b,
@@ -27803,7 +27808,7 @@ function Rx(e) {
   };
 }
 function mg(e, t, n, i, o, r, a, s, c, l) {
-  var u, p, f, d, g, h, m, w, y, v, b, E, A, N, P, k, H = t.type;
+  var u, p, f, d, g, h, m, w, y, v, b, E, A, I, P, k, H = t.type;
   if (t.constructor !== void 0) return null;
   128 & n.__u && (c = !!(32 & n.__u), r = [s = t.__e = n.__e]), (u = Yt.__b) && u(t);
   e: if (typeof H == "function") {
@@ -27821,10 +27826,10 @@ function mg(e, t, n, i, o, r, a, s, c, l) {
           f.componentDidUpdate(g, h, m);
         });
       }
-      if (f.context = E, f.props = y, f.__P = e, f.__e = !1, A = Yt.__r, N = 0, v) f.state = f.__s, f.__d = !1, A && A(t), u = f.render(f.props, f.state, f.context), hu.push.apply(f.__h, f._sb), f._sb = [];
+      if (f.context = E, f.props = y, f.__P = e, f.__e = !1, A = Yt.__r, I = 0, v) f.state = f.__s, f.__d = !1, A && A(t), u = f.render(f.props, f.state, f.context), hu.push.apply(f.__h, f._sb), f._sb = [];
       else do
         f.__d = !1, A && A(t), u = f.render(f.props, f.state, f.context), f.state = f.__s;
-      while (f.__d && ++N < 25);
+      while (f.__d && ++I < 25);
       f.state = f.__s, f.getChildContext != null && (i = bo(bo({}, i), f.getChildContext())), v && !d && f.getSnapshotBeforeUpdate != null && (m = f.getSnapshotBeforeUpdate(g, h)), P = u != null && u.type === dp && u.key == null ? HE(u.props.children) : u, s = BE(e, fp(P) ? P : [P], t, n, i, o, r, a, s, c, l), f.base = t.__e, t.__u &= -161, f.__h.length && a.push(f), w && (f.__E = f.__ = null);
     } catch (F) {
       if (a.length = p, t.__v = null, c || r != null) {
@@ -28381,24 +28386,24 @@ function mB(e) {
       w,
       { keys: ["label", "search", "description"] }
     ).map(({ item: Q }) => Q) : K.filter(({ rank: Q = 0 }) => Q >= 0) : K;
-  }, [E, v, b, w, p, h, f]), N = vo(() => v ? A.length ? [{ id: "default", entries: A }] : [] : bB(A), [A, v]), [P, k] = hf(A[0]), H = mu(null), F = mu(!1), G = vo(() => gB.next(), []), ee = `${G}-results`, se = P && YE(G, P);
+  }, [E, v, b, w, p, h, f]), I = vo(() => v ? A.length ? [{ id: "default", entries: A }] : [] : bB(A), [A, v]), [P, k] = hf(A[0]), H = mu(null), F = mu(!1), G = vo(() => gB.next(), []), ee = `${G}-results`, se = P && YE(G, P);
   Gl(() => {
     const K = H.current;
     K && A.includes(K) ? k(K) : k(A[0]), H.current = null;
   }, [A]);
   const ie = xs((K) => {
-    const Q = vB(N);
+    const Q = vB(I);
     let Ee = Q.indexOf(P) + K;
     Ee < 0 && (Ee = Q.length - 1), Ee >= Q.length && (Ee = 0), F.current = !0, k(Q[Ee]);
-  }, [N, P]), ve = xs((K) => {
+  }, [I, P]), ve = xs((K) => {
     K > 0 && P && P.entries && (F.current = !0, m((Q) => [...Q, P])), K < 0 && h.length > 0 && (F.current = !0, H.current = h[h.length + K], m((Q) => Q.slice(0, K)));
-  }, [P, h]), fe = xs((K, Q, de) => {
+  }, [P, h]), de = xs((K, Q, he) => {
     if (!(!Q || Q.disabled))
-      return Q.entries ? (K.preventDefault(), ve(1)) : n(K, Q, de);
-  }, [n, ve]), ge = xs((K) => {
+      return Q.entries ? (K.preventDefault(), ve(1)) : n(K, Q, he);
+  }, [n, ve]), me = xs((K) => {
     if (K.key === "Enter" && P) {
       const Q = K.target;
-      return !!Ur(Q, "a, button", !0) || P.disabled ? void 0 : fe(K, P);
+      return !!Ur(Q, "a, button", !0) || P.disabled ? void 0 : de(K, P);
     }
     if (K.key === "Backspace") {
       const Q = K.target;
@@ -28413,7 +28418,7 @@ function mB(e) {
       return ve(1), K.preventDefault();
     if (K.key === "ArrowLeft")
       return ve(-1), K.preventDefault();
-  }, [P, ie, ve, fe]), _e = xs((K) => {
+  }, [P, ie, ve, de]), _e = xs((K) => {
     Hf(K.target, "input") && y(() => K.target.value);
   }, [y]);
   Gl(() => (d(), () => {
@@ -28424,7 +28429,7 @@ function mB(e) {
     <${Nx}
       onClose=${t}
       onKeyup=${_e}
-      onKeydown=${ge}
+      onKeydown=${me}
       className=${i}
       position=${r}
       width=${s}
@@ -28474,11 +28479,11 @@ function mB(e) {
           `}
 
           <${dB}
-            groupedEntries=${N}
+            groupedEntries=${I}
             selectedEntry=${P}
             setSelectedEntry=${k}
             keyboardSelection=${F}
-            onAction=${fe}
+            onAction=${de}
             idPrefix=${G}
             id=${ee}
             ariaLabel=${a || "Results"}
@@ -29288,22 +29293,22 @@ function $B(e, t) {
 }
 function i1(e, t, n, i, o) {
   function r(v, b, E) {
-    var A = v.index, N = v.point, P, k, H, F, G, ee;
-    return A <= 0 || v.bendpoint ? !1 : (P = b[A - 1], k = b[A], H = Vf(P, k), F = xo(P, k), G = Math.abs(N.x - H.x), ee = Math.abs(N.y - H.y), F && G <= E && ee <= E);
+    var A = v.index, I = v.point, P, k, H, F, G, ee;
+    return A <= 0 || v.bendpoint ? !1 : (P = b[A - 1], k = b[A], H = Vf(P, k), F = xo(P, k), G = Math.abs(I.x - H.x), ee = Math.abs(I.y - H.y), F && G <= E && ee <= E);
   }
   function a(v, b) {
-    var E = v.waypoints, A, N, P, k;
+    var E = v.waypoints, A, I, P, k;
     return b.index <= 0 || b.bendpoint || (A = {
       start: E[b.index - 1],
       end: E[b.index]
-    }, N = xo(A.start, A.end), !N) ? null : (N === "h" ? P = A.end.x - A.start.x : P = A.end.y - A.start.y, k = dd(P) / 2, k);
+    }, I = xo(A.start, A.end), !I) ? null : (I === "h" ? P = A.end.x - A.start.x : P = A.end.y - A.start.y, k = dd(P) / 2, k);
   }
   function s(v, b) {
-    var E = b.waypoints, A = pd(t, E, v), N;
+    var E = b.waypoints, A = pd(t, E, v), I;
     if (A) {
-      N = a(b, A);
+      I = a(b, A);
       var P;
-      if (r(A, E, N) ? P = o.start(v, b, A.index) : P = i.start(v, b, A.index, !A.bendpoint), P !== !1)
+      if (r(A, E, I) ? P = o.start(v, b, A.index) : P = i.start(v, b, A.index, !A.bendpoint), P !== !1)
         return !0;
     }
   }
@@ -29324,13 +29329,13 @@ function i1(e, t, n, i, o) {
   }
   function p(v, b) {
     b.waypoints.forEach(function(E, A) {
-      var N = fd(v);
-      et(v, N), Ln(N, E.x, E.y);
+      var I = fd(v);
+      et(v, I), Ln(I, E.x, E.y);
     }), fd(v, "floating");
   }
   function f(v, b) {
-    for (var E = b.waypoints, A, N, P, k = 1; k < E.length; k++)
-      A = E[k - 1], N = E[k], xo(A, N) && (P = n1(v, A, N), De(P, { "data-segment-idx": k }), c(P, "mousemove", b));
+    for (var E = b.waypoints, A, I, P, k = 1; k < E.length; k++)
+      A = E[k - 1], I = E[k], xo(A, I) && (P = n1(v, A, I), De(P, { "data-segment-idx": k }), c(P, "mousemove", b));
   }
   function d(v) {
     V(Fs("." + e1, v), function(b) {
@@ -29355,7 +29360,7 @@ function i1(e, t, n, i, o) {
     E && (Ln(E, A.x, A.y), ut(E).add("positioned"));
   }
   function y(v, b, E) {
-    var A = u(b.index, v), N = E[b.index - 1], P = E[b.index], k = b.point, H = Vf(N, P), F = xo(N, P), G, ee;
+    var A = u(b.index, v), I = E[b.index - 1], P = E[b.index], k = b.point, H = Vf(I, P), F = xo(I, P), G, ee;
     A && (G = FB(A), ee = {
       x: k.x - H.x,
       y: k.y - H.y
@@ -29373,11 +29378,11 @@ function i1(e, t, n, i, o) {
     var b = v.element, E;
     b.waypoints && (E = h(b), v.add ? ut(E).add(v.marker) : ut(E).remove(v.marker));
   }), e.on("element.mousemove", function(v) {
-    var b = v.element, E = b.waypoints, A, N;
+    var b = v.element, E = b.waypoints, A, I;
     if (E) {
-      if (A = l(b, !0), N = pd(t, E, v.originalEvent), !N)
+      if (A = l(b, !0), I = pd(t, E, v.originalEvent), !I)
         return;
-      w(A, N), N.bendpoint || y(A, N, E);
+      w(A, I), I.bendpoint || y(A, I, E);
     }
   }), e.on("element.mousedown", function(v) {
     if (ur(v)) {
@@ -29569,9 +29574,9 @@ function Zx(e, t, n) {
 function a1(e, t, n, i, o, r) {
   var a = e.get("connectionDocking", !1);
   this.start = function(p, f, d) {
-    var g, h = n.getGraphics(f), m = d - 1, w = d, y = f.waypoints, v = y[m], b = y[w], E = pd(n, y, p), A, N, P;
+    var g, h = n.getGraphics(f), m = d - 1, w = d, y = f.waypoints, v = y[m], b = y[w], E = pd(n, y, p), A, I, P;
     if (A = xo(v, b), !!A)
-      return N = A === "v" ? "x" : "y", m === 0 && (v = Zx(v, f.source, N)), w === y.length - 1 && (b = Zx(b, f.target, N)), E ? P = E.point : P = {
+      return I = A === "v" ? "x" : "y", m === 0 && (v = Zx(v, f.source, I)), w === y.length - 1 && (b = Zx(b, f.target, I)), E ? P = E.point : P = {
         x: (v.x + b.x) / 2,
         y: (v.y + b.y) / 2
       }, g = {
@@ -29580,10 +29585,10 @@ function a1(e, t, n, i, o, r) {
         segmentEndIndex: w,
         segmentStart: v,
         segmentEnd: b,
-        axis: N,
+        axis: I,
         dragPosition: P
       }, i.init(p, P, "connectionSegment.move", {
-        cursor: N === "x" ? "resize-ew" : "resize-ns",
+        cursor: I === "x" ? "resize-ew" : "resize-ns",
         data: {
           connection: f,
           connectionGfx: h,
@@ -29617,10 +29622,10 @@ function a1(e, t, n, i, o, r) {
     var f = p.context, d = p.connection, g = n.getLayer("overlays");
     f.originalWaypoints = d.waypoints.slice(), f.draggerGfx = n1(g, f.segmentStart, f.segmentEnd), ut(f.draggerGfx).add("djs-dragging"), n.addMarker(d, Kx);
   }), t.on("connectionSegment.move.move", function(p) {
-    var f = p.context, d = f.connection, g = f.segmentStartIndex, h = f.segmentEndIndex, m = f.segmentStart, w = f.segmentEnd, y = f.axis, v = f.originalWaypoints.slice(), b = Xx(m, y, p["d" + y]), E = Xx(w, y, p["d" + y]), A = v.length, N = 0;
+    var f = p.context, d = f.connection, g = f.segmentStartIndex, h = f.segmentEndIndex, m = f.segmentStart, w = f.segmentEnd, y = f.axis, v = f.originalWaypoints.slice(), b = Xx(m, y, p["d" + y]), E = Xx(w, y, p["d" + y]), A = v.length, I = 0;
     v[g] = b, v[h] = E;
     var P, k;
-    g < 2 && (P = In(d.source, b), g === 1 ? P === "intersect" && (v.shift(), v[0] = b, N--) : P !== "intersect" && (v.unshift(m), N++)), h > A - 3 && (k = In(d.target, E), h === A - 2 ? k === "intersect" && (v.pop(), v[v.length - 1] = E) : k !== "intersect" && v.push(w)), f.newWaypoints = d.waypoints = s(d, v), l(f, N, p), f.newSegmentStartIndex = g + N, c(p);
+    g < 2 && (P = In(d.source, b), g === 1 ? P === "intersect" && (v.shift(), v[0] = b, I--) : P !== "intersect" && (v.unshift(m), I++)), h > A - 3 && (k = In(d.target, E), h === A - 2 ? k === "intersect" && (v.pop(), v[v.length - 1] = E) : k !== "intersect" && v.push(w)), f.newWaypoints = d.waypoints = s(d, v), l(f, I, p), f.newSegmentStartIndex = g + I, c(p);
   }), t.on("connectionSegment.move.hover", function(p) {
     p.context.hover = p.hover, n.addMarker(p.hover, Yx);
   }), t.on([
@@ -31463,14 +31468,14 @@ Ec.prototype.getContextPadEntries = function(e) {
     };
   }
   function h(v) {
-    var b = 5, E = t.getPad(v).html, A = E.getBoundingClientRect(), N = {
+    var b = 5, E = t.getPad(v).html, A = E.getBoundingClientRect(), I = {
       x: A.left,
       y: A.bottom + b
     };
-    return N;
+    return I;
   }
   function m(v, b, E, A) {
-    function N(H, F) {
+    function I(H, F) {
       var G = i.createShape(Y({ type: v }, A));
       r.start(H, G, {
         source: F
@@ -31479,7 +31484,7 @@ Ec.prototype.getContextPadEntries = function(e) {
     var P = s ? function(H, F) {
       var G = i.createShape(Y({ type: v }, A));
       s.append(F, G);
-    } : N, k = s ? function(H, F) {
+    } : I, k = s ? function(H, F) {
       return l.create(F, v, A), () => {
         l.cleanUp();
       };
@@ -31489,7 +31494,7 @@ Ec.prototype.getContextPadEntries = function(e) {
       className: b,
       title: E,
       action: {
-        dragstart: N,
+        dragstart: I,
         click: P,
         hover: k
       }
@@ -32798,11 +32803,11 @@ Mc.prototype.getEditingBBox = function(e) {
       y: b.y,
       width: 0,
       height: 0
-    }), A = l, N = jr.width * a + 2 * y;
+    }), A = l, I = jr.width * a + 2 * y;
     Y(r, {
-      width: N,
+      width: I,
       height: A + 2 * y,
-      x: E.x - N / 2,
+      x: E.x - I / 2,
       y: E.y - A / 2 - y
     }), Y(d, {
       fontSize: l + "px",