npm - @g1cloud/bpmn-modeler-next - Versions diffs - 5.0.0-beta.61 → 5.0.0-beta.62 - Mend

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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (3) hide show

package/dist/bpmn-modeler.js CHANGED Viewed

@@ -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)
@@ -1496,7 +1496,7 @@ 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) : I("unclosed cdata");
@@ -1514,7 +1514,7 @@ function lw(e) {
           continue;
         }
       }
-      if (de === 63) {
+      if (he === 63) {
         if (U = F.indexOf("?>", _e), U === -1)
           return G ? F.substring(_e) : I("unclosed question");
         if (l && (l(F.substring(_e, U + 2), p), y))
@@ -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)
+      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 I("closing tag mismatch");
         for (; Q < U; Q++)
-          if (de = F.charCodeAt(Q), !(de === 32 || de > 8 && de < 14))
+          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))
+        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 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)
+          if (he = $.indexOf(":"), he !== -1) {
+            if (Fe = b[$.substring(0, he)], !Fe)
               return I("missing namespace on <" + C + ">");
-            $ = $.substr(de + 1);
+            $ = $.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;
     }
@@ -6638,9 +6638,9 @@ function pt(e, t = {}) {
             if (se < _w) continue;
             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({
@@ -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 I = [];
   for (let ie = 1; ie < A.length; ie++)
     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, 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
+  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 I) {
-    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)
+    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) };
@@ -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";
@@ -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,23 +8807,23 @@ 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 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)) };
@@ -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,7 +8920,7 @@ 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)), N = x.lanes.reduce((T, B, L) => O.has(B.id) ? L : T, -1);
@@ -8933,10 +8933,10 @@ function qA(e, t) {
       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, N) => {
+  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" && !(N != null && N.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) {
@@ -8967,18 +8967,18 @@ function qA(e, t) {
         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) ?? N;
-            he = Z > N ? "down" : Z < N ? "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);
       }
@@ -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(N(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)
@@ -9222,14 +9222,14 @@ function qA(e, t) {
     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) * ge - O) <= ge / 2;
+    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, O) => {
+  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
     );
@@ -9260,7 +9260,7 @@ function qA(e, t) {
       return;
     }
     if (!S) return;
-    const O = ge * (_ + 1);
+    const O = me * (_ + 1);
     if (S.height >= O) return;
     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);
@@ -9284,7 +9284,7 @@ function qA(e, t) {
     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 N = Kn(0), T = U1, B = new Set(
@@ -9294,45 +9294,50 @@ function qA(e, t) {
     ), 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 < 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 >= N || oe(J.y, J.y + J.height)) continue;
-      const ye = N - J.height, Ne = S.y + S.height, ke = on(J, N);
-      Xn(Ne, S.id, ye, ke);
+      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: _ }));
@@ -9351,9 +9356,9 @@ function qA(e, t) {
     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, N = 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) ?? N, 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;
         });
       }
     }
@@ -9429,27 +9434,27 @@ function qA(e, t) {
     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,
@@ -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 && (N += 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, N), ye), !re.node.lane && Ne === void 0 && (N += 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);
       }
     }
   }
@@ -9710,14 +9715,14 @@ 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 = N(j, L) === N(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) => {
@@ -9743,8 +9748,8 @@ function qA(e, 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,13 +9778,13 @@ 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 > N && 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) => {
@@ -9950,14 +9955,14 @@ function qA(e, t) {
       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;
         }
@@ -10098,14 +10103,14 @@ function qA(e, t) {
     if (!S || !O) continue;
     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) <= ge / 5 && z.x + B.label.width > L.x ? z.x + B.label.width + 6 : void 0, X = (N.outgoing ?? []).filter(
+    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 = N.x + N.width, re = T.x + T.width <= N.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"
@@ -10127,10 +10132,10 @@ function qA(e, t) {
       return [
         ...D !== void 0 ? [{ cx: Ue, cy: D }] : [],
         ...Ct ? [{ cx: N.x - No - S.width / 2, cy: tt[0].y }] : [],
-        { cx: Ue, cy: dt + ge },
-        { cx: Ue, cy: dt - ge }
+        { 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) ?? "";
@@ -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,
+      Z + No + Ne - ge,
       [0, N.y + N.height / 2 - ke, T.y + T.height / 2 - ke],
-      ye,
+      fe,
       Z,
       N.y + N.height / 2
     ), Ce = Z + No + Ne + qe, Me = (() => {
       if (j === void 0) return 0;
-      const Oe = Z + No, St = N.y + N.height / 2 - S.height / 2, ht = { x: Oe, y: St, width: te - he, height: S.height }, Wt = g(N);
+      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 !== 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 !== N.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 !== N.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;
@@ -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 });
@@ -10462,22 +10467,22 @@ 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);
             }
           }
         }
