@g1cloud/bpmn-modeler-next 5.0.0-beta.5 → 5.0.0-beta.6

package/dist/bpmn-modeler.js

@@ -1118,9 +1118,9 @@ function ub(e) {
   }, this.ns = function(I) {
     if (typeof I > "u" && (I = {}), typeof I != "object")
       throw vr("required args <nsMap={}>");
-    var j = /* @__PURE__ */ Object.create(null), ee;
-    for (ee in I)
-      j[ee] = I[ee];
+    var j = /* @__PURE__ */ Object.create(null), J;
+    for (J in I)
+      j[J] = I[J];
     return b = !0, w = j, this;
   };
   function $() {
@@ -1142,7 +1142,7 @@ function ub(e) {
     _ = !0;
   };
   function k(I, j = !1) {
-    var ee = null, fe = null, Re, De = 0, Je = !1, Q = !1, te = 0, ue = 0, ve, K, V, ie, Me, Ae, N, R, x, G = "", q = 0, J;
+    var J = null, fe = null, Ce, De = 0, Je = !1, Z = !1, ee = 0, ue = 0, ve, K, V, ne, Ae, Pe, N, R, x, G = "", q = 0, Q;
     function Ee(bt, rn) {
       var gn = bt.indexOf(":");
       if (gn === -1)
@@ -1151,8 +1151,8 @@ function ub(e) {
       return mn ? rn === mn ? bt.substr(gn + 1) : mn + bt.substr(gn) : (T(UE(bt.substring(0, gn))), null);
     }
     function Ye() {
-      if (J !== null)
-        return J;
+      if (Q !== null)
+        return Q;
       var bt, rn, gn = b && y.xmlns, mn = b && g ? [] : null, xt = q, on = G, pn = on.length, Xr, Hn, ai, si, Wt, ci = {}, Mo = /* @__PURE__ */ new Set(), zn, rt, yt;
       e:
         for (; xt < pn; xt++)
@@ -1210,12 +1210,12 @@ function ub(e) {
       if (g)
         for (xt = 0, pn = mn.length; xt < pn; xt++)
           Wt = Ee(mn[xt++], gn), ai = mn[xt], Wt !== null && (ci[Wt] = ai);
-      return J = ci;
+      return Q = ci;
     }
     function lt() {
-      for (var bt = /(\r\n|\r|\n)/g, rn = 0, gn = 0, mn = 0, xt = ue, on, pn; te >= mn && (on = bt.exec(I), !(!on || (xt = on[0].length + on.index, xt > te))); )
+      for (var bt = /(\r\n|\r|\n)/g, rn = 0, gn = 0, mn = 0, xt = ue, on, pn; ee >= mn && (on = bt.exec(I), !(!on || (xt = on[0].length + on.index, xt > ee))); )
         rn += 1, mn = xt;
-      return te == -1 ? (gn = xt, pn = I.substring(ue)) : ue === 0 ? pn = I.substring(ue, te) : (gn = te - mn, pn = ue == -1 ? I.substring(te) : I.substring(te, ue + 1)), {
+      return ee == -1 ? (gn = xt, pn = I.substring(ue)) : ue === 0 ? pn = I.substring(ue, ee) : (gn = ee - mn, pn = ue == -1 ? I.substring(ee) : I.substring(ee, ue + 1)), {
         data: pn,
         line: rn,
         column: gn
@@ -1233,7 +1233,7 @@ function ub(e) {
         return y;
       })
     })); ue !== -1; ) {
-      if (I.charCodeAt(ue) === 60 ? te = ue : te = I.indexOf("<", ue), te === -1) {
+      if (I.charCodeAt(ue) === 60 ? ee = ue : ee = I.indexOf("<", ue), ee === -1) {
         if (j)
           return I.substring(ue);
         if (S.length)
@@ -1243,99 +1243,99 @@ function ub(e) {
         ue < I.length && I.substring(ue).trim() && T(ug);
         return;
       }
-      if (d || (d = !0), ue !== te) {
+      if (d || (d = !0), ue !== ee) {
         if (S.length) {
-          if (n && (n(I.substring(ue, te), ro, p), _))
+          if (n && (n(I.substring(ue, ee), ro, p), _))
             return;
-        } else if (I.substring(ue, te).trim() && (T(ug), _))
+        } else if (I.substring(ue, ee).trim() && (T(ug), _))
           return;
       }
-      if (ie = I.charCodeAt(te + 1), ie === 33) {
-        if (V = I.charCodeAt(te + 2), V === 91 && I.substr(te + 3, 6) === "CDATA[") {
-          if (ue = I.indexOf("]]>", te), ue === -1)
-            return j ? I.substring(te) : P("unclosed cdata");
-          if (o && (o(I.substring(te + 9, ue), p), _))
+      if (ne = I.charCodeAt(ee + 1), ne === 33) {
+        if (V = I.charCodeAt(ee + 2), V === 91 && I.substr(ee + 3, 6) === "CDATA[") {
+          if (ue = I.indexOf("]]>", ee), ue === -1)
+            return j ? I.substring(ee) : P("unclosed cdata");
+          if (o && (o(I.substring(ee + 9, ue), p), _))
             return;
           ue += 3;
           continue;
         }
-        if (V === 45 && I.charCodeAt(te + 3) === 45) {
-          if (ue = I.indexOf("-->", te), ue === -1)
-            return j ? I.substring(te) : P("unclosed comment");
-          if (c && (c(I.substring(te + 4, ue), ro, p), _))
+        if (V === 45 && I.charCodeAt(ee + 3) === 45) {
+          if (ue = I.indexOf("-->", ee), ue === -1)
+            return j ? I.substring(ee) : P("unclosed comment");
+          if (c && (c(I.substring(ee + 4, ue), ro, p), _))
             return;
           ue += 3;
           continue;
         }
       }
-      if (ie === 63) {
-        if (ue = I.indexOf("?>", te), ue === -1)
-          return j ? I.substring(te) : P("unclosed question");
-        if (l && (l(I.substring(te, ue + 2), p), _))
+      if (ne === 63) {
+        if (ue = I.indexOf("?>", ee), ue === -1)
+          return j ? I.substring(ee) : P("unclosed question");
+        if (l && (l(I.substring(ee, ue + 2), p), _))
           return;
         ue += 2;
         continue;
       }
-      for (ve = te + 1; ; ve++) {
-        if (Me = I.charCodeAt(ve), isNaN(Me))
-          return j ? I.substring(te) : (ue = -1, P("unclosed tag"));
-        if (Me === 34)
+      for (ve = ee + 1; ; ve++) {
+        if (Ae = I.charCodeAt(ve), isNaN(Ae))
+          return j ? I.substring(ee) : (ue = -1, P("unclosed tag"));
+        if (Ae === 34)
           V = I.indexOf('"', ve + 1), ve = V !== -1 ? V : ve;
-        else if (Me === 39)
+        else if (Ae === 39)
           V = I.indexOf("'", ve + 1), ve = V !== -1 ? V : ve;
-        else if (Me === 62) {
+        else if (Ae === 62) {
           ue = ve;
           break;
         }
       }
-      if (ie === 33) {
-        if (u && (u(I.substring(te, ue + 1), ro, p), _))
+      if (ne === 33) {
+        if (u && (u(I.substring(ee, ue + 1), ro, p), _))
           return;
         ue += 1;
         continue;
       }
-      if (J = {}, ie === 47) {
-        if (Je = !1, Q = !0, !S.length)
+      if (Q = {}, ne === 47) {
+        if (Je = !1, Z = !0, !S.length)
           return P("missing open tag");
-        if (ve = N = S.pop(), V = te + 2 + ve.length, I.substring(te + 2, V) !== ve)
+        if (ve = N = S.pop(), V = ee + 2 + ve.length, I.substring(ee + 2, V) !== ve)
           return P("closing tag mismatch");
         for (; V < ue; V++)
-          if (ie = I.charCodeAt(V), !(ie === 32 || ie > 8 && ie < 14))
+          if (ne = I.charCodeAt(V), !(ne === 32 || ne > 8 && ne < 14))
             return P("close tag");
       } else {
-        if (I.charCodeAt(ue - 1) === 47 ? (ve = N = I.substring(te + 1, ue - 1), Je = !0, Q = !0) : (ve = N = I.substring(te + 1, ue), Je = !0, Q = !1), !(ie > 96 && ie < 123 || ie > 64 && ie < 91 || ie === 95 || ie === 58))
+        if (I.charCodeAt(ue - 1) === 47 ? (ve = N = I.substring(ee + 1, ue - 1), Je = !0, Z = !0) : (ve = N = I.substring(ee + 1, ue), Je = !0, Z = !1), !(ne > 96 && ne < 123 || ne > 64 && ne < 91 || ne === 95 || ne === 58))
           return P("illegal first char nodeName");
         for (V = 1, K = ve.length; V < K; V++)
-          if (ie = ve.charCodeAt(V), !(ie > 96 && ie < 123 || ie > 64 && ie < 91 || ie > 47 && ie < 59 || ie === 45 || ie === 95 || ie == 46)) {
-            if (ie === 32 || ie < 14 && ie > 8) {
-              N = ve.substring(0, V), J = null;
+          if (ne = ve.charCodeAt(V), !(ne > 96 && ne < 123 || ne > 64 && ne < 91 || ne > 47 && ne < 59 || ne === 45 || ne === 95 || ne == 46)) {
+            if (ne === 32 || ne < 14 && ne > 8) {
+              N = ve.substring(0, V), Q = null;
               break;
             }
             return P("invalid nodeName");
           }
-        Q || S.push(N);
+        Z || S.push(N);
       }
       if (b) {
-        Re = y, Je && (Q || m.push(Re), J === null && (g = ve.indexOf("xmlns", V) !== -1) && (q = V, G = ve, Ye(), g = !1)), R = N, fe !== y && (ee = y[pg], ee === void 0 && (ee = y[pg] = /* @__PURE__ */ Object.create(null)), fe = y);
-        var Bt = ee[N];
+        Ce = y, Je && (Z || m.push(Ce), Q === null && (g = ve.indexOf("xmlns", V) !== -1) && (q = V, G = ve, Ye(), g = !1)), R = N, fe !== y && (J = y[pg], J === void 0 && (J = y[pg] = /* @__PURE__ */ Object.create(null)), fe = y);
+        var Bt = J[N];
         if (Bt !== void 0)
           N = Bt;
         else {
-          if (ie = N.indexOf(":"), ie !== -1) {
-            if (Ae = y[N.substring(0, ie)], !Ae)
+          if (ne = N.indexOf(":"), ne !== -1) {
+            if (Pe = y[N.substring(0, ne)], !Pe)
               return P("missing namespace on <" + R + ">");
-            N = N.substr(ie + 1);
+            N = N.substr(ne + 1);
           } else
-            Ae = y.xmlns;
-          Ae && (N = Ae + ":" + N), ee[R] = N;
+            Pe = y.xmlns;
+          Pe && (N = Pe + ":" + N), J[R] = N;
         }
       }
-      if (Je && (q = V, G = ve, i && (t ? i(x, ro, Q, p) : i(N, Ye, ro, Q, p), _)))
+      if (Je && (q = V, G = ve, i && (t ? i(x, ro, Z, p) : i(N, Ye, ro, Z, p), _)))
         return;
-      if (Q) {
+      if (Z) {
         if (r && (r(t ? x : N, ro, Je, p), _))
           return;
-        b && (Je ? y = Re : y = m.pop());
+        b && (Je ? y = Ce : y = m.pop());
       }
       ue += 1;
     }
@@ -1600,8 +1600,8 @@ pf.prototype.fromXML = function(e, t, n) {
         property: T.property,
         value: T.id
       }), I.isMany) {
-        var j = $.get(I.name), ee = j.indexOf(T);
-        ee === -1 && (ee = j.length), k ? j[ee] = k : j.splice(ee, 1);
+        var j = $.get(I.name), J = j.indexOf(T);
+        J === -1 && (J = j.length), k ? j[J] = k : j.splice(J, 1);
       } else
         $.set(I.name, k);
     }
@@ -1642,9 +1642,9 @@ pf.prototype.fromXML = function(e, t, n) {
     return S[P] = w, S;
   }, r.config && r.config.nsMap || {}));
   return s.ns(y).on("openTag", function(S, w, P, T) {
-    var $ = S.attrs || {}, k = Object.keys($).reduce(function(j, ee) {
-      var fe = w($[ee]);
-      return j[ee] = fe, j;
+    var $ = S.attrs || {}, k = Object.keys($).reduce(function(j, J) {
+      var fe = w($[J]);
+      return j[J] = fe, j;
     }, {}), I = {
       name: S.name,
       originalName: S.originalName,
@@ -6354,10 +6354,10 @@ function ht(e, t = {}) {
       for (const [w, P, T, $, k] of S) {
         const I = T === "h" ? y.x : y.y, j = T === "h" ? y.x + y.width : y.y + y.height;
         if (!(I < k && $ < j)) continue;
-        const ee = T === "h" ? y.y : y.x, fe = T === "h" ? y.y + y.height : y.x + y.width;
-        if (!(ee < P && P < fe)) continue;
-        const Re = Math.min(P - ee, fe - P);
-        Re < PS || n.push({ kind: "group-cuts-shape", group: m.id, shape: y.id, side: w, depth: Re });
+        const J = T === "h" ? y.y : y.x, fe = T === "h" ? y.y + y.height : y.x + y.width;
+        if (!(J < P && P < fe)) continue;
+        const Ce = Math.min(P - J, fe - P);
+        Ce < PS || n.push({ kind: "group-cuts-shape", group: m.id, shape: y.id, side: w, depth: Ce });
       }
     }
   const p = t.includeObservationOnly ? e.shapes.filter((m) => m.type === "bpmn:Group" && m.width > 0 && m.height > 0) : [];
@@ -6376,13 +6376,13 @@ function ht(e, t = {}) {
           });
           let k = null;
           for (const I of S) {
-            const [j, ee, fe] = I.axis === "v" ? [w.y, T, [["left", w.x], ["right", P]]] : [w.x, P, [["top", w.y], ["bottom", T]]], Re = Math.min(I.hi, ee) - Math.max(I.lo, j);
-            if (Re < Eb) continue;
+            const [j, J, fe] = I.axis === "v" ? [w.y, T, [["left", w.x], ["right", P]]] : [w.x, P, [["top", w.y], ["bottom", T]]], Ce = Math.min(I.hi, J) - Math.max(I.lo, j);
+            if (Ce < Eb) continue;
             const De = I.axis === "v" ? w.x < I.at && I.at < P : w.y < I.at && I.at < T;
             if (!(De && $))
-              for (const [Je, Q] of fe) {
-                const te = Math.abs(I.at - Q);
-                te <= Fa && (!k || te < k.distance) && (k = { side: Je, inside: De, distance: te, length: Re });
+              for (const [Je, Z] of fe) {
+                const ee = Math.abs(I.at - Z);
+                ee <= Fa && (!k || ee < k.distance) && (k = { side: Je, inside: De, distance: ee, length: Ce });
               }
           }
           k && n.push({
@@ -6418,8 +6418,8 @@ function ht(e, t = {}) {
         ["y", S.y + S.height, w.y, P],
         ["y", w.y + w.height, S.y, P]
       ];
-      for (const [k, I, j, ee] of $)
-        if (ee && Math.abs(I - j) <= fg) {
+      for (const [k, I, j, J] of $)
+        if (J && Math.abs(I - j) <= fg) {
           n.push({
             kind: "group-on-group-boundary",
             groups: S.id < w.id ? [S.id, w.id] : [w.id, S.id],
@@ -6920,17 +6920,17 @@ function uR(e, t) {
   if (!i || !r) return null;
   const o = wg(i, n), a = wg(r, n);
   if (!o || !a || o.id === a.id) return null;
-  const s = a.y > o.y, c = s ? o : a, l = s ? a : o, u = n.filter((j) => j.id !== o.id && j.id !== a.id && j.y >= c.y + c.height && j.y + j.height <= l.y).sort((j, ee) => j.y - ee.y);
+  const s = a.y > o.y, c = s ? o : a, l = s ? a : o, u = n.filter((j) => j.id !== o.id && j.id !== a.id && j.y >= c.y + c.height && j.y + j.height <= l.y).sort((j, J) => j.y - J.y);
   if (!u.length) return null;
   const p = u[0], f = u[u.length - 1], d = (c.y + c.height + p.y) / 2, h = (f.y + f.height + l.y) / 2, g = s ? d : h, b = s ? h : d, E = e.waypoints[0], _ = e.waypoints[e.waypoints.length - 1], m = hi(t), y = t.edges.filter((j) => j.id !== e.id), S = mi(e, y), w = kn(e, m).length;
   if (S === 0 && w === 0 || w === 0 && e.waypoints.length === 2) return null;
-  const P = Math.min(...u.map((j) => j.x)), T = Math.max(...u.map((j) => j.x + j.width)), $ = (E.x + _.x) / 2, k = (j) => j.filter((ee, fe) => fe === 0 || !(Pt(ee.x, j[fe - 1].x) && Pt(ee.y, j[fe - 1].y)));
+  const P = Math.min(...u.map((j) => j.x)), T = Math.max(...u.map((j) => j.x + j.width)), $ = (E.x + _.x) / 2, k = (j) => j.filter((J, fe) => fe === 0 || !(Pt(J.x, j[fe - 1].x) && Pt(J.y, j[fe - 1].y)));
   let I;
   for (let j = P; j <= T; j += lR) {
-    const ee = k([E, { x: E.x, y: g }, { x: j, y: g }, { x: j, y: b }, { x: _.x, y: b }, _]), fe = { ...e, waypoints: ee };
+    const J = k([E, { x: E.x, y: g }, { x: j, y: g }, { x: j, y: b }, { x: _.x, y: b }, _]), fe = { ...e, waypoints: J };
     if (kn(fe, m).length > 0) continue;
-    const Re = mi(fe, y), De = Math.abs(j - $);
-    (!I || Re < I.cross || Re === I.cross && De < I.detour) && (I = { pts: ee, cross: Re, detour: De });
+    const Ce = mi(fe, y), De = Math.abs(j - $);
+    (!I || Ce < I.cross || Ce === I.cross && De < I.detour) && (I = { pts: J, cross: Ce, detour: De });
   }
   return I && (w > 0 ? I.cross <= S : I.cross < S) ? I.pts : null;
 }
@@ -7077,10 +7077,10 @@ function hR(e, t) {
     if (k > m) continue;
     const I = k < m && $ === 0;
     if (!I && mi(T, o) > s) continue;
-    const j = c(w), ee = h(w);
-    if (!I && !(ee && !g) && j >= l) continue;
-    const Re = ee ? 0 : 1, De = y(w);
-    (!S || k < S.out || k === S.out && (Re < S.lane || Re === S.lane && ($ < S.opp || $ === S.opp && (j < S.sc || j === S.sc && (P < S.cost || P === S.cost && De < S.len))))) && (S = { pts: w, out: k, sc: j, lane: Re, opp: $, cost: P, len: De });
+    const j = c(w), J = h(w);
+    if (!I && !(J && !g) && j >= l) continue;
+    const Ce = J ? 0 : 1, De = y(w);
+    (!S || k < S.out || k === S.out && (Ce < S.lane || Ce === S.lane && ($ < S.opp || $ === S.opp && (j < S.sc || j === S.sc && (P < S.cost || P === S.cost && De < S.len))))) && (S = { pts: w, out: k, sc: j, lane: Ce, opp: $, cost: P, len: De });
   }
   return (S == null ? void 0 : S.pts) ?? null;
 }
@@ -7950,20 +7950,20 @@ const ol = {
 }, bn = 10, HR = 300, zR = 160, kg = 20, Og = 40, GR = 10;
 function Ep(e, t, n, i, r) {
   const o = n, a = (k, I) => {
-    const [j, ee] = ol[k];
+    const [j, J] = ol[k];
     let fe = {
       x: t.x + t.width / 2 + j * (t.width / 2 + o.width / 2 + I),
-      y: t.y + t.height / 2 + ee * (t.height / 2 + o.height / 2 + I)
+      y: t.y + t.height / 2 + J * (t.height / 2 + o.height / 2 + I)
     };
-    const Re = i.x + bn + o.width / 2, De = i.x + i.width - bn - o.width / 2, Je = i.y + bn + o.height / 2, Q = i.y + i.height - bn - o.height / 2, te = { x: Math.min(De, Math.max(Re, fe.x)), y: Math.min(Q, Math.max(Je, fe.y)) };
-    return (te.x !== fe.x || te.y !== fe.y) && (fe = Math.abs(te.x - (t.x + t.width / 2)) < (t.width + o.width) / 2 + bn && Math.abs(te.y - (t.y + t.height / 2)) < (t.height + o.height) / 2 + bn ? { x: t.x + t.width + bn + o.width / 2, y: te.y } : te), fe;
+    const Ce = i.x + bn + o.width / 2, De = i.x + i.width - bn - o.width / 2, Je = i.y + bn + o.height / 2, Z = i.y + i.height - bn - o.height / 2, ee = { x: Math.min(De, Math.max(Ce, fe.x)), y: Math.min(Z, Math.max(Je, fe.y)) };
+    return (ee.x !== fe.x || ee.y !== fe.y) && (fe = Math.abs(ee.x - (t.x + t.width / 2)) < (t.width + o.width) / 2 + bn && Math.abs(ee.y - (t.y + t.height / 2)) < (t.height + o.height) / 2 + bn ? { x: t.x + t.width + bn + o.width / 2, y: ee.y } : ee), fe;
   }, s = (i.children ?? []).filter(
     (k) => !("waypoints" in k && k.waypoints) && k.type !== "bpmn:Lane" && k.type !== "label" && typeof k.x == "number" && k.id !== r.selfId
   ), c = Xe(e), l = (k) => {
-    var j, ee;
+    var j, J;
     if (!r.selfId) return !1;
     const I = e.get(k);
-    return !!I && (((j = I.source) == null ? void 0 : j.id) === r.selfId || ((ee = I.target) == null ? void 0 : ee.id) === r.selfId);
+    return !!I && (((j = I.source) == null ? void 0 : j.id) === r.selfId || ((J = I.target) == null ? void 0 : J.id) === r.selfId);
   }, u = c.edges.filter((k) => !l(k.id)).flatMap(yn), p = Yo(c).filter((k) => k.owner !== r.selfId).map((k) => k.rect), f = (k) => ({
     x0: k.x - o.width / 2 - bn,
     x1: k.x + o.width / 2 + bn,
@@ -7992,21 +7992,21 @@ function Ep(e, t, n, i, r) {
     );
   }, _ = (k) => d(k) || h(k) || g(k) || E(k), m = (k) => k.x - o.width / 2 >= i.x && k.x + o.width / 2 <= i.x + i.width && k.y - o.height / 2 >= i.y && k.y + o.height / 2 <= i.y + i.height;
   if (r.placement) {
-    const k = (De) => De.startsWith("top") ? De.replace(/^top/, "bottom") : De.replace(/^bottom/, "top"), I = (De) => De.endsWith("left") ? De.replace(/left$/, "right") : De.replace(/right$/, "left"), j = r.placement.side, ee = [j, k(j), I(j), k(I(j)), "top", "bottom", "left", "right", "top-left", "top-right", "bottom-left", "bottom-right"], fe = r.placement.offset ?? 50;
-    let Re = a(j, fe);
-    if (_(Re)) {
+    const k = (De) => De.startsWith("top") ? De.replace(/^top/, "bottom") : De.replace(/^bottom/, "top"), I = (De) => De.endsWith("left") ? De.replace(/left$/, "right") : De.replace(/right$/, "left"), j = r.placement.side, J = [j, k(j), I(j), k(I(j)), "top", "bottom", "left", "right", "top-left", "top-right", "bottom-left", "bottom-right"], fe = r.placement.offset ?? 50;
+    let Ce = a(j, fe);
+    if (_(Ce)) {
       const De = /* @__PURE__ */ new Set();
-      for (const Je of ee) {
+      for (const Je of J) {
         if (De.has(Je)) continue;
         De.add(Je);
-        const Q = a(Je, fe);
-        if (m(Q) && !_(Q)) {
-          Re = Q;
+        const Z = a(Je, fe);
+        if (m(Z) && !_(Z)) {
+          Ce = Z;
           break;
         }
       }
     }
-    return Re;
+    return Ce;
   }
   const y = r.from, S = i.x + bn + o.width / 2, w = i.x + i.width - bn - o.width / 2, P = i.y + bn + o.height / 2, T = i.y + i.height - bn - o.height / 2;
   let $ = { x: Math.min(w, Math.max(S, y.x)), y: Math.min(T, Math.max(P, y.y)) };
@@ -8016,7 +8016,7 @@ function Ep(e, t, n, i, r) {
       { x: $.x - k, y: $.y },
       { x: $.x, y: $.y - o.height - bn },
       { x: $.x, y: $.y + o.height + bn }
-    ].filter(m).find((ee) => !_(ee));
+    ].filter(m).find((J) => !_(J));
     j && ($ = j);
   }
   return $;
@@ -8093,15 +8093,15 @@ function VR(e, t) {
       n.updateProperties(H, { id: B.id, name: B.name });
     });
   }
-  const I = 150, j = 130, ee = 80, fe = 90, Re = 180, De = 30, Je = 30, Q = (v, C, A, O, B) => {
+  const I = 150, j = 130, J = 80, fe = 90, Ce = 180, De = 30, Je = 30, Z = (v, C, A, O, B) => {
     const D = A - C.width / 2, H = O - C.height / 2;
     return (v.children ?? []).find(
       (F) => !("waypoints" in F && F.waypoints) && F.type !== "bpmn:Lane" && F.type !== "label" && !(B != null && B.has(F.id)) && typeof F.x == "number" && D < F.x + F.width + Je && D + C.width + Je > F.x && H < F.y + F.height && H + C.height > F.y
     );
-  }, te = /* @__PURE__ */ new Set();
+  }, ee = /* @__PURE__ */ new Set();
   for (const v of g) {
-    te.add(`pool:${v.participant.id}`);
-    for (const C of v.participant.lanes ?? []) te.add(C.id);
+    ee.add(`pool:${v.participant.id}`);
+    for (const C of v.participant.lanes ?? []) ee.add(C.id);
   }
   const ue = /* @__PURE__ */ new Map();
   for (const v of b) {
@@ -8111,7 +8111,7 @@ function VR(e, t) {
   }
   const ve = /* @__PURE__ */ new Map();
   for (const [v, C] of ue) {
-    if (!te.has(v)) continue;
+    if (!ee.has(v)) continue;
     const A = [...C].sort((D, H) => D - H), O = A.map((D, H) => H === 0 ? 0 : H % 2 === 1 ? Math.ceil(H / 2) : -(H / 2)), B = Math.min(...O);
     ve.set(v, new Map(A.map((D, H) => [D, O[H] - B])));
   }
@@ -8129,30 +8129,30 @@ function VR(e, t) {
           if (!Se && ge.flow.target !== X.node.id) continue;
           const st = P.get(Se ? ge.flow.target : ge.flow.source);
           if (!st || st.node.participant !== X.node.participant || !st.node.lane) continue;
-          let Te, Z = !1;
+          let Re, te = !1;
           if (st.node.lane !== C) {
-            const ce = v.get(st.node.lane);
-            if (ce === void 0) continue;
-            Te = ce > O ? "down" : "up", Z = !0;
+            const se = v.get(st.node.lane);
+            if (se === void 0) continue;
+            Re = se > O ? "down" : "up", te = !0;
           } else {
-            const ce = A.get(st.band ?? 0) ?? B;
-            Te = ce > B ? "down" : ce < B ? "up" : void 0;
+            const se = A.get(st.band ?? 0) ?? B;
+            Re = se > B ? "down" : se < B ? "up" : void 0;
           }
-          Te && (pe[Se ? "out" : "in"].add(Te), Z && pe.cross.add(Te));
+          Re && (pe[Se ? "out" : "in"].add(Re), te && pe.cross.add(Re));
         }
         for (const ge of ["up", "down"]) pe.in.has(ge) && pe.out.has(ge) && pe.cross.has(ge) && D.add(ge);
       }
       if (D.size !== 1) continue;
       const [H] = D, F = Math.max(...A.values()), L = H === "down" ? F : 0;
       if (B === L) continue;
-      const U = [...A.entries()].filter(([X]) => X !== 0).sort((X, pe) => X[1] - pe[1]), Y = [...Array(F + 1).keys()].filter((X) => X !== L), re = /* @__PURE__ */ new Map([[0, L]]);
-      U.forEach(([X], pe) => re.set(X, Y[pe])), ve.set(C, re);
+      const U = [...A.entries()].filter(([X]) => X !== 0).sort((X, pe) => X[1] - pe[1]), Y = [...Array(F + 1).keys()].filter((X) => X !== L), ie = /* @__PURE__ */ new Map([[0, L]]);
+      U.forEach(([X], pe) => ie.set(X, Y[pe])), ve.set(C, ie);
     }
   }
   const K = (v) => {
     var C;
     return (((C = ue.get(v)) == null ? void 0 : C.size) ?? 0) > 1;
-  }, V = (v) => v.band ?? (v.node.lane || !K(`pool:${v.node.participant ?? ""}`) ? void 0 : 0), ie = /* @__PURE__ */ new Map(), Me = (v) => ie.get(v.node.id) ?? V(v), Ae = /* @__PURE__ */ new Set(), N = /* @__PURE__ */ new Set();
+  }, V = (v) => v.band ?? (v.node.lane || !K(`pool:${v.node.participant ?? ""}`) ? void 0 : 0), ne = /* @__PURE__ */ new Map(), Ae = (v) => ne.get(v.node.id) ?? V(v), Pe = /* @__PURE__ */ new Set(), N = /* @__PURE__ */ new Set();
   {
     const v = /* @__PURE__ */ new Map();
     for (const O of E) v.set(O.flow.target, (v.get(O.flow.target) ?? 0) + 1);
@@ -8173,23 +8173,23 @@ function VR(e, t) {
       if (!O.node.type.endsWith("Gateway")) continue;
       const B = O.node.lane ?? `pool:${O.node.participant ?? ""}`, D = ve.get(B);
       if (!D || D.size < 2) continue;
-      const H = Me(O);
+      const H = Ae(O);
       if (H === void 0 || A(B, H) !== A(B, 0)) continue;
       const F = A(B, H), L = E.filter((ge) => ge.flow.source === O.node.id).map((ge) => P.get(ge.flow.target)).filter((ge) => !!ge && (ge.node.lane ?? `pool:${ge.node.participant ?? ""}`) === B), U = L.filter((ge) => {
-        const Se = Me(ge);
+        const Se = Ae(ge);
         return Se !== void 0 && A(B, Se) === F && (v.get(ge.node.id) ?? 0) === 1;
       }), Y = L.some((ge) => {
-        const Se = Me(ge);
+        const Se = Ae(ge);
         return Se !== void 0 && A(B, Se) > F;
       });
       if (U.length !== 1 || !Y) continue;
-      const re = new Set(L.flatMap((ge) => C(ge.node.id)));
-      if (!E.some((ge) => ge.flow.target === O.node.id && re.has(ge.flow.source))) continue;
+      const ie = new Set(L.flatMap((ge) => C(ge.node.id)));
+      if (!E.some((ge) => ge.flow.target === O.node.id && ie.has(ge.flow.source))) continue;
       const pe = /* @__PURE__ */ new Map();
       for (const [ge, Se] of D) pe.set(ge, Se + 1);
       pe.set(-1, 0), ve.set(B, pe);
-      for (const ge of C(U[0].node.id)) P.has(ge) && (ie.set(ge, -1), N.add(ge));
-      Ae.add(O.node.id);
+      for (const ge of C(U[0].node.id)) P.has(ge) && (ne.set(ge, -1), N.add(ge));
+      Pe.add(O.node.id);
     }
   }
   const R = (v, C) => {
@@ -8198,7 +8198,7 @@ function VR(e, t) {
   }, x = (v, C, A, O) => {
     const B = v ? p(v) : C ? p(C) : void 0;
     if (!B) return !1;
-    const D = v ? B.y + Math.min(B.height / 2, fe) : B.y + ee;
+    const D = v ? B.y + Math.min(B.height / 2, fe) : B.y + J;
     return Math.abs(D + R(v ?? `pool:${C ?? ""}`, A) * I - O) <= I / 2;
   }, G = /* @__PURE__ */ new Map();
   for (const [v, C] of ue) {
@@ -8206,9 +8206,9 @@ function VR(e, t) {
     for (const O of C) A = Math.max(A, R(v, O));
     G.set(v, A);
   }
-  const q = (v) => Re + I * v, J = (v, C, A) => {
+  const q = (v) => Ce + I * v, Q = (v, C, A) => {
     const O = u().children.filter(
-      (B) => !("waypoints" in B && B.waypoints) && B.id !== C && typeof B.y == "number" && B.y >= v
+      (B) => !("waypoints" in B && B.waypoints) && !(B.type === "label" && !("waypoints" in (B.labelTarget ?? {}))) && B.id !== C && typeof B.y == "number" && B.y >= v
     );
     O.length && n.moveElements(O, { x: 0, y: A });
   }, Ee = (v, C, A) => {
@@ -8217,7 +8217,7 @@ function VR(e, t) {
     const B = A + C.height / 2 + De - O.y;
     if (O.height >= B) return;
     const D = B - O.height, H = O.y + O.height;
-    n.resizeShape(O, { x: O.x, y: O.y, width: O.width, height: B }), J(H, O.id, D);
+    n.resizeShape(O, { x: O.x, y: O.y, width: O.width, height: B }), Q(H, O.id, D);
   }, Ye = (v, C) => {
     const A = C - v.height;
     if (A <= 0) return;
@@ -8233,14 +8233,14 @@ function VR(e, t) {
       const H = f(v), F = q(C);
       if (H.height >= F) return;
       const L = F - H.height, U = d(H), Y = U ? U.y + U.height : H.y + H.height;
-      Ye(H, F), J(Y, U == null ? void 0 : U.id, L);
+      Ye(H, F), Q(Y, U == null ? void 0 : U.id, L);
       return;
     }
     if (!A) return;
     const O = I * (C + 1);
     if (A.height >= O) return;
     const B = O - A.height, D = A.y + A.height;
-    n.resizeShape(A, { x: A.x, y: A.y, width: A.width, height: O }), J(D, A.id, B);
+    n.resizeShape(A, { x: A.x, y: A.y, width: A.width, height: O }), Q(D, A.id, B);
   }, Bt = /* @__PURE__ */ new Map();
   for (const v of E) Bt.set(v.flow.target, (Bt.get(v.flow.target) ?? 0) + 1);
   const bt = (v) => (Bt.get(v) ?? 0) <= 1, rn = (v, C) => {
@@ -8282,8 +8282,8 @@ function VR(e, t) {
       width: B,
       height: L,
       isExpanded: !0
-    }), Y = n.createShape(U, { x: 100 + B / 2, y: xt + L / 2 }, u()), re = C.lanes ?? [];
-    if (re.length && n.splitLane(Y, re.length), re.length) {
+    }), Y = n.createShape(U, { x: 100 + B / 2, y: xt + L / 2 }, u()), ie = C.lanes ?? [];
+    if (ie.length && n.splitLane(Y, ie.length), ie.length) {
       const X = o.filter(
         (pe) => {
           var ge;
@@ -8291,7 +8291,7 @@ function VR(e, t) {
         }
       ).sort((pe, ge) => pe.y - ge.y);
       if (X.forEach((pe, ge) => {
-        const Se = re[ge];
+        const Se = ie[ge];
         Se && n.updateProperties(pe, { id: Se.id, name: Se.name });
       }), D.some((pe) => pe !== Y.height / O)) {
         let pe = Y.y;
@@ -8341,193 +8341,193 @@ function VR(e, t) {
   for (const v of si) {
     const C = pn.get(v), A = v ? f(v) : void 0, O = A ? A.x + 150 : 250;
     let B = A ? A.y + 80 : 120;
-    const D = (Z, ce, ne) => {
-      if (Z) {
-        const he = f(Z);
-        return he.y + Math.min(he.height / 2, fe) + R(Z, ce ?? 0) * I;
-      }
-      return ce !== void 0 && A ? A.y + ee + R(`pool:${v}`, ce) * I : ne;
-    }, H = (Z, ce, ne) => {
-      if (Z) {
-        const he = f(Z);
-        return he.y + Math.min(he.height / 2, fe) + ce * I;
-      }
-      return A ? A.y + ee + ce * I : ne;
-    }, F = (Z) => Z.participant ? f(Z.participant) : u(), L = (Z, ce, ne, he, ze, Ge, wt) => {
-      const Dt = ne !== void 0 || he !== void 0, me = R(ne ?? `pool:${v}`, he ?? 0);
+    const D = (te, se, oe) => {
+      if (te) {
+        const he = f(te);
+        return he.y + Math.min(he.height / 2, fe) + R(te, se ?? 0) * I;
+      }
+      return se !== void 0 && A ? A.y + J + R(`pool:${v}`, se) * I : oe;
+    }, H = (te, se, oe) => {
+      if (te) {
+        const he = f(te);
+        return he.y + Math.min(he.height / 2, fe) + se * I;
+      }
+      return A ? A.y + J + se * I : oe;
+    }, F = (te) => te.participant ? f(te.participant) : u(), L = (te, se, oe, he, ze, Ge, wt) => {
+      const Dt = oe !== void 0 || he !== void 0, me = R(oe ?? `pool:${v}`, he ?? 0);
       if (
         // ── B-89. band 를 **줘도** 그것이 상류 행의 슬롯을 가리키면 승계한다 ──
         // 🔴 종전엔 `band === undefined` 만 승계했는데, 사람 문서에서는 *"상류와 같은 행"* 을
         // 가리키는 band 가 **아예 없다**(격자 밖 92%). ⇒ band 를 주는 것이 승계를 **끄는**
         // 부작용을 냈다(표본 65 = 에이전트가 band 3 을 정확히 계산했는데 그 때문에 30px 어긋났다).
-        (he === void 0 || x(ne, v, he, wt ?? Number.NaN)) && wt !== void 0 && gn(ne, ce, wt) && !Q(Z, ce, ze, wt)
+        (he === void 0 || x(oe, v, he, wt ?? Number.NaN)) && wt !== void 0 && gn(oe, se, wt) && !Z(te, se, ze, wt)
       )
         return { x: ze, y: wt };
       if (Dt)
         for (let de = 0; de < 4; de++) {
-          const Oe = H(ne, me + de, Ge);
-          if (!Q(Z, ce, ze, Oe, rn(ne, me + de)))
-            return lt(ne, me + de, A), { x: ze, y: Oe };
+          const Oe = H(oe, me + de, Ge);
+          if (!Z(te, se, ze, Oe, rn(oe, me + de)))
+            return lt(oe, me + de, A), { x: ze, y: Oe };
         }
-      const ye = D(ne, he, Ge);
-      Dt ? lt(ne, me, A) : Ee(Z, ce, ye);
-      let oe = ze;
+      const ye = D(oe, he, Ge);
+      Dt ? lt(oe, me, A) : Ee(te, se, ye);
+      let re = ze;
       for (let de = 0; de < 64; de++) {
-        const Oe = Q(Z, ce, oe, ye);
+        const Oe = Z(te, se, re, ye);
         if (!Oe) break;
-        oe = Oe.x + Oe.width + j + ce.width / 2;
-      }
-      return { x: oe, y: ye };
-    }, U = new Set(C.flows.map((Z) => Z.flow.target)), Y = /* @__PURE__ */ new Map(), re = (Z) => {
-      if (Z === void 0) return;
-      const ce = o.get(Z);
-      if (!(!ce || typeof ce.x != "number" || typeof ce.width != "number"))
-        return ce.x + ce.width + j;
+        re = Oe.x + Oe.width + j + se.width / 2;
+      }
+      return { x: re, y: ye };
+    }, U = new Set(C.flows.map((te) => te.flow.target)), Y = /* @__PURE__ */ new Map(), ie = (te) => {
+      if (te === void 0) return;
+      const se = o.get(te);
+      if (!(!se || typeof se.x != "number" || typeof se.width != "number"))
+        return se.x + se.width + j;
     };
-    for (const Z of C.nodes) {
-      if (U.has(Z.node.id)) continue;
-      const ce = ai(Z.node, Z.band, Z.afterColumn), ne = V(Z), he = Z.node.lane ? `${Z.node.lane}|${ne ?? ""}` : ne !== void 0 ? `band:${ne}` : "", ze = F(Z.node), Ge = Y.get(he) ?? O, wt = re(Z.afterColumn), Dt = wt === void 0 ? Ge : Math.max(Ge, wt), me = L(ze, ce, Z.node.lane, ne, Dt, B);
-      n.createShape(ce, me, ze), Y.set(he, me.x + ce.width + j), !Z.node.lane && ne === void 0 && (B += 160);
+    for (const te of C.nodes) {
+      if (U.has(te.node.id)) continue;
+      const se = ai(te.node, te.band, te.afterColumn), oe = V(te), he = te.node.lane ? `${te.node.lane}|${oe ?? ""}` : oe !== void 0 ? `band:${oe}` : "", ze = F(te.node), Ge = Y.get(he) ?? O, wt = ie(te.afterColumn), Dt = wt === void 0 ? Ge : Math.max(Ge, wt), me = L(ze, se, te.node.lane, oe, Dt, B);
+      n.createShape(se, me, ze), Y.set(he, me.x + se.width + j), !te.node.lane && oe === void 0 && (B += 160);
     }
     const X = /* @__PURE__ */ new Set(), pe = /* @__PURE__ */ new Map(), ge = /* @__PURE__ */ new Map(), Se = /* @__PURE__ */ new Map();
-    if (v && te.has(`pool:${v}`)) {
-      const Z = /* @__PURE__ */ new Map();
-      for (const me of C.flows) Z.set(me.flow.target, (Z.get(me.flow.target) ?? 0) + 1);
-      const ce = (me) => D(me.node.lane, Me(me), Number.NaN), ne = /* @__PURE__ */ new Set(), he = (me) => {
+    if (v && ee.has(`pool:${v}`)) {
+      const te = /* @__PURE__ */ new Map();
+      for (const me of C.flows) te.set(me.flow.target, (te.get(me.flow.target) ?? 0) + 1);
+      const se = (me) => D(me.node.lane, Ae(me), Number.NaN), oe = /* @__PURE__ */ new Set(), he = (me) => {
         var de;
         const ye = (de = P.get(me)) == null ? void 0 : de.node.participant;
         if (ye) return p(ye);
-        const oe = p(me);
-        if (oe)
-          return oe.type === "bpmn:Participant" ? oe : d(oe);
+        const re = p(me);
+        if (re)
+          return re.type === "bpmn:Participant" ? re : d(re);
       }, ze = (me) => {
-        const ye = [], oe = /* @__PURE__ */ new Set([me]), de = [me];
+        const ye = [], re = /* @__PURE__ */ new Set([me]), de = [me];
         for (; de.length; ) {
           const Oe = de.shift(), We = P.get(Oe);
           We && ye.push(We);
-          for (const Pe of C.flows)
-            Pe.flow.source !== Oe || oe.has(Pe.flow.target) || (Z.get(Pe.flow.target) ?? 0) !== 1 || (oe.add(Pe.flow.target), de.push(Pe.flow.target));
+          for (const Te of C.flows)
+            Te.flow.source !== Oe || re.has(Te.flow.target) || (te.get(Te.flow.target) ?? 0) !== 1 || (re.add(Te.flow.target), de.push(Te.flow.target));
         }
         return ye;
       }, Ge = (me) => {
         if (!A) return;
         const ye = new Set(me.map((Oe) => Oe.node.id));
-        let oe = !1, de = !1;
+        let re = !1, de = !1;
         for (const Oe of _) {
           if (!ye.has(Oe.flow.source)) continue;
           const We = he(Oe.flow.target);
-          !We || We.id === A.id || (We.y < A.y ? oe = !0 : de = !0);
+          !We || We.id === A.id || (We.y < A.y ? re = !0 : de = !0);
         }
-        return oe && !de ? "up" : de && !oe ? "down" : void 0;
+        return re && !de ? "up" : de && !re ? "down" : void 0;
       };
       for (const me of C.nodes) {
         if (!Wt(me.node.type)) continue;
         const ye = D(me.node.lane, V(me), Number.NaN);
         if (Number.isNaN(ye)) continue;
-        const oe = [];
-        for (const Pe of C.flows) {
-          if (Pe.flow.source !== me.node.id) continue;
-          const je = P.get(Pe.flow.target);
-          if (!je || je.node.lane !== me.node.lane || (Z.get(je.node.id) ?? 0) !== 1) continue;
+        const re = [];
+        for (const Te of C.flows) {
+          if (Te.flow.source !== me.node.id) continue;
+          const je = P.get(Te.flow.target);
+          if (!je || je.node.lane !== me.node.lane || (te.get(je.node.id) ?? 0) !== 1) continue;
           const Ke = V(je);
           if (Ke === void 0) continue;
           const xe = D(je.node.lane, Ke, Number.NaN);
           if (Number.isNaN(xe)) continue;
-          const nt = ze(je.node.id), Ce = Ge(nt);
-          Ce && oe.push({ subtree: nt, band: Ke, row: xe, dir: Ce });
+          const nt = ze(je.node.id), Me = Ge(nt);
+          Me && re.push({ subtree: nt, band: Ke, row: xe, dir: Me });
         }
-        if (!oe.some((Pe) => Pe.dir === "up") || !oe.some((Pe) => Pe.dir === "down") || !oe.some((Pe) => Pe.dir === "up" && oe.some((je) => je.dir === "down" && je.row < Pe.row))) continue;
-        const Oe = [...oe].sort((Pe, je) => Pe.row - je.row);
-        [...oe.filter((Pe) => Pe.dir === "up"), ...oe.filter((Pe) => Pe.dir === "down")].sort(
-          (Pe, je) => Pe.dir === je.dir ? Pe.row - je.row : Pe.dir === "up" ? -1 : 1
-        ).forEach((Pe, je) => {
+        if (!re.some((Te) => Te.dir === "up") || !re.some((Te) => Te.dir === "down") || !re.some((Te) => Te.dir === "up" && re.some((je) => je.dir === "down" && je.row < Te.row))) continue;
+        const Oe = [...re].sort((Te, je) => Te.row - je.row);
+        [...re.filter((Te) => Te.dir === "up"), ...re.filter((Te) => Te.dir === "down")].sort(
+          (Te, je) => Te.dir === je.dir ? Te.row - je.row : Te.dir === "up" ? -1 : 1
+        ).forEach((Te, je) => {
           const Ke = Oe[je].band;
-          if (Ke !== Pe.band) {
-            ne.add(me.node.id);
-            for (const xe of Pe.subtree) V(xe) === Pe.band && ie.set(xe.node.id, Ke);
+          if (Ke !== Te.band) {
+            oe.add(me.node.id);
+            for (const xe of Te.subtree) V(xe) === Te.band && ne.set(xe.node.id, Ke);
           }
         });
       }
       const wt = (me) => {
         if (!A) return;
         const ye = new Set(me.map((Oe) => Oe.node.id));
-        let oe = !1, de = !1;
+        let re = !1, de = !1;
         for (const Oe of _) {
           if (!ye.has(Oe.flow.target)) continue;
           const We = he(Oe.flow.source);
-          !We || We.id === A.id || (We.y < A.y ? oe = !0 : de = !0);
+          !We || We.id === A.id || (We.y < A.y ? re = !0 : de = !0);
         }
-        return oe && !de ? "up" : de && !oe ? "down" : void 0;
+        return re && !de ? "up" : de && !re ? "down" : void 0;
       };
       for (const me of C.nodes) {
         if (!Wt(me.node.type)) continue;
-        const ye = me.node.lane ?? `pool:${v}`, oe = ve.get(ye);
-        if (!oe || oe.size < 2) continue;
-        const de = oe.get(0);
+        const ye = me.node.lane ?? `pool:${v}`, re = ve.get(ye);
+        if (!re || re.size < 2) continue;
+        const de = re.get(0);
         if (de === void 0) continue;
-        const Oe = Math.max(...oe.values()), We = de === Oe && de !== 0 ? "down" : void 0;
+        const Oe = Math.max(...re.values()), We = de === Oe && de !== 0 ? "down" : void 0;
         if (!We) continue;
-        const Pe = [];
-        for (const Ce of C.flows) {
-          if (Ce.flow.source !== me.node.id) continue;
-          const _t = P.get(Ce.flow.target);
-          if (!_t || _t.node.lane !== me.node.lane || (Z.get(_t.node.id) ?? 0) !== 1) continue;
-          const gt = Me(_t);
-          gt !== void 0 && Pe.push({ t: _t, subtree: ze(_t.node.id), band: gt });
+        const Te = [];
+        for (const Me of C.flows) {
+          if (Me.flow.source !== me.node.id) continue;
+          const _t = P.get(Me.flow.target);
+          if (!_t || _t.node.lane !== me.node.lane || (te.get(_t.node.id) ?? 0) !== 1) continue;
+          const gt = Ae(_t);
+          gt !== void 0 && Te.push({ t: _t, subtree: ze(_t.node.id), band: gt });
         }
-        const je = Pe.find((Ce) => (oe.get(Ce.band) ?? Ce.band) === de);
+        const je = Te.find((Me) => (re.get(Me.band) ?? Me.band) === de);
         if (!je || wt(je.subtree) === We || Ge(je.subtree) === We) continue;
-        const Ke = Pe.find((Ce) => Ce !== je && wt(Ce.subtree) === We);
+        const Ke = Te.find((Me) => Me !== je && wt(Me.subtree) === We);
         if (!Ke) continue;
         const xe = je.band, nt = Ke.band;
-        for (const Ce of je.subtree) Me(Ce) === xe && ie.set(Ce.node.id, nt);
-        for (const Ce of Ke.subtree) Me(Ce) === nt && ie.set(Ce.node.id, xe);
-        ne.add(me.node.id);
+        for (const Me of je.subtree) Ae(Me) === xe && ne.set(Me.node.id, nt);
+        for (const Me of Ke.subtree) Ae(Me) === nt && ne.set(Me.node.id, xe);
+        oe.add(me.node.id);
       }
       for (const me of C.nodes) {
         if (!Wt(me.node.type)) continue;
-        const ye = ce(me);
+        const ye = se(me);
         if (Number.isNaN(ye) || S.some(
-          (Pe) => {
+          (Te) => {
             var je, Ke;
-            return (((je = Pe.placement) == null ? void 0 : je.anchor) ?? (Pe.association ? Pe.association.source === Pe.annotation.id ? Pe.association.target : Pe.association.source : void 0)) === me.node.id && ((Ke = Pe.placement) == null ? void 0 : Ke.side.startsWith("bottom"));
+            return (((je = Te.placement) == null ? void 0 : je.anchor) ?? (Te.association ? Te.association.source === Te.annotation.id ? Te.association.target : Te.association.source : void 0)) === me.node.id && ((Ke = Te.placement) == null ? void 0 : Ke.side.startsWith("bottom"));
           }
         )) continue;
         let de, Oe = !1, We;
-        for (const Pe of C.flows) {
-          if (Pe.flow.source !== me.node.id) continue;
-          const je = P.get(Pe.flow.target);
+        for (const Te of C.flows) {
+          if (Te.flow.source !== me.node.id) continue;
+          const je = P.get(Te.flow.target);
           if (!je || !je.node.lane && V(je) === void 0) continue;
-          const Ke = ce(je);
+          const Ke = se(je);
           Number.isNaN(Ke) || (Math.abs(Ke - ye) < 0.5 && (Oe = !0), Ke > ye ? !de || Ke > de.row ? de = { id: je.node.id, row: Ke, count: 1 } : Ke === de.row && de.count++ : Ke < ye && je.node.lane === me.node.lane && (!We || Ke > We.row ? We = { op: je, row: Ke, count: 1 } : Ke === We.row && We.count++));
         }
-        de && de.count === 1 && (Z.get(de.id) ?? 0) === 1 && !ne.has(me.node.id) && X.add(de.id), !Oe && We && We.count === 1 && (Z.get(We.op.node.id) ?? 0) === 1 && !Ae.has(me.node.id) && pe.set(We.op.node.id, { lane: me.node.lane, band: Me(me) });
+        de && de.count === 1 && (te.get(de.id) ?? 0) === 1 && !oe.has(me.node.id) && X.add(de.id), !Oe && We && We.count === 1 && (te.get(We.op.node.id) ?? 0) === 1 && !Pe.has(me.node.id) && pe.set(We.op.node.id, { lane: me.node.lane, band: Ae(me) });
       }
       const Dt = /* @__PURE__ */ new Map();
       for (const me of _) Dt.set(me.flow.target, [...Dt.get(me.flow.target) ?? [], me]);
       for (const me of C.nodes) {
         const ye = Dt.get(me.node.id);
-        if (!ye || ye.length !== 1 || !Z.get(me.node.id) || !me.node.lane && V(me) === void 0 || N.has(me.node.id)) continue;
-        const oe = (Lh = P.get(ye[0].flow.source)) == null ? void 0 : Lh.node.participant, de = oe ? p(oe) : void 0;
+        if (!ye || ye.length !== 1 || !te.get(me.node.id) || !me.node.lane && V(me) === void 0 || N.has(me.node.id)) continue;
+        const re = (Lh = P.get(ye[0].flow.source)) == null ? void 0 : Lh.node.participant, de = re ? p(re) : void 0;
         if (!de || !A || de.id === A.id) continue;
         const Oe = me.node.lane ?? `pool:${v}`, We = ve.get(Oe);
         if (!We) continue;
-        const Pe = We.get(0) ?? 0, je = (We.get(Me(me) ?? 0) ?? Pe) - Pe;
+        const Te = We.get(0) ?? 0, je = (We.get(Ae(me) ?? 0) ?? Te) - Te;
         if (je === 0) continue;
         const Ke = de.y < A.y;
         if (Ke && je < 0 || !Ke && je > 0) continue;
         let xe;
-        for (const [nt, Ce] of We) {
-          const _t = Ce - Pe;
+        for (const [nt, Me] of We) {
+          const _t = Me - Te;
           (Ke && _t < 0 && (!xe || _t < xe.row) || !Ke && _t > 0 && (!xe || _t > xe.row)) && (xe = { band: nt, row: _t });
         }
         xe && ge.set(me.node.id, { lane: me.node.lane, band: xe.band });
       }
     }
     const st = /* @__PURE__ */ new Set();
-    let Te = 0;
-    for (; Te++ < C.nodes.length + 2; ) {
-      for (let ne = 0; ne < C.nodes.length + C.flows.length + 2; ne++) {
+    let Re = 0;
+    for (; Re++ < C.nodes.length + 2; ) {
+      for (let oe = 0; oe < C.nodes.length + C.flows.length + 2; oe++) {
         let he = !1;
         for (const ze of C.flows) {
           const Ge = ze.flow;
@@ -8536,18 +8536,18 @@ function VR(e, t) {
           if (!wt) continue;
           const Dt = p(Ge.target), me = P.get(Ge.target);
           if (!Dt && me) {
-            const ye = ai(me.node, me.band), oe = Me(me);
-            if (me.node.lane || oe !== void 0) {
-              const de = F(me.node), Oe = wt, We = Oe.x + (Se.get(Ge.source) ?? 0) + Oe.width + j, Pe = pe.get(Ge.target) ?? ge.get(Ge.target), je = L(
+            const ye = ai(me.node, me.band), re = Ae(me);
+            if (me.node.lane || re !== void 0) {
+              const de = F(me.node), Oe = wt, We = Oe.x + (Se.get(Ge.source) ?? 0) + Oe.width + j, Te = pe.get(Ge.target) ?? ge.get(Ge.target), je = L(
                 de,
                 ye,
-                Pe ? Pe.lane : me.node.lane,
-                Pe ? Pe.band : oe,
+                Te ? Te.lane : me.node.lane,
+                Te ? Te.band : re,
                 X.has(Ge.target) ? Oe.x + Oe.width / 2 : We,
                 Number.NaN,
                 // B-84 ⓐ — 승격·수신 행(B-17 ⓑ · B-18 ⓐ)은 **행을 명시한 것**이라 승계 대상이 아니고,
                 // 합류(유입 ≥ 2)는 물려받을 행이 유일하지 않다(위 `inheritsRowFrom` 주석).
-                Pe || !bt(Ge.target) ? void 0 : Oe.y + Oe.height / 2
+                Te || !bt(Ge.target) ? void 0 : Oe.y + Oe.height / 2
               ), Ke = n.createShape(ye, je, de);
               X.has(Ge.target) && Se.set(Ge.target, We - (Ke.x + Ke.width / 2)), n.connect(wt, Ke, { type: "bpmn:SequenceFlow", businessObject: Hn(Ge) });
             } else
@@ -8562,12 +8562,12 @@ function VR(e, t) {
         }
         if (!he) break;
       }
-      const Z = C.nodes.filter((ne) => !p(ne.node.id));
-      if (!Z.length) break;
-      const ce = Z[0];
+      const te = C.nodes.filter((oe) => !p(oe.node.id));
+      if (!te.length) break;
+      const se = te[0];
       {
-        const ne = ai(ce.node, ce.band), he = F(ce.node), ze = V(ce);
-        n.createShape(ne, L(he, ne, ce.node.lane, ze, O, B), he), !ce.node.lane && ze === void 0 && (B += 160);
+        const oe = ai(se.node, se.band), he = F(se.node), ze = V(se);
+        n.createShape(oe, L(he, oe, se.node.lane, ze, O, B), he), !se.node.lane && ze === void 0 && (B += 160);
       }
     }
   }
@@ -8584,45 +8584,45 @@ function VR(e, t) {
     ...Xt(e, "sequenceFlow.update").map((v) => v.id),
     ...Xt(e, "messageFlow.update").map((v) => v.id)
   ].filter((v) => !!v)), k0 = (v, C, A, O, B, D) => {
-    const H = new Set(v.map((Z) => Z.id)), F = Math.min(...v.map((Z) => Z.x)) + C - rt, L = Math.max(...v.map((Z) => Z.x + Z.width)) + C + yt + rt, U = Math.min(...v.map((Z) => Z.y + Math.min(0, ...A))) - rt, Y = Math.max(...v.map((Z) => Z.y + Z.height + Math.max(0, ...A))) + rt, re = o.getAll().filter((Z) => {
-      if (Z.type !== "bpmn:SequenceFlow" && Z.type !== "bpmn:MessageFlow") return !1;
-      const ce = Z;
-      return js.has(ce.id) || !ce.waypoints || ce.waypoints.length < 2 || [ce.source, ce.target].some((he) => !he || H.has(he.id) || he.x >= O) ? !1 : ce.waypoints.some((he, ze) => {
-        const Ge = ce.waypoints[ze + 1];
+    const H = new Set(v.map((te) => te.id)), F = Math.min(...v.map((te) => te.x)) + C - rt, L = Math.max(...v.map((te) => te.x + te.width)) + C + yt + rt, U = Math.min(...v.map((te) => te.y + Math.min(0, ...A))) - rt, Y = Math.max(...v.map((te) => te.y + te.height + Math.max(0, ...A))) + rt, ie = o.getAll().filter((te) => {
+      if (te.type !== "bpmn:SequenceFlow" && te.type !== "bpmn:MessageFlow") return !1;
+      const se = te;
+      return js.has(se.id) || !se.waypoints || se.waypoints.length < 2 || [se.source, se.target].some((he) => !he || H.has(he.id) || he.x >= O) ? !1 : se.waypoints.some((he, ze) => {
+        const Ge = se.waypoints[ze + 1];
         return !!Ge && Math.max(he.x, Ge.x) >= F && Math.min(he.x, Ge.x) <= L && Math.max(he.y, Ge.y) >= U && Math.min(he.y, Ge.y) <= Y;
       });
     });
-    if (!re.length) return 0;
-    const X = (Z) => {
-      const ce = /* @__PURE__ */ new Map();
-      for (const ne of v)
+    if (!ie.length) return 0;
+    const X = (te) => {
+      const se = /* @__PURE__ */ new Map();
+      for (const oe of v)
         for (const he of A) {
-          const ze = { id: ne.id, type: ne.type, x: ne.x + C + Z, y: ne.y + he, width: ne.width, height: ne.height };
-          for (const Ge of re) {
+          const ze = { id: oe.id, type: oe.type, x: oe.x + C + te, y: oe.y + he, width: oe.width, height: oe.height };
+          for (const Ge of ie) {
             let wt = 1 / 0;
             for (let me = 0; me + 1 < Ge.waypoints.length; me++) wt = Math.min(wt, Bu(Ge.waypoints[me], Ge.waypoints[me + 1], ze));
-            const Dt = `${Ge.id}|${ne.id}`;
-            ce.set(Dt, Math.min(ce.get(Dt) ?? 1 / 0, wt));
+            const Dt = `${Ge.id}|${oe.id}`;
+            se.set(Dt, Math.min(se.get(Dt) ?? 1 / 0, wt));
           }
         }
-      return ce;
-    }, pe = [...X(0)].filter(([, Z]) => Z <= zn).map(([Z]) => Z);
+      return se;
+    }, pe = [...X(0)].filter(([, te]) => te <= zn).map(([te]) => te);
     if (!pe.length) return 0;
     let ge = 0;
-    for (let Z = 1; Z <= yt; Z++) {
-      const ce = X(Z);
-      if ([...ce.values()].every((ne) => ne > zn) && pe.every((ne) => (ce.get(ne) ?? 1 / 0) >= rt)) {
-        ge = Z;
+    for (let te = 1; te <= yt; te++) {
+      const se = X(te);
+      if ([...se.values()].every((oe) => oe > zn) && pe.every((oe) => (se.get(oe) ?? 1 / 0) >= rt)) {
+        ge = te;
         break;
       }
     }
     if (!ge) return 0;
-    const Se = Math.min(...v.map((Z) => Z.x)) + C + ge, st = new Set(pe.map((Z) => Z.slice(0, Z.indexOf("|"))));
-    return re.some(
-      (Z) => Z.type === "bpmn:SequenceFlow" && st.has(Z.id) && Z.waypoints.some((ce, ne) => {
-        const he = Z.waypoints[ne + 1];
-        if (!he || Math.min(ce.y, he.y) > D || Math.max(ce.y, he.y) < D || ce.y === he.y) return !1;
-        const ze = ce.x + (D - ce.y) * (he.x - ce.x) / (he.y - ce.y);
+    const Se = Math.min(...v.map((te) => te.x)) + C + ge, st = new Set(pe.map((te) => te.slice(0, te.indexOf("|"))));
+    return ie.some(
+      (te) => te.type === "bpmn:SequenceFlow" && st.has(te.id) && te.waypoints.some((se, oe) => {
+        const he = te.waypoints[oe + 1];
+        if (!he || Math.min(se.y, he.y) > D || Math.max(se.y, he.y) < D || se.y === he.y) return !1;
+        const ze = se.x + (D - se.y) * (he.x - se.x) / (he.y - se.y);
         return ze > B && ze < Se;
       })
     ) ? 0 : ge;
@@ -8659,10 +8659,10 @@ function VR(e, t) {
   }, ki = 30, Ki = (v) => !("waypoints" in v && v.waypoints) && v.type !== "bpmn:Lane" && v.type !== "label" && typeof v.x == "number", Hs = (v, C) => Sp(n, v, C), _a = (v, C, A = !1) => {
     const O = new Set(v.flatMap((L) => L.subtree.map((U) => U.id)));
     for (const L of v) {
-      const U = (L.pool.children ?? []).filter(Ki).filter((re) => !O.has(re.id));
+      const U = (L.pool.children ?? []).filter(Ki).filter((ie) => !O.has(ie.id));
       if (L.subtree.some(
-        (re) => U.some(
-          (X) => re.x + C < X.x + X.width + ki && re.x + C + re.width + ki > X.x && re.y < X.y + X.height && re.y + re.height > X.y
+        (ie) => U.some(
+          (X) => ie.x + C < X.x + X.width + ki && ie.x + C + ie.width + ki > X.x && ie.y < X.y + X.height && ie.y + ie.height > X.y
         )
       )) return null;
     }
@@ -8679,7 +8679,7 @@ function VR(e, t) {
       { x: C, y: 0 }
     );
     const F = v.map((L) => {
-      const Y = Math.max(...L.subtree.map((re) => re.x + re.width)) + Lb - (L.pool.x + L.pool.width);
+      const Y = Math.max(...L.subtree.map((ie) => ie.x + ie.width)) + Lb - (L.pool.x + L.pool.width);
       return Y > 0 && Hs(L.pool, L.pool.width + Y), Y;
     });
     return () => {
@@ -8696,8 +8696,8 @@ function VR(e, t) {
       for (let L = 0; L < 3; L++) {
         let U = 0;
         for (const Y of H) {
-          const re = Y.x - Y.label.x, X = Y.y - Y.label.y;
-          Math.abs(re) <= 0.5 && Math.abs(X) <= 0.5 || (n.moveElements([Y.label], { x: re, y: X }), U++);
+          const ie = Y.x - Y.label.x, X = Y.y - Y.label.y;
+          Math.abs(ie) <= 0.5 && Math.abs(X) <= 0.5 || (n.moveElements([Y.label], { x: ie, y: X }), U++);
         }
         if (!U) break;
       }
@@ -8727,9 +8727,9 @@ function VR(e, t) {
       ...O.filter((Y) => (Y.children ?? []).length > 0).map((Y) => Y.x)
     ), D = new Set(v.filter((Y) => Math.abs(Y.x - B) <= 2).map((Y) => Y.id));
     if (v.some((Y) => {
-      const re = D.has(Y.id) ? Y.x : Y.x + C, X = D.has(Y.id) ? Y.width + C : Y.width;
+      const ie = D.has(Y.id) ? Y.x : Y.x + C, X = D.has(Y.id) ? Y.width + C : Y.width;
       return O.some(
-        (pe) => re < pe.x + pe.width + ki && re + X + ki > pe.x && Y.y < pe.y + pe.height && Y.y + Y.height > pe.y
+        (pe) => ie < pe.x + pe.width + ki && ie + X + ki > pe.x && Y.y < pe.y + pe.height && Y.y + Y.height > pe.y
       );
     })) return null;
     const F = o.filter((Y) => Y.type === "label").map((Y) => ({
@@ -8738,17 +8738,17 @@ function VR(e, t) {
       y: Y.y
     })), L = v.filter((Y) => !D.has(Y.id)), U = v.filter((Y) => D.has(Y.id)).map((Y) => ({ pool: Y, was: { x: Y.x, y: Y.y, width: Y.width, height: Y.height } }));
     L.length && n.moveElements(L, { x: C, y: 0 });
-    for (const { pool: Y, was: re } of U) n.resizeShape(Y, { ...re, width: re.width + C });
+    for (const { pool: Y, was: ie } of U) n.resizeShape(Y, { ...ie, width: ie.width + C });
     return () => {
-      for (const { pool: Y, was: re } of U) n.resizeShape(Y, re);
+      for (const { pool: Y, was: ie } of U) n.resizeShape(Y, ie);
       L.length && n.moveElements(L, { x: -C, y: 0 });
       for (let Y = 0; Y < 3; Y++) {
-        let re = 0;
+        let ie = 0;
         for (const X of F) {
           const pe = X.x - X.label.x, ge = X.y - X.label.y;
-          Math.abs(pe) <= 0.5 && Math.abs(ge) <= 0.5 || (n.moveElements([X.label], { x: pe, y: ge }), re++);
+          Math.abs(pe) <= 0.5 && Math.abs(ge) <= 0.5 || (n.moveElements([X.label], { x: pe, y: ge }), ie++);
         }
-        if (!re) break;
+        if (!ie) break;
       }
     };
   }, ph = () => {
@@ -8780,7 +8780,7 @@ function VR(e, t) {
       const H = (L) => {
         if (!("waypoints" in L && L.waypoints)) return [L.id];
         const U = L, Y = [U.source, U.target];
-        return Y.some((re) => !re) ? [] : Y.map((re) => re.id);
+        return Y.some((ie) => !ie) ? [] : Y.map((ie) => ie.id);
       }, F = D.flatMap((L) => H(L));
       F.length && F.every((L) => v.has(L)) && C.push(O);
     }
@@ -8853,28 +8853,28 @@ function VR(e, t) {
     if (!B || !D || D.id === A.id) continue;
     const H = O.waypoints && O.waypoints.length >= 3 && Math.abs(O.waypoints[0].x - O.waypoints[1].x) < 1 && Math.abs(O.waypoints[0].y - O.waypoints[1].y) > 1 ? { x: O.waypoints[0].x, y: O.waypoints[0].y } : void 0, F = H ? O.waypoints[1].y : void 0, L = H && O.label ? { x: O.label.x, y: O.label.y } : void 0, U = L && O.label && Math.abs(L.y + O.label.height / 2 - F) <= I / 5 && L.x + O.label.width > H.x ? L.x + O.label.width + 6 : void 0, Y = (B.outgoing ?? []).filter(
       (xe) => xe.type === "bpmn:SequenceFlow" && xe.id !== O.id && xe.target && !js.has(xe.id)
-    ), re = new Set(Y.map((xe) => xe.target.id)), X = (xe) => {
+    ), ie = new Set(Y.map((xe) => xe.target.id)), X = (xe) => {
       const nt = { type: "bpmn:Task", x: xe.x + 2, y: xe.y + 2, width: xe.width - 4, height: xe.height - 4 };
       return Y.find(
-        (Ce) => (Ce.waypoints ?? []).some((_t, gt) => !!Ce.waypoints[gt + 1] && Bu(_t, Ce.waypoints[gt + 1], nt) === 0)
+        (Me) => (Me.waypoints ?? []).some((_t, gt) => !!Me.waypoints[gt + 1] && Bu(_t, Me.waypoints[gt + 1], nt) === 0)
       );
-    }, pe = Zr(v.target), ge = new Set(pe.map((xe) => xe.id)), Se = Math.min(...pe.map((xe) => xe.x)), st = Math.max(...pe.map((xe) => xe.x + xe.width)), Te = B.x + B.width, Z = A.y + A.height / 2, ce = k0(
+    }, pe = Zr(v.target), ge = new Set(pe.map((xe) => xe.id)), Se = Math.min(...pe.map((xe) => xe.x)), st = Math.max(...pe.map((xe) => xe.x + xe.width)), Re = B.x + B.width, te = A.y + A.height / 2, se = k0(
       pe,
-      Te + ci - Se,
-      [0, B.y + B.height / 2 - Z, D.y + D.height / 2 - Z],
+      Re + ci - Se,
+      [0, B.y + B.height / 2 - te, D.y + D.height / 2 - te],
       D.x,
-      Te,
+      Re,
       B.y + B.height / 2
-    ), ne = Te + ci + ce, he = (() => {
+    ), oe = Re + ci + se, he = (() => {
       if (U === void 0) return 0;
-      const xe = Te + ci, nt = B.y + B.height / 2 - A.height / 2, Ce = { x: xe, y: nt, width: st - Se, height: A.height }, _t = d(B);
+      const xe = Re + ci, nt = B.y + B.height / 2 - A.height / 2, Me = { x: xe, y: nt, width: st - Se, height: A.height }, _t = d(B);
       return ((_t == null ? void 0 : _t.children) ?? []).some(
-        (dt) => Ki(dt) && !ge.has(dt.id) && dt.id !== B.id && dt.id !== D.id && dt.type !== "bpmn:Group" && dt.type !== "bpmn:Participant" && dt.x < Ce.x + Ce.width && dt.x + dt.width > Ce.x && dt.y < Ce.y + Ce.height && dt.y + dt.height > Ce.y
-      ) || X(Ce) ? Math.max(0, U - xe) : 0;
-    })(), ze = st - Se + ci * 2 + ce + he - (D.x - Te);
+        (dt) => Ki(dt) && !ge.has(dt.id) && dt.id !== B.id && dt.id !== D.id && dt.type !== "bpmn:Group" && dt.type !== "bpmn:Participant" && dt.x < Me.x + Me.width && dt.x + dt.width > Me.x && dt.y < Me.y + Me.height && dt.y + dt.height > Me.y
+      ) || X(Me) ? Math.max(0, U - xe) : 0;
+    })(), ze = st - Se + ci * 2 + se + he - (D.x - Re);
     let Ge = [];
     if (ze > 0) {
-      const xe = d(A), nt = (xe == null ? void 0 : xe.children) ?? [], Ce = (Ie) => Ie.type === "bpmn:Lane";
+      const xe = d(A), nt = (xe == null ? void 0 : xe.children) ?? [], Me = (Ie) => Ie.type === "bpmn:Lane";
       Ge = (() => {
         const Ie = /* @__PURE__ */ new Set();
         for (const Ne of nt)
@@ -8888,8 +8888,8 @@ function VR(e, t) {
         return St;
       })();
       const gt = nt.filter(
-        (Ie) => !("waypoints" in Ie && Ie.waypoints) && !Ce(Ie) && Ie.type !== "label" && !ge.has(Ie.id) && Ie.id !== B.id && Ie.x >= D.x
-      ), dt = gt.flatMap((Ie) => Ie.labels ?? []), kt = xe ? [xe, ...nt.filter((Ie) => Ce(Ie))] : [];
+        (Ie) => !("waypoints" in Ie && Ie.waypoints) && !Me(Ie) && Ie.type !== "label" && !ge.has(Ie.id) && Ie.id !== B.id && Ie.x >= D.x
+      ), dt = gt.flatMap((Ie) => Ie.labels ?? []), kt = xe ? [xe, ...nt.filter((Ie) => Me(Ie))] : [];
       if (gt.length) {
         const Ie = new Set(gt.map((tt) => tt.id)), St = gh(Ie), Ne = St.length ? I0(Ie, St, xe) : null, vt = (tt) => {
           const mt = new Set(Ie);
@@ -8956,28 +8956,28 @@ function VR(e, t) {
       if (!wt) return !0;
       const nt = xe.y + xe.height / 2;
       return nt >= wt.y && nt <= wt.y + wt.height;
-    }, me = !Dt(B) && Dt(D) ? D : B, ye = me.y + me.height / 2, oe = ye - (A.y + A.height / 2), de = C.band !== void 0, Oe = de ? [A] : pe, We = (
+    }, me = !Dt(B) && Dt(D) ? D : B, ye = me.y + me.height / 2, re = ye - (A.y + A.height / 2), de = C.band !== void 0, Oe = de ? [A] : pe, We = (
       // ── B-89. 삽입도 같은 축이다 — band 가 **상류 행의 슬롯**을 가리키면 승계한다 ──
       // 🔁 「add/update 경로 갈림」의 동형이라 `freeSpot` 과 **같은 술어**를 쓴다(한쪽만 넓히면 구멍).
       (C.band === void 0 || x(C.node.lane, C.node.participant, C.band, ye)) && bt(v.target) && Oe.every(
         (xe) => {
           var nt;
-          return gn((nt = P.get(xe.id)) == null ? void 0 : nt.node.lane, xe, xe.y + xe.height / 2 + oe);
+          return gn((nt = P.get(xe.id)) == null ? void 0 : nt.node.lane, xe, xe.y + xe.height / 2 + re);
         }
       )
-    ), Pe = (xe) => Math.abs(xe.y + xe.height / 2 - (A.y + A.height / 2)) <= I / 2;
+    ), Te = (xe) => Math.abs(xe.y + xe.height / 2 - (A.y + A.height / 2)) <= I / 2;
     if (We && de) {
-      const xe = Math.abs(oe) <= I / 2 ? pe.filter((nt) => nt.id !== A.id && Pe(nt)) : [];
-      if (n.moveElements(pe, { x: ne - Se, y: 0 }), n.moveElements([A], { x: 0, y: oe }), xe.length) {
-        const nt = () => new Set(ht(Xe(o)).map((Ie) => ft(Ie))), Ce = nt(), _t = o.filter((Ie) => Ie.type === "label").map((Ie) => ({
+      const xe = Math.abs(re) <= I / 2 ? pe.filter((nt) => nt.id !== A.id && Te(nt)) : [];
+      if (n.moveElements(pe, { x: oe - Se, y: 0 }), n.moveElements([A], { x: 0, y: re }), xe.length) {
+        const nt = () => new Set(ht(Xe(o)).map((Ie) => ft(Ie))), Me = nt(), _t = o.filter((Ie) => Ie.type === "label").map((Ie) => ({
           label: Ie,
           x: Ie.x,
           y: Ie.y
         }));
-        n.moveElements(xe, { x: 0, y: oe });
-        const gt = nt(), dt = [...gt].filter((Ie) => !Ce.has(Ie)).length, kt = [...Ce].filter((Ie) => !gt.has(Ie)).length;
+        n.moveElements(xe, { x: 0, y: re });
+        const gt = nt(), dt = [...gt].filter((Ie) => !Me.has(Ie)).length, kt = [...Me].filter((Ie) => !gt.has(Ie)).length;
         if (dt > kt) {
-          n.moveElements(xe, { x: 0, y: -oe });
+          n.moveElements(xe, { x: 0, y: -re });
           for (const Ie of _t) {
             const St = Ie.x - Ie.label.x, Ne = Ie.y - Ie.label.y;
             (St !== 0 || Ne !== 0) && n.moveElements([Ie.label], { x: St, y: Ne });
@@ -8986,19 +8986,19 @@ function VR(e, t) {
       }
     } else
       n.moveElements(pe, {
-        x: ne - Se,
-        y: We ? oe : 0
+        x: oe - Se,
+        y: We ? re : 0
       });
     const je = d(A);
     if (!We && C.node.lane === void 0 && C.band !== void 0 && je) {
-      const xe = je.y + ee + R(`pool:${C.node.participant ?? ""}`, C.band) * I, nt = xe - (A.y + A.height / 2);
-      nt !== 0 && !Q(je, A, A.x + A.width / 2, xe, ge) && n.moveElements([A], { x: 0, y: nt });
+      const xe = je.y + J + R(`pool:${C.node.participant ?? ""}`, C.band) * I, nt = xe - (A.y + A.height / 2);
+      nt !== 0 && !Z(je, A, A.x + A.width / 2, xe, ge) && n.moveElements([A], { x: 0, y: nt });
     }
     if (je) {
       const xe = (je.children ?? []).filter(
         (gt) => Ki(gt) && !ge.has(gt.id) && gt.type !== "bpmn:Group" && gt.type !== "bpmn:Participant"
-      ), nt = (gt, dt, kt, Ie, St) => gt.x + dt < St.x + St.width + Ie && gt.x + dt + gt.width + Ie > St.x && gt.y + kt < St.y + St.height + Ie && gt.y + kt + gt.height + Ie > St.y, Ce = xe.find((gt) => nt(A, 0, 0, 0, gt)), _t = Ce ? void 0 : X(A);
-      if (Ce || _t) {
+      ), nt = (gt, dt, kt, Ie, St) => gt.x + dt < St.x + St.width + Ie && gt.x + dt + gt.width + Ie > St.x && gt.y + kt < St.y + St.height + Ie && gt.y + kt + gt.height + Ie > St.y, Me = xe.find((gt) => nt(A, 0, 0, 0, gt)), _t = Me ? void 0 : X(A);
+      if (Me || _t) {
         const gt = ["bpmn:SequenceFlow", "bpmn:MessageFlow", "bpmn:Association", "bpmn:DataInputAssociation", "bpmn:DataOutputAssociation"], dt = o.getAll().filter((ct) => {
           if (!gt.includes(ct.type)) return !1;
           const qt = ct;
@@ -9015,7 +9015,7 @@ function VR(e, t) {
           })
         ), St = A.y + A.height / 2, Ne = [F, D.y + D.height / 2].filter(
           (ct) => ct !== void 0 && Math.abs(ct - St) >= 1
-        ), vt = Ce && re.has(Ce.id) ? Ce : _t == null ? void 0 : _t.target, On = vt ? vt.x - A.x : 0, Bn = Math.max(...pe.map((ct) => ct.x + ct.width)), Ut = [...On !== 0 ? [On] : [], ...ce !== 0 ? [-ce] : [], 0], Us = U === void 0 ? [] : Ut.map((ct) => Math.max(ct, U - A.x)), qs = (ct) => Bn + ct + ci <= D.x, Ys = [.../* @__PURE__ */ new Set([...Us, ...Ut])].filter(qs), Sa = Ce && re.has(Ce.id) ? [Ce.x + Ce.width + ci - A.x] : [], Iu = U === void 0 ? [] : Sa.map((ct) => Math.max(ct, U - A.x)), Ks = [.../* @__PURE__ */ new Set([...Iu, ...Sa])].filter((ct) => qs(ct) && !Ys.includes(ct));
+        ), vt = Me && ie.has(Me.id) ? Me : _t == null ? void 0 : _t.target, On = vt ? vt.x - A.x : 0, Bn = Math.max(...pe.map((ct) => ct.x + ct.width)), Ut = [...On !== 0 ? [On] : [], ...se !== 0 ? [-se] : [], 0], Us = U === void 0 ? [] : Ut.map((ct) => Math.max(ct, U - A.x)), qs = (ct) => Bn + ct + ci <= D.x, Ys = [.../* @__PURE__ */ new Set([...Us, ...Ut])].filter(qs), Sa = Me && ie.has(Me.id) ? [Me.x + Me.width + ci - A.x] : [], Iu = U === void 0 ? [] : Sa.map((ct) => Math.max(ct, U - A.x)), Ks = [.../* @__PURE__ */ new Set([...Iu, ...Sa])].filter((ct) => qs(ct) && !Ys.includes(ct));
         let Ri;
         for (const ct of [Ys, Ks]) {
           for (const qt of Ne) {
@@ -9054,8 +9054,8 @@ function VR(e, t) {
       }
     }
     {
-      const xe = new Set(pe.map((dt) => dt.id)), nt = new Set(E.map((dt) => dt.flow.id)), Ce = 20, _t = (dt) => {
-        const kt = dt.source, Ie = dt.target, St = Math.min(kt.x, Ie.x) - Ce, Ne = Math.max(kt.x + kt.width, Ie.x + Ie.width) + Ce, vt = Math.min(kt.y, Ie.y) - Ce, On = Math.max(kt.y + kt.height, Ie.y + Ie.height) + Ce;
+      const xe = new Set(pe.map((dt) => dt.id)), nt = new Set(E.map((dt) => dt.flow.id)), Me = 20, _t = (dt) => {
+        const kt = dt.source, Ie = dt.target, St = Math.min(kt.x, Ie.x) - Me, Ne = Math.max(kt.x + kt.width, Ie.x + Ie.width) + Me, vt = Math.min(kt.y, Ie.y) - Me, On = Math.max(kt.y + kt.height, Ie.y + Ie.height) + Me;
         return dt.waypoints.some((Bn) => Bn.x < St || Bn.x > Ne || Bn.y < vt || Bn.y > On);
       }, gt = /* @__PURE__ */ new Map();
       for (const dt of pe)
@@ -9065,7 +9065,7 @@ function VR(e, t) {
     }
     const Ke = Ge.length ? d(Ge[0]) : void 0;
     if (Ke) {
-      const xe = { assoc: ph(), overlaps: hh(Ke), crosses: dh() }, nt = Ge.map((Ne) => ({ st: Ne, x: Ne.x })), Ce = o.filter((Ne) => Ne.type === "label").map((Ne) => ({
+      const xe = { assoc: ph(), overlaps: hh(Ke), crosses: dh() }, nt = Ge.map((Ne) => ({ st: Ne, x: Ne.x })), Me = o.filter((Ne) => Ne.type === "label").map((Ne) => ({
         label: Ne,
         x: Ne.x,
         y: Ne.y
@@ -9092,7 +9092,7 @@ function VR(e, t) {
       if (St.assoc >= xe.assoc || St.overlaps > xe.overlaps || St.crosses > xe.crosses) {
         for (const { st: Ne, x: vt } of nt) Ne.x !== vt && n.moveElements([Ne], { x: vt - Ne.x, y: 0 });
         Ie > 0 && Hs(Ke, Ke.width - Ie);
-        for (const Ne of Ce) {
+        for (const Ne of Me) {
           const vt = Ne.x - Ne.label.x, On = Ne.y - Ne.label.y;
           (vt !== 0 || On !== 0) && n.moveElements([Ne.label], { x: vt, y: On });
         }
@@ -9130,27 +9130,27 @@ function VR(e, t) {
           return (F = [...H.values()].sort((L, U) => U.n - L.n)[0]) == null ? void 0 : F.shape;
         })();
         if (D) {
-          const H = (U) => U.reduce((Y, re) => Y + re, 0) / U.length, F = H(O.map((U) => U.y + U.height / 2)) < D.y + D.height / 2, L = o.filter(
+          const H = (U) => U.reduce((Y, ie) => Y + ie, 0) / U.length, F = H(O.map((U) => U.y + U.height / 2)) < D.y + D.height / 2, L = o.filter(
             (U) => U.type === "bpmn:Participant" && U.id !== C.participant.id && U.id !== D.id
           ).filter(
             (U) => F ? U.y + U.height <= D.y + 5 : U.y >= D.y + D.height - 5
           );
           if (L.length) {
-            const U = [...L.reduce((ne, he) => ne.set(he.y, (ne.get(he.y) ?? 0) + 1), /* @__PURE__ */ new Map())].sort((ne, he) => he[1] - ne[1] || (F ? he[0] - ne[0] : ne[0] - he[0]))[0][0], Y = Math.min(A.width, HR), re = zR, X = O.map((ne) => ne.x + ne.width / 2), pe = Math.round(H(X) - Y / 2), ge = Math.max(...X) + vh, Se = (ne) => ({ x: ne, width: Math.max(Y, ge - ne) }), st = L.filter((ne) => Math.min(ne.y + ne.height, U + re) - Math.max(ne.y, U) > 0), Te = (ne) => {
-              const he = Se(ne);
+            const U = [...L.reduce((oe, he) => oe.set(he.y, (oe.get(he.y) ?? 0) + 1), /* @__PURE__ */ new Map())].sort((oe, he) => he[1] - oe[1] || (F ? he[0] - oe[0] : oe[0] - he[0]))[0][0], Y = Math.min(A.width, HR), ie = zR, X = O.map((oe) => oe.x + oe.width / 2), pe = Math.round(H(X) - Y / 2), ge = Math.max(...X) + vh, Se = (oe) => ({ x: oe, width: Math.max(Y, ge - oe) }), st = L.filter((oe) => Math.min(oe.y + oe.height, U + ie) - Math.max(oe.y, U) > 0), Re = (oe) => {
+              const he = Se(oe);
               return st.some((ze) => ze.x < he.x + he.width && he.x < ze.x + ze.width);
-            }, Z = (ne) => {
-              const he = Se(ne);
+            }, te = (oe) => {
+              const he = Se(oe);
               return X.filter((ze) => ze >= he.x + 10 && ze <= he.x + he.width - 10).length;
-            }, ce = (() => {
-              if (!Te(pe)) return pe;
-              const ne = Z(pe);
-              return st.flatMap((he) => [he.x + he.width + kg, he.x - kg - Y]).map((he) => Math.round(he)).filter((he) => !Te(he) && Z(he) >= ne).sort((he, ze) => Math.abs(he - pe) - Math.abs(ze - pe))[0] ?? pe;
+            }, se = (() => {
+              if (!Re(pe)) return pe;
+              const oe = te(pe);
+              return st.flatMap((he) => [he.x + he.width + kg, he.x - kg - Y]).map((he) => Math.round(he)).filter((he) => !Re(he) && te(he) >= oe).sort((he, ze) => Math.abs(he - pe) - Math.abs(ze - pe))[0] ?? pe;
             })();
-            if (ce !== A.x || U !== A.y || Y !== A.width || re !== A.height) {
-              const ne = () => new Set(ht(Xe(o)).map((me) => ft(me))), he = ne(), ze = { x: A.x, y: A.y, width: A.width, height: A.height };
-              n.resizeShape(A, { x: ce, y: U, width: Y, height: re });
-              const Ge = ne(), wt = [...Ge].filter((me) => !he.has(me)).length, Dt = [...he].filter((me) => !Ge.has(me)).length;
+            if (se !== A.x || U !== A.y || Y !== A.width || ie !== A.height) {
+              const oe = () => new Set(ht(Xe(o)).map((me) => ft(me))), he = oe(), ze = { x: A.x, y: A.y, width: A.width, height: A.height };
+              n.resizeShape(A, { x: se, y: U, width: Y, height: ie });
+              const Ge = oe(), wt = [...Ge].filter((me) => !he.has(me)).length, Dt = [...he].filter((me) => !Ge.has(me)).length;
               wt > Dt && n.resizeShape(A, ze);
             }
           }
@@ -9163,7 +9163,7 @@ function VR(e, t) {
           if (!H || !L || L.type === "bpmn:Participant") continue;
           const U = L.x + L.width / 2;
           if (U < A.x + 10 || U > A.x + A.width - 10) continue;
-          const Y = A.y > L.y, re = Y ? L.y + L.height : L.y, X = Y ? A.y : A.y + A.height, pe = D.flow.source === C.participant.id ? [{ x: U, y: X }, { x: U, y: re }] : [{ x: U, y: re }, { x: U, y: X }], ge = Xe(o), Se = { ...ge.edges.find((st) => st.id === D.flow.id), waypoints: pe };
+          const Y = A.y > L.y, ie = Y ? L.y + L.height : L.y, X = Y ? A.y : A.y + A.height, pe = D.flow.source === C.participant.id ? [{ x: U, y: X }, { x: U, y: ie }] : [{ x: U, y: ie }, { x: U, y: X }], ge = Xe(o), Se = { ...ge.edges.find((st) => st.id === D.flow.id), waypoints: pe };
           kn(Se, hi(ge)).length || n.updateWaypoints(H, pe);
         }
     }
@@ -9183,10 +9183,10 @@ function VR(e, t) {
       )
     ), O = o.filter((L) => !!L.waypoints), B = (L, U) => Math.abs(U.x - L.x) < 2 ? "L" : Math.abs(U.x - (L.x + L.width)) < 2 ? "R" : Math.abs(U.y - L.y) < 2 ? "T" : Math.abs(U.y - (L.y + L.height)) < 2 ? "B" : void 0, D = /* @__PURE__ */ new Map(), H = (L, U, Y) => {
       if (!L || !U || typeof L.x != "number") return;
-      const re = B(L, U);
-      if (!re) return;
+      const ie = B(L, U);
+      if (!ie) return;
       let X = D.get(L.id);
-      X || D.set(L.id, X = /* @__PURE__ */ new Map()), X.set(re, [...X.get(re) ?? [], Y]);
+      X || D.set(L.id, X = /* @__PURE__ */ new Map()), X.set(ie, [...X.get(ie) ?? [], Y]);
     };
     for (const L of O) {
       const U = L.waypoints;
@@ -9195,27 +9195,23 @@ function VR(e, t) {
     const F = /* @__PURE__ */ new Set();
     for (const [L, U] of D) {
       const Y = p(L);
-      if (!Y || typeof Y.x != "number" || ![...U.values()].some((Z) => {
-        const ce = Z.filter((ne) => ne.dir === "in");
-        return Z.length >= 3 && ce.length >= 1 && Z.some((ne) => ne.dir === "out") && ce.some((ne) => A.has(ne.id));
+      if (!Y || typeof Y.x != "number" || ![...U.values()].some((Re) => {
+        const te = Re.filter((se) => se.dir === "in");
+        return Re.length >= 3 && te.length >= 1 && Re.some((se) => se.dir === "out") && te.some((se) => A.has(se.id));
       })) continue;
       const X = d(Y);
-      if (!X || F.has(X.id) || (X.children ?? []).some((Z) => Z.type === "bpmn:Lane")) continue;
+      if (!X || F.has(X.id) || (X.children ?? []).some((Re) => Re.type === "bpmn:Lane")) continue;
       const pe = (Nh = U.get("T")) != null && Nh.length ? (Bh = U.get("B")) != null && Bh.length ? void 0 : "B" : "T";
       if (!pe || (pe === "T" ? Y.y - X.y : X.y + X.height - (Y.y + Y.height)) >= I) continue;
       const Se = (X.children ?? []).filter(
-        (Z) => !("waypoints" in Z && Z.waypoints) && Z.type !== "label" && typeof Z.x == "number"
+        (Re) => !("waypoints" in Re && Re.waypoints) && Re.type !== "label" && typeof Re.x == "number"
       ), st = X.y + X.height;
       n.resizeShape(X, {
         x: X.x,
         y: X.y,
         width: X.width,
         height: X.height + I
-      });
-      const Te = u().children.filter(
-        (Z) => !("waypoints" in Z && Z.waypoints) && Z.id !== X.id && typeof Z.y == "number" && Z.y >= st
-      );
-      Te.length && n.moveElements(Te, { x: 0, y: I }), pe === "T" && Se.length && n.moveElements(Se, { x: 0, y: I }), F.add(X.id);
+      }), Q(st, X.id, I), pe === "T" && Se.length && n.moveElements(Se, { x: 0, y: I }), F.add(X.id);
     }
   }
   const Mu = 20, xh = 4, L0 = 2, N0 = [10, 30, 80], mr = () => {
@@ -9309,8 +9305,8 @@ function VR(e, t) {
         if (L === U || O(L ? F.flow.source : F.flow.target)) continue;
         const Y = L ? F.flow.target : F.flow.source;
         if (B(Y) || !Jr(Y)) continue;
-        const re = p(F.flow.id);
-        if (!(re != null && re.waypoints) || re.waypoints.length !== 2) continue;
+        const ie = p(F.flow.id);
+        if (!(ie != null && ie.waypoints) || ie.waypoints.length !== 2) continue;
         const X = p(Y), pe = (D = P.get(Y)) == null ? void 0 : D.node.participant;
         if (!X || !pe) continue;
         const ge = Zr(Y, (Se) => Se.x >= X.x).filter((Se) => !C.has(Se.id));
@@ -9371,8 +9367,8 @@ function VR(e, t) {
     if (A === void 0) continue;
     const O = p(v), B = O ? d(O) : void 0;
     if (!O || !B) continue;
-    const D = B.y + ee + R(`pool:${C.node.participant ?? ""}`, A) * I, H = D - (O.y + O.height / 2);
-    H !== 0 && !Q(B, O, O.x + O.width / 2, D) && n.moveElements([O], { x: 0, y: H });
+    const D = B.y + J + R(`pool:${C.node.participant ?? ""}`, A) * I, H = D - (O.y + O.height / 2);
+    H !== 0 && !Z(B, O, O.x + O.width / 2, D) && n.moveElements([O], { x: 0, y: H });
   }
   for (const v of Vs.flatMap((C) => wa.get(C) ?? [])) {
     if (!zs(v.flow.id)) continue;
@@ -9404,31 +9400,31 @@ function VR(e, t) {
     for (const F of H) {
       const L = ($h = P.get(F.id)) == null ? void 0 : $h.node.participant, U = L ? p(L) : void 0;
       if (!L || !U) continue;
-      const Y = [...P.values()].filter((ce) => ce.node.participant === L).map((ce) => ce.node.id), re = (ce) => ce.map((ne) => p(ne)).filter((ne) => !!ne), pe = [O0(F.id, (ce) => {
-        var ne;
-        return ((ne = P.get(ce.id)) == null ? void 0 : ne.node.participant) === L;
-      }), re(Y)].filter((ce) => ce.length).map((ce) => [{ subtree: ce, pool: U }]);
+      const Y = [...P.values()].filter((se) => se.node.participant === L).map((se) => se.node.id), ie = (se) => se.map((oe) => p(oe)).filter((oe) => !!oe), pe = [O0(F.id, (se) => {
+        var oe;
+        return ((oe = P.get(se.id)) == null ? void 0 : oe.node.participant) === L;
+      }), ie(Y)].filter((se) => se.length).map((se) => [{ subtree: se, pool: U }]);
       if (v.preexisting) {
-        const ce = re(Y);
-        ce.length && pe.push(
+        const se = ie(Y);
+        se.length && pe.push(
           Tu(
-            /* @__PURE__ */ new Map([[L, [...ce]]]),
-            new Set(ce.map((ne) => ne.id)),
+            /* @__PURE__ */ new Map([[L, [...se]]]),
+            new Set(se.map((oe) => oe.id)),
             v.id,
             () => !1,
-            (ne) => ne === C.id || ne === A.id
+            (oe) => oe === C.id || oe === A.id
           )
         );
       }
-      const ge = F.width + j, Se = Po(v.id), st = Gs(v.id), Te = () => Po(v.id) < Se && Gs(v.id) >= st;
-      let Z = !1;
-      for (const ce of pe) {
-        for (let ne = 1; ne <= xh; ne++)
-          if (Qr(ce, ge * ne, Te)) {
-            Z = !0;
+      const ge = F.width + j, Se = Po(v.id), st = Gs(v.id), Re = () => Po(v.id) < Se && Gs(v.id) >= st;
+      let te = !1;
+      for (const se of pe) {
+        for (let oe = 1; oe <= xh; oe++)
+          if (Qr(se, ge * oe, Re)) {
+            te = !0;
             break;
           }
-        if (Z) break;
+        if (te) break;
       }
       if (!zs(v.id)) break;
     }
@@ -9448,8 +9444,8 @@ function VR(e, t) {
   }, W0 = (v, C, A, O, B) => {
     const D = v.map((U) => ({ ...U, subtree: U.subtree.filter((Y) => !B.includes(Y.id)) })).filter((U) => U.subtree.length), H = new Set(D.flatMap((U) => U.subtree.map((Y) => Y.id))), F = () => B.every((U) => {
       const Y = p(U);
-      return !!Y && E.filter((re) => re.flow.target === U && H.has(re.flow.source)).every((re) => {
-        const X = p(re.flow.source);
+      return !!Y && E.filter((ie) => ie.flow.target === U && H.has(ie.flow.source)).every((ie) => {
+        const X = p(ie.flow.source);
         return !!X && X.x + X.width <= Y.x;
       });
     });
@@ -9467,16 +9463,16 @@ function VR(e, t) {
     if (!L.length) continue;
     const U = (jh = P.get(v.flow.source)) == null ? void 0 : jh.node.participant, Y = (Hh = P.get(v.flow.target)) == null ? void 0 : Hh.node.participant;
     if (!U || !Y) continue;
-    const re = /* @__PURE__ */ new Map();
-    for (const [Se, st, Te] of [
+    const ie = /* @__PURE__ */ new Map();
+    for (const [Se, st, Re] of [
       [v.flow.source, A, U],
       [v.flow.target, O, Y]
     ]) {
-      const Z = re.get(Te) ?? [], ce = Zr(Se, (ne) => ne.x >= st.x).filter((ne) => !Z.some((he) => he.id === ne.id));
-      re.set(Te, [...Z, ...ce]);
+      const te = ie.get(Re) ?? [], se = Zr(Se, (oe) => oe.x >= st.x).filter((oe) => !te.some((he) => he.id === oe.id));
+      ie.set(Re, [...te, ...se]);
     }
-    const X = new Set([...re.values()].flat().map((Se) => Se.id)), pe = Tu(
-      re,
+    const X = new Set([...ie.values()].flat().map((Se) => Se.id)), pe = Tu(
+      ie,
       X,
       v.flow.id,
       (Se) => Se === v.flow.source || Se === v.flow.target,
@@ -9485,11 +9481,11 @@ function VR(e, t) {
     for (const Se of N0) {
       const st = ge + Se - B;
       if (st <= 0) continue;
-      const Te = mr().bad, Z = Ws();
-      let ce = [], ne = !0;
-      const he = () => !Mh(v.flow.id) || ne && (ce = V0(pe, v.flow, Z), ce.length) ? !1 : !G0(Te, Z);
+      const Re = mr().bad, te = Ws();
+      let se = [], oe = !0;
+      const he = () => !Mh(v.flow.id) || oe && (se = V0(pe, v.flow, te), se.length) ? !1 : !G0(Re, te);
       if (Qr(pe, st, he, To)) break;
-      if (ce.length && (W0(pe, st, v.flow, Z, ce) || (ne = !1, Qr(pe, st, he, To))))
+      if (se.length && (W0(pe, st, v.flow, te, se) || (oe = !1, Qr(pe, st, he, To))))
         break;
     }
   }
@@ -9510,8 +9506,8 @@ function VR(e, t) {
       if (H <= j + 1) continue;
       const F = f(O.node.participant), L = Zr(A, (X) => X.x >= B.x), U = mr(), Y = B0(L, F, -(H - j));
       if (!Y) continue;
-      const re = mr();
-      (re.bad > U.bad || re.crossings >= U.crossings || re.straight < U.straight) && Y();
+      const ie = mr();
+      (ie.bad > U.bad || ie.crossings >= U.crossings || ie.straight < U.straight) && Y();
     }
   }
   bh(!0);
@@ -9555,12 +9551,12 @@ function VR(e, t) {
   const eo = 10, Ph = 40, Z0 = (v, C) => {
     const A = C.map((L) => d(L)).filter((L) => !!L);
     for (const L of A) {
-      const U = eo, Y = L.y, re = L.y + L.height, X = L.x, pe = L.x + L.width;
+      const U = eo, Y = L.y, ie = L.y + L.height, X = L.x, pe = L.x + L.width;
       if (Math.abs(v.y - Y) < U) {
         const ge = Y + U - v.y;
         v.y += ge, v.height -= ge;
       }
-      if (Math.abs(v.y + v.height - re) < U && (v.height = re - U - v.y), Math.abs(v.x - X) < U) {
+      if (Math.abs(v.y + v.height - ie) < U && (v.height = ie - U - v.y), Math.abs(v.x - X) < U) {
         const ge = X + U - v.x;
         v.x += ge, v.width -= ge;
       }
@@ -9578,7 +9574,7 @@ function VR(e, t) {
       (D) => D.type === "bpmn:Group" && D.id !== C
     );
     for (const D of B) {
-      const H = D.x, F = D.x + D.width, L = D.y, U = D.y + D.height, Y = v.y < U && L < v.y + v.height, re = v.x < F && H < v.x + v.width;
+      const H = D.x, F = D.x + D.width, L = D.y, U = D.y + D.height, Y = v.y < U && L < v.y + v.height, ie = v.x < F && H < v.x + v.width;
       if (Y) {
         if (Math.abs(v.x - F) < A) {
           const X = Math.min(F + A - v.x, O);
@@ -9589,7 +9585,7 @@ function VR(e, t) {
           X > 0 && v.width - X > 0 && (v.width -= X);
         }
       }
-      if (re) {
+      if (ie) {
         if (Math.abs(v.y - U) < A) {
           const X = Math.min(U + A - v.y, O);
           X > 0 && v.height - X > 0 && (v.y += X, v.height -= X);
@@ -9630,76 +9626,76 @@ function VR(e, t) {
     }
     const O = o.filter((B) => B.type === "bpmn:Group");
     for (const B of O) {
-      const H = (((qh = B.businessObject.extensionElements) == null ? void 0 : qh.values) ?? []).find((Te) => Te.$type === "bwl:Members"), F = ((H == null ? void 0 : H.refs) ?? "").split(" ").filter(Boolean);
+      const H = (((qh = B.businessObject.extensionElements) == null ? void 0 : qh.values) ?? []).find((Re) => Re.$type === "bwl:Members"), F = ((H == null ? void 0 : H.refs) ?? "").split(" ").filter(Boolean);
       if (!F.length) continue;
       const L = new Set(F), U = [...F];
       for (; U.length; ) {
-        const Te = U.shift();
-        for (const Z of C.get(Te) ?? []) L.has(Z) || (L.add(Z), U.push(Z));
-      }
-      const Y = B.x, re = B.x + B.width, X = B.y, pe = B.y + B.height, ge = (Te) => E.filter((Z) => Z.flow.target === Te).length, Se = (Te) => {
-        var ce;
-        const Z = ((ce = p(Te)) == null ? void 0 : ce.type) ?? "";
-        if (Z === "bpmn:StartEvent" && ge(Te) === 0) return !1;
-        if (Z.endsWith("Gateway")) {
-          const ne = E.filter((he) => he.flow.target === Te).map((he) => he.flow.source);
-          if (ne.length && ne.every((he) => {
+        const Re = U.shift();
+        for (const te of C.get(Re) ?? []) L.has(te) || (L.add(te), U.push(te));
+      }
+      const Y = B.x, ie = B.x + B.width, X = B.y, pe = B.y + B.height, ge = (Re) => E.filter((te) => te.flow.target === Re).length, Se = (Re) => {
+        var se;
+        const te = ((se = p(Re)) == null ? void 0 : se.type) ?? "";
+        if (te === "bpmn:StartEvent" && ge(Re) === 0) return !1;
+        if (te.endsWith("Gateway")) {
+          const oe = E.filter((he) => he.flow.target === Re).map((he) => he.flow.source);
+          if (oe.length && oe.every((he) => {
             var ze;
             return ((ze = p(he)) == null ? void 0 : ze.type) === "bpmn:StartEvent" && ge(he) === 0;
           }))
             return !1;
         }
         return !0;
-      }, st = o.filter((Te) => Ki(Te)).filter(
-        (Te) => Te.type !== "bpmn:Group" && Te.type !== "bpmn:Participant" && Te.type !== "bpmn:TextAnnotation" && !L.has(Te.id) && Jr(Te.id) && Se(Te.id) && Te.x < re && Te.x + Te.width > Y && Te.y < pe && Te.y + Te.height > X
+      }, st = o.filter((Re) => Ki(Re)).filter(
+        (Re) => Re.type !== "bpmn:Group" && Re.type !== "bpmn:Participant" && Re.type !== "bpmn:TextAnnotation" && !L.has(Re.id) && Jr(Re.id) && Se(Re.id) && Re.x < ie && Re.x + Re.width > Y && Re.y < pe && Re.y + Re.height > X
       );
       if (st.length)
-        for (const Te of [-1, 1]) {
-          const Z = st.filter((ye) => (ye.x + ye.width - Y <= re - ye.x ? -1 : 1) === Te);
-          if (!Z.length) continue;
-          const ce = [];
-          for (const ye of Z) {
-            const oe = ce.find((de) => de.some((Oe) => ye.y < Oe.y + Oe.height && ye.y + ye.height > Oe.y));
-            oe ? oe.push(ye) : ce.push([ye]);
+        for (const Re of [-1, 1]) {
+          const te = st.filter((ye) => (ye.x + ye.width - Y <= ie - ye.x ? -1 : 1) === Re);
+          if (!te.length) continue;
+          const se = [];
+          for (const ye of te) {
+            const re = se.find((de) => de.some((Oe) => ye.y < Oe.y + Oe.height && ye.y + ye.height > Oe.y));
+            re ? re.push(ye) : se.push([ye]);
           }
-          const ne = /* @__PURE__ */ new Map();
-          for (const ye of ce) {
-            let oe = Te < 0 ? Y - eo : re + eo;
-            for (const de of [...ye].sort((Oe, We) => Te < 0 ? We.x - Oe.x : Oe.x - We.x)) {
-              const Oe = Te < 0 ? Math.min(de.x, oe - de.width) : Math.max(de.x, oe);
-              oe = Te < 0 ? Oe - ki : Oe + de.width + ki, Oe !== de.x && Math.sign(Oe - de.x) === Te && ne.set(de.id, Oe - de.x);
+          const oe = /* @__PURE__ */ new Map();
+          for (const ye of se) {
+            let re = Re < 0 ? Y - eo : ie + eo;
+            for (const de of [...ye].sort((Oe, We) => Re < 0 ? We.x - Oe.x : Oe.x - We.x)) {
+              const Oe = Re < 0 ? Math.min(de.x, re - de.width) : Math.max(de.x, re);
+              re = Re < 0 ? Oe - ki : Oe + de.width + ki, Oe !== de.x && Math.sign(Oe - de.x) === Re && oe.set(de.id, Oe - de.x);
             }
           }
           const he = /* @__PURE__ */ new Map(), ze = (ye) => he.get(ye) === ye || !he.get(ye) ? ye : ze(he.get(ye));
-          for (const ye of Z) he.set(ye.id, ye.id);
+          for (const ye of te) he.set(ye.id, ye.id);
           for (const ye of _) {
-            const oe = ne.has(ye.flow.source) ? ye.flow.source : void 0, de = ne.has(ye.flow.target) ? ye.flow.target : void 0;
-            if (!oe || !de) continue;
+            const re = oe.has(ye.flow.source) ? ye.flow.source : void 0, de = oe.has(ye.flow.target) ? ye.flow.target : void 0;
+            if (!re || !de) continue;
             const Oe = p(ye.flow.id);
-            ((Yh = Oe == null ? void 0 : Oe.waypoints) == null ? void 0 : Yh.length) === 2 && he.set(ze(oe), ze(de));
+            ((Yh = Oe == null ? void 0 : Oe.waypoints) == null ? void 0 : Yh.length) === 2 && he.set(ze(re), ze(de));
           }
           const Ge = /* @__PURE__ */ new Map();
-          for (const ye of Z) {
-            if (!ne.has(ye.id)) continue;
-            const oe = ze(ye.id);
-            Ge.set(oe, [...Ge.get(oe) ?? [], ye]);
+          for (const ye of te) {
+            if (!oe.has(ye.id)) continue;
+            const re = ze(ye.id);
+            Ge.set(re, [...Ge.get(re) ?? [], ye]);
           }
           const wt = [...Ge.values()].sort(
-            (ye, oe) => Te < 0 ? Math.min(...ye.map((de) => de.x)) - Math.min(...oe.map((de) => de.x)) : Math.max(...oe.map((de) => de.x)) - Math.max(...ye.map((de) => de.x))
+            (ye, re) => Re < 0 ? Math.min(...ye.map((de) => de.x)) - Math.min(...re.map((de) => de.x)) : Math.max(...re.map((de) => de.x)) - Math.max(...ye.map((de) => de.x))
           ), Dt = [];
           let me = !0;
           for (const ye of wt) {
-            const oe = ye.map((We) => ne.get(We.id) ?? 0).reduce((We, Pe) => Math.abs(Pe) > Math.abs(We) ? Pe : We, 0), de = /* @__PURE__ */ new Map();
+            const re = ye.map((We) => oe.get(We.id) ?? 0).reduce((We, Te) => Math.abs(Te) > Math.abs(We) ? Te : We, 0), de = /* @__PURE__ */ new Map();
             let Oe = !0;
             for (const We of ye) {
-              const Pe = d(We);
-              if (!Pe) {
+              const Te = d(We);
+              if (!Te) {
                 Oe = !1;
                 break;
               }
-              de.has(Pe.id) || de.set(Pe.id, { subtree: [], pool: Pe }), de.get(Pe.id).subtree.push(We);
+              de.has(Te.id) || de.set(Te.id, { subtree: [], pool: Te }), de.get(Te.id).subtree.push(We);
             }
-            Oe && Qr([...de.values()], oe, () => !0, To) ? Dt.push({ shapes: ye, dx: oe }) : me = !1;
+            Oe && Qr([...de.values()], re, () => !0, To) ? Dt.push({ shapes: ye, dx: re }) : me = !1;
           }
           if (!me)
             for (const ye of Dt.reverse()) n.moveElements(ye.shapes, { x: -ye.dx, y: 0 });
@@ -9733,40 +9729,40 @@ function VR(e, t) {
       const L = ((U = p(F)) == null ? void 0 : U.type) ?? "";
       if (L === "bpmn:StartEvent" && D(F) === 0) return !1;
       if (L.endsWith("Gateway")) {
-        const Y = E.filter((re) => re.flow.target === F).map((re) => re.flow.source);
-        if (Y.length && Y.every((re) => {
+        const Y = E.filter((ie) => ie.flow.target === F).map((ie) => ie.flow.source);
+        if (Y.length && Y.every((ie) => {
           var X;
-          return ((X = p(re)) == null ? void 0 : X.type) === "bpmn:StartEvent" && D(re) === 0;
+          return ((X = p(ie)) == null ? void 0 : X.type) === "bpmn:StartEvent" && D(ie) === 0;
         }))
           return !1;
       }
       return !0;
     };
     for (const F of o.filter((L) => L.type === "bpmn:Group")) {
-      const U = (((eg = F.businessObject.extensionElements) == null ? void 0 : eg.values) ?? []).find((oe) => oe.$type === "bwl:Members"), Y = ((U == null ? void 0 : U.refs) ?? "").split(" ").filter(Boolean);
+      const U = (((eg = F.businessObject.extensionElements) == null ? void 0 : eg.values) ?? []).find((re) => re.$type === "bwl:Members"), Y = ((U == null ? void 0 : U.refs) ?? "").split(" ").filter(Boolean);
       if (!Y.length) continue;
-      const re = Y.map(p).filter((oe) => !!oe);
-      if (!re.length || !(w.some((oe) => oe.group.id === F.id) || Xt(e, "group.update").some((oe) => oe.id === F.id) || re.some((oe) => {
-        const de = h.get(oe.id);
-        return !de || de.x !== oe.x || de.y !== oe.y;
+      const ie = Y.map(p).filter((re) => !!re);
+      if (!ie.length || !(w.some((re) => re.group.id === F.id) || Xt(e, "group.update").some((re) => re.id === F.id) || ie.some((re) => {
+        const de = h.get(re.id);
+        return !de || de.x !== re.x || de.y !== re.y;
       }))) continue;
       const pe = new Set(Y), ge = [...Y];
       for (; ge.length; ) {
-        const oe = ge.shift();
-        for (const de of O.get(oe) ?? []) pe.has(de) || (pe.add(de), ge.push(de));
+        const re = ge.shift();
+        for (const de of O.get(re) ?? []) pe.has(de) || (pe.add(de), ge.push(de));
       }
-      const Se = F.x, st = F.x + F.width, Te = F.y, Z = F.y + F.height, ce = (oe) => {
-        const de = C.get(oe.id), Oe = { x: oe.x, y: oe.y, width: oe.width, height: oe.height };
+      const Se = F.x, st = F.x + F.width, Re = F.y, te = F.y + F.height, se = (re) => {
+        const de = C.get(re.id), Oe = { x: re.x, y: re.y, width: re.width, height: re.height };
         return de ? [Oe, { x: de.x, y: de.y, width: de.width, height: de.height }] : [Oe];
-      }, ne = re.flatMap(ce), he = Math.min(...ne.map((oe) => oe.x)), ze = Math.max(...ne.map((oe) => oe.x + oe.width)), Ge = Math.min(...ne.map((oe) => oe.y)), wt = Math.max(...ne.map((oe) => oe.y + oe.height)), Dt = { L: he - Se, R: st - ze, T: Ge - Te, B: Z - wt }, me = o.filter((oe) => Ki(oe)).filter(
-        (oe) => oe.type !== "bpmn:Group" && oe.type !== "bpmn:Participant" && oe.type !== "bpmn:TextAnnotation" && !pe.has(oe.id) && H(oe.id) && oe.x < st && oe.x + oe.width > Se && oe.y < Z && oe.y + oe.height > Te
+      }, oe = ie.flatMap(se), he = Math.min(...oe.map((re) => re.x)), ze = Math.max(...oe.map((re) => re.x + re.width)), Ge = Math.min(...oe.map((re) => re.y)), wt = Math.max(...oe.map((re) => re.y + re.height)), Dt = { L: he - Se, R: st - ze, T: Ge - Re, B: te - wt }, me = o.filter((re) => Ki(re)).filter(
+        (re) => re.type !== "bpmn:Group" && re.type !== "bpmn:Participant" && re.type !== "bpmn:TextAnnotation" && !pe.has(re.id) && H(re.id) && re.x < st && re.x + re.width > Se && re.y < te && re.y + re.height > Re
       );
       if (!me.length) continue;
       const ye = { L: 0, R: 0, T: 0, B: 0 };
-      for (const oe of me) {
-        const de = ce(oe), Oe = Math.min(...de.map((Ce) => Ce.x)), We = Math.max(...de.map((Ce) => Ce.x + Ce.width)), Pe = Math.min(...de.map((Ce) => Ce.y)), je = Math.max(...de.map((Ce) => Ce.y + Ce.height)), Ke = { L: We - Se, R: st - Oe, T: je - Te, B: Z - Pe }, xe = ["L", "R", "T", "B"].filter((Ce) => Ke[Ce] <= Dt[Ce] + 1e-3);
+      for (const re of me) {
+        const de = se(re), Oe = Math.min(...de.map((Me) => Me.x)), We = Math.max(...de.map((Me) => Me.x + Me.width)), Te = Math.min(...de.map((Me) => Me.y)), je = Math.max(...de.map((Me) => Me.y + Me.height)), Ke = { L: We - Se, R: st - Oe, T: je - Re, B: te - Te }, xe = ["L", "R", "T", "B"].filter((Me) => Ke[Me] <= Dt[Me] + 1e-3);
         if (!xe.length) continue;
-        const nt = xe.reduce((Ce, _t) => Ke[_t] < Ke[Ce] ? _t : Ce, xe[0]);
+        const nt = xe.reduce((Me, _t) => Ke[_t] < Ke[Me] ? _t : Me, xe[0]);
         ye[nt] = Math.max(ye[nt], Math.min(Ke[nt] + 10, Dt[nt]));
       }
       !ye.L && !ye.R && !ye.T && !ye.B || n.resizeShape(F, {
@@ -9796,10 +9792,10 @@ function VR(e, t) {
     const C = v.association, A = ((tg = v.placement) == null ? void 0 : tg.anchor) ?? (C ? C.source === v.annotation.id ? C.target : C.source : void 0), O = A ? p(A) : void 0, B = O ? Th(O) : void 0, D = tE(v.annotation.text ?? "");
     let H;
     if (B && v.placement) {
-      const [Y, re] = ol[v.placement.side], X = v.placement.offset ?? 50;
+      const [Y, ie] = ol[v.placement.side], X = v.placement.offset ?? 50;
       H = {
         x: B.x + B.width / 2 + Y * (B.width / 2 + D.width / 2 + X),
-        y: B.y + B.height / 2 + re * (B.height / 2 + D.height / 2 + X)
+        y: B.y + B.height / 2 + ie * (B.height / 2 + D.height / 2 + X)
       };
     } else B ? (H = {
       x: B.x + B.width / 2 + 180 + Ea % 3 * 260,
@@ -9821,7 +9817,7 @@ function VR(e, t) {
       F
     );
     if (C) {
-      const Y = (re) => re === v.annotation.id ? U : f(re);
+      const Y = (ie) => ie === v.annotation.id ? U : f(ie);
       n.connect(
         Y(C.source),
         Y(C.target),
@@ -9877,7 +9873,7 @@ function VR(e, t) {
         (H) => H.type === "bpmn:Lane" && A >= H.y && A <= H.y + H.height
       );
       v.band !== void 0 && lt(B == null ? void 0 : B.id, v.band, O);
-      const D = B ? B.y + (v.band === void 0 ? B.height / 2 : Math.min(B.height / 2, fe) + R(B.id, v.band) * I) : v.band !== void 0 && O ? O.y + ee + R(`pool:${O.id}`, v.band) * I : void 0;
+      const D = B ? B.y + (v.band === void 0 ? B.height / 2 : Math.min(B.height / 2, fe) + R(B.id, v.band) * I) : v.band !== void 0 && O ? O.y + J + R(`pool:${O.id}`, v.band) * I : void 0;
       if (D !== void 0) {
         const H = D - A;
         H !== 0 && n.moveElements([C], { x: 0, y: H });
@@ -9894,7 +9890,7 @@ function VR(e, t) {
         n.updateWaypoints(A, [H.exit, { x: H.exit.x, y: F }, { x: B.x, y: F }]);
         const L = A.label;
         if (L && H.label) {
-          const Y = Math.abs(H.label.y + L.height / 2 - H.channelY) <= I / 5 && H.label.x + L.width > H.exit.x, re = H.exit.x + 6, X = B.x - 6 - L.width, pe = Y ? X >= re ? { x: Math.max(re, Math.min(H.label.x, X)), y: H.label.y + (F - H.channelY) } : void 0 : H.label;
+          const Y = Math.abs(H.label.y + L.height / 2 - H.channelY) <= I / 5 && H.label.x + L.width > H.exit.x, ie = H.exit.x + 6, X = B.x - 6 - L.width, pe = Y ? X >= ie ? { x: Math.max(ie, Math.min(H.label.x, X)), y: H.label.y + (F - H.channelY) } : void 0 : H.label;
           pe && (pe.x !== L.x || pe.y !== L.y) && n.moveElements([L], { x: pe.x - L.x, y: pe.y - L.y });
         }
       } else Math.abs(F - (O.y + O.height / 2)) > 1 && Mo(A);
@@ -9960,11 +9956,11 @@ function WR(e, t, n) {
         h = h.parent;
       }
       if (!g) {
-        const fe = d.x + d.width / 2, Re = d.y + d.height / 2;
+        const fe = d.x + d.width / 2, Ce = d.y + d.height / 2;
         g = i.getAll().find((De) => {
           if (De.type !== "bpmn:Participant") return !1;
           const Je = De;
-          return typeof Je.x == "number" && typeof Je.width == "number" && fe >= Je.x && fe <= Je.x + Je.width && Re >= Je.y && Re <= Je.y + Je.height;
+          return typeof Je.x == "number" && typeof Je.width == "number" && fe >= Je.x && fe <= Je.x + Je.width && Ce >= Je.y && Ce <= Je.y + Je.height;
         });
       }
       if (!g || typeof g.x != "number" || typeof g.width != "number") continue;
@@ -9974,24 +9970,24 @@ function WR(e, t, n) {
       if (!m) continue;
       const y = m.waypoints, S = y != null && y.length ? { x: y[Math.floor((y.length - 1) / 2)].x, y: y[Math.floor((y.length - 1) / 2)].y, width: 0, height: 0 } : { x: m.x, y: m.y, width: m.width, height: m.height }, w = { width: d.width, height: d.height }, P = { x: d.x + d.width / 2, y: d.y + d.height / 2 }, T = E == null ? void 0 : E.side, $ = [];
       T && T in ol && $.push(Ep(i, S, w, g, { placement: { side: T, offset: (E == null ? void 0 : E.offset) ?? null }, selfId: f }));
-      for (const [fe, Re] of [[-1, 0], [1, 0], [0, -1], [0, 1]])
+      for (const [fe, Ce] of [[-1, 0], [1, 0], [0, -1], [0, 1]])
         for (let De = 1; De <= GR; De++)
-          $.push({ x: P.x + fe * Og * De, y: P.y + Re * Og * De });
+          $.push({ x: P.x + fe * Og * De, y: P.y + Ce * Og * De });
       const k = { ...s, edges: s.edges.filter((fe) => fe.id !== (_ == null ? void 0 : _.id)) }, I = o(k), j = I.filter((fe) => ju(fe).includes(f)).length;
       if (!j) continue;
-      let ee;
+      let J;
       for (const fe of $) {
-        const Re = fe.x - P.x, De = fe.y - P.y;
-        if (!Re && !De || fe.x - w.width / 2 < g.x || fe.x + w.width / 2 > g.x + g.width || fe.y - w.height / 2 < g.y || fe.y + w.height / 2 > g.y + g.height) continue;
+        const Ce = fe.x - P.x, De = fe.y - P.y;
+        if (!Ce && !De || fe.x - w.width / 2 < g.x || fe.x + w.width / 2 > g.x + g.width || fe.y - w.height / 2 < g.y || fe.y + w.height / 2 > g.y + g.height) continue;
         const Je = {
           ...k,
-          shapes: k.shapes.map((ve) => ve.id === f ? { ...ve, x: ve.x + Re, y: ve.y + De } : ve)
-        }, Q = o(Je), te = Q.filter((ve) => ju(ve).includes(f)).length;
-        if (te >= j || Q.length > I.length) continue;
-        const ue = Math.abs(Re) + Math.abs(De);
-        if ((!ee || te < ee.mine || te === ee.mine && (Q.length < ee.all || Q.length === ee.all && ue < ee.dist)) && (ee = { x: fe.x, y: fe.y, mine: te, all: Q.length, dist: ue }), ee.mine === 0 && ee.all < I.length) break;
+          shapes: k.shapes.map((ve) => ve.id === f ? { ...ve, x: ve.x + Ce, y: ve.y + De } : ve)
+        }, Z = o(Je), ee = Z.filter((ve) => ju(ve).includes(f)).length;
+        if (ee >= j || Z.length > I.length) continue;
+        const ue = Math.abs(Ce) + Math.abs(De);
+        if ((!J || ee < J.mine || ee === J.mine && (Z.length < J.all || Z.length === J.all && ue < J.dist)) && (J = { x: fe.x, y: fe.y, mine: ee, all: Z.length, dist: ue }), J.mine === 0 && J.all < I.length) break;
       }
-      ee && r.moveElements([d], { x: ee.x - P.x, y: ee.y - P.y });
+      J && r.moveElements([d], { x: J.x - P.x, y: J.y - P.y });
     }
 }
 const UR = 60;
@@ -10040,10 +10036,10 @@ function qR(e, t, n) {
       if (!P || !T) continue;
       const [$, k] = P.x <= T.x ? [P, T] : [T, P];
       if (y.contained) continue;
-      const I = s.get($.id), j = s.get(k.id), ee = I && j ? Math.max(j.x - (I.x + I.width), 0) : UR, fe = $.x + $.width + ee - k.x;
+      const I = s.get($.id), j = s.get(k.id), J = I && j ? Math.max(j.x - (I.x + I.width), 0) : UR, fe = $.x + $.width + J - k.x;
       if (fe <= 0) continue;
-      const Re = l(k.id).filter((De) => i.get(De));
-      Re.length && (!g || fe > g.dx) && (g = { movers: Re, dx: fe });
+      const Ce = l(k.id).filter((De) => i.get(De));
+      Ce.length && (!g || fe > g.dx) && (g = { movers: Ce, dx: fe });
     }
     if (!g) return;
     const b = g.movers.map((y) => i.get(y)).filter((y) => !!y && typeof y.x == "number");
@@ -10098,14 +10094,14 @@ function YR(e, t) {
       ...(m.outgoing ?? []).map((k) => k.waypoints[0])
     ].some((k) => !k || k.x > h || Math.abs(k.x - y) < 1)) return;
     if (h > y) {
-      const k = { x: y, y: m.y, width: h - y, height: m.height }, I = /* @__PURE__ */ new Set([m.id, ...S.map((ee) => ee.id), ...w.map((ee) => ee.id), ...P.map((ee) => ee.id)]);
-      if (n.getAll().some((ee) => {
+      const k = { x: y, y: m.y, width: h - y, height: m.height }, I = /* @__PURE__ */ new Set([m.id, ...S.map((J) => J.id), ...w.map((J) => J.id), ...P.map((J) => J.id)]);
+      if (n.getAll().some((J) => {
         var De;
-        if ("waypoints" in ee && ee.waypoints || ee.type === "bpmn:Group" || !p(ee)) return !1;
-        const fe = ee.type === "label" ? (De = ee.labelTarget) == null ? void 0 : De.id : ee.id;
-        if (!fe || I.has(fe) || I.has(ee.id)) return !1;
-        const Re = ee;
-        return Re.x < k.x + k.width && Re.x + Re.width > k.x && Re.y < k.y + k.height && Re.y + Re.height > k.y;
+        if ("waypoints" in J && J.waypoints || J.type === "bpmn:Group" || !p(J)) return !1;
+        const fe = J.type === "label" ? (De = J.labelTarget) == null ? void 0 : De.id : J.id;
+        if (!fe || I.has(fe) || I.has(J.id)) return !1;
+        const Ce = J;
+        return Ce.x < k.x + k.width && Ce.x + Ce.width > k.x && Ce.y < k.y + k.height && Ce.y + Ce.height > k.y;
       })) return;
     }
   }
@@ -10153,49 +10149,49 @@ function XR(e, t, n, i) {
   const l = new Map(n.shapes.map((d) => [d.id, d])), u = /* @__PURE__ */ new Map();
   for (const d of c) u.set(d.group, [...u.get(d.group) ?? [], d]);
   for (const [d, h] of u) {
-    const g = s.shapes.find((Ae) => Ae.id === d);
+    const g = s.shapes.find((Pe) => Pe.id === d);
     if (!((p = g == null ? void 0 : g.members) != null && p.length)) continue;
     const b = l.get(d);
     if (!(!b || Math.abs(b.x - g.x) >= 0.5 || Math.abs(b.y - g.y) >= 0.5 || Math.abs(b.width - g.width) >= 0.5 || Math.abs(b.height - g.height) >= 0.5)) continue;
-    const _ = g.members.map((Ae) => r.get(Ae)).filter((Ae) => !!Ae && typeof Ae.x == "number");
+    const _ = g.members.map((Pe) => r.get(Pe)).filter((Pe) => !!Pe && typeof Pe.x == "number");
     if (!_.length) continue;
-    const m = Math.min(..._.map((Ae) => Ae.x)), y = Math.min(..._.map((Ae) => Ae.y)), S = Math.max(..._.map((Ae) => Ae.x + Ae.width)), w = Math.max(..._.map((Ae) => Ae.y + Ae.height)), P = g.x, T = g.y, $ = g.x + g.width, k = g.y + g.height;
-    let I = P, j = T, ee = $, fe = k;
-    for (const Ae of h) {
-      const N = s.edges.find((x) => x.id === Ae.edge);
+    const m = Math.min(..._.map((Pe) => Pe.x)), y = Math.min(..._.map((Pe) => Pe.y)), S = Math.max(..._.map((Pe) => Pe.x + Pe.width)), w = Math.max(..._.map((Pe) => Pe.y + Pe.height)), P = g.x, T = g.y, $ = g.x + g.width, k = g.y + g.height;
+    let I = P, j = T, J = $, fe = k;
+    for (const Pe of h) {
+      const N = s.edges.find((x) => x.id === Pe.edge);
       if (!N) continue;
       const R = N.endpoints.some((x) => {
         const G = s.shapes.find((Ee) => Ee.id === x);
         if (!G || G.container) return !1;
-        const q = G.x + G.width / 2, J = G.y + G.height / 2;
-        return P < q && q < $ && T < J && J < k;
+        const q = G.x + G.width / 2, Q = G.y + G.height / 2;
+        return P < q && q < $ && T < Q && Q < k;
       });
       for (const x of yn(N)) {
         const G = x.axis === "v" ? [T, k] : [P, $];
-        Math.min(x.hi, G[1]) - Math.max(x.lo, G[0]) < Eb || (x.axis === "v" ? P < x.at && x.at < $ : T < x.at && x.at < k) && R || (x.axis === "v" ? (Math.abs(x.at - P) <= Fa && (I = Math.max(I, x.at + ac)), Math.abs(x.at - $) <= Fa && (ee = Math.min(ee, x.at - ac))) : (Math.abs(x.at - T) <= Fa && (j = Math.max(j, x.at + ac)), Math.abs(x.at - k) <= Fa && (fe = Math.min(fe, x.at - ac))));
+        Math.min(x.hi, G[1]) - Math.max(x.lo, G[0]) < Eb || (x.axis === "v" ? P < x.at && x.at < $ : T < x.at && x.at < k) && R || (x.axis === "v" ? (Math.abs(x.at - P) <= Fa && (I = Math.max(I, x.at + ac)), Math.abs(x.at - $) <= Fa && (J = Math.min(J, x.at - ac))) : (Math.abs(x.at - T) <= Fa && (j = Math.max(j, x.at + ac)), Math.abs(x.at - k) <= Fa && (fe = Math.min(fe, x.at - ac))));
       }
     }
-    if (I > m - sc && (I = P), j > y - sc && (j = T), ee < S + sc && (ee = $), fe < w + sc && (fe = k), I === P && j === T && ee === $ && fe === k) continue;
-    const Re = r.get(d), De = { x: Re.x, y: Re.y, width: Re.width, height: Re.height }, Je = Xe(r), Q = new Set(ht(Je).map(ft)), te = a(Je);
-    o.resizeShape(Re, { x: I, y: j, width: ee - I, height: fe - j });
-    let ue = Xe(r), ve = ht(ue).filter((Ae) => !Q.has(ft(Ae)));
+    if (I > m - sc && (I = P), j > y - sc && (j = T), J < S + sc && (J = $), fe < w + sc && (fe = k), I === P && j === T && J === $ && fe === k) continue;
+    const Ce = r.get(d), De = { x: Ce.x, y: Ce.y, width: Ce.width, height: Ce.height }, Je = Xe(r), Z = new Set(ht(Je).map(ft)), ee = a(Je);
+    o.resizeShape(Ce, { x: I, y: j, width: J - I, height: fe - j });
+    let ue = Xe(r), ve = ht(ue).filter((Pe) => !Z.has(ft(Pe)));
     const K = [];
     if (ve.length > 0 && ve.every(
-      (Ae) => Ae.kind === "label-over-line" && !i.has(Ae.edge) && ue.edges.some((N) => N.id === Ae.edge)
+      (Pe) => Pe.kind === "label-over-line" && !i.has(Pe.edge) && ue.edges.some((N) => N.id === Pe.edge)
     )) {
-      for (const Ae of ve) {
-        if (Ae.kind !== "label-over-line") continue;
-        const N = ue.edges.find((J) => J.id === Ae.edge), R = N && Db(N, ue), x = (f = r.get(Ae.edge)) == null ? void 0 : f.label;
+      for (const Pe of ve) {
+        if (Pe.kind !== "label-over-line") continue;
+        const N = ue.edges.find((Q) => Q.id === Pe.edge), R = N && Db(N, ue), x = (f = r.get(Pe.edge)) == null ? void 0 : f.label;
         if (!R || !x) continue;
         const G = R.x - x.x, q = R.y - x.y;
         o.moveElements([x], { x: G, y: q }), K.push({ label: x, dx: G, dy: q });
       }
-      ue = Xe(r), ve = ht(ue).filter((Ae) => !Q.has(ft(Ae)));
+      ue = Xe(r), ve = ht(ue).filter((Pe) => !Z.has(ft(Pe)));
     }
-    const ie = a(ue), Me = [...ie].some((Ae) => !te.has(Ae));
-    if (ve.length || Me || ie.size >= te.size) {
-      for (const Ae of K.reverse()) o.moveElements([Ae.label], { x: -Ae.dx, y: -Ae.dy });
-      o.resizeShape(Re, De);
+    const ne = a(ue), Ae = [...ne].some((Pe) => !ee.has(Pe));
+    if (ve.length || Ae || ne.size >= ee.size) {
+      for (const Pe of K.reverse()) o.moveElements([Pe.label], { x: -Pe.dx, y: -Pe.dy });
+      o.resizeShape(Ce, De);
     }
   }
 }
@@ -10281,25 +10277,25 @@ function Mi(e) {
   return typeof t == "string" ? t : void 0;
 }
 function eC(e) {
-  const t = e.rootElements ?? [], n = t.find((Q) => Q.$type === "bpmn:Collaboration"), i = new Map(
-    t.filter((Q) => Q.$type === "bpmn:Process").map((Q) => [Q.id, Q])
-  ), r = [], o = [], a = [], s = [], c = [], l = [], u = { poolOrders: {}, bands: {}, placements: {}, afterColumns: {} }, p = [], f = [], d = [], h = [], g = [], b = [], E = [], _ = /* @__PURE__ */ new Set(), m = /* @__PURE__ */ new Set(), y = (Q) => {
-    Q && _.add(Q);
-  }, S = (Q) => {
-    _.add(Q), m.add(Q);
-  }, w = (Q) => {
-    const te = Ig(Q, "bwl:Placement");
-    if (!te) return;
-    const ue = typeof te.anchor == "string" ? te.anchor : void 0;
-    if (!ue || !JR(te.side)) return;
-    const ve = typeof te.offset == "number" ? te.offset : void 0;
-    g.push({ owner: Q.id, anchor: ue, side: te.side, ...ve !== void 0 ? { offset: ve } : {} });
-  }, P = (Q) => {
-    const te = Ig(Q, "bwl:Members"), ue = typeof (te == null ? void 0 : te.refs) == "string" ? te.refs.split(/\s+/).filter(Boolean) : [];
-    ue.length && E.push({ owner: Q.id, refs: ue });
-  }, T = (Q) => {
-    var te;
-    for (const ue of Q)
+  const t = e.rootElements ?? [], n = t.find((Z) => Z.$type === "bpmn:Collaboration"), i = new Map(
+    t.filter((Z) => Z.$type === "bpmn:Process").map((Z) => [Z.id, Z])
+  ), r = [], o = [], a = [], s = [], c = [], l = [], u = { poolOrders: {}, bands: {}, placements: {}, afterColumns: {} }, p = [], f = [], d = [], h = [], g = [], b = [], E = [], _ = /* @__PURE__ */ new Set(), m = /* @__PURE__ */ new Set(), y = (Z) => {
+    Z && _.add(Z);
+  }, S = (Z) => {
+    _.add(Z), m.add(Z);
+  }, w = (Z) => {
+    const ee = Ig(Z, "bwl:Placement");
+    if (!ee) return;
+    const ue = typeof ee.anchor == "string" ? ee.anchor : void 0;
+    if (!ue || !JR(ee.side)) return;
+    const ve = typeof ee.offset == "number" ? ee.offset : void 0;
+    g.push({ owner: Z.id, anchor: ue, side: ee.side, ...ve !== void 0 ? { offset: ve } : {} });
+  }, P = (Z) => {
+    const ee = Ig(Z, "bwl:Members"), ue = typeof (ee == null ? void 0 : ee.refs) == "string" ? ee.refs.split(/\s+/).filter(Boolean) : [];
+    ue.length && E.push({ owner: Z.id, refs: ue });
+  }, T = (Z) => {
+    var ee;
+    for (const ue of Z)
       switch (y(ue.id), ue.$type) {
         case "bpmn:TextAnnotation":
           S(ue.id), s.push({ id: ue.id, text: typeof ue.text == "string" ? ue.text : "" }), w(ue);
@@ -10314,25 +10310,25 @@ function eC(e) {
           break;
         case "bpmn:Group": {
           S(ue.id);
-          const ve = (te = ue.categoryValueRef) == null ? void 0 : te.value;
+          const ve = (ee = ue.categoryValueRef) == null ? void 0 : ee.value;
           c.push({ id: ue.id, ...typeof ve == "string" && ve ? { name: ve } : {} }), P(ue);
           break;
         }
         default:
           l.push({ id: ue.id, type: ue.$type, reason: "type-outside-mvp" });
       }
-  }, $ = (Q) => {
-    for (const te of Q.flowElements ?? [])
-      y(te.id), l.push({ id: te.id, type: te.$type, reason: "inside-container" }), (te.flowElements ?? []).length && $(te);
-    for (const te of Q.artifacts ?? [])
-      y(te.id), l.push({ id: te.id, type: te.$type, reason: "inside-container" });
-  }, k = (Q, te) => {
-    const ue = Q.flowElements ?? [], ve = (Q.laneSets ?? []).flatMap((V) => V.lanes ?? []), K = /* @__PURE__ */ new Map();
+  }, $ = (Z) => {
+    for (const ee of Z.flowElements ?? [])
+      y(ee.id), l.push({ id: ee.id, type: ee.$type, reason: "inside-container" }), (ee.flowElements ?? []).length && $(ee);
+    for (const ee of Z.artifacts ?? [])
+      y(ee.id), l.push({ id: ee.id, type: ee.$type, reason: "inside-container" });
+  }, k = (Z, ee) => {
+    const ue = Z.flowElements ?? [], ve = (Z.laneSets ?? []).flatMap((V) => V.lanes ?? []), K = /* @__PURE__ */ new Map();
     for (const V of ve) {
       y(V.id);
-      for (const ie of V.flowNodeRef ?? []) {
-        const Me = Mi(ie);
-        Me && K.set(Me, V.id);
+      for (const ne of V.flowNodeRef ?? []) {
+        const Ae = Mi(ne);
+        Ae && K.set(Ae, V.id);
       }
     }
     for (const V of ue) {
@@ -10349,22 +10345,22 @@ function eC(e) {
         S(V.id), a.push({ id: V.id, ...V.name ? { name: V.name } : {} });
         continue;
       }
-      const ie = QR(V.$type), Me = ie === "intermediateCatchEvent" ? eb((V.eventDefinitions ?? []).map((x) => x.$type)) : void 0;
-      if (!lE(ie) || ie === "intermediateCatchEvent" && !Me) {
+      const ne = QR(V.$type), Ae = ne === "intermediateCatchEvent" ? eb((V.eventDefinitions ?? []).map((x) => x.$type)) : void 0;
+      if (!lE(ne) || ne === "intermediateCatchEvent" && !Ae) {
         l.push({ id: V.id, type: V.$type, reason: "type-outside-mvp" });
         continue;
       }
       S(V.id);
-      const Ae = ie === "boundaryEvent" ? Mi(V.attachedToRef) : void 0;
+      const Pe = ne === "boundaryEvent" ? Mi(V.attachedToRef) : void 0;
       o.push({
         id: V.id,
-        type: ie,
+        type: ne,
         ...V.name ? { name: V.name } : {},
-        ...te ? { participant: te } : {},
+        ...ee ? { participant: ee } : {},
         ...K.has(V.id) ? { lane: K.get(V.id) } : {},
-        ...Ae ? { attachedTo: Ae } : {},
-        ...Me ? { eventDefinition: Me } : {}
-      }), ie === "subProcess" && $(V);
+        ...Pe ? { attachedTo: Pe } : {},
+        ...Ae ? { eventDefinition: Ae } : {}
+      }), ne === "subProcess" && $(V);
       const N = Dg(V, "bwl:band");
       N !== void 0 && (u.bands[V.id] = N);
       const R = Nb(V, "bwl:afterColumn");
@@ -10385,76 +10381,76 @@ function eC(e) {
           target: V.id
         });
     }
-    T(Q.artifacts ?? []);
+    T(Z.artifacts ?? []);
   };
   if (n) {
-    const Q = /* @__PURE__ */ new Set();
-    for (const te of n.participants ?? []) {
-      S(te.id);
-      const ue = Mi(te.processRef);
-      ue && Q.add(ue);
-      const ve = ue ? i.get(ue) : void 0, K = ((ve == null ? void 0 : ve.laneSets) ?? []).flatMap((Ae) => Ae.lanes ?? []), V = K.map((Ae) => ({ id: Ae.id, ...Ae.name ? { name: Ae.name } : {} }));
-      for (const Ae of V) S(Ae.id);
-      const ie = !ve || (ve.flowElements ?? []).length === 0 && K.length === 0 && (ve.artifacts ?? []).length === 0;
+    const Z = /* @__PURE__ */ new Set();
+    for (const ee of n.participants ?? []) {
+      S(ee.id);
+      const ue = Mi(ee.processRef);
+      ue && Z.add(ue);
+      const ve = ue ? i.get(ue) : void 0, K = ((ve == null ? void 0 : ve.laneSets) ?? []).flatMap((Pe) => Pe.lanes ?? []), V = K.map((Pe) => ({ id: Pe.id, ...Pe.name ? { name: Pe.name } : {} }));
+      for (const Pe of V) S(Pe.id);
+      const ne = !ve || (ve.flowElements ?? []).length === 0 && K.length === 0 && (ve.artifacts ?? []).length === 0;
       r.push({
-        id: te.id,
-        ...te.name ? { name: te.name } : {},
-        ...ie ? { blackBox: !0 } : {},
+        id: ee.id,
+        ...ee.name ? { name: ee.name } : {},
+        ...ne ? { blackBox: !0 } : {},
         ...V.length ? { lanes: V } : {}
       });
-      const Me = Dg(te, "bwl:poolOrder");
-      Me !== void 0 && (u.poolOrders[te.id] = Me), ve && k(ve, te.id);
-    }
-    for (const te of n.messageFlows ?? [])
-      y(te.id), f.push({
-        id: te.id,
-        source: Mi(te.sourceRef),
-        target: Mi(te.targetRef),
-        ...typeof te.name == "string" && te.name ? { name: te.name } : {}
+      const Ae = Dg(ee, "bwl:poolOrder");
+      Ae !== void 0 && (u.poolOrders[ee.id] = Ae), ve && k(ve, ee.id);
+    }
+    for (const ee of n.messageFlows ?? [])
+      y(ee.id), f.push({
+        id: ee.id,
+        source: Mi(ee.sourceRef),
+        target: Mi(ee.targetRef),
+        ...typeof ee.name == "string" && ee.name ? { name: ee.name } : {}
       });
     T(n.artifacts ?? []);
-    for (const [te, ue] of i)
-      !Q.has(te) && (ue.flowElements ?? []).length > 0 && l.push({ id: te, type: ue.$type, reason: "unreachable-process" });
+    for (const [ee, ue] of i)
+      !Z.has(ee) && (ue.flowElements ?? []).length > 0 && l.push({ id: ee, type: ue.$type, reason: "unreachable-process" });
   } else
-    for (const Q of i.values()) k(Q);
-  const I = [], j = [], ee = [], fe = [], Re = (Q, te) => !!Q && !!te && m.has(Q) && m.has(te);
-  for (const Q of p) {
-    if (!Re(Q.source, Q.target)) {
-      l.push({ id: Q.id, type: "bpmn:SequenceFlow", reason: "endpoint-outside-mvp" });
+    for (const Z of i.values()) k(Z);
+  const I = [], j = [], J = [], fe = [], Ce = (Z, ee) => !!Z && !!ee && m.has(Z) && m.has(ee);
+  for (const Z of p) {
+    if (!Ce(Z.source, Z.target)) {
+      l.push({ id: Z.id, type: "bpmn:SequenceFlow", reason: "endpoint-outside-mvp" });
       continue;
     }
-    I.push({ id: Q.id, source: Q.source, target: Q.target, ...Q.name ? { name: Q.name } : {} }), m.add(Q.id);
+    I.push({ id: Z.id, source: Z.source, target: Z.target, ...Z.name ? { name: Z.name } : {} }), m.add(Z.id);
   }
-  for (const Q of f) {
-    if (!Re(Q.source, Q.target)) {
-      l.push({ id: Q.id, type: "bpmn:MessageFlow", reason: "endpoint-outside-mvp" });
+  for (const Z of f) {
+    if (!Ce(Z.source, Z.target)) {
+      l.push({ id: Z.id, type: "bpmn:MessageFlow", reason: "endpoint-outside-mvp" });
       continue;
     }
-    j.push({ id: Q.id, source: Q.source, target: Q.target, ...Q.name ? { name: Q.name } : {} }), m.add(Q.id);
+    j.push({ id: Z.id, source: Z.source, target: Z.target, ...Z.name ? { name: Z.name } : {} }), m.add(Z.id);
   }
-  for (const Q of h) {
-    if (!Re(Q.source, Q.target)) {
-      l.push({ id: Q.id ?? "", type: Q.type, reason: "endpoint-outside-mvp" });
+  for (const Z of h) {
+    if (!Ce(Z.source, Z.target)) {
+      l.push({ id: Z.id ?? "", type: Z.type, reason: "endpoint-outside-mvp" });
       continue;
     }
-    fe.push({ ...Q.id ? { id: Q.id } : {}, source: Q.source, target: Q.target }), Q.id && m.add(Q.id);
+    fe.push({ ...Z.id ? { id: Z.id } : {}, source: Z.source, target: Z.target }), Z.id && m.add(Z.id);
   }
-  for (const Q of d) {
-    if (!Re(Q.source, Q.target)) {
-      l.push({ id: Q.id ?? "", type: Q.type, reason: "endpoint-outside-mvp" });
+  for (const Z of d) {
+    if (!Ce(Z.source, Z.target)) {
+      l.push({ id: Z.id ?? "", type: Z.type, reason: "endpoint-outside-mvp" });
       continue;
     }
-    ee.push({ ...Q.id ? { id: Q.id } : {}, source: Q.source, target: Q.target });
+    J.push({ ...Z.id ? { id: Z.id } : {}, source: Z.source, target: Z.target });
   }
-  const De = new Map(c.map((Q) => [Q.id, Q]));
-  for (const { owner: Q, refs: te } of E) {
-    const ue = te.filter((K) => _.has(K)), ve = De.get(Q);
+  const De = new Map(c.map((Z) => [Z.id, Z]));
+  for (const { owner: Z, refs: ee } of E) {
+    const ue = ee.filter((K) => _.has(K)), ve = De.get(Z);
     ve && ue.length && (ve.members = ue);
   }
-  for (const Q of g)
-    _.has(Q.anchor) && (u.placements[Q.owner] = { anchor: Q.anchor, side: Q.side, ...Q.offset !== void 0 ? { offset: Q.offset } : {} });
-  for (const [Q, te] of b)
-    _.has(te) && (u.afterColumns[Q] = te);
+  for (const Z of g)
+    _.has(Z.anchor) && (u.placements[Z.owner] = { anchor: Z.anchor, side: Z.side, ...Z.offset !== void 0 ? { offset: Z.offset } : {} });
+  for (const [Z, ee] of b)
+    _.has(ee) && (u.afterColumns[Z] = ee);
   return { definition: {
     ...r.length ? { participants: r } : {},
     nodes: o,
@@ -10463,7 +10459,7 @@ function eC(e) {
     ...a.length ? { dataStores: a } : {},
     ...fe.length ? { dataAssociations: fe } : {},
     ...s.length ? { annotations: s } : {},
-    ...ee.length ? { associations: ee } : {},
+    ...J.length ? { associations: J } : {},
     ...c.length ? { groups: c } : {}
   }, hints: u, omitted: l };
 }
@@ -11351,10 +11347,10 @@ function Wb(e, t) {
   function d(m, y) {
     if (y && y.length) {
       const S = /* @__PURE__ */ Object.create(null), w = /* @__PURE__ */ Object.create(null), P = [], T = [], $ = [];
-      let k, I, j, ee;
+      let k, I, j, J;
       for (let fe in r)
-        k = r[fe], y.indexOf(fe) !== -1 && (k[2] === "private" ? (I = P.indexOf(k[3]), I === -1 ? (j = k[3].createChild([], y), ee = f(j), P.push(k[3]), T.push(j), $.push(ee), S[fe] = [ee, fe, "private", j]) : S[fe] = [$[I], fe, "private", T[I]]) : S[fe] = [k[2], k[1]], w[fe] = !0), (k[2] === "factory" || k[2] === "type") && k[1].$scope && y.forEach((Re) => {
-          k[1].$scope.indexOf(Re) !== -1 && (S[fe] = [k[2], k[1]], w[Re] = !0);
+        k = r[fe], y.indexOf(fe) !== -1 && (k[2] === "private" ? (I = P.indexOf(k[3]), I === -1 ? (j = k[3].createChild([], y), J = f(j), P.push(k[3]), T.push(j), $.push(J), S[fe] = [J, fe, "private", j]) : S[fe] = [$[I], fe, "private", T[I]]) : S[fe] = [k[2], k[1]], w[fe] = !0), (k[2] === "factory" || k[2] === "type") && k[1].$scope && y.forEach((Ce) => {
+          k[1].$scope.indexOf(Ce) !== -1 && (S[fe] = [k[2], k[1]], w[Ce] = !0);
         });
       y.forEach((fe) => {
         if (!w[fe])
@@ -11973,13 +11969,13 @@ function Kb(e, t, n, i, r, o, a, s, c, l) {
     T = P + u * (a && T > P ? 1 : -1), s = S + n * Zt.cos(T), c = w + i * Zt.sin(T), f = Kb(s, c, n, i, r, 0, a, I, j, [T, k, S, w]);
   }
   $ = T - P;
-  var ee = Zt.cos(P), fe = Zt.sin(P), Re = Zt.cos(T), De = Zt.sin(T), Je = Zt.tan($ / 4), Q = 4 / 3 * n * Je, te = 4 / 3 * i * Je, ue = [e, t], ve = [e + Q * fe, t - te * ee], K = [s + Q * De, c - te * Re], V = [s, c];
+  var J = Zt.cos(P), fe = Zt.sin(P), Ce = Zt.cos(T), De = Zt.sin(T), Je = Zt.tan($ / 4), Z = 4 / 3 * n * Je, ee = 4 / 3 * i * Je, ue = [e, t], ve = [e + Z * fe, t - ee * J], K = [s + Z * De, c - ee * Ce], V = [s, c];
   if (ve[0] = 2 * ue[0] - ve[0], ve[1] = 2 * ue[1] - ve[1], l)
     return [ve, K, V].concat(f);
   f = [ve, K, V].concat(f).join().split(",");
-  for (var ie = [], Me = 0, Ae = f.length; Me < Ae; Me++)
-    ie[Me] = Me % 2 ? h(f[Me - 1], f[Me], p).y : h(f[Me], f[Me + 1], p).x;
-  return ie;
+  for (var ne = [], Ae = 0, Pe = f.length; Ae < Pe; Ae++)
+    ne[Ae] = Ae % 2 ? h(f[Ae - 1], f[Ae], p).y : h(f[Ae], f[Ae + 1], p).x;
+  return ne;
 }
 function gM(e, t, n, i, r, o, a, s) {
   for (var c = [], l = [[], []], u, p, f, d, h, g, b, E, _ = 0; _ < 2; ++_) {
@@ -13054,8 +13050,8 @@ function HM(e) {
 function zM(e) {
   var t = {}, n = [], i = {};
   function r(K, V) {
-    return function(ie) {
-      K(ie, V);
+    return function(ne) {
+      K(ne, V);
     };
   }
   function o(K) {
@@ -13065,8 +13061,8 @@ function zM(e) {
     return t[K.id];
   }
   function s(K, V) {
-    var ie = K.gfx;
-    if (ie)
+    var ne = K.gfx;
+    if (ne)
       throw new Error(
         `already rendered ${Cn(K)}`
       );
@@ -13077,21 +13073,21 @@ function zM(e) {
   }
   function l(K, V) {
     try {
-      var ie = i[K.id] && s(K, V);
-      return o(K), ie;
-    } catch (Me) {
-      u(Me.message, { element: K, error: Me }), console.error(`failed to import ${Cn(K)}`, Me);
+      var ne = i[K.id] && s(K, V);
+      return o(K), ne;
+    } catch (Ae) {
+      u(Ae.message, { element: K, error: Ae }), console.error(`failed to import ${Cn(K)}`, Ae);
     }
   }
   function u(K, V) {
     e.error(K, V);
   }
   var p = this.registerDi = function(V) {
-    var ie = V.bpmnElement;
-    ie ? i[ie.id] ? u(
-      `multiple DI elements defined for ${Cn(ie)}`,
-      { element: ie }
-    ) : i[ie.id] = V : u(
+    var ne = V.bpmnElement;
+    ne ? i[ne.id] ? u(
+      `multiple DI elements defined for ${Cn(ne)}`,
+      { element: ne }
+    ) : i[ne.id] = V : u(
       `no bpmnElement referenced in ${Cn(V)}`,
       { element: V }
     );
@@ -13105,34 +13101,34 @@ function zM(e) {
   function h(K) {
     p(K);
   }
-  this.handleDefinitions = function(V, ie) {
-    var Me = V.diagrams;
-    if (ie && Me.indexOf(ie) === -1)
+  this.handleDefinitions = function(V, ne) {
+    var Ae = V.diagrams;
+    if (ne && Ae.indexOf(ne) === -1)
       throw new Error("diagram not part of <bpmn:Definitions />");
-    if (!ie && Me && Me.length && (ie = Me[0]), !ie)
+    if (!ne && Ae && Ae.length && (ne = Ae[0]), !ne)
       throw new Error("no diagram to display");
-    i = {}, f(ie);
-    var Ae = ie.plane;
-    if (!Ae)
+    i = {}, f(ne);
+    var Pe = ne.plane;
+    if (!Pe)
       throw new Error(
-        `no plane for ${Cn(ie)}`
+        `no plane for ${Cn(ne)}`
       );
-    var N = Ae.bpmnElement;
+    var N = Pe.bpmnElement;
     if (!N)
       if (N = HM(V), N)
         u(
-          `correcting missing bpmnElement on ${Cn(Ae)} to ${Cn(N)}`
-        ), Ae.bpmnElement = N, p(Ae);
+          `correcting missing bpmnElement on ${Cn(Pe)} to ${Cn(N)}`
+        ), Pe.bpmnElement = N, p(Pe);
       else
         throw new Error("no process or collaboration to display");
-    var R = c(N, Ae);
+    var R = c(N, Pe);
     if ($n(N, "bpmn:Process") || $n(N, "bpmn:SubProcess"))
       b(N, R);
     else if ($n(N, "bpmn:Collaboration"))
       ue(N, R), E(V.rootElements, R);
     else
       throw new Error(
-        `unsupported bpmnElement for ${Cn(Ae)}: ${Cn(N)}`
+        `unsupported bpmnElement for ${Cn(Pe)}: ${Cn(N)}`
       );
     g(n);
   };
@@ -13144,10 +13140,10 @@ function zM(e) {
     Je(K, V), $(K.ioSpecification, V), T(K.artifacts, V), o(K);
   }
   function E(K, V) {
-    var ie = et(K, function(Me) {
-      return !a(Me) && $n(Me, "bpmn:Process") && Me.laneSets;
+    var ne = et(K, function(Ae) {
+      return !a(Ae) && $n(Ae, "bpmn:Process") && Ae.laneSets;
     });
-    ie.forEach(r(b, V));
+    ne.forEach(r(b, V));
   }
   function _(K, V) {
     l(K, V);
@@ -13168,73 +13164,73 @@ function zM(e) {
     l(K, V);
   }
   function T(K, V) {
-    z(K, function(ie) {
-      $n(ie, "bpmn:Association") ? n.push(function() {
-        P(ie, V);
-      }) : P(ie, V);
+    z(K, function(ne) {
+      $n(ne, "bpmn:Association") ? n.push(function() {
+        P(ne, V);
+      }) : P(ne, V);
     });
   }
   function $(K, V) {
     K && (z(K.dataInputs, r(S, V)), z(K.dataOutputs, r(w, V)));
   }
-  var k = this.handleSubProcess = function(V, ie) {
-    Je(V, ie), T(V.artifacts, ie);
+  var k = this.handleSubProcess = function(V, ne) {
+    Je(V, ne), T(V.artifacts, ne);
   };
   function I(K, V) {
-    var ie = l(K, V);
-    $n(K, "bpmn:SubProcess") && k(K, ie || V), $n(K, "bpmn:Activity") && $(K.ioSpecification, V), n.push(function() {
+    var ne = l(K, V);
+    $n(K, "bpmn:SubProcess") && k(K, ne || V), $n(K, "bpmn:Activity") && $(K.ioSpecification, V), n.push(function() {
       z(K.dataInputAssociations, r(y, V)), z(K.dataOutputAssociations, r(y, V));
     });
   }
   function j(K, V) {
     l(K, V);
   }
-  function ee(K, V) {
+  function J(K, V) {
     l(K, V);
   }
   function fe(K, V) {
     n.push(function() {
-      var ie = l(K, V);
-      K.childLaneSet && Re(K.childLaneSet, ie || V), ve(K);
+      var ne = l(K, V);
+      K.childLaneSet && Ce(K.childLaneSet, ne || V), ve(K);
     });
   }
-  function Re(K, V) {
+  function Ce(K, V) {
     z(K.lanes, r(fe, V));
   }
   function De(K, V) {
-    z(K, r(Re, V));
+    z(K, r(Ce, V));
   }
   function Je(K, V) {
-    Q(K.flowElements, V), K.laneSets && De(K.laneSets, V);
-  }
-  function Q(K, V) {
-    z(K, function(ie) {
-      $n(ie, "bpmn:SequenceFlow") ? n.push(function() {
-        j(ie, V);
-      }) : $n(ie, "bpmn:BoundaryEvent") ? n.unshift(function() {
-        I(ie, V);
-      }) : $n(ie, "bpmn:FlowNode") ? I(ie, V) : $n(ie, "bpmn:DataObject") || ($n(ie, "bpmn:DataStoreReference") || $n(ie, "bpmn:DataObjectReference") ? ee(ie, V) : u(
-        `unrecognized flowElement ${Cn(ie)} in context ${Cn(V && V.businessObject)}`,
+    Z(K.flowElements, V), K.laneSets && De(K.laneSets, V);
+  }
+  function Z(K, V) {
+    z(K, function(ne) {
+      $n(ne, "bpmn:SequenceFlow") ? n.push(function() {
+        j(ne, V);
+      }) : $n(ne, "bpmn:BoundaryEvent") ? n.unshift(function() {
+        I(ne, V);
+      }) : $n(ne, "bpmn:FlowNode") ? I(ne, V) : $n(ne, "bpmn:DataObject") || ($n(ne, "bpmn:DataStoreReference") || $n(ne, "bpmn:DataObjectReference") ? J(ne, V) : u(
+        `unrecognized flowElement ${Cn(ne)} in context ${Cn(V && V.businessObject)}`,
         {
-          element: ie,
+          element: ne,
           context: V
         }
       ));
     });
   }
-  function te(K, V) {
-    var ie = l(K, V), Me = K.processRef;
-    Me && b(Me, ie || V);
+  function ee(K, V) {
+    var ne = l(K, V), Ae = K.processRef;
+    Ae && b(Ae, ne || V);
   }
   function ue(K, V) {
-    z(K.participants, r(te, V)), n.push(function() {
+    z(K.participants, r(ee, V)), n.push(function() {
       m(K.messageFlows, V);
     }), T(K.artifacts, V);
   }
   function ve(K) {
     z(K.flowNodeRef, function(V) {
-      var ie = V.get("lanes");
-      ie && ie.push(K);
+      var ne = V.get("lanes");
+      ne && ne.push(K);
     });
   }
 }
@@ -13808,7 +13804,7 @@ function wo(e, t, n, i, r, o, a) {
       ref: x = { x: 0, y: 0 },
       scale: G = 1,
       element: q,
-      parentGfx: J = r._svg
+      parentGfx: Q = r._svg
     } = R, Ee = ke("marker", {
       id: N,
       viewBox: "0 0 20 20",
@@ -13819,8 +13815,8 @@ function wo(e, t, n, i, r, o, a) {
       orient: "auto"
     });
     Ue(Ee, q);
-    var Ye = Et(":scope > defs", J);
-    Ye || (Ye = ke("defs"), Ue(J, Ye)), Ue(Ye, Ee);
+    var Ye = Et(":scope > defs", Q);
+    Ye || (Ye = ke("defs"), Ue(Q, Ye)), Ue(Ye, Ee);
   }
   function d(N, R, x, G) {
     var q = vA.nextPrefixed("marker-");
@@ -13828,7 +13824,7 @@ function wo(e, t, n, i, r, o, a) {
   }
   function h(N, R, x, G, q) {
     if (x === "sequenceflow-end") {
-      var J = ke("path", {
+      var Q = ke("path", {
         d: "M 1 5 L 11 10 L 1 15 Z",
         ...u({
           fill: q,
@@ -13837,7 +13833,7 @@ function wo(e, t, n, i, r, o, a) {
         })
       });
       f(R, {
-        element: J,
+        element: Q,
         ref: { x: 11, y: 10 },
         scale: 0.5,
         parentGfx: N
@@ -13952,16 +13948,16 @@ function wo(e, t, n, i, r, o, a) {
   }
   function g(N, R, x, G, q = {}) {
     hn(G) && (q = G, G = 0), G = G || 0, q = u(q);
-    var J = R / 2, Ee = x / 2, Ye = ke("circle", {
-      cx: J,
+    var Q = R / 2, Ee = x / 2, Ye = ke("circle", {
+      cx: Q,
       cy: Ee,
       r: Math.round((R + x) / 4 - G),
       ...q
     });
     return Ue(N, Ye), Ye;
   }
-  function b(N, R, x, G, q, J) {
-    hn(q) && (J = q, q = 0), q = q || 0, J = u(J);
+  function b(N, R, x, G, q, Q) {
+    hn(q) && (Q = q, q = 0), q = q || 0, Q = u(Q);
     var Ee = ke("rect", {
       x: q,
       y: q,
@@ -13969,16 +13965,16 @@ function wo(e, t, n, i, r, o, a) {
       height: x - q * 2,
       rx: G,
       ry: G,
-      ...J
+      ...Q
     });
     return Ue(N, Ee), Ee;
   }
   function E(N, R, x, G) {
-    var q = R / 2, J = x / 2, Ee = [
+    var q = R / 2, Q = x / 2, Ee = [
       { x: q, y: 0 },
-      { x: R, y: J },
+      { x: R, y: Q },
       { x: q, y: x },
-      { x: 0, y: J }
+      { x: 0, y: Q }
     ], Ye = Ee.map(function(Bt) {
       return Bt.x + "," + Bt.y;
     }).join(" ");
@@ -14009,7 +14005,7 @@ function wo(e, t, n, i, r, o, a) {
     return y(R, x, W({ "data-marker": N }, G));
   }
   function w(N) {
-    return Ae[N];
+    return Pe[N];
   }
   function P(N) {
     return function(R, x, G) {
@@ -14027,18 +14023,18 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.235,
           my: 0.315
         }
-      }), J = G ? be(R, c, x.stroke) : it(R, s, x.fill), Ee = G ? it(R, s, x.fill) : be(R, c, x.stroke), Ye = y(N, q, {
-        fill: J,
+      }), Q = G ? be(R, c, x.stroke) : it(R, s, x.fill), Ee = G ? it(R, s, x.fill) : be(R, c, x.stroke), Ye = y(N, q, {
+        fill: Q,
         stroke: Ee,
         strokeWidth: 1
       });
       return Ye;
     },
     "bpmn:TimerEventDefinition": function(N, R, x = {}) {
-      var G = x.width || R.width, q = x.height || R.height, J = x.width ? 1 : 2, Ee = g(N, G, q, 0.2 * q, {
+      var G = x.width || R.width, q = x.height || R.height, Q = x.width ? 1 : 2, Ee = g(N, G, q, 0.2 * q, {
         fill: it(R, s, x.fill),
         stroke: be(R, c, x.stroke),
-        strokeWidth: J
+        strokeWidth: Q
       }), Ye = i.getScaledPath("EVENT_TIMER_WH", {
         xScaleFactor: 0.75,
         yScaleFactor: 0.75,
@@ -14051,7 +14047,7 @@ function wo(e, t, n, i, r, o, a) {
       });
       y(N, Ye, {
         stroke: be(R, c, x.stroke),
-        strokeWidth: J
+        strokeWidth: Q
       });
       for (var lt = 0; lt < 12; lt++) {
         var Bt = i.getScaledPath("EVENT_TIMER_LINE", {
@@ -14082,9 +14078,9 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.5,
           my: 0.2
         }
-      }), J = G ? be(R, c, x.stroke) : it(R, s, x.fill);
+      }), Q = G ? be(R, c, x.stroke) : it(R, s, x.fill);
       return y(N, q, {
-        fill: J,
+        fill: Q,
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
       });
@@ -14116,9 +14112,9 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.57,
           my: 0.263
         }
-      }), J = G ? be(R, c, x.stroke) : it(R, s, x.fill);
+      }), Q = G ? be(R, c, x.stroke) : it(R, s, x.fill);
       return y(N, q, {
-        fill: J,
+        fill: Q,
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
       });
@@ -14133,9 +14129,9 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.2,
           my: 0.722
         }
-      }), J = G ? be(R, c, x.stroke) : it(R, s, x.fill);
+      }), Q = G ? be(R, c, x.stroke) : it(R, s, x.fill);
       return y(N, q, {
-        fill: J,
+        fill: Q,
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
       });
@@ -14150,8 +14146,8 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.638,
           my: -0.055
         }
-      }), J = G ? be(R, c, x.stroke) : "none", Ee = y(N, q, {
-        fill: J,
+      }), Q = G ? be(R, c, x.stroke) : "none", Ee = y(N, q, {
+        fill: Q,
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
       });
@@ -14167,9 +14163,9 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.22,
           my: 0.5
         }
-      }), J = G ? be(R, c, x.stroke) : it(R, s, x.fill);
+      }), Q = G ? be(R, c, x.stroke) : it(R, s, x.fill);
       return y(N, q, {
-        fill: J,
+        fill: Q,
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
       });
@@ -14184,10 +14180,10 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.5,
           my: 0.2
         }
-      }), J = G ? be(R, c, x.stroke) : it(R, s, x.fill);
+      }), Q = G ? be(R, c, x.stroke) : it(R, s, x.fill);
       return y(N, q, {
         strokeWidth: 1,
-        fill: J,
+        fill: Q,
         stroke: be(R, c, x.stroke)
       });
     },
@@ -14201,9 +14197,9 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.211,
           my: 0.36
         }
-      }), J = G ? be(R, c, x.stroke) : it(R, s, x.fill);
+      }), Q = G ? be(R, c, x.stroke) : it(R, s, x.fill);
       return y(N, q, {
-        fill: J,
+        fill: Q,
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
       });
@@ -14235,12 +14231,12 @@ function wo(e, t, n, i, r, o, a) {
     }
   };
   function $(N, R, x = {}, G) {
-    var q = le(N), J = hA(q), Ee = G || N;
-    return q.get("eventDefinitions") && q.get("eventDefinitions").length > 1 ? q.get("parallelMultiple") ? T["bpmn:ParallelMultipleEventDefinition"](R, Ee, x, J) : T["bpmn:MultipleEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:MessageEventDefinition") ? T["bpmn:MessageEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:TimerEventDefinition") ? T["bpmn:TimerEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:ConditionalEventDefinition") ? T["bpmn:ConditionalEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:SignalEventDefinition") ? T["bpmn:SignalEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:EscalationEventDefinition") ? T["bpmn:EscalationEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:LinkEventDefinition") ? T["bpmn:LinkEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:ErrorEventDefinition") ? T["bpmn:ErrorEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:CancelEventDefinition") ? T["bpmn:CancelEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:CompensateEventDefinition") ? T["bpmn:CompensateEventDefinition"](R, Ee, x, J) : Oi(q, "bpmn:TerminateEventDefinition") ? T["bpmn:TerminateEventDefinition"](R, Ee, x, J) : null;
+    var q = le(N), Q = hA(q), Ee = G || N;
+    return q.get("eventDefinitions") && q.get("eventDefinitions").length > 1 ? q.get("parallelMultiple") ? T["bpmn:ParallelMultipleEventDefinition"](R, Ee, x, Q) : T["bpmn:MultipleEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:MessageEventDefinition") ? T["bpmn:MessageEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:TimerEventDefinition") ? T["bpmn:TimerEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:ConditionalEventDefinition") ? T["bpmn:ConditionalEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:SignalEventDefinition") ? T["bpmn:SignalEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:EscalationEventDefinition") ? T["bpmn:EscalationEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:LinkEventDefinition") ? T["bpmn:LinkEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:ErrorEventDefinition") ? T["bpmn:ErrorEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:CancelEventDefinition") ? T["bpmn:CancelEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:CompensateEventDefinition") ? T["bpmn:CompensateEventDefinition"](R, Ee, x, Q) : Oi(q, "bpmn:TerminateEventDefinition") ? T["bpmn:TerminateEventDefinition"](R, Ee, x, Q) : null;
   }
   var k = {
     ParticipantMultiplicityMarker: function(N, R, x = {}) {
-      var G = li(R, x), q = Un(R, x), J = i.getScaledPath("MARKER_PARALLEL", {
+      var G = li(R, x), q = Un(R, x), Q = i.getScaledPath("MARKER_PARALLEL", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: G,
@@ -14250,7 +14246,7 @@ function wo(e, t, n, i, r, o, a) {
           my: (q - 15) / q
         }
       });
-      S("participant-multiplicity", N, J, {
+      S("participant-multiplicity", N, Q, {
         strokeWidth: 2,
         fill: it(R, s, x.fill),
         stroke: be(R, c, x.stroke)
@@ -14279,7 +14275,7 @@ function wo(e, t, n, i, r, o, a) {
       });
     },
     ParallelMarker: function(N, R, x) {
-      var G = li(R, x), q = Un(R, x), J = i.getScaledPath("MARKER_PARALLEL", {
+      var G = li(R, x), q = Un(R, x), Q = i.getScaledPath("MARKER_PARALLEL", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: G,
@@ -14289,7 +14285,7 @@ function wo(e, t, n, i, r, o, a) {
           my: (q - 20) / q
         }
       });
-      S("parallel", N, J, {
+      S("parallel", N, Q, {
         fill: it(R, s, x.fill),
         stroke: be(R, c, x.stroke)
       });
@@ -14328,7 +14324,7 @@ function wo(e, t, n, i, r, o, a) {
       });
     },
     LoopMarker: function(N, R, x) {
-      var G = li(R, x), q = Un(R, x), J = i.getScaledPath("MARKER_LOOP", {
+      var G = li(R, x), q = Un(R, x), Q = i.getScaledPath("MARKER_LOOP", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: G,
@@ -14338,7 +14334,7 @@ function wo(e, t, n, i, r, o, a) {
           my: (q - 7) / q
         }
       });
-      S("loop", N, J, {
+      S("loop", N, Q, {
         strokeWidth: 1.5,
         fill: "none",
         stroke: be(R, c, x.stroke),
@@ -14346,7 +14342,7 @@ function wo(e, t, n, i, r, o, a) {
       });
     },
     AdhocMarker: function(N, R, x) {
-      var G = li(R, x), q = Un(R, x), J = i.getScaledPath("MARKER_ADHOC", {
+      var G = li(R, x), q = Un(R, x), Q = i.getScaledPath("MARKER_ADHOC", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: G,
@@ -14356,7 +14352,7 @@ function wo(e, t, n, i, r, o, a) {
           my: (q - 15) / q
         }
       });
-      S("adhoc", N, J, {
+      S("adhoc", N, Q, {
         strokeWidth: 1,
         fill: be(R, c, x.stroke),
         stroke: be(R, c, x.stroke)
@@ -14373,8 +14369,8 @@ function wo(e, t, n, i, r, o, a) {
       width: li(R, G),
       height: Un(R, G)
     };
-    var q = le(R), J = x.includes("SubProcessMarker");
-    J ? G = {
+    var q = le(R), Q = x.includes("SubProcessMarker");
+    Q ? G = {
       ...G,
       seq: -21,
       parallel: -22,
@@ -14388,7 +14384,7 @@ function wo(e, t, n, i, r, o, a) {
       compensation: -7,
       loop: 0,
       adhoc: -8
-    }, q.get("isForCompensation") && x.push("CompensationMarker"), M(q, "bpmn:AdHocSubProcess") && (x.push("AdhocMarker"), J || W(G, { compensation: G.compensation - 18 }));
+    }, q.get("isForCompensation") && x.push("CompensationMarker"), M(q, "bpmn:AdHocSubProcess") && (x.push("AdhocMarker"), Q || W(G, { compensation: G.compensation - 18 }));
     var Ee = q.get("loopCharacteristics"), Ye = Ee && Ee.get("isSequential");
     Ee && (W(G, {
       compensation: G.compensation - 18
@@ -14402,7 +14398,7 @@ function wo(e, t, n, i, r, o, a) {
       I(lt, N, R, G);
     });
   }
-  function ee(N, R, x = {}) {
+  function J(N, R, x = {}) {
     x = W({
       size: {
         width: 100
@@ -14412,29 +14408,29 @@ function wo(e, t, n, i, r, o, a) {
     return at(G).add("djs-label"), Ue(N, G), G;
   }
   function fe(N, R, x, G = {}) {
-    var q = le(R), J = Pa({
+    var q = le(R), Q = Pa({
       x: R.x,
       y: R.y,
       width: R.width,
       height: R.height
     }, G);
-    return ee(N, q.name, {
+    return J(N, q.name, {
       align: x,
-      box: J,
+      box: Q,
       padding: 7,
       style: {
         fill: Aa(R, l, c, G.stroke)
       }
     });
   }
-  function Re(N, R, x = {}) {
+  function Ce(N, R, x = {}) {
     var G = {
       width: R.width,
       height: R.height,
       x: R.width / 2 + R.x,
       y: R.height / 2 + R.y
     };
-    return ee(N, ni(R), {
+    return J(N, ni(R), {
       box: G,
       style: W(
         {},
@@ -14446,7 +14442,7 @@ function wo(e, t, n, i, r, o, a) {
     });
   }
   function De(N, R, x, G = {}) {
-    var q = dn(x), J = ee(N, R, {
+    var q = dn(x), Q = J(N, R, {
       box: {
         height: 30,
         width: q ? Un(x, G) : li(x, G)
@@ -14458,7 +14454,7 @@ function wo(e, t, n, i, r, o, a) {
     });
     if (q) {
       var Ee = -1 * Un(x, G);
-      jc(J, 0, -Ee, 270);
+      jc(Q, 0, -Ee, 270);
     }
   }
   function Je(N, R, x = {}) {
@@ -14473,19 +14469,19 @@ function wo(e, t, n, i, r, o, a) {
       stroke: be(R, c, x.stroke)
     });
   }
-  function Q(N, R, x = {}) {
-    var G = le(R), q = it(R, s, x.fill), J = be(R, c, x.stroke);
-    return (G.get("associationDirection") === "One" || G.get("associationDirection") === "Both") && (x.markerEnd = d(N, "association-end", q, J)), G.get("associationDirection") === "Both" && (x.markerStart = d(N, "association-start", q, J)), x = ut(x, [
+  function Z(N, R, x = {}) {
+    var G = le(R), q = it(R, s, x.fill), Q = be(R, c, x.stroke);
+    return (G.get("associationDirection") === "One" || G.get("associationDirection") === "Both") && (x.markerEnd = d(N, "association-end", q, Q)), G.get("associationDirection") === "Both" && (x.markerStart = d(N, "association-start", q, Q)), x = ut(x, [
       "markerStart",
       "markerEnd"
     ]), m(N, R.waypoints, {
       ...x,
-      stroke: J,
+      stroke: Q,
       strokeDasharray: "0, 5"
     });
   }
-  function te(N, R, x = {}) {
-    var G = it(R, s, x.fill), q = be(R, c, x.stroke), J = i.getScaledPath("DATA_OBJECT_PATH", {
+  function ee(N, R, x = {}) {
+    var G = it(R, s, x.fill), q = be(R, c, x.stroke), Q = i.getScaledPath("DATA_OBJECT_PATH", {
       xScaleFactor: 1,
       yScaleFactor: 1,
       containerWidth: R.width,
@@ -14494,7 +14490,7 @@ function wo(e, t, n, i, r, o, a) {
         mx: 0.474,
         my: 0.296
       }
-    }), Ee = y(N, J, {
+    }), Ee = y(N, Q, {
       fill: G,
       fillOpacity: Do,
       stroke: q
@@ -14541,8 +14537,8 @@ function wo(e, t, n, i, r, o, a) {
       strokeWidth: 1.5
     }), q = le(R);
     if (M(q, "bpmn:Lane")) {
-      var J = q.get("name");
-      De(N, J, R, x);
+      var Q = q.get("name");
+      De(N, Q, R, x);
     }
     return G;
   }
@@ -14552,31 +14548,31 @@ function wo(e, t, n, i, r, o, a) {
       strokeDasharray: "0, 5.5",
       strokeWidth: 2.5
     }), !q)) {
-      var J = le(R).flowElements || [], Ee = J.filter((Ye) => M(Ye, "bpmn:StartEvent"));
-      Ee.length === 1 && ie(Ee[0], N, x, R);
+      var Q = le(R).flowElements || [], Ee = Q.filter((Ye) => M(Ye, "bpmn:StartEvent"));
+      Ee.length === 1 && ne(Ee[0], N, x, R);
     }
     return fe(N, R, q ? "center-top" : "center-middle", x), q ? j(N, R, void 0, x) : j(N, R, ["SubProcessMarker"], x), G;
   }
-  function ie(N, R, x, G) {
-    var q = 22, J = {
+  function ne(N, R, x, G) {
+    var q = 22, Q = {
       fill: it(G, s, x.fill),
       stroke: be(G, c, x.stroke),
       width: q,
       height: q
     }, Ee = le(N).isInterrupting, Ye = Ee ? 0 : 3, lt = Ee ? 1 : 1.2, Bt = 20, bt = (q - Bt) / 2, rn = "translate(" + bt + "," + bt + ")";
     g(R, Bt, Bt, {
-      fill: J.fill,
-      stroke: J.stroke,
+      fill: Q.fill,
+      stroke: Q.stroke,
       strokeWidth: lt,
       strokeDasharray: Ye,
       transform: rn
-    }), $(N, R, J, G);
+    }), $(N, R, Q, G);
   }
-  function Me(N, R, x = {}) {
+  function Ae(N, R, x = {}) {
     var G = Je(N, R, x);
     return fe(N, R, "center-middle", x), j(N, R, void 0, x), G;
   }
-  var Ae = this.handlers = {
+  var Pe = this.handlers = {
     "bpmn:AdHocSubProcess": function(N, R, x = {}) {
       return ot(R) ? x = ut(x, [
         "fill",
@@ -14592,7 +14588,7 @@ function wo(e, t, n, i, r, o, a) {
       return x = ut(x, [
         "fill",
         "stroke"
-      ]), Q(N, R, x);
+      ]), Z(N, R, x);
     },
     "bpmn:BoundaryEvent": function(N, R, x = {}) {
       var { renderIcon: G = !0 } = x;
@@ -14600,13 +14596,13 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var q = le(R), J = q.get("cancelActivity");
+      var q = le(R), Q = q.get("cancelActivity");
       x = {
         strokeWidth: 1.5,
         fill: it(R, s, x.fill),
         fillOpacity: wA,
         stroke: be(R, c, x.stroke)
-      }, J || (x.strokeDasharray = "6");
+      }, Q || (x.strokeDasharray = "6");
       var Ee = ue(N, R, x);
       return g(N, R.width, R.height, fc, {
         ...x,
@@ -14618,13 +14614,13 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = Me(N, R, x), q = i.getScaledPath("TASK_TYPE_BUSINESS_RULE_MAIN", {
+      var G = Ae(N, R, x), q = i.getScaledPath("TASK_TYPE_BUSINESS_RULE_MAIN", {
         abspos: {
           x: 8,
           y: 8
         }
-      }), J = y(N, q);
-      _e(J, {
+      }), Q = y(N, q);
+      _e(Q, {
         fill: it(R, s, x.fill),
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
@@ -14676,7 +14672,7 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = i.getRawPath("DATA_ARROW"), q = te(N, R, x);
+      var G = i.getRawPath("DATA_ARROW"), q = ee(N, R, x);
       return y(N, G, {
         fill: "none",
         stroke: be(R, c, x.stroke),
@@ -14687,7 +14683,7 @@ function wo(e, t, n, i, r, o, a) {
       return x = ut(x, [
         "fill",
         "stroke"
-      ]), Q(N, R, {
+      ]), Z(N, R, {
         ...x,
         markerEnd: d(N, "association-end", it(R, s, x.fill), be(R, c, x.stroke))
       });
@@ -14696,7 +14692,7 @@ function wo(e, t, n, i, r, o, a) {
       return x = ut(x, [
         "fill",
         "stroke"
-      ]), te(N, R, x);
+      ]), ee(N, R, x);
     },
     "bpmn:DataObjectReference": P("bpmn:DataObject"),
     "bpmn:DataOutput": function(N, R, x = {}) {
@@ -14704,7 +14700,7 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = i.getRawPath("DATA_ARROW"), q = te(N, R, x);
+      var G = i.getRawPath("DATA_ARROW"), q = ee(N, R, x);
       return y(N, G, {
         strokeWidth: 1,
         fill: be(R, c, x.stroke),
@@ -14715,7 +14711,7 @@ function wo(e, t, n, i, r, o, a) {
       return x = ut(x, [
         "fill",
         "stroke"
-      ]), Q(N, R, {
+      ]), Z(N, R, {
         ...x,
         markerEnd: d(N, "association-end", it(R, s, x.fill), be(R, c, x.stroke))
       });
@@ -14765,7 +14761,7 @@ function wo(e, t, n, i, r, o, a) {
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
       });
-      var J = G.get("eventGatewayType"), Ee = !!G.get("instantiate");
+      var Q = G.get("eventGatewayType"), Ee = !!G.get("instantiate");
       function Ye() {
         var Bt = i.getScaledPath("GATEWAY_EVENT_BASED", {
           xScaleFactor: 0.18,
@@ -14783,7 +14779,7 @@ function wo(e, t, n, i, r, o, a) {
           strokeWidth: 2
         });
       }
-      if (J === "Parallel") {
+      if (Q === "Parallel") {
         var lt = i.getScaledPath("GATEWAY_PARALLEL", {
           xScaleFactor: 0.4,
           yScaleFactor: 0.4,
@@ -14799,7 +14795,7 @@ function wo(e, t, n, i, r, o, a) {
           stroke: be(R, c, x.stroke),
           strokeWidth: 1
         });
-      } else J === "Exclusive" && (Ee || g(N, R.width, R.height, R.height * 0.26, {
+      } else Q === "Exclusive" && (Ee || g(N, R.width, R.height, R.height * 0.26, {
         fill: "none",
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
@@ -14820,8 +14816,8 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.32,
           my: 0.3
         }
-      }), J = pt(R);
-      return J.get("isMarkerVisible") && y(N, q, {
+      }), Q = pt(R);
+      return Q.get("isMarkerVisible") && y(N, q, {
         fill: be(R, c, x.stroke),
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
@@ -14895,7 +14891,7 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = Me(N, R, x), q = i.getScaledPath("TASK_TYPE_MANUAL", {
+      var G = Ae(N, R, x), q = i.getScaledPath("TASK_TYPE_MANUAL", {
         abspos: {
           x: 17,
           y: 15
@@ -14912,9 +14908,9 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = le(R), q = pt(R), J = it(R, s, x.fill), Ee = be(R, c, x.stroke), Ye = m(N, R.waypoints, {
-        markerEnd: d(N, "messageflow-end", J, Ee),
-        markerStart: d(N, "messageflow-start", J, Ee),
+      var G = le(R), q = pt(R), Q = it(R, s, x.fill), Ee = be(R, c, x.stroke), Ye = m(N, R.waypoints, {
+        markerEnd: d(N, "messageflow-end", Q, Ee),
+        markerStart: d(N, "messageflow-start", Q, Ee),
         stroke: Ee,
         strokeDasharray: "10, 11",
         strokeWidth: 1.5
@@ -14928,8 +14924,8 @@ function wo(e, t, n, i, r, o, a) {
         }), bt = {
           strokeWidth: 1
         };
-        q.get("messageVisibleKind") === "initiating" ? (bt.fill = J, bt.stroke = Ee) : (bt.fill = Ee, bt.stroke = J);
-        var rn = y(N, Bt, bt), gn = G.get("messageRef"), mn = gn.get("name"), xt = ee(N, mn, {
+        q.get("messageVisibleKind") === "initiating" ? (bt.fill = Q, bt.stroke = Ee) : (bt.fill = Ee, bt.stroke = Q);
+        var rn = y(N, Bt, bt), gn = G.get("messageRef"), mn = gn.get("name"), xt = J(N, mn, {
           align: "center-top",
           fitBox: !0,
           style: {
@@ -14968,9 +14964,9 @@ function wo(e, t, n, i, r, o, a) {
         "width",
         "height"
       ]);
-      var G = K(N, R, x), q = ot(R), J = dn(R), Ee = le(R), Ye = Ee.get("name");
+      var G = K(N, R, x), q = ot(R), Q = dn(R), Ee = le(R), Ye = Ee.get("name");
       if (q) {
-        var lt = J ? [
+        var lt = Q ? [
           {
             x: 30,
             y: 0
@@ -14995,15 +14991,15 @@ function wo(e, t, n, i, r, o, a) {
         }), De(N, Ye, R, x);
       } else {
         var Bt = Pa(R, x);
-        J || (Bt.height = li(R, x), Bt.width = Un(R, x));
-        var bt = ee(N, Ye, {
+        Q || (Bt.height = li(R, x), Bt.width = Un(R, x));
+        var bt = J(N, Ye, {
           box: Bt,
           align: "center-middle",
           style: {
             fill: Aa(R, l, c, x.stroke)
           }
         });
-        if (!J) {
+        if (!Q) {
           var rn = -1 * Un(R, x);
           jc(bt, 0, -rn, 270);
         }
@@ -15015,17 +15011,17 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = le(R), q = Me(N, R, x), J;
+      var G = le(R), q = Ae(N, R, x), Q;
       return G.get("instantiate") ? (g(N, 28, 28, 20 * 0.22, {
         fill: it(R, s, x.fill),
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
-      }), J = i.getScaledPath("TASK_TYPE_INSTANTIATING_SEND", {
+      }), Q = i.getScaledPath("TASK_TYPE_INSTANTIATING_SEND", {
         abspos: {
           x: 7.77,
           y: 9.52
         }
-      })) : J = i.getScaledPath("TASK_TYPE_SEND", {
+      })) : Q = i.getScaledPath("TASK_TYPE_SEND", {
         xScaleFactor: 0.9,
         yScaleFactor: 0.9,
         containerWidth: 21,
@@ -15034,7 +15030,7 @@ function wo(e, t, n, i, r, o, a) {
           mx: 0.3,
           my: 0.4
         }
-      }), y(N, J, {
+      }), y(N, Q, {
         fill: it(R, s, x.fill),
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
@@ -15045,7 +15041,7 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = Me(N, R, x), q = i.getScaledPath("TASK_TYPE_SCRIPT", {
+      var G = Ae(N, R, x), q = i.getScaledPath("TASK_TYPE_SCRIPT", {
         abspos: {
           x: 15,
           y: 20
@@ -15062,7 +15058,7 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = Me(N, R, x), q = i.getScaledPath("TASK_TYPE_SEND", {
+      var G = Ae(N, R, x), q = i.getScaledPath("TASK_TYPE_SEND", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: 21,
@@ -15083,26 +15079,26 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = it(R, s, x.fill), q = be(R, c, x.stroke), J = m(N, R.waypoints, {
+      var G = it(R, s, x.fill), q = be(R, c, x.stroke), Q = m(N, R.waypoints, {
         markerEnd: d(N, "sequenceflow-end", G, q),
         stroke: q
       }), Ee = le(R), { source: Ye } = R;
       if (Ye) {
         var lt = le(Ye);
-        Ee.get("conditionExpression") && M(lt, "bpmn:Activity") && _e(J, {
+        Ee.get("conditionExpression") && M(lt, "bpmn:Activity") && _e(Q, {
           markerStart: d(N, "conditional-flow-marker", G, q)
-        }), lt.get("default") && (M(lt, "bpmn:Gateway") || M(lt, "bpmn:Activity")) && lt.get("default") === Ee && _e(J, {
+        }), lt.get("default") && (M(lt, "bpmn:Gateway") || M(lt, "bpmn:Activity")) && lt.get("default") === Ee && _e(Q, {
           markerStart: d(N, "conditional-default-flow-marker", G, q)
         });
       }
-      return J;
+      return Q;
     },
     "bpmn:ServiceTask": function(N, R, x = {}) {
       x = ut(x, [
         "fill",
         "stroke"
       ]);
-      var G = Me(N, R, x);
+      var G = Ae(N, R, x);
       g(N, 10, 10, {
         fill: it(R, s, x.fill),
         stroke: "none",
@@ -15123,13 +15119,13 @@ function wo(e, t, n, i, r, o, a) {
         stroke: "none",
         transform: "translate(11, 10)"
       });
-      var J = i.getScaledPath("TASK_TYPE_SERVICE", {
+      var Q = i.getScaledPath("TASK_TYPE_SERVICE", {
         abspos: {
           x: 17,
           y: 22
         }
       });
-      return y(N, J, {
+      return y(N, Q, {
         fill: it(R, s, x.fill),
         stroke: be(R, c, x.stroke),
         strokeWidth: 1
@@ -15146,8 +15142,8 @@ function wo(e, t, n, i, r, o, a) {
         ...x,
         strokeDasharray: "6"
       });
-      var J = ue(N, R, x);
-      return G && $(R, N, x), J;
+      var Q = ue(N, R, x);
+      return G && $(R, N, x), Q;
     },
     "bpmn:SubProcess": function(N, R, x = {}) {
       return ot(R) ? x = ut(x, [
@@ -15164,7 +15160,7 @@ function wo(e, t, n, i, r, o, a) {
       return x = ut(x, [
         "fill",
         "stroke"
-      ]), Me(N, R, x);
+      ]), Ae(N, R, x);
     },
     "bpmn:TextAnnotation": function(N, R, x = {}) {
       x = ut(x, [
@@ -15174,7 +15170,7 @@ function wo(e, t, n, i, r, o, a) {
       var {
         width: G,
         height: q
-      } = Pa(R, x), J = b(N, G, q, 0, 0, {
+      } = Pa(R, x), Q = b(N, G, q, 0, 0, {
         fill: "none",
         stroke: "none"
       }), Ee = i.getScaledPath("TEXT_ANNOTATION", {
@@ -15191,14 +15187,14 @@ function wo(e, t, n, i, r, o, a) {
         stroke: be(R, c, x.stroke)
       });
       var Ye = le(R), lt = Ye.get("text") || "";
-      return ee(N, lt, {
+      return J(N, lt, {
         align: "left-top",
         box: Pa(R, x),
         padding: Go,
         style: {
           fill: Aa(R, l, c, x.stroke)
         }
-      }), J;
+      }), Q;
     },
     "bpmn:Transaction": function(N, R, x = {}) {
       ot(R) ? x = ut(x, [
@@ -15216,8 +15212,8 @@ function wo(e, t, n, i, r, o, a) {
       }), q = n.style(["no-fill", "no-events"], {
         stroke: be(R, c, x.stroke),
         strokeWidth: 1.5
-      }), J = ot(R);
-      return J || (x = {}), b(
+      }), Q = ot(R);
+      return Q || (x = {}), b(
         N,
         li(R, x),
         Un(R, x),
@@ -15231,10 +15227,10 @@ function wo(e, t, n, i, r, o, a) {
         "fill",
         "stroke"
       ]);
-      var G = Me(N, R, x), q = 15, J = 12, Ee = i.getScaledPath("TASK_TYPE_USER_1", {
+      var G = Ae(N, R, x), q = 15, Q = 12, Ee = i.getScaledPath("TASK_TYPE_USER_1", {
         abspos: {
           x: q,
-          y: J
+          y: Q
         }
       });
       y(N, Ee, {
@@ -15245,7 +15241,7 @@ function wo(e, t, n, i, r, o, a) {
       var Ye = i.getScaledPath("TASK_TYPE_USER_2", {
         abspos: {
           x: q,
-          y: J
+          y: Q
         }
       });
       y(N, Ye, {
@@ -15256,7 +15252,7 @@ function wo(e, t, n, i, r, o, a) {
       var lt = i.getScaledPath("TASK_TYPE_USER_3", {
         abspos: {
           x: q,
-          y: J
+          y: Q
         }
       });
       return y(N, lt, {
@@ -15266,7 +15262,7 @@ function wo(e, t, n, i, r, o, a) {
       }), G;
     },
     label: function(N, R, x = {}) {
-      return Re(N, R, x);
+      return Ce(N, R, x);
     }
   };
   this._drawPath = y, this._renderer = w;
@@ -15902,16 +15898,16 @@ function Op(e) {
   return Math.log(e) / Math.log(10);
 }
 var XA = 1e3;
-function se(e) {
+function ce(e) {
   this._eventBus = e;
 }
-se.$inject = ["eventBus"];
+ce.$inject = ["eventBus"];
 function ZA(e, t) {
   return function(n) {
     return e.call(t || null, n.context, n.command, n);
   };
 }
-se.prototype.on = function(e, t, n, i, r, o) {
+ce.prototype.on = function(e, t, n, i, r, o) {
   if ((fn(t) || He(t)) && (o = r, r = i, i = n, n = t, t = null), fn(n) && (o = r, r = i, i = n, n = XA), hn(r) && (o = r, r = !1), !fn(i))
     throw new Error("handlerFn must be a function");
   $e(e) || (e = [e]);
@@ -15923,15 +15919,15 @@ se.prototype.on = function(e, t, n, i, r, o) {
     a.on(c, n, r ? ZA(i, o) : i, o);
   });
 };
-se.prototype.canExecute = lr("canExecute");
-se.prototype.preExecute = lr("preExecute");
-se.prototype.preExecuted = lr("preExecuted");
-se.prototype.execute = lr("execute");
-se.prototype.executed = lr("executed");
-se.prototype.postExecute = lr("postExecute");
-se.prototype.postExecuted = lr("postExecuted");
-se.prototype.revert = lr("revert");
-se.prototype.reverted = lr("reverted");
+ce.prototype.canExecute = lr("canExecute");
+ce.prototype.preExecute = lr("preExecute");
+ce.prototype.preExecuted = lr("preExecuted");
+ce.prototype.execute = lr("execute");
+ce.prototype.executed = lr("executed");
+ce.prototype.postExecute = lr("postExecute");
+ce.prototype.postExecuted = lr("postExecuted");
+ce.prototype.revert = lr("revert");
+ce.prototype.reverted = lr("reverted");
 function lr(e) {
   return function(n, i, r, o, a) {
     (fn(n) || He(n)) && (a = o, o = r, r = i, i = n, n = null), this.on(n, e, i, r, o, a);
@@ -15944,7 +15940,7 @@ var kf = [
   "right"
 ], dc = 10;
 function Of(e, t) {
-  se.call(this, e), this.postExecuted([
+  ce.call(this, e), this.postExecuted([
     "connection.create",
     "connection.layout",
     "connection.updateWaypoints"
@@ -16005,7 +16001,7 @@ function Of(e, t) {
     }
   }
 }
-we(Of, se);
+we(Of, ce);
 Of.$inject = [
   "eventBus",
   "modeling"
@@ -16052,7 +16048,7 @@ function tP(e) {
   return kf.indexOf(e) !== -1;
 }
 function Df(e) {
-  se.call(this, e), this.preExecute("shape.append", function(t) {
+  ce.call(this, e), this.preExecute("shape.append", function(t) {
     var n = t.source, i = t.shape;
     t.position || (M(i, "bpmn:TextAnnotation") ? t.position = {
       x: n.x + n.width / 2 + 75,
@@ -16063,13 +16059,13 @@ function Df(e) {
     });
   }, !0);
 }
-we(Df, se);
+we(Df, ce);
 Df.$inject = [
   "eventBus"
 ];
 var nP = 1500;
 function If(e, t, n) {
-  e.invoke(se, this), this.preExecute("elements.delete", nP, function(r) {
+  e.invoke(ce, this), this.preExecute("elements.delete", nP, function(r) {
     var o = r.context, a = o.elements, s = i(a);
     s.length && (o.elements = a.concat(s));
   }), t.on("shape.move.start", function(r) {
@@ -16097,14 +16093,14 @@ function If(e, t, n) {
     }), Array.from(c);
   }
 }
-we(If, se);
+we(If, ce);
 If.$inject = [
   "injector",
   "eventBus",
   "canvas"
 ];
 function Lf(e, t) {
-  e.invoke(se, this), this.postExecute("shape.move", function(n) {
+  e.invoke(ce, this), this.postExecute("shape.move", function(n) {
     var i = n.newParent, r = n.shape, o = et(r.incoming.concat(r.outgoing), function(a) {
       return M(a, "bpmn:Association");
     });
@@ -16113,7 +16109,7 @@ function Lf(e, t) {
     });
   }, !0);
 }
-we(Lf, se);
+we(Lf, ce);
 Lf.$inject = [
   "injector",
   "modeling"
@@ -16146,7 +16142,7 @@ function _x(e, t) {
 }
 var am = 500;
 function Ll(e, t) {
-  t.invoke(se, this), this._bpmnReplace = e;
+  t.invoke(ce, this), this._bpmnReplace = e;
   var n = this;
   this.postExecuted("elements.create", am, function(i) {
     var r = i.elements;
@@ -16171,7 +16167,7 @@ Ll.$inject = [
   "bpmnReplace",
   "injector"
 ];
-we(Ll, se);
+we(Ll, ce);
 Ll.prototype._replaceShape = function(e, t) {
   var n = iP(e), i = {
     type: "bpmn:BoundaryEvent",
@@ -16187,7 +16183,7 @@ function sm(e, t) {
   return !Ze(e) && Qe(e, ["bpmn:IntermediateThrowEvent", "bpmn:IntermediateCatchEvent"]) && !!t;
 }
 function Nf(e, t) {
-  se.call(this, e);
+  ce.call(this, e);
   function n(i) {
     return et(i.attachers, function(r) {
       return M(r, "bpmn:BoundaryEvent");
@@ -16208,7 +16204,7 @@ Nf.$inject = [
   "eventBus",
   "modeling"
 ];
-we(Nf, se);
+we(Nf, ce);
 function wx(e) {
   return e.create("bpmn:Category");
 }
@@ -16232,7 +16228,7 @@ function sP(e) {
 }
 var cP = 500;
 function Bf(e, t, n) {
-  n.invoke(se, this);
+  n.invoke(ce, this);
   function i(c) {
     return t.filter(function(l) {
       return M(l, "bpmn:Group") && !l.labelTarget;
@@ -16293,13 +16289,13 @@ Bf.$inject = [
   "elementRegistry",
   "injector"
 ];
-we(Bf, se);
+we(Bf, ce);
 function cm(e) {
   var t;
   return ((t = e.updates) == null ? void 0 : t.groups) || [];
 }
 function $f(e, t, n) {
-  se.call(this, e), this.preExecute("shape.replace", s, !0), this.postExecuted("shape.replace", c, !0), this.preExecute("connection.create", r, !0), this.postExecuted("connection.delete", i, !0), this.postExecuted("connection.reconnect", o, !0), this.postExecuted("element.updateProperties", a, !0);
+  ce.call(this, e), this.preExecute("shape.replace", s, !0), this.postExecuted("shape.replace", c, !0), this.preExecute("connection.create", r, !0), this.postExecuted("connection.delete", i, !0), this.postExecuted("connection.reconnect", o, !0), this.postExecuted("element.updateProperties", a, !0);
   function i(b) {
     const E = b.source, _ = b.target;
     Io(E) && Ta(_) && u(_);
@@ -16372,7 +16368,7 @@ function $f(e, t, n) {
     t.removeElements(E);
   }
 }
-we($f, se);
+we($f, ce);
 $f.$inject = [
   "eventBus",
   "modeling",
@@ -16389,15 +16385,15 @@ function hc(e) {
   return e && M(e, "bpmn:Activity") && !Pn(e);
 }
 function Ff(e) {
-  e.invoke(se, this), this.preExecute("shape.create", 1500, function(t) {
+  e.invoke(ce, this), this.preExecute("shape.create", 1500, function(t) {
     var n = t.context, i = n.parent, r = n.shape;
     M(i, "bpmn:Lane") && !M(r, "bpmn:Lane") && (n.parent = Zo(i, "bpmn:Participant"));
   });
 }
 Ff.$inject = ["injector"];
-we(Ff, se);
+we(Ff, ce);
 function jf(e, t) {
-  se.call(this, e), this.preExecute("shape.create", function(n) {
+  ce.call(this, e), this.preExecute("shape.create", function(n) {
     var a;
     var i = n.context, r = i.shape;
     if (M(r, "bpmn:DataObjectReference") && r.type !== "label") {
@@ -16410,10 +16406,10 @@ jf.$inject = [
   "eventBus",
   "bpmnFactory"
 ];
-we(jf, se);
+we(jf, ce);
 var Dp = 20, Ip = 20, Sx = 30, gc = 2e3;
 function Hf(e, t, n) {
-  se.call(this, t), t.on([
+  ce.call(this, t), t.on([
     "create.start",
     "shape.move.start"
   ], gc, function(r) {
@@ -16465,7 +16461,7 @@ Hf.$inject = [
   "eventBus",
   "modeling"
 ];
-we(Hf, se);
+we(Hf, ce);
 function lP(e, t) {
   t = {
     width: t.width + Dp * 2 + Sx,
@@ -16494,7 +16490,7 @@ function pP(e) {
 }
 var lm = "__targetRef_placeholder";
 function zf(e, t) {
-  se.call(this, e), this.executed([
+  ce.call(this, e), this.executed([
     "connection.create",
     "connection.delete",
     "connection.move",
@@ -16532,7 +16528,7 @@ zf.$inject = [
   "eventBus",
   "bpmnFactory"
 ];
-we(zf, se);
+we(zf, ce);
 function um(e) {
   return function(t) {
     var n = t.context, i = n.connection;
@@ -16553,7 +16549,7 @@ Nl.prototype.revert = function(e) {
   return this._bpmnUpdater.updateSemanticParent(t, i), this._bpmnUpdater.updateDiParent(n, r), [];
 };
 function Gf(e, t, n, i) {
-  se.call(this, i), t.registerHandler("dataStore.updateContainment", Nl);
+  ce.call(this, i), t.registerHandler("dataStore.updateContainment", Nl);
   function r() {
     return n.filter(function(s) {
       return M(s, "bpmn:Participant") && le(s).processRef;
@@ -16615,7 +16611,7 @@ Gf.$inject = [
   "elementRegistry",
   "eventBus"
 ];
-we(Gf, se);
+we(Gf, ce);
 function fP(e, t) {
   for (var n = e.businessObject || e, i = t.businessObject || t; n.$parent; ) {
     if (n.$parent === i.processRef || i)
@@ -16747,7 +16743,7 @@ function EP(e, t) {
 }
 var SP = 500;
 function Vf(e, t) {
-  se.call(this, e);
+  ce.call(this, e);
   function n(i, r) {
     var o = dn(i), a = Nr(r), s = [], c = [], l = [], u = [];
     if (_o(a, function(b) {
@@ -16808,10 +16804,10 @@ Vf.$inject = [
   "eventBus",
   "spaceTool"
 ];
-we(Vf, se);
+we(Vf, ce);
 var pm = 500;
 function $l(e, t) {
-  t.invoke(se, this), this._bpmnReplace = e;
+  t.invoke(ce, this), this._bpmnReplace = e;
   var n = this;
   this.postExecuted("elements.create", pm, function(i) {
     var r = i.elements;
@@ -16835,7 +16831,7 @@ $l.$inject = [
   "bpmnReplace",
   "injector"
 ];
-we($l, se);
+we($l, ce);
 $l.prototype._replaceShape = function(e) {
   var t = RP(e), n;
   return t ? n = {
@@ -16908,7 +16904,7 @@ function Lp(e, t) {
   return TP(e, t) || kP(e, t);
 }
 function Wf(e, t, n) {
-  se.call(this, e);
+  ce.call(this, e);
   function i(r, o, a) {
     var s = o.waypoints, c, l, u, p, f, d, h, g = r.outgoing.slice(), b = r.incoming.slice(), E;
     He(a.width) ? E = Be(a) : E = a;
@@ -16957,7 +16953,7 @@ function Wf(e, t, n) {
     a && i(o, a, s);
   }, !0);
 }
-we(Wf, se);
+we(Wf, ce);
 Wf.$inject = [
   "eventBus",
   "bpmnRules",
@@ -16971,7 +16967,7 @@ function hm(e) {
   return W({}, e);
 }
 function Uf(e, t) {
-  se.call(this, e), this.preExecuted("connection.create", function(n) {
+  ce.call(this, e), this.preExecuted("connection.create", function(n) {
     var i = n.context, r = i.connection, o = i.source, a = i.target, s = i.hints;
     if (!(s && s.createElementsBehavior === !1) && Lo(r)) {
       var c = [];
@@ -17004,7 +17000,7 @@ Uf.$inject = [
   "eventBus",
   "modeling"
 ];
-we(Uf, se);
+we(Uf, ce);
 function Lo(e) {
   return M(e, "bpmn:SequenceFlow");
 }
@@ -17061,7 +17057,7 @@ Ax.$inject = [
 ];
 var mm = 770;
 function qf(e, t, n, i) {
-  n.invoke(se, this);
+  n.invoke(ce, this);
   function r(s, c) {
     var l = le(s), u = c.categoryValue || l.categoryValueRef;
     u || (u = Ex(e, l));
@@ -17127,7 +17123,7 @@ qf.$inject = [
   "injector",
   "moddleCopy"
 ];
-we(qf, se);
+we(qf, ce);
 function Np(e, t, n, i) {
   var r, o, a, s, c;
   return r = (i.y - n.y) * (t.x - e.x) - (i.x - n.x) * (t.y - e.y), r == 0 ? null : (o = e.y - n.y, a = e.x - n.x, c = (i.x - n.x) * o - (i.y - n.y) * a, s = c / r, {
@@ -17170,7 +17166,7 @@ function ym(e, t) {
   return Math.sqrt(Math.pow(e.x - t.x, 2) + Math.pow(e.y - t.y, 2));
 }
 function Yf(e) {
-  se.call(this, e);
+  ce.call(this, e);
   var t = [
     "bpmn:Participant",
     "bpmn:Lane"
@@ -17184,7 +17180,7 @@ function Yf(e) {
   });
 }
 Yf.$inject = ["eventBus"];
-we(Yf, se);
+we(Yf, ce);
 function Tx(e) {
   return Math.sqrt(Math.pow(e.x, 2) + Math.pow(e.y, 2));
 }
@@ -17429,7 +17425,7 @@ function UP(e, t) {
 }
 var Rm = "name", Cm = "text";
 function Xf(e, t, n, i) {
-  se.call(this, e), this.postExecute("element.updateProperties", r), this.postExecute("element.updateModdleProperties", (a) => {
+  ce.call(this, e), this.postExecute("element.updateProperties", r), this.postExecute("element.updateModdleProperties", (a) => {
     le(a.context.element) === a.context.moddleElement && r(a);
   });
   function r(a) {
@@ -17495,7 +17491,7 @@ function Xf(e, t, n, i) {
     }
   });
 }
-we(Xf, se);
+we(Xf, ce);
 Xf.$inject = [
   "eventBus",
   "modeling",
@@ -17573,7 +17569,7 @@ function ZP(e, t, n, i) {
   return Ix(e, t, n, i).point;
 }
 function Zf(e, t) {
-  se.call(this, e);
+  ce.call(this, e);
   function n(i, r) {
     var o = i.context, a = o.connection, s = W({}, o.hints), c = o.newWaypoints || a.waypoints, l = o.oldWaypoints;
     return typeof s.startChanged > "u" && (s.startChanged = !!s.connectionStart), typeof s.endChanged > "u" && (s.endChanged = !!s.connectionEnd), ZP(r, c, l, s);
@@ -17609,7 +17605,7 @@ function Zf(e, t) {
     });
   });
 }
-we(Zf, se);
+we(Zf, ce);
 Zf.$inject = [
   "eventBus",
   "modeling"
@@ -17657,7 +17653,7 @@ function JP(e) {
   return e.original || e;
 }
 function ed(e, t) {
-  se.call(this, e), this.postExecute("shape.replace", function(n) {
+  ce.call(this, e), this.postExecute("shape.replace", function(n) {
     var i = n.oldShape, r = n.newShape;
     if (eT(i, r)) {
       var o = tT(i);
@@ -17672,7 +17668,7 @@ function ed(e, t) {
   }, !0);
 }
 ed.$inject = ["eventBus", "modeling"];
-we(ed, se);
+we(ed, ce);
 function eT(e, t) {
   return M(e, "bpmn:Participant") && ot(e) && M(t, "bpmn:Participant") && !ot(t);
 }
@@ -17707,7 +17703,7 @@ function Fx(e) {
   return M(e, "bpmn:BoundaryEvent") ? "cancelActivity" : "isInterrupting";
 }
 function td(e, t) {
-  e.invoke(se, this), this.postExecuted("shape.replace", function(n) {
+  e.invoke(ce, this), this.postExecuted("shape.replace", function(n) {
     const i = n.context.oldShape, r = n.context.newShape, o = n.context.hints;
     if (!$x(r))
       return;
@@ -17721,22 +17717,22 @@ function td(e, t) {
   });
 }
 td.$inject = ["injector", "modeling"];
-we(td, se);
+we(td, ce);
 function nd(e, t) {
-  se.call(this, e), this.preExecute("shape.resize", function(n) {
+  ce.call(this, e), this.preExecute("shape.resize", function(n) {
     var i = n.shape, r = pt(i), o = r && r.get("label"), a = o && o.get("bounds");
     a && t.updateModdleProperties(i, o, {
       bounds: void 0
     });
   }, !0);
 }
-we(nd, se);
+we(nd, ce);
 nd.$inject = [
   "eventBus",
   "modeling"
 ];
 function id(e, t, n) {
-  se.call(this, e), this.preExecute("shape.delete", function(i) {
+  ce.call(this, e), this.preExecute("shape.delete", function(i) {
     var r = i.context.shape;
     if (!(r.incoming.length !== 1 || r.outgoing.length !== 1)) {
       var o = r.incoming[0], a = r.outgoing[0];
@@ -17747,7 +17743,7 @@ function id(e, t, n) {
     }
   });
 }
-we(id, se);
+we(id, ce);
 id.$inject = [
   "eventBus",
   "bpmnRules",
@@ -17773,7 +17769,7 @@ function iT(e, t) {
   ];
 }
 function rd(e, t) {
-  se.call(this, e), this.preExecute("shape.delete", function(n) {
+  ce.call(this, e), this.preExecute("shape.delete", function(n) {
     var i = n.shape, r = i.parent;
     M(i, "bpmn:Participant") && (n.collaborationRoot = r);
   }, !0), this.postExecute("shape.delete", function(n) {
@@ -17785,9 +17781,9 @@ function rd(e, t) {
   }, !0);
 }
 rd.$inject = ["eventBus", "modeling"];
-we(rd, se);
+we(rd, ce);
 function od(e, t, n, i) {
-  se.call(this, e);
+  ce.call(this, e);
   var r = i.get("dragging", !1);
   function o(c) {
     var l = c.source, u = c.target, p = c.parent;
@@ -17822,7 +17818,7 @@ function od(e, t, n, i) {
     ), d && t.updateProperties(d, { conditionExpression: void 0 })), u.conditionExpression && f.sourceRef.default === f && t.updateProperties(p.source, { default: void 0 });
   });
 }
-we(od, se);
+we(od, ce);
 od.$inject = [
   "eventBus",
   "modeling",
@@ -17830,7 +17826,7 @@ od.$inject = [
   "injector"
 ];
 function zl(e, t, n, i, r, o) {
-  i.invoke(se, this), this._bpmnReplace = e, this._elementRegistry = n, this._selection = o, this.postExecuted(["elements.create"], 500, function(a) {
+  i.invoke(ce, this), this._bpmnReplace = e, this._elementRegistry = n, this._selection = o, this.postExecuted(["elements.create"], 500, function(a) {
     var s = a.context, c = s.parent, l = s.elements, u = Zn(l, function(p, f) {
       var d = t.canReplace([f], f.host || f.parent || c);
       return d ? p.concat(d.replacements) : p;
@@ -17851,7 +17847,7 @@ function zl(e, t, n, i, r, o) {
     r.unclaimId(c.businessObject.id, c.businessObject), r.updateProperties(l, { id: c.id });
   });
 }
-we(zl, se);
+we(zl, ce);
 zl.prototype._replaceElements = function(e, t) {
   var n = this._elementRegistry, i = this._bpmnReplace, r = this._selection;
   z(t, function(o) {
@@ -17958,7 +17954,7 @@ Ux.$inject = [
 ];
 var fT = 500;
 function cd(e, t, n, i, r) {
-  n.invoke(se, this);
+  n.invoke(ce, this);
   function o(u) {
     return Qe(u, ["bpmn:ReceiveTask", "bpmn:SendTask"]) || dT(u, [
       "bpmn:ErrorEventDefinition",
@@ -18034,7 +18030,7 @@ cd.$inject = [
   "moddleCopy",
   "bpmnFactory"
 ];
-we(cd, se);
+we(cd, ce);
 function dT(e, t) {
   return $e(t) || (t = [t]), Or(t, function(n) {
     return ca(e, n);
@@ -18119,7 +18115,7 @@ var Tm = 400, wT = 600, km = {
   y: 160
 };
 function ur(e, t, n, i, r, o, a) {
-  se.call(this, t), this._canvas = e, this._eventBus = t, this._modeling = n, this._elementFactory = i, this._bpmnFactory = r, this._bpmnjs = o, this._elementRegistry = a;
+  ce.call(this, t), this._canvas = e, this._eventBus = t, this._modeling = n, this._elementFactory = i, this._bpmnFactory = r, this._bpmnjs = o, this._elementRegistry = a;
   var s = this;
   function c(p) {
     return M(p, "bpmn:SubProcess") && !ot(p);
@@ -18251,7 +18247,7 @@ function ur(e, t, n, i, r, o, a) {
     f.parent && (c(f.parent) || f.parent.hidden) && (f.hidden = !0);
   });
 }
-we(ur, se);
+we(ur, ce);
 ur.prototype._moveChildrenToShape = function(e, t) {
   var n = this._modeling;
   if (e.length) {
@@ -18346,7 +18342,7 @@ function ST(e) {
   }, []);
 }
 function ud(e, t) {
-  e.invoke(se, this), this.postExecuted("shape.replace", function(n) {
+  e.invoke(ce, this), this.postExecuted("shape.replace", function(n) {
     var i = n.context.oldShape, r = n.context.newShape;
     if (!(!M(r, "bpmn:SubProcess") || M(r, "bpmn:AdHocSubProcess") || !(M(i, "bpmn:Task") || M(i, "bpmn:CallActivity")) || !ot(r))) {
       var o = RT(r);
@@ -18358,7 +18354,7 @@ ud.$inject = [
   "injector",
   "modeling"
 ];
-we(ud, se);
+we(ud, ce);
 function RT(e) {
   return {
     x: e.x + e.width / 6,
@@ -18366,7 +18362,7 @@ function RT(e) {
   };
 }
 function pd(e, t) {
-  se.call(this, e), this.preExecute("connection.create", function(n) {
+  ce.call(this, e), this.preExecute("connection.create", function(n) {
     const { target: i } = n;
     M(i, "bpmn:TextAnnotation") && (n.parent = i.parent);
   }, !0), this.preExecute(["shape.create", "shape.resize", "elements.move"], function(n) {
@@ -18385,13 +18381,13 @@ function pd(e, t) {
     }
   });
 }
-we(pd, se);
+we(pd, ce);
 pd.$inject = [
   "eventBus",
   "textRenderer"
 ];
 function fd(e, t) {
-  se.call(this, e), this.postExecuted("shape.toggleCollapse", 1500, function(n) {
+  ce.call(this, e), this.postExecuted("shape.toggleCollapse", 1500, function(n) {
     var i = n.shape;
     if (ot(i))
       return;
@@ -18409,14 +18405,14 @@ function fd(e, t) {
     }
   }, !0);
 }
-we(fd, se);
+we(fd, ce);
 fd.$inject = [
   "eventBus",
   "modeling"
 ];
 var Ku = 500;
 function dd(e, t, n) {
-  se.call(this, e);
+  ce.call(this, e);
   function i(a) {
     a.length && a.forEach(function(s) {
       s.type === "label" && !s.businessObject.name && (s.hidden = !0);
@@ -18447,7 +18443,7 @@ function dd(e, t, n) {
     });
   });
 }
-we(dd, se);
+we(dd, ce);
 dd.$inject = [
   "eventBus",
   "elementFactory",
@@ -18459,7 +18455,7 @@ function CT(e) {
   });
 }
 function hd(e, t, n, i) {
-  t.invoke(se, this), this.preExecute("shape.delete", function(r) {
+  t.invoke(ce, this), this.preExecute("shape.delete", function(r) {
     var o = r.context, a = o.shape, s = a.businessObject;
     Ze(a) || (M(a, "bpmn:Participant") && ot(a) && n.ids.unclaim(s.processRef.id), i.unclaimId(s.id, s));
   }), this.preExecute("connection.delete", function(r) {
@@ -18470,17 +18466,17 @@ function hd(e, t, n, i) {
     M(r, "bpmn:Collaboration") && n.ids.unclaim(o.id);
   });
 }
-we(hd, se);
+we(hd, ce);
 hd.$inject = ["canvas", "injector", "moddle", "modeling"];
 function gd(e, t) {
-  se.call(this, e), this.preExecute("connection.delete", function(n) {
+  ce.call(this, e), this.preExecute("connection.delete", function(n) {
     var i = n.context, r = i.connection, o = r.source;
     MT(r, o) && t.updateProperties(o, {
       default: null
     });
   });
 }
-we(gd, se);
+we(gd, ce);
 gd.$inject = [
   "eventBus",
   "modeling"
@@ -18507,7 +18503,7 @@ var AT = 500, PT = 5e3, Zx = [
   "elements.move"
 ];
 function md(e, t) {
-  se.call(this, e);
+  ce.call(this, e);
   var n;
   function i() {
     return n = n || new TT(), n.enter(), n;
@@ -18536,7 +18532,7 @@ md.$inject = [
   "eventBus",
   "modeling"
 ];
-we(md, se);
+we(md, ce);
 function TT() {
   this.flowNodes = [], this.lanes = [], this.counter = 0, this.addLane = function(e) {
     this.lanes.push(e);
@@ -18568,7 +18564,7 @@ var kT = 500, OT = 5e3, Qx = [
   "spaceTool"
 ];
 function yd(e, t) {
-  se.call(this, e);
+  ce.call(this, e);
   var n;
   function i() {
     return n = n || new DT(), n.enter(), n;
@@ -18603,7 +18599,7 @@ yd.$inject = [
   "eventBus",
   "modeling"
 ];
-we(yd, se);
+we(yd, ce);
 function DT() {
   this.affectedFlowElements = /* @__PURE__ */ new Set(), this.affectedGroupEntries = /* @__PURE__ */ new Map(), this.counter = 0, this.addFlowElement = function(e) {
     this.affectedFlowElements.add(e);
@@ -18619,13 +18615,13 @@ function DT() {
   };
 }
 function vd(e, t) {
-  se.call(this, e), this.postExecuted("elements.create", function(n) {
+  ce.call(this, e), this.postExecuted("elements.create", function(n) {
     const i = n.context, r = i.elements;
     for (const o of r)
       IT(o) && !NT(o) && t.updateProperties(o, { isForCompensation: void 0 });
   });
 }
-we(vd, se);
+we(vd, ce);
 vd.$inject = [
   "eventBus",
   "modeling"
@@ -18747,10 +18743,10 @@ const Wi = {
   rules: ["type", bd]
 };
 function bi(e) {
-  se.call(this, e), this.init();
+  ce.call(this, e), this.init();
 }
 bi.$inject = ["eventBus"];
-we(bi, se);
+we(bi, ce);
 bi.prototype.addRule = function(e, t, n) {
   var i = this;
   typeof e == "string" && (e = [e]), e.forEach(function(r) {
@@ -19115,7 +19111,7 @@ const t2 = {
   bpmnDiOrdering: ["type", g_]
 };
 function Vl(e) {
-  se.call(this, e);
+  ce.call(this, e);
   var t = this;
   this.preExecute(["shape.create", "connection.create"], function(n) {
     var i = n.context, r = i.shape || i.connection, o = i.parent, a = t.getOrdering(r, o);
@@ -19128,7 +19124,7 @@ function Vl(e) {
 Vl.prototype.getOrdering = function(e, t) {
   return null;
 };
-we(Vl, se);
+we(Vl, ce);
 function wd(e, t) {
   Vl.call(this, e);
   var n = [
@@ -19312,12 +19308,12 @@ function y_(e, t, n) {
   var i = this;
   function r(T, $, k) {
     if (!s(T, $)) {
-      var I, j, ee;
-      k ? j = t.getGraphics(k) : (I = $.delegateTarget || $.target, I && (j = I, k = t.get(j))), !(!j || !k) && (ee = e.fire(T, {
+      var I, j, J;
+      k ? j = t.getGraphics(k) : (I = $.delegateTarget || $.target, I && (j = I, k = t.get(j))), !(!j || !k) && (J = e.fire(T, {
         element: k,
         gfx: j,
         originalEvent: $
-      }), ee === !1 && ($.stopPropagation(), $.preventDefault()));
+      }), J === !1 && ($.stopPropagation(), $.preventDefault()));
     }
   }
   var o = {};
@@ -19352,8 +19348,8 @@ function y_(e, t, n) {
   }
   var p = "svg, .djs-element";
   function f(T, $, k, I) {
-    var j = o[k] = function(ee) {
-      r(k, ee);
+    var j = o[k] = function(J) {
+      r(k, J);
     };
     I && (l[k] = I), j.$delegate = Yn.bind(T, p, $, j);
   }
@@ -21204,7 +21200,7 @@ function Mr(e, t) {
 }
 var rk = 250, oy = 1400;
 function Cd(e, t, n) {
-  se.call(this, t);
+  ce.call(this, t);
   var i = e.get("movePreview", !1);
   t.on("shape.move.start", oy, function(r) {
     var o = r.context, a = o.shapes, s = o.validatedShapes;
@@ -21239,7 +21235,7 @@ function Cd(e, t, n) {
     s && (Kt(s.labels, a, c), a.labelTarget = s);
   });
 }
-we(Cd, se);
+we(Cd, ce);
 Cd.$inject = [
   "injector",
   "eventBus",
@@ -21257,7 +21253,7 @@ const ok = {
 };
 var ak = 251, sy = 1401, cy = "attach-ok";
 function Md(e, t, n, i, r) {
-  se.call(this, t);
+  ce.call(this, t);
   var o = e.get("movePreview", !1);
   t.on("shape.move.start", sy, function(a) {
     var s = a.context, c = s.shapes, l = s.validatedShapes;
@@ -21344,7 +21340,7 @@ function Md(e, t, n, i, r) {
     }), s.host && r.updateAttachment(s, null);
   });
 }
-we(Md, se);
+we(Md, ce);
 Md.$inject = [
   "injector",
   "eventBus",
@@ -21481,7 +21477,7 @@ wi.prototype.createDiPlane = function(e, t) {
   }, t));
 };
 function ei(e, t, n) {
-  se.call(this, e), this._bpmnFactory = t;
+  ce.call(this, e), this._bpmnFactory = t;
   var i = this;
   function r(d) {
     var h = d.context, g = h.hints || {}, b;
@@ -21579,7 +21575,7 @@ function ei(e, t, n) {
     kr(h) || Uc(h) || (g && !E ? b.set("label", t.create("bpmndi:BPMNLabel")) : !g && E && b.set("label", void 0));
   }
 }
-we(ei, se);
+we(ei, ce);
 ei.$inject = [
   "eventBus",
   "bpmnFactory",
@@ -24602,7 +24598,7 @@ const uu = {
   overlays: ["type", vn]
 };
 function Wd(e, t) {
-  t.invoke(se, this), this.executed(function(n) {
+  t.invoke(ce, this), this.executed(function(n) {
     var i = n.context;
     i.rootElement ? e.setRootElement(i.rootElement) : i.rootElement = e.getRootElement();
   }), this.revert(function(n) {
@@ -24610,7 +24606,7 @@ function Wd(e, t) {
     i.rootElement && e.setRootElement(i.rootElement);
   });
 }
-we(Wd, se);
+we(Wd, ce);
 Wd.$inject = ["canvas", "injector"];
 const XO = {
   __init__: ["rootElementsBehavior"],
@@ -24817,7 +24813,7 @@ function nD(e, t) {
 }
 var Mc = 250, iD = '<svg xmlns="http://www.w3.org/2000/svg" width="20" height="20" viewBox="0 0 16 16"><path fill-rule="evenodd" d="M4.81801948,3.50735931 L10.4996894,9.1896894 L10.5,4 L12,4 L12,12 L4,12 L4,10.5 L9.6896894,10.4996894 L3.75735931,4.56801948 C3.46446609,4.27512627 3.46446609,3.80025253 3.75735931,3.50735931 C4.05025253,3.21446609 4.52512627,3.21446609 4.81801948,3.50735931 Z"/></svg>', rD = "bjs-drilldown-empty";
 function Gr(e, t, n, i, r) {
-  se.call(this, t), this._canvas = e, this._eventBus = t, this._elementRegistry = n, this._overlays = i, this._translate = r;
+  ce.call(this, t), this._canvas = e, this._eventBus = t, this._elementRegistry = n, this._overlays = i, this._translate = r;
   var o = this;
   this.executed("shape.toggleCollapse", Mc, function(a) {
     var s = a.shape;
@@ -24849,7 +24845,7 @@ function Gr(e, t, n, i, r) {
     });
   });
 }
-we(Gr, se);
+we(Gr, ce);
 Gr.prototype._updateDrilldownOverlay = function(e) {
   var t = this._canvas;
   if (e) {
@@ -26299,21 +26295,21 @@ function WD(e) {
       E,
       { keys: ["label", "search", "description"] }
     ).map(({ item: V }) => V) : K.filter(({ rank: V = 0 }) => V >= 0) : K;
-  }, [S, m, y, E, p, g, f]), P = Qi(() => m ? w.length ? [{ id: "default", entries: w }] : [] : KD(w), [w, m]), [T, $] = ap(w[0]), k = bl(null), I = bl(!1), j = Qi(() => VD.next(), []), ee = `${j}-results`, fe = T && Lw(j, T);
+  }, [S, m, y, E, p, g, f]), P = Qi(() => m ? w.length ? [{ id: "default", entries: w }] : [] : KD(w), [w, m]), [T, $] = ap(w[0]), k = bl(null), I = bl(!1), j = Qi(() => VD.next(), []), J = `${j}-results`, fe = T && Lw(j, T);
   Zc(() => {
     const K = k.current;
     K && w.includes(K) ? $(K) : $(w[0]), k.current = null;
   }, [w]);
-  const Re = Ia((K) => {
+  const Ce = Ia((K) => {
     const V = qD(P);
-    let Me = V.indexOf(T) + K;
-    Me < 0 && (Me = V.length - 1), Me >= V.length && (Me = 0), I.current = !0, $(V[Me]);
+    let Ae = V.indexOf(T) + K;
+    Ae < 0 && (Ae = V.length - 1), Ae >= V.length && (Ae = 0), I.current = !0, $(V[Ae]);
   }, [P, T]), De = Ia((K) => {
     K > 0 && T && T.entries && (I.current = !0, b((V) => [...V, T])), K < 0 && g.length > 0 && (I.current = !0, k.current = g[g.length + K], b((V) => V.slice(0, K)));
-  }, [T, g]), Je = Ia((K, V, ie) => {
+  }, [T, g]), Je = Ia((K, V, ne) => {
     if (!(!V || V.disabled))
-      return V.entries ? (K.preventDefault(), De(1)) : n(K, V, ie);
-  }, [n, De]), Q = Ia((K) => {
+      return V.entries ? (K.preventDefault(), De(1)) : n(K, V, ne);
+  }, [n, De]), Z = Ia((K) => {
     if (K.key === "Enter" && T) {
       const V = K.target;
       return !!bo(V, "a, button", !0) || T.disabled ? void 0 : Je(K, T);
@@ -26324,14 +26320,14 @@ function WD(e) {
         return De(-1), K.preventDefault();
     }
     if (K.key === "ArrowUp")
-      return Re(-1), K.preventDefault();
+      return Ce(-1), K.preventDefault();
     if (K.key === "ArrowDown")
-      return Re(1), K.preventDefault();
+      return Ce(1), K.preventDefault();
     if (K.key === "ArrowRight")
       return De(1), K.preventDefault();
     if (K.key === "ArrowLeft")
       return De(-1), K.preventDefault();
-  }, [T, Re, De, Je]), te = Ia((K) => {
+  }, [T, Ce, De, Je]), ee = Ia((K) => {
     Rp(K.target, "input") && _(() => K.target.value);
   }, [_]);
   Zc(() => (d(), () => {
@@ -26341,8 +26337,8 @@ function WD(e) {
   return Rt`
     <${qy}
       onClose=${t}
-      onKeyup=${te}
-      onKeydown=${Q}
+      onKeyup=${ee}
+      onKeydown=${Z}
       className=${i}
       position=${o}
       width=${s}
@@ -26378,7 +26374,7 @@ function WD(e) {
               role="combobox"
               aria-label="${a || "Search"}"
               aria-expanded="true"
-              aria-controls=${ee}
+              aria-controls=${J}
               aria-activedescendant=${fe || void 0}
               aria-autocomplete="list"
             />
@@ -26398,7 +26394,7 @@ function WD(e) {
             keyboardSelection=${I}
             onAction=${Je}
             idPrefix=${j}
-            id=${ee}
+            id=${J}
             ariaLabel=${a || "Results"}
             tabIndex=${S ? -1 : 0}
             ariaActivedescendant=${S ? void 0 : fe || void 0}
@@ -27075,7 +27071,7 @@ const aI = {
   bpmnAlignElements: ["type", mu]
 };
 function dr(e, t, n, i) {
-  se.call(this, e), this._elementRegistry = t, this._modeling = n, this._rules = i;
+  ce.call(this, e), this._elementRegistry = t, this._modeling = n, this._rules = i;
   var r = this;
   this.postExecuted(["shape.create"], function(o) {
     var a = o.context, s = a.hints || {}, c = a.shape, l = a.parent || a.newParent;
@@ -27106,7 +27102,7 @@ dr.$inject = [
   "modeling",
   "rules"
 ];
-we(dr, se);
+we(dr, ce);
 dr.prototype._getOptimalBounds = function(e, t) {
   var n = this.getOffset(t), i = this.getPadding(t), r = Le(en(e)), o = Le(t), a = {};
   return r.top - o.top < i.top && (a.top = r.top - n.top), r.left - o.left < i.left && (a.left = r.left - n.left), o.right - r.right < i.right && (a.right = r.right + n.right), o.bottom - r.bottom < i.bottom && (a.bottom = r.bottom + n.bottom), Ol(W({}, o, a));
@@ -27326,8 +27322,8 @@ function mI(e, t) {
 }
 function Vw(e, t, n, i, r) {
   function o(m, y, S) {
-    var w = m.index, P = m.point, T, $, k, I, j, ee;
-    return w <= 0 || m.bendpoint ? !1 : (T = y[w - 1], $ = y[w], k = Ap(T, $), I = Ji(T, $), j = Math.abs(P.x - k.x), ee = Math.abs(P.y - k.y), I && j <= S && ee <= S);
+    var w = m.index, P = m.point, T, $, k, I, j, J;
+    return w <= 0 || m.bendpoint ? !1 : (T = y[w - 1], $ = y[w], k = Ap(T, $), I = Ji(T, $), j = Math.abs(P.x - k.x), J = Math.abs(P.y - k.y), I && j <= S && J <= S);
   }
   function a(m, y) {
     var S = m.waypoints, w, P, T, $;
@@ -27393,14 +27389,14 @@ function Vw(e, t, n, i, r) {
     S && (_n(S, w.x, w.y), at(S).add("positioned"));
   }
   function _(m, y, S) {
-    var w = u(y.index, m), P = S[y.index - 1], T = S[y.index], $ = y.point, k = Ap(P, T), I = Ji(P, T), j, ee;
-    w && (j = yI(w), ee = {
+    var w = u(y.index, m), P = S[y.index - 1], T = S[y.index], $ = y.point, k = Ap(P, T), I = Ji(P, T), j, J;
+    w && (j = yI(w), J = {
       x: $.x - k.x,
       y: $.y - k.y
-    }, I === "v" && (ee = {
-      x: ee.y,
-      y: ee.x
-    }), _n(j, ee.x, ee.y));
+    }, I === "v" && (J = {
+      x: J.y,
+      y: J.x
+    }), _n(j, J.x, J.y));
   }
   e.on("connection.changed", function(m) {
     b(m.element);
@@ -30050,7 +30046,7 @@ function r0(e) {
 }
 r0.$inject = ["eventBus"];
 function Co(e, t) {
-  se.call(this, e), this._gridSnapping = t;
+  ce.call(this, e), this._gridSnapping = t;
   var n = this;
   this.preExecute("shape.resize", function(i) {
     var r = i.context, o = r.hints || {}, a = o.autoResize;
@@ -30065,7 +30061,7 @@ Co.$inject = [
   "gridSnapping",
   "modeling"
 ];
-we(Co, se);
+we(Co, ce);
 Co.prototype.snapSimple = function(e, t) {
   var n = this._gridSnapping;
   return t.width = n.snapValue(t.width, {
@@ -30252,7 +30248,7 @@ s0.$inject = [
 ];
 var bL = 3e3;
 function wu(e, t, n) {
-  se.call(this, e), this._gridSnapping = t;
+  ce.call(this, e), this._gridSnapping = t;
   var i = this;
   this.postExecuted([
     "connection.create",
@@ -30267,7 +30263,7 @@ wu.$inject = [
   "gridSnapping",
   "modeling"
 ];
-we(wu, se);
+we(wu, ce);
 wu.prototype.snapMiddleSegments = function(e) {
   var t = this._gridSnapping, n;
   e = e.slice();
@@ -32111,7 +32107,7 @@ const wN = {
 };
 var EN = 250;
 function ch(e, t, n, i, r) {
-  se.call(this, e);
+  ce.call(this, e);
   function o(s) {
     var c = s.canExecute.replacements;
     z(c, function(l) {
@@ -32149,7 +32145,7 @@ ch.$inject = [
   "canvas",
   "previewSupport"
 ];
-we(ch, se);
+we(ch, ce);
 const SN = {
   __depends__: [
     fa