@@ -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 = () => {
@@ -10696,7 +10701,7 @@ function qA(e, t) {
     if (S === void 0) continue;
     const O = f(x), N = O ? g(O) : void 0;
     if (!O || !N) continue;
-    const T = N.y + U + Nt(`pool:${_.node.participant ?? ""}`, S) * ge, B = T - (O.y + O.height / 2);
+    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 = () => {
@@ -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;
           }
@@ -10829,12 +10834,12 @@ function qA(e, t) {
     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 - N;
-      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;
     }
   }
@@ -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);
@@ -11028,32 +11033,32 @@ function qA(e, t) {
     }
     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((he) => he.$type === "bwl:Members"), L = ((B == null ? void 0 : B.refs) ?? "").split(" ").filter(Boolean);
+      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 = N.x, X = N.x + N.width, ne = N.y, ce = N.y + N.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) {
@@ -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]));
@@ -11249,9 +11254,9 @@ function qA(e, t) {
     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);
+      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;
     }
@@ -11289,7 +11294,7 @@ function qA(e, t) {
         (B) => B.type === "bpmn:Lane" && S >= B.y && S <= B.y + B.height
       );
       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) * ge) : x.band !== void 0 && O ? O.y + U + Nt(`pool:${O.id}`, x.band) * ge : void 0;
+      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(_, N, O, T), L = B === T ? T - S : B - (_.y + _.height / 2);
         L !== 0 && n.moveElements([_], { x: 0, y: L });
@@ -11309,7 +11314,7 @@ function qA(e, t) {
         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 - (N.y + N.height / 2)) > 1 && Oc(O);
@@ -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;
@@ -11408,22 +11413,22 @@ function KA(e, t, n) {
       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: I.x + ve * gy * ge, y: I.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 - I.x, ge = ve.y - I.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;
         }
@@ -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 });
@@ -11635,9 +11640,9 @@ function nP(e, t, n, i) {
       }
     }
     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 }, fe = We(o), ge = new Set(pt(fe).map(ft)), _e = a(fe);
+    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}`)), I = to(p), P = new Set(I.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,
@@ -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) {
@@ -11870,7 +11875,7 @@ function sP(e, t = {}) {
         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);
@@ -11902,9 +11907,9 @@ function sP(e, t = {}) {
       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 } : {} }));
+      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 && de.length === 0 && (Q.artifacts ?? []).length === 0;
+      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)
@@ -13756,13 +13761,13 @@ function t_(e, t, n, i, o, r, a, s, c, l) {
     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 - I;
-  var ee = rn.cos(I), se = rn.sin(I), 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];
+  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);
@@ -14951,21 +14956,21 @@ function a2(e) {
     l(K, Q);
   }
   function P(K, Q) {
-    V(K, function(de) {
-      Zn(de, "bpmn:Association") ? n.push(function() {
-        I(de, Q);
-      }) : I(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);
     });
   }
 }
@@ -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))
       });
@@ -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))
       });
@@ -28392,13 +28397,13 @@ function mB(e) {
     Ee < 0 && (Ee = Q.length - 1), Ee >= Q.length && (Ee = 0), F.current = !0, k(Q[Ee]);
   }, [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}
@@ -28478,7 +28483,7 @@ function mB(e) {
             selectedEntry=${P}
             setSelectedEntry=${k}
             keyboardSelection=${F}
-            onAction=${fe}
+            onAction=${de}
             idPrefix=${G}
             id=${ee}
             ariaLabel=${a || "Results"}