@g1cloud/bpmn-modeler-next 5.0.0-beta.50 → 5.0.0-beta.51

package/dist/bpmn-modeler.js

@@ -1388,7 +1388,7 @@ function Yb(e) {
     y = !0;
   };
   function $(j, G = !1) {
-    var X = null, te = null, J, ie = 0, se = !1, ve = !1, we = 0, U = 0, ne, q, Z, ue, xe, Pe, B, C, S, V = "", K = 0, oe;
+    var X = null, te = null, J, ie = 0, se = !1, ve = !1, we = 0, U = 0, ne, q, Z, ue, xe, Pe, B, M, S, V = "", K = 0, oe;
     function _e(xt, en) {
       var _n = xt.indexOf(":");
       if (_n === -1)
@@ -1472,7 +1472,7 @@ function Yb(e) {
         return B;
       }),
       originalName: Bc(function() {
-        return C;
+        return M;
       }),
       attrs: Bc(Qe),
       ns: Bc(function() {
@@ -1562,18 +1562,18 @@ function Yb(e) {
         ve || E.push(B);
       }
       if (m) {
-        J = b, se && (ve || v.push(J), oe === null && (h = ne.indexOf("xmlns", Z) !== -1) && (K = Z, V = ne, Qe(), h = !1)), C = B, te !== b && (X = b[Mm], X === void 0 && (X = b[Mm] = /* @__PURE__ */ Object.create(null)), te = b);
+        J = b, se && (ve || v.push(J), oe === null && (h = ne.indexOf("xmlns", Z) !== -1) && (K = Z, V = ne, Qe(), h = !1)), M = B, te !== b && (X = b[Mm], X === void 0 && (X = b[Mm] = /* @__PURE__ */ Object.create(null)), te = b);
         var Ot = X[B];
         if (Ot !== void 0)
           B = Ot;
         else {
           if (ue = B.indexOf(":"), ue !== -1) {
             if (Pe = b[B.substring(0, ue)], !Pe)
-              return D("missing namespace on <" + C + ">");
+              return D("missing namespace on <" + M + ">");
             B = B.substr(ue + 1);
           } else
             Pe = b.xmlns;
-          Pe && (B = Pe + ":" + B), X[C] = B;
+          Pe && (B = Pe + ":" + B), X[M] = B;
         }
       }
       if (se && (K = Z, V = ne, i && (t ? i(S, kr, ve, p) : i(B, Qe, kr, ve, p), y)))
@@ -8874,11 +8874,11 @@ function RA(e, t) {
   ))
     g.set(x.id, { x: x.x, y: x.y });
   const h = Gt(e, "participant.add"), m = Gt(e, "node.add"), w = Gt(e, "sequenceFlow.add"), y = Gt(e, "messageFlow.add"), v = Gt(e, "dataStore.add"), b = Gt(e, "dataAssociation.add"), E = Gt(e, "annotation.add"), R = Gt(e, "group.add"), D = new Map(m.map((x) => [x.node.id, x])), P = bw(e, (x) => {
-    var _, M;
-    return (M = (_ = p(x)) == null ? void 0 : _.source) == null ? void 0 : M.id;
-  }), T = new Set([...P.values()].map((x) => x.flow.id)), $ = w.filter((x) => !T.has(x.flow.id)), j = new Set([...P.values()].map((x) => x.flow.target)), G = (x) => Gt(e, "sequenceFlow.update").filter((_) => _.target === x).length + (j.has(x) ? 1 : 0), X = (x, _, M) => {
+    var _, C;
+    return (C = (_ = p(x)) == null ? void 0 : _.source) == null ? void 0 : C.id;
+  }), T = new Set([...P.values()].map((x) => x.flow.id)), $ = w.filter((x) => !T.has(x.flow.id)), j = new Set([...P.values()].map((x) => x.flow.target)), G = (x) => Gt(e, "sequenceFlow.update").filter((_) => _.target === x).length + (j.has(x) ? 1 : 0), X = (x, _, C) => {
     var I;
-    const O = x.businessObject, L = (((I = O.extensionElements) == null ? void 0 : I.values) ?? []).filter((N) => N.$type !== _), k = M ? [...L, i.create(_, M)] : L;
+    const O = x.businessObject, L = (((I = O.extensionElements) == null ? void 0 : I.values) ?? []).filter((N) => N.$type !== _), k = C ? [...L, i.create(_, C)] : L;
     if (!k.length) {
       O.extensionElements && n.updateProperties(x, { extensionElements: void 0 });
       return;
@@ -8894,26 +8894,28 @@ function RA(e, t) {
   });
   for (const x of Gt(e, "element.remove")) {
     const _ = p(x.id);
-    _ && n.removeElements([_]);
+    if (!_) continue;
+    const C = "waypoints" in _ ? [] : [..._.incoming ?? [], ..._.outgoing ?? []];
+    n.removeElements([...C, _]);
   }
   const J = (x) => r.filter(
     (_) => {
-      var M;
-      return _.type === "bpmn:Lane" && ((M = d(_)) == null ? void 0 : M.id) === x;
+      var C;
+      return _.type === "bpmn:Lane" && ((C = d(_)) == null ? void 0 : C.id) === x;
     }
-  ).sort((_, M) => _.y - M.y);
+  ).sort((_, C) => _.y - C.y);
   for (const x of Gt(e, "participant.update")) {
     const _ = f(x.id);
     if (x.name !== void 0 && n.updateProperties(_, { name: x.name ?? void 0 }), !x.lanes) continue;
-    const M = J(x.id);
-    if (!M.length) {
+    const C = J(x.id);
+    if (!C.length) {
       n.splitLane(_, x.lanes.length), J(x.id).forEach((k, F) => {
         const I = x.lanes[F];
         I && n.updateProperties(k, { id: I.id, name: I.name });
       });
       continue;
     }
-    const O = new Set(M.map((k) => k.id)), L = x.lanes.reduce((k, F, I) => O.has(F.id) ? I : k, -1);
+    const O = new Set(C.map((k) => k.id)), L = x.lanes.reduce((k, F, I) => O.has(F.id) ? I : k, -1);
     x.lanes.forEach((k, F) => {
       if (O.has(k.id)) {
         n.updateProperties(f(k.id), { name: k.name });
@@ -8923,8 +8925,8 @@ function RA(e, t) {
       n.updateProperties(N, { id: k.id, name: k.name });
     });
   }
-  const ie = 150, se = 130, ve = 80, we = 90, U = 180, ne = 30, q = 30, Z = 10, ue = 300, xe = 5, Pe = (x, _, M, O, L) => {
-    const k = M - _.width / 2, F = O - _.height / 2;
+  const ie = 150, se = 130, ve = 80, we = 90, U = 180, ne = 30, q = 30, Z = 10, ue = 300, xe = 5, Pe = (x, _, C, O, L) => {
+    const k = C - _.width / 2, F = O - _.height / 2;
     return (x.children ?? []).find(
       (I) => !("waypoints" in I && I.waypoints) && I.type !== "bpmn:Lane" && I.type !== "label" && !(L != null && L.has(I.id)) && typeof I.x == "number" && k < I.x + I.width + q && k + _.width + q > I.x && F < I.y + I.height && F + _.height > I.y
     );
@@ -8933,24 +8935,24 @@ function RA(e, t) {
     B.add(`pool:${x.participant.id}`);
     for (const _ of x.participant.lanes ?? []) B.add(_.id);
   }
-  const C = /* @__PURE__ */ new Map();
+  const M = /* @__PURE__ */ new Map();
   for (const x of m) {
     const _ = x.node.lane ?? `pool:${x.node.participant ?? ""}`;
-    let M = C.get(_);
-    M || C.set(_, M = /* @__PURE__ */ new Set([0])), x.band !== void 0 && M.add(x.band);
+    let C = M.get(_);
+    C || M.set(_, C = /* @__PURE__ */ new Set([0])), x.band !== void 0 && C.add(x.band);
   }
   const S = /* @__PURE__ */ new Map();
-  for (const [x, _] of C) {
+  for (const [x, _] of M) {
     if (!B.has(x)) continue;
-    const M = [..._].sort((k, F) => k - F), O = M.map((k, F) => F === 0 ? 0 : F % 2 === 1 ? Math.ceil(F / 2) : -(F / 2)), L = Math.min(...O);
-    S.set(x, new Map(M.map((k, F) => [k, O[F] - L])));
+    const C = [..._].sort((k, F) => k - F), O = C.map((k, F) => F === 0 ? 0 : F % 2 === 1 ? Math.ceil(F / 2) : -(F / 2)), L = Math.min(...O);
+    S.set(x, new Map(C.map((k, F) => [k, O[F] - L])));
   }
   {
     const x = /* @__PURE__ */ new Map();
-    for (const _ of h) (_.participant.lanes ?? []).forEach((M, O) => x.set(M.id, O));
-    for (const [_, M] of S) {
-      if (!x.has(_) || M.size < 2) continue;
-      const O = x.get(_), L = M.get(0) ?? 0, k = /* @__PURE__ */ new Set();
+    for (const _ of h) (_.participant.lanes ?? []).forEach((C, O) => x.set(C.id, O));
+    for (const [_, C] of S) {
+      if (!x.has(_) || C.size < 2) continue;
+      const O = x.get(_), L = C.get(0) ?? 0, k = /* @__PURE__ */ new Set();
       for (const re of m) {
         if (re.node.lane !== _ || (re.band ?? 0) !== 0 || !re.node.type.endsWith("Gateway")) continue;
         const ye = { in: /* @__PURE__ */ new Set(), out: /* @__PURE__ */ new Set(), cross: /* @__PURE__ */ new Set() };
@@ -8965,7 +8967,7 @@ function RA(e, t) {
             if (he === void 0) continue;
             Ee = he > O ? "down" : "up", de = !0;
           } else {
-            const he = M.get(Oe.band ?? 0) ?? L;
+            const he = C.get(Oe.band ?? 0) ?? L;
             Ee = he > L ? "down" : he < L ? "up" : void 0;
           }
           Ee && (ye[ge ? "out" : "in"].add(Ee), de && ye.cross.add(Ee));
@@ -8973,15 +8975,15 @@ function RA(e, t) {
         for (const ae of ["up", "down"]) ye.in.has(ae) && ye.out.has(ae) && ye.cross.has(ae) && k.add(ae);
       }
       if (k.size !== 1) continue;
-      const [F] = k, I = Math.max(...M.values()), N = F === "down" ? I : 0;
+      const [F] = k, I = Math.max(...C.values()), N = F === "down" ? I : 0;
       if (L === N) continue;
-      const H = [...M.entries()].filter(([re]) => re !== 0).sort((re, ye) => re[1] - ye[1]), W = [...Array(I + 1).keys()].filter((re) => re !== N), ee = /* @__PURE__ */ new Map([[0, N]]);
+      const H = [...C.entries()].filter(([re]) => re !== 0).sort((re, ye) => re[1] - ye[1]), W = [...Array(I + 1).keys()].filter((re) => re !== N), ee = /* @__PURE__ */ new Map([[0, N]]);
       H.forEach(([re], ye) => ee.set(re, W[ye])), S.set(_, ee);
     }
   }
   const V = (x) => {
     var _;
-    return (((_ = C.get(x)) == null ? void 0 : _.size) ?? 0) > 1;
+    return (((_ = M.get(x)) == null ? void 0 : _.size) ?? 0) > 1;
   }, K = (x) => x.band ?? (x.node.lane || !V(`pool:${x.node.participant ?? ""}`) ? void 0 : 0), oe = /* @__PURE__ */ new Map(), _e = (x) => oe.get(x.node.id) ?? K(x), Qe = /* @__PURE__ */ new Set(), yt = /* @__PURE__ */ new Set();
   {
     const x = /* @__PURE__ */ new Map();
@@ -8995,7 +8997,7 @@ function RA(e, t) {
           N.flow.source !== I || k.has(N.flow.target) || (x.get(N.flow.target) ?? 0) !== 1 || (k.add(N.flow.target), F.push(N.flow.target));
       }
       return L;
-    }, M = (O, L) => {
+    }, C = (O, L) => {
       var k;
       return ((k = S.get(O)) == null ? void 0 : k.get(L)) ?? L;
     };
@@ -9004,13 +9006,13 @@ function RA(e, t) {
       const L = O.node.lane ?? `pool:${O.node.participant ?? ""}`, k = S.get(L);
       if (!k || k.size < 2) continue;
       const F = _e(O);
-      if (F === void 0 || M(L, F) !== M(L, 0)) continue;
-      const I = M(L, F), N = $.filter((ae) => ae.flow.source === O.node.id).map((ae) => D.get(ae.flow.target)).filter((ae) => !!ae && (ae.node.lane ?? `pool:${ae.node.participant ?? ""}`) === L), H = N.filter((ae) => {
+      if (F === void 0 || C(L, F) !== C(L, 0)) continue;
+      const I = C(L, F), N = $.filter((ae) => ae.flow.source === O.node.id).map((ae) => D.get(ae.flow.target)).filter((ae) => !!ae && (ae.node.lane ?? `pool:${ae.node.participant ?? ""}`) === L), H = N.filter((ae) => {
         const ge = _e(ae);
-        return ge !== void 0 && M(L, ge) === I && (x.get(ae.node.id) ?? 0) === 1;
+        return ge !== void 0 && C(L, ge) === I && (x.get(ae.node.id) ?? 0) === 1;
       }), W = N.some((ae) => {
         const ge = _e(ae);
-        return ge !== void 0 && M(L, ge) > I;
+        return ge !== void 0 && C(L, ge) > I;
       });
       if (H.length !== 1 || !W) continue;
       const ee = new Set(N.flatMap((ae) => _(ae.node.id)));
@@ -9023,42 +9025,42 @@ function RA(e, t) {
     }
   }
   const Ot = (x, _) => {
-    var M;
-    return ((M = S.get(x)) == null ? void 0 : M.get(_)) ?? _;
-  }, xt = (x, _, M, O) => {
+    var C;
+    return ((C = S.get(x)) == null ? void 0 : C.get(_)) ?? _;
+  }, xt = (x, _, C, O) => {
     const L = x ? p(x) : _ ? p(_) : void 0;
     if (!L) return !1;
     const k = x ? L.y + Math.min(L.height / 2, we) : L.y + ve;
-    return Math.abs(k + Ot(x ?? `pool:${_ ?? ""}`, M) * ie - O) <= ie / 2;
+    return Math.abs(k + Ot(x ?? `pool:${_ ?? ""}`, C) * ie - O) <= ie / 2;
   }, en = /* @__PURE__ */ new Map();
-  for (const [x, _] of C) {
-    let M = 0;
-    for (const O of _) M = Math.max(M, Ot(x, O));
-    en.set(x, M);
+  for (const [x, _] of M) {
+    let C = 0;
+    for (const O of _) C = Math.max(C, Ot(x, O));
+    en.set(x, C);
   }
-  const _n = (x) => U + ie * x, En = (x, _, M) => {
+  const _n = (x) => U + ie * x, En = (x, _, C) => {
     const O = u().children.filter(
       (L) => !("waypoints" in L && L.waypoints) && L.type !== "label" && L.id !== _ && typeof L.y == "number" && L.y >= x
     );
-    O.length && n.moveElements(O, { x: 0, y: M });
-  }, Bt = (x, _, M) => {
+    O.length && n.moveElements(O, { x: 0, y: C });
+  }, Bt = (x, _, C) => {
     const O = x.type === "bpmn:Participant" ? x : void 0;
     if (!O || O.children.some((I) => I.type === "bpmn:Lane")) return;
-    const L = M + _.height / 2 + ne - O.y;
+    const L = C + _.height / 2 + ne - O.y;
     if (O.height >= L) return;
     const k = L - O.height, F = O.y + O.height;
     n.resizeShape(O, { x: O.x, y: O.y, width: O.width, height: L }), En(F, O.id, k);
   }, fn = (x, _) => {
-    const M = _ - x.height;
-    if (M <= 0) return;
+    const C = _ - x.height;
+    if (C <= 0) return;
     const O = d(x) ?? x, L = [], k = (N) => {
       L.push(N);
       for (const H of N.children ?? []) k(H);
     };
     k(O);
-    const F = x.y + x.height - 10, I = l.calculateAdjustments(L, "y", M, F);
-    l.makeSpace(I.movingShapes, I.resizingShapes, { x: 0, y: M }, "s", F);
-  }, Mn = (x, _, M) => {
+    const F = x.y + x.height - 10, I = l.calculateAdjustments(L, "y", C, F);
+    l.makeSpace(I.movingShapes, I.resizingShapes, { x: 0, y: C }, "s", F);
+  }, Mn = (x, _, C) => {
     if (x) {
       const F = f(x), I = _n(_);
       if (F.height >= I) return;
@@ -9066,11 +9068,11 @@ function RA(e, t) {
       fn(F, I), En(W, H == null ? void 0 : H.id, N);
       return;
     }
-    if (!M) return;
+    if (!C) return;
     const O = ie * (_ + 1);
-    if (M.height >= O) return;
-    const L = O - M.height, k = M.y + M.height;
-    n.resizeShape(M, { x: M.x, y: M.y, width: M.width, height: O }), En(k, M.id, L);
+    if (C.height >= O) return;
+    const L = O - C.height, k = C.y + C.height;
+    n.resizeShape(C, { x: C.x, y: C.y, width: C.width, height: O }), En(k, C.id, L);
   }, No = /* @__PURE__ */ new Map();
   for (const x of $) No.set(x.flow.target, (No.get(x.flow.target) ?? 0) + 1);
   const di = (x) => (No.get(x) ?? 0) <= 1, Ui = new Set(
@@ -9079,21 +9081,21 @@ function RA(e, t) {
     )
   ), ei = /* @__PURE__ */ new Map(), nn = (x, _) => {
     if (!x) return;
-    const M = p(x);
-    if (!M || M.height >= _n(_)) return;
-    const O = M.y + M.height - 10, L = d(M);
+    const C = p(x);
+    if (!C || C.height >= _n(_)) return;
+    const O = C.y + C.height - 10, L = d(C);
     if (L)
       return new Set(
         (L.children ?? []).filter((k) => k.type !== "bpmn:Lane" && typeof k.y == "number" && k.y > O).map((k) => k.id)
       );
-  }, qi = (x, _, M) => {
+  }, qi = (x, _, C) => {
     if (!x) return !0;
     const O = p(x);
-    return O ? M - _.height / 2 >= O.y && M + _.height / 2 <= O.y + O.height : !0;
+    return O ? C - _.height / 2 >= O.y && C + _.height / 2 <= O.y + O.height : !0;
   }, br = h.map((x, _) => ({ op: x, declared: _ }));
   br.sort((x, _) => {
-    const M = x.op.order ?? Number.POSITIVE_INFINITY, O = _.op.order ?? Number.POSITIVE_INFINITY;
-    return M !== O ? M - O : x.declared - _.declared;
+    const C = x.op.order ?? Number.POSITIVE_INFINITY, O = _.op.order ?? Number.POSITIVE_INFINITY;
+    return C !== O ? C - O : x.declared - _.declared;
   });
   let jn = 80;
   for (const x of r.getAll())
@@ -9102,13 +9104,13 @@ function RA(e, t) {
     (x) => x.type === "bpmn:Participant" && x.parent === u()
   ), Mt = (() => {
     if (!ht.length) return;
-    const x = ht.filter((L) => !Ew(L)), _ = x.length ? x : ht, M = Math.min(..._.map((L) => L.x)), O = Math.max(..._.map((L) => L.x + L.width));
-    return O > M ? { x: M, width: O - M } : void 0;
+    const x = ht.filter((L) => !Ew(L)), _ = x.length ? x : ht, C = Math.min(..._.map((L) => L.x)), O = Math.max(..._.map((L) => L.x + L.width));
+    return O > C ? { x: C, width: O - C } : void 0;
   })();
   for (const { op: x } of br) {
-    const _ = x.participant, M = m.filter((ge) => ge.node.participant === _.id).length, O = ((em = _.lanes) == null ? void 0 : em.length) ?? 0, L = Math.max(1200, M * 160 + 300), k = (_.lanes ?? []).map((ge) => _n(en.get(ge.id) ?? 0)), F = k.reduce((ge, Oe) => ge + Oe, 0);
+    const _ = x.participant, C = m.filter((ge) => ge.node.participant === _.id).length, O = ((em = _.lanes) == null ? void 0 : em.length) ?? 0, L = Math.max(1200, C * 160 + 300), k = (_.lanes ?? []).map((ge) => _n(en.get(ge.id) ?? 0)), F = k.reduce((ge, Oe) => ge + Oe, 0);
     O && F < 300 && (k[O - 1] += 300 - F);
-    const I = Math.max(300, ie * ((en.get(`pool:${_.id}`) ?? 0) + 1)), N = _.blackBox || M + O === 0 ? 120 : O ? Math.max(300, F) : I, H = _.blackBox ? Mt : void 0, W = (H == null ? void 0 : H.x) ?? 100, ee = (H == null ? void 0 : H.width) ?? L, re = o.createShape({
+    const I = Math.max(300, ie * ((en.get(`pool:${_.id}`) ?? 0) + 1)), N = _.blackBox || C + O === 0 ? 120 : O ? Math.max(300, F) : I, H = _.blackBox ? Mt : void 0, W = (H == null ? void 0 : H.x) ?? 100, ee = (H == null ? void 0 : H.width) ?? L, re = o.createShape({
       type: "bpmn:Participant",
       businessObject: i.create("bpmn:Participant", {
         id: _.id,
@@ -9148,8 +9150,8 @@ function RA(e, t) {
     var O;
     const _ = D.get(x);
     if (_) return _.node.participant ?? "";
-    const M = p(x);
-    return M ? M.type === "bpmn:Participant" ? M.id : ((O = d(M)) == null ? void 0 : O.id) ?? "" : "";
+    const C = p(x);
+    return C ? C.type === "bpmn:Participant" ? C.id : ((O = d(C)) == null ? void 0 : O.id) ?? "" : "";
   }, es = /* @__PURE__ */ new Map(), Sg = (x) => {
     let _ = es.get(x);
     return _ || es.set(x, _ = { nodes: [], flows: [] }), _;
@@ -9162,7 +9164,7 @@ function RA(e, t) {
       // 조건 라벨은 name 채널로 하강 (실측: conditionExpression 0건 — validate.ts 헤더)
       i.create("bpmn:SequenceFlow", { id: x.id, name: x.name ?? ((_ = x.condition) == null ? void 0 : _.label) })
     );
-  }, xp = (x, _, M) => o.createShape({
+  }, xp = (x, _, C) => o.createShape({
     type: Vc(x.type),
     // 이벤트 정의(B-87 ⓑ 부분 — timer 만) — ElementFactory 가 정의 요소를 만들어 businessObject 에 단다.
     // validator 가 `intermediateCatchEvent` ⇔ 정의 짝을 강제하므로 여기 오는 정의는 그 타입에만 있다.
@@ -9173,30 +9175,30 @@ function RA(e, t) {
       // 밴드 힌트 기록 (bwl:band 속성)
       ..._ !== void 0 ? { "bwl:band": _ } : {},
       // 열 지목 힌트 기록 (bwl:afterColumn 속성) — band 와 대칭. 선언값 그대로 남긴다.
-      ...M !== void 0 ? { "bwl:afterColumn": M } : {}
+      ...C !== void 0 ? { "bwl:afterColumn": C } : {}
     })
   }), O1 = [
     ...br.map(({ op: x }) => x.participant.id).filter((x) => es.has(x)),
     ...[...es.keys()].filter((x) => !h.some((_) => _.participant.id === x))
   ], bp = (x) => x.endsWith("Gateway");
   for (const x of O1) {
-    const _ = es.get(x), M = x ? f(x) : void 0, O = M ? M.x + 150 : 250;
-    let L = M ? M.y + 80 : 120;
+    const _ = es.get(x), C = x ? f(x) : void 0, O = C ? C.x + 150 : 250;
+    let L = C ? C.y + 80 : 120;
     const k = (Q, le, Me) => {
       if (Q) {
         const Xe = f(Q);
         return Xe.y + Math.min(Xe.height / 2, we) + Ot(Q, le ?? 0) * ie;
       }
-      return le !== void 0 && M ? M.y + ve + Ot(`pool:${x}`, le) * ie : Me;
+      return le !== void 0 && C ? C.y + ve + Ot(`pool:${x}`, le) * ie : Me;
     }, F = (Q, le, Me) => {
       if (Q) {
         const Xe = f(Q);
         return Xe.y + Math.min(Xe.height / 2, we) + le * ie;
       }
-      return M ? M.y + ve + le * ie : Me;
+      return C ? C.y + ve + le * ie : Me;
     }, I = (Q) => Q.participant ? f(Q.participant) : u(), N = (Q, le, Me, Xe, St, nt, st, De) => {
       const be = Me !== void 0 || Xe !== void 0, Se = (tt) => {
-        const Ie = () => Mn(Me, tt, M);
+        const Ie = () => Mn(Me, tt, C);
         De ? De(Ie) : Ie();
       }, ce = Ot(Me ?? `pool:${x}`, Xe ?? 0);
       if (
@@ -9295,13 +9297,13 @@ function RA(e, t) {
         }
         return Se;
       }, nt = (be) => {
-        if (!M) return;
+        if (!C) return;
         const Se = new Set(be.map((Ze) => Ze.node.id));
         let ce = !1, Te = !1;
         for (const Ze of y) {
           if (!Se.has(Ze.flow.source)) continue;
           const tt = Xe(Ze.flow.target);
-          !tt || tt.id === M.id || (tt.y < M.y ? ce = !0 : Te = !0);
+          !tt || tt.id === C.id || (tt.y < C.y ? ce = !0 : Te = !0);
         }
         return ce && !Te ? "up" : Te && !ce ? "down" : void 0;
       };
@@ -9334,13 +9336,13 @@ function RA(e, t) {
         });
       }
       const st = (be) => {
-        if (!M) return;
+        if (!C) return;
         const Se = new Set(be.map((Ze) => Ze.node.id));
         let ce = !1, Te = !1;
         for (const Ze of y) {
           if (!Se.has(Ze.flow.target)) continue;
           const tt = Xe(Ze.flow.source);
-          !tt || tt.id === M.id || (tt.y < M.y ? ce = !0 : Te = !0);
+          !tt || tt.id === C.id || (tt.y < C.y ? ce = !0 : Te = !0);
         }
         return ce && !Te ? "up" : Te && !ce ? "down" : void 0;
       };
@@ -9394,12 +9396,12 @@ function RA(e, t) {
         const Se = De.get(be.node.id);
         if (!Se || Se.length !== 1 || !Q.get(be.node.id) || !be.node.lane && K(be) === void 0 || yt.has(be.node.id)) continue;
         const ce = (tm = D.get(Se[0].flow.source)) == null ? void 0 : tm.node.participant, Te = ce ? p(ce) : void 0;
-        if (!Te || !M || Te.id === M.id) continue;
+        if (!Te || !C || Te.id === C.id) continue;
         const Ze = be.node.lane ?? `pool:${x}`, tt = S.get(Ze);
         if (!tt) continue;
         const Ie = tt.get(0) ?? 0, rt = (tt.get(_e(be) ?? 0) ?? Ie) - Ie;
         if (rt === 0) continue;
-        const dt = Te.y < M.y;
+        const dt = Te.y < C.y;
         if (dt && rt < 0 || !dt && rt > 0) continue;
         let Dt;
         for (const [Xn, bt] of tt) {
@@ -9458,23 +9460,23 @@ function RA(e, t) {
   }
   const Rg = /* @__PURE__ */ new Map();
   for (const [x, _] of P) {
-    const M = p(x), O = p(_.flow.target);
-    if (!(M != null && M.target) || !O) continue;
-    const L = M.label && { x: M.label.x, y: M.label.y, width: M.label.width, height: M.label.height };
-    Rg.set(x, { waypoints: M.waypoints.map((I) => ({ x: I.x, y: I.y })), label: L });
-    const k = M.target, F = (I) => ({ x: I.x + I.width / 2, y: I.y + I.height / 2 });
-    n.reconnect(M, O, k, [F(O), F(k)]), n.layoutConnection(M, { waypoints: [] });
+    const C = p(x), O = p(_.flow.target);
+    if (!(C != null && C.target) || !O) continue;
+    const L = C.label && { x: C.label.x, y: C.label.y, width: C.label.width, height: C.label.height };
+    Rg.set(x, { waypoints: C.waypoints.map((I) => ({ x: I.x, y: I.y })), label: L });
+    const k = C.target, F = (I) => ({ x: I.x + I.width / 2, y: I.y + I.height / 2 });
+    n.reconnect(C, O, k, [F(O), F(k)]), n.layoutConnection(C, { waypoints: [] });
   }
   const wr = 40, Mc = (x) => {
-    const _ = (W) => W.kind === "label-over-line" || W.kind === "label-over-shape" || W.kind === "label-on-shared-segment" ? W.edge === x.id : W.kind === "annotation-over-label" || W.kind === "pool-name-over-label" ? W.label === x.id : !1, M = () => new Map(
+    const _ = (W) => W.kind === "label-over-line" || W.kind === "label-over-shape" || W.kind === "label-on-shared-segment" ? W.edge === x.id : W.kind === "annotation-over-label" || W.kind === "pool-name-over-label" ? W.label === x.id : !1, C = () => new Map(
       pt(He(r)).filter((W) => !_(W)).map((W) => [ft(W), W])
-    ), O = M(), L = (W) => [...W].filter(([ee]) => !O.has(ee)).map(([, ee]) => ee), k = (W) => L(W).length <= [...O.keys()].filter((ee) => !W.has(ee)).length, F = x.waypoints.map((W) => ({ x: W.x, y: W.y })), I = x.label, N = I && { x: I.x, y: I.y };
+    ), O = C(), L = (W) => [...W].filter(([ee]) => !O.has(ee)).map(([, ee]) => ee), k = (W) => L(W).length <= [...O.keys()].filter((ee) => !W.has(ee)).length, F = x.waypoints.map((W) => ({ x: W.x, y: W.y })), I = x.label, N = I && { x: I.x, y: I.y };
     n.layoutConnection(x, { waypoints: [] });
-    const H = M();
+    const H = C();
     if (!k(H)) {
       if (L(H).every((W) => W.kind === "edge-crosses-shape" && W.edge === x.id)) {
         const W = He(r), ee = W.edges.find((ge) => ge.id === x.id), re = qn(W), ye = ee ? Vt(ee, re) : [], ae = ee && ye.length && !ye.every((ge) => ge.type === "bpmn:TextAnnotation") ? Td(ee, re, Xl(x), W.edges) : null;
-        if (ae && (n.updateWaypoints(x, ae), k(M())))
+        if (ae && (n.updateWaypoints(x, ae), k(C())))
           return;
       }
       n.updateWaypoints(x, F), I && N && (I.x !== N.x || I.y !== N.y) && n.moveElements([I], { x: N.x - I.x, y: N.y - I.y });
@@ -9484,8 +9486,8 @@ function RA(e, t) {
     ...y.map((x) => x.flow.id),
     ...Gt(e, "sequenceFlow.update").map((x) => x.id),
     ...Gt(e, "messageFlow.update").map((x) => x.id)
-  ].filter((x) => !!x)), D1 = (x, _, M, O, L, k) => {
-    const F = new Set(x.map((de) => de.id)), I = Math.min(...x.map((de) => de.x)) + _ - vi, N = Math.max(...x.map((de) => de.x + de.width)) + _ + Cg + vi, H = Math.min(...x.map((de) => de.y + Math.min(0, ...M))) - vi, W = Math.max(...x.map((de) => de.y + de.height + Math.max(0, ...M))) + vi, ee = r.getAll().filter((de) => {
+  ].filter((x) => !!x)), D1 = (x, _, C, O, L, k) => {
+    const F = new Set(x.map((de) => de.id)), I = Math.min(...x.map((de) => de.x)) + _ - vi, N = Math.max(...x.map((de) => de.x + de.width)) + _ + Cg + vi, H = Math.min(...x.map((de) => de.y + Math.min(0, ...C))) - vi, W = Math.max(...x.map((de) => de.y + de.height + Math.max(0, ...C))) + vi, ee = r.getAll().filter((de) => {
       if (de.type !== "bpmn:SequenceFlow" && de.type !== "bpmn:MessageFlow") return !1;
       const he = de;
       return ts.has(he.id) || !he.waypoints || he.waypoints.length < 2 || [he.source, he.target].some((le) => !le || F.has(le.id) || le.x >= O) ? !1 : he.waypoints.some((le, Me) => {
@@ -9497,7 +9499,7 @@ function RA(e, t) {
     const re = (de) => {
       const he = /* @__PURE__ */ new Map();
       for (const Q of x)
-        for (const le of M) {
+        for (const le of C) {
           const Me = { id: Q.id, type: Q.type, x: Q.x + _ + de, y: Q.y + le, width: Q.width, height: Q.height };
           for (const Xe of ee) {
             let St = 1 / 0;
@@ -9528,9 +9530,9 @@ function RA(e, t) {
       })
     ) ? 0 : ae;
   }, _r = (x, _ = () => !0) => {
-    const M = p(x);
-    if (!M) return [];
-    const O = [M], L = /* @__PURE__ */ new Set([x]);
+    const C = p(x);
+    if (!C) return [];
+    const O = [C], L = /* @__PURE__ */ new Set([x]);
     for (let k = 0; k < O.length; k++) {
       const F = O[k].id;
       for (const I of $) {
@@ -9543,9 +9545,9 @@ function RA(e, t) {
     }
     return O;
   }, L1 = (x, _ = () => !0) => {
-    const M = p(x);
-    if (!M) return [];
-    const O = [M], L = /* @__PURE__ */ new Set([x]);
+    const C = p(x);
+    if (!C) return [];
+    const O = [C], L = /* @__PURE__ */ new Set([x]);
     for (let k = 0; k < O.length; k++) {
       const F = O[k].id;
       for (const I of $) {
@@ -9557,7 +9559,7 @@ function RA(e, t) {
       }
     }
     return O;
-  }, xi = 30, bi = (x) => !("waypoints" in x && x.waypoints) && x.type !== "bpmn:Lane" && x.type !== "label" && typeof x.x == "number", na = (x, _) => kf(n, x, _), ia = (x, _, M = !1) => {
+  }, xi = 30, bi = (x) => !("waypoints" in x && x.waypoints) && x.type !== "bpmn:Lane" && x.type !== "label" && typeof x.x == "number", na = (x, _) => kf(n, x, _), ia = (x, _, C = !1) => {
     const O = new Set(x.flatMap((N) => N.subtree.map((H) => H.id)));
     for (const N of x) {
       const H = (N.pool.children ?? []).filter(bi).filter((ee) => !O.has(ee.id));
@@ -9567,7 +9569,7 @@ function RA(e, t) {
         )
       )) return null;
     }
-    const L = x.map((N) => N.pool.width), k = M ? r.filter((N) => Array.isArray(N.waypoints)).map((N) => ({
+    const L = x.map((N) => N.pool.width), k = C ? r.filter((N) => Array.isArray(N.waypoints)).map((N) => ({
       c: N,
       wps: N.waypoints.map((H) => ({ x: H.x, y: H.y }))
     })) : [], F = r.filter((N) => N.type === "label").map((N) => ({
@@ -9605,25 +9607,25 @@ function RA(e, t) {
     };
   }, _p = (x) => {
     var L, k;
-    const _ = /* @__PURE__ */ new Map(), M = /* @__PURE__ */ new Map();
+    const _ = /* @__PURE__ */ new Map(), C = /* @__PURE__ */ new Map();
     for (const F of r.getAll()) {
       if (F.type !== "bpmn:Participant") continue;
       const I = F;
-      (I.children ?? []).length || (_.set(I.id, I), M.set(I.id, []));
+      (I.children ?? []).length || (_.set(I.id, I), C.set(I.id, []));
     }
     for (const F of r.getAll()) {
       if (F.type !== "bpmn:MessageFlow") continue;
       const I = F, N = (L = I.source) == null ? void 0 : L.id, H = (k = I.target) == null ? void 0 : k.id;
-      N && H && M.has(N) && M.get(N).push(H), N && H && M.has(H) && M.get(H).push(N);
+      N && H && C.has(N) && C.get(N).push(H), N && H && C.has(H) && C.get(H).push(N);
     }
     const O = [];
-    for (const [F, I] of M)
+    for (const [F, I] of C)
       I.length && I.every((N) => x.has(N)) && O.push(_.get(F));
     return O;
   }, Mg = (x, _) => {
     if (!x.length) return null;
-    const M = new Set(x.map((W) => W.id)), O = r.getAll().filter(
-      (W) => W.type === "bpmn:Participant" && !M.has(W.id)
+    const C = new Set(x.map((W) => W.id)), O = r.getAll().filter(
+      (W) => W.type === "bpmn:Participant" && !C.has(W.id)
     ), L = Math.min(
       ...O.filter((W) => (W.children ?? []).length > 0).map((W) => W.x)
     ), k = new Set(x.filter((W) => Math.abs(W.x - L) <= 2).map((W) => W.id));
@@ -9652,12 +9654,12 @@ function RA(e, t) {
         if (!ee) break;
       }
     };
-  }, Ag = (x, _, M) => {
-    const O = M.x + M.width / 2, L = _.y > M.y, k = L ? M.y + M.height : M.y, F = L ? _.y : _.y + _.height, I = x.source === _ ? [{ x: O, y: F }, { x: O, y: k }] : [{ x: O, y: k }, { x: O, y: F }], N = He(r), H = { ...N.edges.find((W) => W.id === x.id), waypoints: I };
+  }, Ag = (x, _, C) => {
+    const O = C.x + C.width / 2, L = _.y > C.y, k = L ? C.y + C.height : C.y, F = L ? _.y : _.y + _.height, I = x.source === _ ? [{ x: O, y: F }, { x: O, y: k }] : [{ x: O, y: k }, { x: O, y: F }], N = He(r), H = { ...N.edges.find((W) => W.id === x.id), waypoints: I };
     return Vt(H, qn(N)).length ? !1 : (n.updateWaypoints(x, I), !0);
   }, I1 = () => {
-    const x = r.filter((F) => F.type === "bpmn:Participant"), _ = Math.min(...x.filter((F) => (F.children ?? []).length > 0).map((F) => F.x)), M = (F) => h.some((I) => I.participant.id === F.id), O = (F) => !!F && F.type === "bpmn:Participant" && !(F.children ?? []).length && Math.abs(F.x - _) <= 2 && // B-130 과 같은 판별자 — 폭이 아니라 좌변 관계
-    !M(F), L = (F) => !!F && F.type === "bpmn:Participant" && (F.children ?? []).length > 0 && !M(F), k = /* @__PURE__ */ new Set();
+    const x = r.filter((F) => F.type === "bpmn:Participant"), _ = Math.min(...x.filter((F) => (F.children ?? []).length > 0).map((F) => F.x)), C = (F) => h.some((I) => I.participant.id === F.id), O = (F) => !!F && F.type === "bpmn:Participant" && !(F.children ?? []).length && Math.abs(F.x - _) <= 2 && // B-130 과 같은 판별자 — 폭이 아니라 좌변 관계
+    !C(F), L = (F) => !!F && F.type === "bpmn:Participant" && (F.children ?? []).length > 0 && !C(F), k = /* @__PURE__ */ new Set();
     for (const F of r.getAll()) {
       if (F.type !== "bpmn:MessageFlow") continue;
       const I = F;
@@ -9669,12 +9671,12 @@ function RA(e, t) {
     }
     return k;
   }, N1 = (x) => {
-    var M;
+    var C;
     const _ = /* @__PURE__ */ new Map();
     for (const O of x) {
       const L = r.get(O);
       if (!L || (L.waypoints ?? []).length === 2) continue;
-      const k = ((M = L.source) == null ? void 0 : M.type) === "bpmn:Participant" ? L.source : L.target, F = k === L.source ? L.target : L.source;
+      const k = ((C = L.source) == null ? void 0 : C.type) === "bpmn:Participant" ? L.source : L.target, F = k === L.source ? L.target : L.source;
       if (F.x + F.width / 2 <= k.x + k.width) continue;
       const I = _.get(k.id) ?? { pool: k, msgs: [] };
       I.msgs.push({ conn: L, other: F }), _.set(k.id, I);
@@ -9712,23 +9714,23 @@ function RA(e, t) {
     let x = 0;
     for (const _ of r.getAll()) {
       if (_.type !== "bpmn:DataInputAssociation" && _.type !== "bpmn:DataOutputAssociation") continue;
-      const M = _.waypoints ?? [];
-      for (let O = 1; O < M.length; O++) x += Math.hypot(M[O].x - M[O - 1].x, M[O].y - M[O - 1].y);
+      const C = _.waypoints ?? [];
+      for (let O = 1; O < C.length; O++) x += Math.hypot(C[O].x - C[O - 1].x, C[O].y - C[O - 1].y);
     }
     return x;
   }, Tg = () => {
     let x = 0;
     for (const _ of r.getAll()) {
       if (_.type !== "bpmn:Association") continue;
-      const M = _.waypoints ?? [];
-      for (let O = 1; O < M.length; O++) x += Math.hypot(M[O].x - M[O - 1].x, M[O].y - M[O - 1].y);
+      const C = _.waypoints ?? [];
+      for (let O = 1; O < C.length; O++) x += Math.hypot(C[O].x - C[O - 1].x, C[O].y - C[O - 1].y);
     }
     return x;
   }, B1 = (x) => {
     const _ = [];
-    for (const M of r.getAll()) {
-      if (M.type !== "bpmn:TextAnnotation") continue;
-      const O = M;
+    for (const C of r.getAll()) {
+      if (C.type !== "bpmn:TextAnnotation") continue;
+      const O = C;
       if (x.has(O.id)) continue;
       const k = [...O.incoming ?? [], ...O.outgoing ?? []].filter(
         (N) => N.type === "bpmn:Association"
@@ -9744,18 +9746,18 @@ function RA(e, t) {
     return _;
   }, kg = () => pt(He(r)).filter((x) => x.kind === "edge-crosses-shape").length, Og = (x) => {
     const _ = (x.children ?? []).filter(bi);
-    let M = 0;
+    let C = 0;
     for (let O = 0; O < _.length; O++)
       for (let L = O + 1; L < _.length; L++) {
         const k = _[O], F = _[L];
-        k.x < F.x + F.width && k.x + k.width > F.x && k.y < F.y + F.height && k.y + k.height > F.y && M++;
+        k.x < F.x + F.width && k.x + k.width > F.x && k.y < F.y + F.height && k.y + k.height > F.y && C++;
       }
-    return M;
+    return C;
   }, Bo = () => {
-    const x = He(r), _ = (M) => M.length >= 2 && (M.every((O) => Math.abs(O.x - M[0].x) < 0.01) || M.every((O) => Math.abs(O.y - M[0].y) < 0.01));
+    const x = He(r), _ = (C) => C.length >= 2 && (C.every((O) => Math.abs(O.x - C[0].x) < 0.01) || C.every((O) => Math.abs(O.y - C[0].y) < 0.01));
     return {
-      messages: x.edges.filter((M) => M.type === "bpmn:MessageFlow" && M.waypoints.length === 2).length,
-      lines: x.edges.filter((M) => _(M.waypoints)).length
+      messages: x.edges.filter((C) => C.type === "bpmn:MessageFlow" && C.waypoints.length === 2).length,
+      lines: x.edges.filter((C) => _(C.waypoints)).length
     };
   }, Dg = (x) => {
     const _ = /* @__PURE__ */ new Map();
@@ -9772,15 +9774,15 @@ function RA(e, t) {
       const W = _.get(H.id);
       W ? N.x < W.minX && (W.minX = N.x) : _.set(H.id, { pool: H, minX: N.x });
     }
-    const M = [];
+    const C = [];
     for (const { pool: O, minX: L } of _.values()) {
       const k = (O.children ?? []).filter(
         (F) => bi(F) && !x.has(F.id) && F.x >= L
       );
-      k.length && M.push({ subtree: k, pool: O });
+      k.length && C.push({ subtree: k, pool: O });
     }
-    return M;
-  }, $1 = (x, _, M) => {
+    return C;
+  }, $1 = (x, _, C) => {
     const O = new Map(
       _.map((F) => [F.pool.id, { subtree: [...F.subtree], pool: F.pool }])
     ), L = new Set(x);
@@ -9789,7 +9791,7 @@ function RA(e, t) {
     for (; ; ) {
       let F = 0;
       for (const I of Dg(L)) {
-        if (I.pool === M) continue;
+        if (I.pool === C) continue;
         const N = O.get(I.pool.id);
         N ? N.subtree.push(...I.subtree) : O.set(I.pool.id, { subtree: [...I.subtree], pool: I.pool });
         for (const H of I.subtree) L.add(H.id);
@@ -9800,7 +9802,7 @@ function RA(e, t) {
     }
     return k ? [...O.values()] : null;
   }, F1 = (x, _) => {
-    const M = /* @__PURE__ */ new Map();
+    const C = /* @__PURE__ */ new Map();
     for (const L of r.getAll()) {
       if (L.type !== "bpmn:DataInputAssociation" && L.type !== "bpmn:DataOutputAssociation") continue;
       const k = L, F = k.waypoints;
@@ -9811,11 +9813,11 @@ function RA(e, t) {
       if (H === x.has(N.id)) continue;
       const W = H ? N : I, ee = d(W);
       if (!ee || ee === _ || ee === d(H ? I : N)) continue;
-      const re = M.get(ee.id);
-      re ? W.x < re.minX && (re.minX = W.x) : M.set(ee.id, { pool: ee, minX: W.x });
+      const re = C.get(ee.id);
+      re ? W.x < re.minX && (re.minX = W.x) : C.set(ee.id, { pool: ee, minX: W.x });
     }
     const O = [];
-    for (const { pool: L, minX: k } of M.values()) {
+    for (const { pool: L, minX: k } of C.values()) {
       const F = (L.children ?? []).filter(
         (I) => bi(I) && !x.has(I.id) && I.x >= k
       );
@@ -9823,10 +9825,10 @@ function RA(e, t) {
     }
     return O;
   }, Lg = (x) => {
-    const _ = He(r), M = _.shapes.filter((L) => x.has(L.id)), O = /* @__PURE__ */ new Set();
+    const _ = He(r), C = _.shapes.filter((L) => x.has(L.id)), O = /* @__PURE__ */ new Set();
     for (const L of _.edges)
       if (!(L.type !== "bpmn:SequenceFlow" && L.type !== "bpmn:MessageFlow"))
-        for (const k of Vt(L, M)) O.add(`${L.id}|${k.id}`);
+        for (const k of Vt(L, C)) O.add(`${L.id}|${k.id}`);
     return O;
   }, Ep = /* @__PURE__ */ new Map(), j1 = Gt(e, "sequenceFlow.update").flatMap(
     (x) => {
@@ -9839,10 +9841,10 @@ function RA(e, t) {
     if (x.target === void 0) continue;
     const _ = D.get(x.target);
     if (!_) continue;
-    const M = p(x.target), O = p(x.id);
-    if (!M || !O) continue;
+    const C = p(x.target), O = p(x.id);
+    if (!C || !O) continue;
     const L = x.source !== void 0 ? p(x.source) : O.source, k = O.target;
-    if (!L || !k || k.id === M.id) continue;
+    if (!L || !k || k.id === C.id) continue;
     const F = Rg.get(O.id) ?? { waypoints: O.waypoints, label: O.label }, I = F.waypoints && F.waypoints.length >= 3 && Math.abs(F.waypoints[0].x - F.waypoints[1].x) < 1 && Math.abs(F.waypoints[0].y - F.waypoints[1].y) > 1 ? { x: F.waypoints[0].x, y: F.waypoints[0].y } : void 0, N = I ? F.waypoints[1].y : void 0, H = I && F.label ? { x: F.label.x, y: F.label.y } : void 0, W = H && F.label && Math.abs(H.y + F.label.height / 2 - N) <= ie / 5 && H.x + F.label.width > I.x ? H.x + F.label.width + 6 : void 0, ee = (L.outgoing ?? []).filter(
       (ke) => ke.type === "bpmn:SequenceFlow" && ke.id !== O.id && ke.target && !ts.has(ke.id)
     ), re = new Set(ee.map((ke) => ke.target.id)), ye = (ke) => {
@@ -9852,7 +9854,7 @@ function RA(e, t) {
       );
     }, ae = _r(x.target), ge = new Set(ae.map((ke) => ke.id)), Oe = ei.has(x.target) ? { autoResize: !1 } : void 0, Ee = Math.min(...ae.map((ke) => ke.x)), de = Math.max(...ae.map((ke) => ke.x + ke.width)), he = L.x + L.width, Q = k.x + k.width <= L.x, le = (() => {
       if (!Q) return;
-      const ke = d(M), Tt = ((ke == null ? void 0 : ke.children) ?? []).filter(
+      const ke = d(C), Tt = ((ke == null ? void 0 : ke.children) ?? []).filter(
         (Be) => bi(Be) && !ge.has(Be.id) && Be.type !== "bpmn:Group" && Be.type !== "bpmn:Participant"
       ), Rt = ["bpmn:SequenceFlow", "bpmn:MessageFlow", "bpmn:Association", "bpmn:DataInputAssociation", "bpmn:DataOutputAssociation"], on = r.getAll().filter((Be) => {
         if (!Rt.includes(Be.type)) return !1;
@@ -9871,11 +9873,11 @@ function RA(e, t) {
       }), qe = L.x + L.width / 2, wt = L.y + L.height / 2, Ke = F.waypoints ?? [], At = Ke.length >= 2 && Math.abs(Ke[0].y - Ke[1].y) < 1 && Ke[1].x < Ke[0].x;
       return [
         ...N !== void 0 ? [{ cx: qe, cy: N }] : [],
-        ...At ? [{ cx: L.x - wr - M.width / 2, cy: Ke[0].y }] : [],
+        ...At ? [{ cx: L.x - wr - C.width / 2, cy: Ke[0].y }] : [],
         { cx: qe, cy: wt + ie },
         { cx: qe, cy: wt - ie }
-      ].find((Be) => Le(Be.cx - (M.x + M.width / 2), Be.cy - (M.y + M.height / 2)));
-    })(), Me = Q && !le ? he : k.x, Xe = M.y + M.height / 2, St = D1(
+      ].find((Be) => Le(Be.cx - (C.x + C.width / 2), Be.cy - (C.y + C.height / 2)));
+    })(), Me = Q && !le ? he : k.x, Xe = C.y + C.height / 2, St = D1(
       ae,
       he + wr - Ee,
       [0, L.y + L.height / 2 - Xe, k.y + k.height / 2 - Xe],
@@ -9884,14 +9886,14 @@ function RA(e, t) {
       L.y + L.height / 2
     ), nt = he + wr + St, st = (() => {
       if (W === void 0) return 0;
-      const ke = he + wr, Tt = L.y + L.height / 2 - M.height / 2, Rt = { x: ke, y: Tt, width: de - Ee, height: M.height }, on = d(L);
+      const ke = he + wr, Tt = L.y + L.height / 2 - C.height / 2, Rt = { x: ke, y: Tt, width: de - Ee, height: C.height }, on = d(L);
       return ((on == null ? void 0 : on.children) ?? []).some(
         (qe) => bi(qe) && !ge.has(qe.id) && qe.id !== L.id && qe.id !== k.id && qe.type !== "bpmn:Group" && qe.type !== "bpmn:Participant" && qe.x < Rt.x + Rt.width && qe.x + qe.width > Rt.x && qe.y < Rt.y + Rt.height && qe.y + qe.height > Rt.y
       ) || ye(Rt) ? Math.max(0, W - ke) : 0;
     })(), De = le ? 0 : de - Ee + wr * 2 + St + st - (Q ? 0 : k.x - he);
     let be = [];
     if (De > 0) {
-      const ke = d(M), Tt = (ke == null ? void 0 : ke.children) ?? [], Rt = (Ke) => Ke.type === "bpmn:Lane";
+      const ke = d(C), Tt = (ke == null ? void 0 : ke.children) ?? [], Rt = (Ke) => Ke.type === "bpmn:Lane";
       be = (() => {
         const Ke = /* @__PURE__ */ new Set();
         for (const $e of Tt)
@@ -9982,11 +9984,11 @@ function RA(e, t) {
       const Tt = ke.y + ke.height / 2;
       return Tt >= Se.y && Tt <= Se.y + Se.height;
     }, Te = !ce(L) && ce(k), Ze = (ke) => ke.y + ke.height / 2, tt = () => {
-      const ke = L.x + L.width, Tt = k.x, Rt = Ze(k) - M.height / 2, on = Ze(k) + M.height / 2;
+      const ke = L.x + L.width, Tt = k.x, Rt = Ze(k) - C.height / 2, on = Ze(k) + C.height / 2;
       return !r.getAll().some(
-        (Le) => bi(Le) && Le.type !== "bpmn:Participant" && Le.type !== "bpmn:Group" && Le.type !== "bpmn:TextAnnotation" && Le.id !== L.id && Le.id !== k.id && Le.id !== M.id && Le.x < Tt && Le.x + Le.width > ke && Le.y < on && Le.y + Le.height > Rt
+        (Le) => bi(Le) && Le.type !== "bpmn:Participant" && Le.type !== "bpmn:Group" && Le.type !== "bpmn:TextAnnotation" && Le.id !== L.id && Le.id !== k.id && Le.id !== C.id && Le.x < Tt && Le.x + Le.width > ke && Le.y < on && Le.y + Le.height > Rt
       );
-    }, Ie = !Te && _.band !== void 0 && ce(k) && !xt(_.node.lane, _.node.participant, _.band, Ze(L)) && xt(_.node.lane, _.node.participant, _.band, Ze(k)) && k.x >= L.x + L.width && tt(), rt = Te || Ie ? k : L, dt = rt.y + rt.height / 2, Dt = dt - (M.y + M.height / 2), Xn = _.band !== void 0, bt = Xn ? [M] : ae, Sn = (
+    }, Ie = !Te && _.band !== void 0 && ce(k) && !xt(_.node.lane, _.node.participant, _.band, Ze(L)) && xt(_.node.lane, _.node.participant, _.band, Ze(k)) && k.x >= L.x + L.width && tt(), rt = Te || Ie ? k : L, dt = rt.y + rt.height / 2, Dt = dt - (C.y + C.height / 2), Xn = _.band !== void 0, bt = Xn ? [C] : ae, Sn = (
       // ── B-89. 삽입도 같은 축이다 — band 가 **상류 행의 슬롯**을 가리키면 승계한다 ──
       // 🔁 「add/update 경로 갈림」의 동형이라 `freeSpot` 과 **같은 술어**를 쓴다(한쪽만 넓히면 구멍).
       (_.band === void 0 || xt(_.node.lane, _.node.participant, _.band, dt)) && di(x.target) && bt.every(
@@ -9995,15 +9997,15 @@ function RA(e, t) {
           return qi((Tt = D.get(ke.id)) == null ? void 0 : Tt.node.lane, ke, ke.y + ke.height / 2 + Dt);
         }
       )
-    ), Dc = (ke) => Math.abs(ke.y + ke.height / 2 - (M.y + M.height / 2)) <= ie / 2;
+    ), Dc = (ke) => Math.abs(ke.y + ke.height / 2 - (C.y + C.height / 2)) <= ie / 2;
     if (Sn && Xn) {
-      const ke = Math.abs(Dt) <= ie / 2 ? ae.filter((Le) => Le.id !== M.id && Dc(Le)) : [], Tt = M.y + M.height / 2, on = _.band !== void 0 && !xt(_.node.lane, _.node.participant, _.band, Tt) ? ae.filter(
+      const ke = Math.abs(Dt) <= ie / 2 ? ae.filter((Le) => Le.id !== C.id && Dc(Le)) : [], Tt = C.y + C.height / 2, on = _.band !== void 0 && !xt(_.node.lane, _.node.participant, _.band, Tt) ? ae.filter(
         (Le) => {
           var qe, wt;
-          return Le.id !== M.id && !ke.includes(Le) && ((qe = D.get(Le.id)) == null ? void 0 : qe.band) === _.band && ((wt = D.get(Le.id)) == null ? void 0 : wt.node.lane) === _.node.lane && (Math.abs(Le.y + Le.height / 2 - Tt) <= ie / 2 || xt(_.node.lane, _.node.participant, _.band, Le.y + Le.height / 2));
+          return Le.id !== C.id && !ke.includes(Le) && ((qe = D.get(Le.id)) == null ? void 0 : qe.band) === _.band && ((wt = D.get(Le.id)) == null ? void 0 : wt.node.lane) === _.node.lane && (Math.abs(Le.y + Le.height / 2 - Tt) <= ie / 2 || xt(_.node.lane, _.node.participant, _.band, Le.y + Le.height / 2));
         }
       ).map((Le) => ({ t: Le, dy: dt - (Le.y + Le.height / 2) })).filter(({ dy: Le }) => Le !== 0) : [];
-      if (n.moveElements(ae, { x: nt - Ee, y: 0 }, void 0, Oe), n.moveElements([M], { x: 0, y: Dt }, void 0, Oe), ke.length) {
+      if (n.moveElements(ae, { x: nt - Ee, y: 0 }, void 0, Oe), n.moveElements([C], { x: 0, y: Dt }, void 0, Oe), ke.length) {
         const Le = () => new Set(pt(He(r)).map((Be) => ft(Be))), qe = Le(), wt = r.filter((Be) => Be.type === "label").map((Be) => ({
           label: Be,
           x: Be.x,
@@ -10034,22 +10036,22 @@ function RA(e, t) {
         void 0,
         Oe
       );
-    const $i = d(M);
+    const $i = d(C);
     if (!Sn && _.node.lane === void 0 && _.band !== void 0 && $i) {
-      const ke = $i.y + ve + Ot(`pool:${_.node.participant ?? ""}`, _.band) * ie, Tt = ke - (M.y + M.height / 2);
-      Tt !== 0 && !Pe($i, M, M.x + M.width / 2, ke, ge) && n.moveElements([M], { x: 0, y: Tt }, void 0, Oe);
+      const ke = $i.y + ve + Ot(`pool:${_.node.participant ?? ""}`, _.band) * ie, Tt = ke - (C.y + C.height / 2);
+      Tt !== 0 && !Pe($i, C, C.x + C.width / 2, ke, ge) && n.moveElements([C], { x: 0, y: Tt }, void 0, Oe);
     }
     if (le)
       n.moveElements(
         ae,
-        { x: le.cx - (M.x + M.width / 2), y: le.cy - (M.y + M.height / 2) },
+        { x: le.cx - (C.x + C.width / 2), y: le.cy - (C.y + C.height / 2) },
         void 0,
         Oe
       );
     else if ($i) {
       const ke = ($i.children ?? []).filter(
         (Le) => bi(Le) && !ge.has(Le.id) && Le.type !== "bpmn:Group" && Le.type !== "bpmn:Participant"
-      ), Tt = (Le, qe, wt, Ke, At) => Le.x + qe < At.x + At.width + Ke && Le.x + qe + Le.width + Ke > At.x && Le.y + wt < At.y + At.height + Ke && Le.y + wt + Le.height + Ke > At.y, Rt = ke.find((Le) => Tt(M, 0, 0, 0, Le)), on = Rt ? void 0 : ye(M);
+      ), Tt = (Le, qe, wt, Ke, At) => Le.x + qe < At.x + At.width + Ke && Le.x + qe + Le.width + Ke > At.x && Le.y + wt < At.y + At.height + Ke && Le.y + wt + Le.height + Ke > At.y, Rt = ke.find((Le) => Tt(C, 0, 0, 0, Le)), on = Rt ? void 0 : ye(C);
       if (Rt || on) {
         const Le = ["bpmn:SequenceFlow", "bpmn:MessageFlow", "bpmn:Association", "bpmn:DataInputAssociation", "bpmn:DataOutputAssociation"], qe = r.getAll().filter((vt) => {
           if (!Le.includes(vt.type)) return !1;
@@ -10065,9 +10067,9 @@ function RA(e, t) {
               if (ca(ti.waypoints[Xi], ti.waypoints[Xi + 1], Pr) < vi) return !1;
             return !0;
           })
-        ), At = M.y + M.height / 2, $e = [N, k.y + k.height / 2].filter(
+        ), At = C.y + C.height / 2, $e = [N, k.y + k.height / 2].filter(
           (vt) => vt !== void 0 && Math.abs(vt - At) >= 1
-        ), Be = Rt && re.has(Rt.id) ? Rt : on == null ? void 0 : on.target, $t = Be ? Be.x - M.x : 0, kt = Math.max(...ae.map((vt) => vt.x + vt.width)), _t = [...$t !== 0 ? [$t] : [], ...St !== 0 ? [-St] : [], 0], Mr = W === void 0 ? [] : _t.map((vt) => Math.max(vt, W - M.x)), Wn = (vt) => kt + vt + wr <= k.x, Ki = [.../* @__PURE__ */ new Set([...Mr, ..._t])].filter(Wn), aa = Rt && re.has(Rt.id) ? [Rt.x + Rt.width + wr - M.x] : [], Ar = W === void 0 ? [] : aa.map((vt) => Math.max(vt, W - M.x)), Tp = [.../* @__PURE__ */ new Set([...Ar, ...aa])].filter((vt) => Wn(vt) && !Ki.includes(vt));
+        ), Be = Rt && re.has(Rt.id) ? Rt : on == null ? void 0 : on.target, $t = Be ? Be.x - C.x : 0, kt = Math.max(...ae.map((vt) => vt.x + vt.width)), _t = [...$t !== 0 ? [$t] : [], ...St !== 0 ? [-St] : [], 0], Mr = W === void 0 ? [] : _t.map((vt) => Math.max(vt, W - C.x)), Wn = (vt) => kt + vt + wr <= k.x, Ki = [.../* @__PURE__ */ new Set([...Mr, ..._t])].filter(Wn), aa = Rt && re.has(Rt.id) ? [Rt.x + Rt.width + wr - C.x] : [], Ar = W === void 0 ? [] : aa.map((vt) => Math.max(vt, W - C.x)), Tp = [.../* @__PURE__ */ new Set([...Ar, ...aa])].filter((vt) => Wn(vt) && !Ki.includes(vt));
         let Fi;
         for (const vt of [Ki, Tp]) {
           for (const xn of $e) {
@@ -10152,15 +10154,15 @@ function RA(e, t) {
     }
   }
   for (const [x, _] of ei) {
-    const M = p(x);
-    if (!M) continue;
-    const O = _.container, L = Math.abs(M.y + M.height / 2 - O.y - _.relCy) >= 0.5, k = M.label, F = Math.min(M.y, k && !k.hidden ? k.y : M.y), I = Math.max(M.y + M.height, k && !k.hidden ? k.y + k.height : 0);
+    const C = p(x);
+    if (!C) continue;
+    const O = _.container, L = Math.abs(C.y + C.height / 2 - O.y - _.relCy) >= 0.5, k = C.label, F = Math.min(C.y, k && !k.hidden ? k.y : C.y), I = Math.max(C.y + C.height, k && !k.hidden ? k.y + k.height : 0);
     if (L && F >= O.y && I <= O.y + O.height) continue;
-    const N = M.y;
-    _.grow(), M.y !== N && n.moveElements([M], { x: 0, y: N - M.y }, void 0, { autoResize: !1 });
+    const N = C.y;
+    _.grow(), C.y !== N && n.moveElements([C], { x: 0, y: N - C.y }, void 0, { autoResize: !1 });
   }
   const Ig = (x, _) => {
-    const M = _.target === x, O = f(_.source), L = f(_.target), k = M ? "bpmn:DataOutputAssociation" : "bpmn:DataInputAssociation";
+    const C = _.target === x, O = f(_.source), L = f(_.target), k = C ? "bpmn:DataOutputAssociation" : "bpmn:DataInputAssociation";
     n.connect(
       O,
       L,
@@ -10169,8 +10171,8 @@ function RA(e, t) {
   }, Ng = (x) => {
     for (const _ of h) {
       if (!_.participant.blackBox) continue;
-      const M = p(_.participant.id);
-      if (!M) continue;
+      const C = p(_.participant.id);
+      if (!C) continue;
       const O = [];
       for (const k of y) {
         const F = k.flow.source === _.participant.id ? k.flow.target : k.flow.target === _.participant.id ? k.flow.source : void 0, I = F ? p(F) : void 0;
@@ -10196,7 +10198,7 @@ function RA(e, t) {
             (H) => I ? H.y + H.height <= k.y + 5 : H.y >= k.y + k.height - 5
           );
           if (N.length) {
-            const H = [...N.reduce((Q, le) => Q.set(le.y, (Q.get(le.y) ?? 0) + 1), /* @__PURE__ */ new Map())].sort((Q, le) => le[1] - Q[1] || (I ? le[0] - Q[0] : Q[0] - le[0]))[0][0], W = Math.min(M.width, wA), ee = _A, re = O.map((Q) => Q.x + Q.width / 2), ye = Math.round(F(re) - W / 2), ae = Math.max(...re) + $p, ge = (Q) => ({ x: Q, width: Math.max(W, ae - Q) }), Oe = N.filter((Q) => Math.min(Q.y + Q.height, H + ee) - Math.max(Q.y, H) > 0), Ee = (Q) => {
+            const H = [...N.reduce((Q, le) => Q.set(le.y, (Q.get(le.y) ?? 0) + 1), /* @__PURE__ */ new Map())].sort((Q, le) => le[1] - Q[1] || (I ? le[0] - Q[0] : Q[0] - le[0]))[0][0], W = Math.min(C.width, wA), ee = _A, re = O.map((Q) => Q.x + Q.width / 2), ye = Math.round(F(re) - W / 2), ae = Math.max(...re) + $p, ge = (Q) => ({ x: Q, width: Math.max(W, ae - Q) }), Oe = N.filter((Q) => Math.min(Q.y + Q.height, H + ee) - Math.max(Q.y, H) > 0), Ee = (Q) => {
               const le = ge(Q);
               return Oe.some((Me) => Me.x < le.x + le.width && le.x < Me.x + Me.width);
             }, de = (Q) => {
@@ -10207,22 +10209,22 @@ function RA(e, t) {
               const Q = de(ye);
               return Oe.flatMap((le) => [le.x + le.width + Qm, le.x - Qm - W]).map((le) => Math.round(le)).filter((le) => !Ee(le) && de(le) >= Q).sort((le, Me) => Math.abs(le - ye) - Math.abs(Me - ye))[0] ?? ye;
             })();
-            if (he !== M.x || H !== M.y || W !== M.width || ee !== M.height) {
-              const Q = () => new Set(pt(He(r)).map((st) => ft(st))), le = Q(), Me = { x: M.x, y: M.y, width: M.width, height: M.height };
-              n.resizeShape(M, { x: he, y: H, width: W, height: ee });
+            if (he !== C.x || H !== C.y || W !== C.width || ee !== C.height) {
+              const Q = () => new Set(pt(He(r)).map((st) => ft(st))), le = Q(), Me = { x: C.x, y: C.y, width: C.width, height: C.height };
+              n.resizeShape(C, { x: he, y: H, width: W, height: ee });
               const Xe = Q(), St = [...Xe].filter((st) => !le.has(st)).length, nt = [...le].filter((st) => !Xe.has(st)).length;
-              St > nt && n.resizeShape(M, Me);
+              St > nt && n.resizeShape(C, Me);
             }
           }
         }
       }
       const L = Math.max(...O.map((k) => k.x + k.width / 2)) + $p;
-      if (L > M.x + M.width && n.resizeShape(M, { x: M.x, y: M.y, width: L - M.x, height: M.height }), !!x)
+      if (L > C.x + C.width && n.resizeShape(C, { x: C.x, y: C.y, width: L - C.x, height: C.height }), !!x)
         for (const k of y) {
           const F = p(k.flow.id), I = k.flow.source === _.participant.id ? k.flow.target : k.flow.target === _.participant.id ? k.flow.source : void 0, N = I ? p(I) : void 0;
           if (!F || !N || N.type === "bpmn:Participant") continue;
           const H = N.x + N.width / 2;
-          H < M.x + 10 || H > M.x + M.width - 10 || Ag(F, M, N);
+          H < C.x + 10 || H > C.x + C.width - 10 || Ag(F, C, N);
         }
     }
   };
@@ -10235,7 +10237,7 @@ function RA(e, t) {
     });
   }
   {
-    const M = new Set(
+    const C = new Set(
       [...$.map((N) => N.flow.id), ...y.map((N) => N.flow.id)].filter(
         (N) => !!N
       )
@@ -10260,7 +10262,7 @@ function RA(e, t) {
         return !!he && typeof he.x == "number" && he.x + he.width / 2 > W.x + W.width / 2;
       };
       if (![...H.values()].some(
-        (de) => de.length >= 3 && de.some((he) => he.dir === "out") && de.some((he) => he.dir === "in" && M.has(he.id) && ee(he))
+        (de) => de.length >= 3 && de.some((he) => he.dir === "out") && de.some((he) => he.dir === "in" && C.has(he.id) && ee(he))
       )) continue;
       const ye = d(W);
       if (!ye || I.has(ye.id) || (ye.children ?? []).some((de) => de.type === "bpmn:Lane")) continue;
@@ -10293,16 +10295,16 @@ function RA(e, t) {
       straight: x.edges.filter((_) => _.type === "bpmn:MessageFlow" && _.waypoints.length === 2).length
     };
   }, oa = (x) => {
-    const _ = He(r), M = _.edges.find((O) => O.id === x);
-    return M ? Vt(M, qn(_)).length : 0;
+    const _ = He(r), C = _.edges.find((O) => O.id === x);
+    return C ? Vt(C, qn(_)).length : 0;
   }, Ac = (x) => oa(x) > 0, Pc = (x) => He(r).edges.filter(
     (_) => _.type === "bpmn:MessageFlow" && _.id !== x && _.waypoints.length === 2
-  ).length, $g = (x, _, M) => ia([{ subtree: x, pool: _ }], M), Fg = (x, _) => _.bad > x.bad || _.crossings > x.crossings && _.straight <= x.straight && _.bad >= x.bad, ra = (x, _) => Fg(x, _) || _.straight < x.straight, Sr = (x, _, M = () => !0, O = Fg, L = !1) => {
+  ).length, $g = (x, _, C) => ia([{ subtree: x, pool: _ }], C), Fg = (x, _) => _.bad > x.bad || _.crossings > x.crossings && _.straight <= x.straight && _.bad >= x.bad, ra = (x, _) => Fg(x, _) || _.straight < x.straight, Sr = (x, _, C = () => !0, O = Fg, L = !1) => {
     const k = Er(), F = ia(x, _, L);
     if (!F) return !1;
     const I = Er();
-    return O(k, I) || !M() ? (F(), !1) : !0;
-  }, V1 = (x, _, M, O = () => !0) => Sr([{ subtree: x, pool: _ }], M, O), Rr = (x) => {
+    return O(k, I) || !C() ? (F(), !1) : !0;
+  }, V1 = (x, _, C, O = () => !0) => Sr([{ subtree: x, pool: _ }], C, O), Rr = (x) => {
     var _;
     return !!((_ = D.get(x)) != null && _.node.participant);
   }, ns = /* @__PURE__ */ new Map();
@@ -10314,8 +10316,8 @@ function RA(e, t) {
   const Tc = [...ns.keys()], Rp = new Set($.map((x) => x.flow.target)), jg = (x) => br.findIndex(({ op: _ }) => _.participant.id === x);
   Tc.sort((x, _) => {
     var L, k;
-    const M = Rp.has(x) ? 1 : 0, O = Rp.has(_) ? 1 : 0;
-    return M !== O ? M - O : jg((L = D.get(x)) == null ? void 0 : L.node.participant) - jg((k = D.get(_)) == null ? void 0 : k.node.participant);
+    const C = Rp.has(x) ? 1 : 0, O = Rp.has(_) ? 1 : 0;
+    return C !== O ? C - O : jg((L = D.get(x)) == null ? void 0 : L.node.participant) - jg((k = D.get(_)) == null ? void 0 : k.node.participant);
   });
   const $o = (x) => x.x + x.width / 2, W1 = (x) => {
     const _ = /* @__PURE__ */ new Map();
@@ -10324,17 +10326,17 @@ function RA(e, t) {
       if (!k.waypoints || !k.source || !k.target) continue;
       (_.get(k.source.id) ?? _.set(k.source.id, []).get(k.source.id)).push(k.target.id);
     }
-    const M = /* @__PURE__ */ new Set([x]), O = [x];
+    const C = /* @__PURE__ */ new Set([x]), O = [x];
     for (let L = 0; L < O.length; L++)
       for (const k of _.get(O[L]) ?? [])
-        M.has(k) || (M.add(k), O.push(k));
-    return M;
+        C.has(k) || (C.add(k), O.push(k));
+    return C;
   }, U1 = (x, _) => {
-    const M = W1(_);
+    const C = W1(_);
     let O;
     for (const L of r.getAll()) {
       const k = L;
-      if (k.type !== "bpmn:MessageFlow" || !k.source || !k.target || k.target.id !== x || M.has(k.source.id)) continue;
+      if (k.type !== "bpmn:MessageFlow" || !k.source || !k.target || k.target.id !== x || C.has(k.source.id)) continue;
       const F = k.source;
       if (typeof F.x != "number" || F.type === "bpmn:Participant") continue;
       const I = $o(F);
@@ -10342,28 +10344,28 @@ function RA(e, t) {
     }
     return O;
   }, Cp = (x, _) => {
-    const M = p(x.flow.source);
-    if (M)
-      return M.type === "bpmn:Participant" ? U1(M.id, _) : $o(M);
+    const C = p(x.flow.source);
+    if (C)
+      return C.type === "bpmn:Participant" ? U1(C.id, _) : $o(C);
   }, Hg = (x) => {
     let _;
-    for (const M of ns.get(x) ?? []) {
-      const O = Cp(M, x);
-      O !== void 0 && (!_ || O > _.cx) && (_ = { op: M, cx: O });
+    for (const C of ns.get(x) ?? []) {
+      const O = Cp(C, x);
+      O !== void 0 && (!_ || O > _.cx) && (_ = { op: C, cx: O });
     }
     return _ == null ? void 0 : _.op;
   }, q1 = (x) => {
-    const _ = Hg(x), M = p(x), O = _ ? Cp(_, x) : void 0;
-    return M && O !== void 0 ? O - $o(M) : void 0;
+    const _ = Hg(x), C = p(x), O = _ ? Cp(_, x) : void 0;
+    return C && O !== void 0 ? O - $o(C) : void 0;
   }, Y1 = (x) => {
     const _ = q1(x);
     return _ !== void 0 && Math.abs(_) < Sp;
-  }, kc = (x, _, M, O, L) => {
+  }, kc = (x, _, C, O, L) => {
     var k;
     for (let F = !0; F; ) {
       F = !1;
       for (const I of y) {
-        if (I.flow.id === M) continue;
+        if (I.flow.id === C) continue;
         const N = _.has(I.flow.source), H = _.has(I.flow.target);
         if (N === H || O(N ? I.flow.source : I.flow.target)) continue;
         const W = N ? I.flow.target : I.flow.source;
@@ -10380,20 +10382,20 @@ function RA(e, t) {
       }
     }
     return [...x].map(([F, I]) => ({ subtree: I, pool: f(F) }));
-  }, zg = (x, _, M, O, L) => kc(
+  }, zg = (x, _, C, O, L) => kc(
     /* @__PURE__ */ new Map([[_, [...x]]]),
     new Set(x.map((k) => k.id)),
     O,
-    (k) => k === M,
+    (k) => k === C,
     (k) => k === L
   ), Mp = (x) => {
     const _ = Hg(x);
     if (!_) return null;
-    const M = p(x), O = p(_.flow.source), L = Cp(_, x);
-    if (!M || !O || L === void 0) return null;
-    const k = L - $o(M);
+    const C = p(x), O = p(_.flow.source), L = Cp(_, x);
+    if (!C || !O || L === void 0) return null;
+    const k = L - $o(C);
     if (k >= Sp) {
-      const F = D.get(x).node.participant, I = _r(x, (N) => N.x >= M.x);
+      const F = D.get(x).node.participant, I = _r(x, (N) => N.x >= C.x);
       return { groups: zg(I, F, x, _.flow.id, _.flow.source), dx: k };
     }
     if (-k >= Sp && Rr(_.flow.source)) {
@@ -10402,19 +10404,19 @@ function RA(e, t) {
     }
     return null;
   }, Gg = () => Tc.map((x) => ({ id: x, plan: Mp(x) })).filter((x) => !!x.plan).sort(
-    (x, _) => Math.min(...x.plan.groups.flatMap((M) => M.subtree.map((O) => O.x))) - Math.min(..._.plan.groups.flatMap((M) => M.subtree.map((O) => O.x)))
+    (x, _) => Math.min(...x.plan.groups.flatMap((C) => C.subtree.map((O) => O.x))) - Math.min(..._.plan.groups.flatMap((C) => C.subtree.map((O) => O.x)))
   ).map((x) => x.id);
   for (let x = 0; x < 3; x++) {
-    const _ = Er(), M = [];
+    const _ = Er(), C = [];
     for (const L of Gg()) {
       const k = Mp(L);
       if (!k) continue;
       const F = ia(k.groups, k.dx);
-      F && M.push(F);
+      F && C.push(F);
     }
-    if (!M.length) break;
+    if (!C.length) break;
     if (!ra(_, Er())) continue;
-    for (const L of M.reverse()) L();
+    for (const L of C.reverse()) L();
     let O = !1;
     for (const L of Gg()) {
       const k = Mp(L);
@@ -10426,33 +10428,33 @@ function RA(e, t) {
     if (Rp.has(x)) continue;
     const _ = D.get(x);
     if (!_ || _.node.lane !== void 0) continue;
-    const M = K(_);
-    if (M === void 0) continue;
+    const C = K(_);
+    if (C === void 0) continue;
     const O = p(x), L = O ? d(O) : void 0;
     if (!O || !L) continue;
-    const k = L.y + ve + Ot(`pool:${_.node.participant ?? ""}`, M) * ie, F = k - (O.y + O.height / 2);
+    const k = L.y + ve + Ot(`pool:${_.node.participant ?? ""}`, C) * ie, F = k - (O.y + O.height / 2);
     F !== 0 && !Pe(L, O, O.x + O.width / 2, k) && n.moveElements([O], { x: 0, y: F });
   }
   const Vg = () => {
     const x = r.filter((O) => O.type === "bpmn:Participant"), _ = new Map(x.map((O) => [O.id, O]));
-    let M = 0;
+    let C = 0;
     for (const { pools: [O, L] } of gw(x)) {
       const k = _.get(O), F = _.get(L);
-      M += (Math.min(k.x + k.width, F.x + F.width) - Math.max(k.x, F.x)) * (Math.min(k.y + k.height, F.y + F.height) - Math.max(k.y, F.y));
+      C += (Math.min(k.x + k.width, F.x + F.width) - Math.max(k.x, F.x)) * (Math.min(k.y + k.height, F.y + F.height) - Math.max(k.y, F.y));
     }
-    return M;
+    return C;
   }, Wg = /* @__PURE__ */ new Set();
   for (let x = 0, _ = !0; _ && x < H1; x++) {
     _ = !1;
-    for (const M of Tc.flatMap((O) => ns.get(O) ?? [])) {
-      if (Wg.has(M.flow.id) || !Ac(M.flow.id)) continue;
-      const O = p(M.flow.target);
+    for (const C of Tc.flatMap((O) => ns.get(O) ?? [])) {
+      if (Wg.has(C.flow.id) || !Ac(C.flow.id)) continue;
+      const O = p(C.flow.target);
       if (!O) continue;
-      const L = f(D.get(M.flow.target).node.participant), k = _r(M.flow.target, (W) => W.x >= O.x), F = O.width + se, I = oa(M.flow.id), N = Pc(M.flow.id), H = Vg();
+      const L = f(D.get(C.flow.target).node.participant), k = _r(C.flow.target, (W) => W.x >= O.x), F = O.width + se, I = oa(C.flow.id), N = Pc(C.flow.id), H = Vg();
       for (let W = 1; W <= Bg; W++) {
-        const ee = () => oa(M.flow.id) < I && Pc(M.flow.id) >= N && Vg() <= H;
+        const ee = () => oa(C.flow.id) < I && Pc(C.flow.id) >= N && Vg() <= H;
         if (V1(k, L, F * W, ee)) {
-          Wg.add(M.flow.id), _ = !0;
+          Wg.add(C.flow.id), _ = !0;
           break;
         }
       }
@@ -10463,18 +10465,18 @@ function RA(e, t) {
     Ug.has(x.id) || !x.source || !x.target || x.source.type === "bpmn:Participant" != (x.target.type === "bpmn:Participant") && Ap.push({ id: x.id, source: x.source.id, target: x.target.id, preexisting: !0 });
   for (const x of Ap) {
     if (!Ac(x.id)) continue;
-    const _ = p(x.source), M = p(x.target);
-    if (!_ || !M) continue;
+    const _ = p(x.source), C = p(x.target);
+    if (!_ || !C) continue;
     let O, L, k;
     if (x.preexisting) {
-      const [I, N] = _.type === "bpmn:Participant" ? [M, _] : [_, M];
+      const [I, N] = _.type === "bpmn:Participant" ? [C, _] : [_, C];
       if (O = $o(I), O < N.x || O > N.x + N.width) continue;
       [L, k] = I.y < N.y ? [I.y + I.height, N.y] : [N.y + N.height, I.y];
     } else {
-      if (_.type === "bpmn:Participant" || M.type === "bpmn:Participant" || (O = _.x + _.width / 2, Math.abs(O - (M.x + M.width / 2)) > 15)) continue;
-      [L, k] = _.y < M.y ? [_.y + _.height, M.y] : [M.y + M.height, _.y];
+      if (_.type === "bpmn:Participant" || C.type === "bpmn:Participant" || (O = _.x + _.width / 2, Math.abs(O - (C.x + C.width / 2)) > 15)) continue;
+      [L, k] = _.y < C.y ? [_.y + _.height, C.y] : [C.y + C.height, _.y];
     }
-    const F = [...D.values()].map((I) => p(I.node.id)).filter((I) => !!I && I.id !== _.id && I.id !== M.id).filter((I) => I.x <= O && O <= I.x + I.width && I.y + I.height > L && I.y < k).sort((I, N) => I.x - N.x);
+    const F = [...D.values()].map((I) => p(I.node.id)).filter((I) => !!I && I.id !== _.id && I.id !== C.id).filter((I) => I.x <= O && O <= I.x + I.width && I.y + I.height > L && I.y < k).sort((I, N) => I.x - N.x);
     for (const I of F) {
       const N = (om = D.get(I.id)) == null ? void 0 : om.node.participant, H = N ? p(N) : void 0;
       if (!N || !H) continue;
@@ -10490,7 +10492,7 @@ function RA(e, t) {
             new Set(he.map((Q) => Q.id)),
             x.id,
             () => !1,
-            (Q) => Q === _.id || Q === M.id
+            (Q) => Q === _.id || Q === C.id
           )
         );
       }
@@ -10510,16 +10512,16 @@ function RA(e, t) {
   const Oc = () => {
     var _;
     const x = /* @__PURE__ */ new Set();
-    for (const M of pt(He(r)))
-      M.kind !== "edge-crosses-shape" || Ug.has(M.edge) || ((_ = p(M.edge)) == null ? void 0 : _.type) === "bpmn:MessageFlow" && x.add(`${M.edge}>${M.shape}`);
+    for (const C of pt(He(r)))
+      C.kind !== "edge-crosses-shape" || Ug.has(C.edge) || ((_ = p(C.edge)) == null ? void 0 : _.type) === "bpmn:MessageFlow" && x.add(`${C.edge}>${C.shape}`);
     return x;
-  }, K1 = (x, _) => Er().bad >= x && [...Oc()].some((M) => !_.has(M)), qg = (x) => {
-    var _, M;
-    return oa(x) === 0 && ((M = (_ = p(x)) == null ? void 0 : _.waypoints) == null ? void 0 : M.length) === 2;
-  }, X1 = (x, _, M) => {
-    const O = new Set(x.flatMap((k) => k.subtree.map((F) => F.id))), L = [...Oc()].filter((k) => !M.has(k)).map((k) => k.split(">")[1]);
+  }, K1 = (x, _) => Er().bad >= x && [...Oc()].some((C) => !_.has(C)), qg = (x) => {
+    var _, C;
+    return oa(x) === 0 && ((C = (_ = p(x)) == null ? void 0 : _.waypoints) == null ? void 0 : C.length) === 2;
+  }, X1 = (x, _, C) => {
+    const O = new Set(x.flatMap((k) => k.subtree.map((F) => F.id))), L = [...Oc()].filter((k) => !C.has(k)).map((k) => k.split(">")[1]);
     return [...new Set(L)].filter((k) => O.has(k) && k !== _.source && k !== _.target);
-  }, Z1 = (x, _, M, O, L) => {
+  }, Z1 = (x, _, C, O, L) => {
     const k = x.map((H) => ({ ...H, subtree: H.subtree.filter((W) => !L.includes(W.id)) })).filter((H) => H.subtree.length), F = new Set(k.flatMap((H) => H.subtree.map((W) => W.id))), I = () => L.every((H) => {
       const W = p(H);
       return !!W && $.filter((ee) => ee.flow.target === H && F.has(ee.flow.source)).every((ee) => {
@@ -10527,23 +10529,23 @@ function RA(e, t) {
         return !!re && re.x + re.width <= W.x;
       });
     });
-    return Sr(k, _, () => qg(M.id) && [...Oc()].every((H) => O.has(H)) && I(), ra, !0);
+    return Sr(k, _, () => qg(C.id) && [...Oc()].every((H) => O.has(H)) && I(), ra, !0);
   };
   for (const x of y) {
     if (!Ac(x.flow.id)) continue;
     const _ = p(x.flow.id);
     if (((rm = _ == null ? void 0 : _.waypoints) == null ? void 0 : rm.length) !== 2) continue;
-    const M = p(x.flow.source), O = p(x.flow.target);
-    if (!M || !O || M.type === "bpmn:Participant" || O.type === "bpmn:Participant" || !Rr(x.flow.source) || !Rr(x.flow.target) || Math.abs($o(M) - $o(O)) > z1) continue;
-    const L = $o(M), k = _.waypoints.map((ge) => ge.y), [F, I] = [Math.min(...k), Math.max(...k)], N = qn(He(r)).filter(
-      (ge) => ge.id !== M.id && ge.id !== O.id && ge.x < L && L < ge.x + ge.width && F < ge.y + ge.height && ge.y < I
+    const C = p(x.flow.source), O = p(x.flow.target);
+    if (!C || !O || C.type === "bpmn:Participant" || O.type === "bpmn:Participant" || !Rr(x.flow.source) || !Rr(x.flow.target) || Math.abs($o(C) - $o(O)) > z1) continue;
+    const L = $o(C), k = _.waypoints.map((ge) => ge.y), [F, I] = [Math.min(...k), Math.max(...k)], N = qn(He(r)).filter(
+      (ge) => ge.id !== C.id && ge.id !== O.id && ge.x < L && L < ge.x + ge.width && F < ge.y + ge.height && ge.y < I
     );
     if (!N.length) continue;
     const H = (am = D.get(x.flow.source)) == null ? void 0 : am.node.participant, W = (sm = D.get(x.flow.target)) == null ? void 0 : sm.node.participant;
     if (!H || !W) continue;
     const ee = /* @__PURE__ */ new Map();
     for (const [ge, Oe, Ee] of [
-      [x.flow.source, M, H],
+      [x.flow.source, C, H],
       [x.flow.target, O, W]
     ]) {
       const de = ee.get(Ee) ?? [], he = _r(ge, (Q) => Q.x >= Oe.x).filter((Q) => !de.some((le) => le.id === Q.id));
@@ -10568,7 +10570,7 @@ function RA(e, t) {
     }
   }
   {
-    const x = (k) => k.y + k.height / 2, _ = /(Task|Event|Gateway|CallActivity|SubProcess)$/, M = () => {
+    const x = (k) => k.y + k.height / 2, _ = /(Task|Event|Gateway|CallActivity|SubProcess)$/, C = () => {
       const k = He(r), F = new Set(
         pt(k).flatMap((H) => H.kind === "edge-crosses-shape" ? [`${H.edge}|${H.shape}`] : [])
       ), I = k.shapes.filter((H) => !H.container && _.test(H.type)), N = /* @__PURE__ */ new Set();
@@ -10588,7 +10590,7 @@ function RA(e, t) {
           }
       }
       return N;
-    }, O = () => ({ ...Er(), grazes: M() }), L = [];
+    }, O = () => ({ ...Er(), grazes: C() }), L = [];
     for (const k of D.keys()) {
       if (!Rr(k)) continue;
       const F = $.filter((H) => H.flow.target === k);
@@ -10629,11 +10631,11 @@ function RA(e, t) {
   const J1 = 10, Q1 = 400, eS = (x) => [...x.incoming ?? [], ...x.outgoing ?? []].filter((_) => _.type === "bpmn:DataInputAssociation" || _.type === "bpmn:DataOutputAssociation").map((_) => _.source === x ? _.target : _.source).filter((_) => !!_ && typeof _.y == "number"), tS = r.filter(
     (x) => x.type === "bpmn:DataStoreReference" && g.has(x.id)
   ), nS = (x, _) => {
-    const M = x.x + x.width / 2, O = x.y + x.height / 2;
+    const C = x.x + x.width / 2, O = x.y + x.height / 2;
     let L;
     for (const k of tS) {
       if ((d(k) ?? u()) !== _ || k.y < x.y + x.height) continue;
-      const F = Math.abs(k.x + k.width / 2 - M);
+      const F = Math.abs(k.x + k.width / 2 - C);
       F > Q1 || F < k.width || !eS(k).some(
         (N) => N.height === x.height && Math.abs(N.y + N.height / 2 - O) <= J1 && k.y >= N.y + N.height
       ) || (!L || F < L.dx || F === L.dx && k.id < L.id) && (L = { dx: F, id: k.id, cy: k.y + k.height / 2 });
@@ -10641,9 +10643,9 @@ function RA(e, t) {
     return L == null ? void 0 : L.cy;
   };
   for (const x of v) {
-    const _ = x.associations ?? [], M = _.map((k) => k.source === x.dataStore.id ? k.target : k.source).map(p).find(Boolean), O = M ? d(M) ?? u() : u(), L = M ? {
-      x: M.x + M.width / 2,
-      y: nS(M, O) ?? M.y + M.height + 110
+    const _ = x.associations ?? [], C = _.map((k) => k.source === x.dataStore.id ? k.target : k.source).map(p).find(Boolean), O = C ? d(C) ?? u() : u(), L = C ? {
+      x: C.x + C.width / 2,
+      y: nS(C, O) ?? C.y + C.height + 110
     } : { x: 200, y: jn + 60 };
     n.createShape(
       {
@@ -10659,13 +10661,13 @@ function RA(e, t) {
     for (const k of _) Ig(x.dataStore.id, k);
   }
   for (const x of b) {
-    const M = f(x.association.target).type === "bpmn:DataStoreReference" ? x.association.target : x.association.source;
-    Ig(M, x.association);
+    const C = f(x.association.target).type === "bpmn:DataStoreReference" ? x.association.target : x.association.source;
+    Ig(C, x.association);
   }
   let Yg = 0;
   const Cr = 10, Kg = 40, iS = (x, _) => {
-    const M = _.map((N) => d(N)).filter((N) => !!N);
-    for (const N of M) {
+    const C = _.map((N) => d(N)).filter((N) => !!N);
+    for (const N of C) {
       const H = Cr, W = N.y, ee = N.y + N.height, re = N.x, ye = N.x + N.width;
       if (Math.abs(x.y - W) < H) {
         const ae = W + H - x.y;
@@ -10677,67 +10679,67 @@ function RA(e, t) {
       }
       Math.abs(x.x + x.width - ye) < H && (x.width = ye - H - x.x);
     }
-    if (!M.length) return;
-    const O = Math.min(...M.map((N) => N.y)), L = Math.max(...M.map((N) => N.y + N.height)), k = O - x.y, F = x.y + x.height - L, I = Kg - Cr;
+    if (!C.length) return;
+    const O = Math.min(...C.map((N) => N.y)), L = Math.max(...C.map((N) => N.y + N.height)), k = O - x.y, F = x.y + x.height - L, I = Kg - Cr;
     if (k > 0 != F > 0)
       if (k > 0 && k < I) {
         const N = k + Cr;
         x.y += N, x.height -= N;
       } else F > 0 && F < I && (x.height -= F + Cr);
   }, oS = (x, _) => {
-    const M = Cr, O = 30, L = r.filter(
+    const C = Cr, O = 30, L = r.filter(
       (k) => k.type === "bpmn:Group" && k.id !== _
     );
     for (const k of L) {
       const F = k.x, I = k.x + k.width, N = k.y, H = k.y + k.height, W = x.y < H && N < x.y + x.height, ee = x.x < I && F < x.x + x.width;
       if (W) {
-        if (Math.abs(x.x - I) < M) {
-          const re = Math.min(I + M - x.x, O);
+        if (Math.abs(x.x - I) < C) {
+          const re = Math.min(I + C - x.x, O);
           re > 0 && x.width - re > 0 && (x.x += re, x.width -= re);
         }
-        if (Math.abs(x.x + x.width - F) < M) {
-          const re = Math.min(x.x + x.width - (F - M), O);
+        if (Math.abs(x.x + x.width - F) < C) {
+          const re = Math.min(x.x + x.width - (F - C), O);
           re > 0 && x.width - re > 0 && (x.width -= re);
         }
       }
       if (ee) {
-        if (Math.abs(x.y - H) < M) {
-          const re = Math.min(H + M - x.y, O);
+        if (Math.abs(x.y - H) < C) {
+          const re = Math.min(H + C - x.y, O);
           re > 0 && x.height - re > 0 && (x.y += re, x.height -= re);
         }
-        if (Math.abs(x.y + x.height - N) < M) {
-          const re = Math.min(x.y + x.height - (N - M), O);
+        if (Math.abs(x.y + x.height - N) < C) {
+          const re = Math.min(x.y + x.height - (N - C), O);
           re > 0 && x.height - re > 0 && (x.height -= re);
         }
       }
     }
   }, Pp = (x, _) => {
-    const M = Kg, O = Math.min(...x.map((N) => N.x)) - M, L = Math.min(...x.map((N) => N.y)) - M, k = Math.max(...x.map((N) => N.x + N.width)) + M, F = Math.max(...x.map((N) => N.y + N.height)) + M, I = { x: O, y: L, width: k - O, height: F - L };
+    const C = Kg, O = Math.min(...x.map((N) => N.x)) - C, L = Math.min(...x.map((N) => N.y)) - C, k = Math.max(...x.map((N) => N.x + N.width)) + C, F = Math.max(...x.map((N) => N.y + N.height)) + C, I = { x: O, y: L, width: k - O, height: F - L };
     return iS(I, x), oS(I, _), I;
   };
   for (const x of R) {
     const _ = (x.group.members ?? []).map(p).filter((L) => !!L);
-    let M;
-    _.length ? M = Pp(_, x.group.id) : (M = { x: 300 + Yg * 350, y: 40, width: 300, height: 200 }, Yg++);
+    let C;
+    _.length ? C = Pp(_, x.group.id) : (C = { x: 300 + Yg * 350, y: 40, width: 300, height: 200 }, Yg++);
     const O = n.createShape(
       {
         type: "bpmn:Group",
         businessObject: i.create("bpmn:Group", { id: x.group.id }),
-        width: M.width,
-        height: M.height
+        width: C.width,
+        height: C.height
       },
-      { x: M.x + M.width / 2, y: M.y + M.height / 2 },
+      { x: C.x + C.width / 2, y: C.y + C.height / 2 },
       u()
     );
     x.group.name && n.updateLabel(O, x.group.name), (cm = x.group.members) != null && cm.length && X(O, "bwl:Members", { refs: x.group.members.join(" ") });
   }
   {
-    const x = r.filter((L) => !!L.waypoints), _ = /* @__PURE__ */ new Map(), M = (L, k) => {
+    const x = r.filter((L) => !!L.waypoints), _ = /* @__PURE__ */ new Map(), C = (L, k) => {
       !L || !k || (_.has(L) || _.set(L, /* @__PURE__ */ new Set()), _.get(L).add(k));
     };
     for (const L of x) {
       const k = (lm = L.source) == null ? void 0 : lm.id, F = (um = L.target) == null ? void 0 : um.id;
-      M(k, F), ((pm = L.type) != null && pm.includes("DataOutputAssociation") || (fm = L.type) != null && fm.includes("DataInputAssociation") || L.type === "bpmn:Association") && M(F, k);
+      C(k, F), ((pm = L.type) != null && pm.includes("DataOutputAssociation") || (fm = L.type) != null && fm.includes("DataInputAssociation") || L.type === "bpmn:Association") && C(F, k);
     }
     const O = r.filter((L) => L.type === "bpmn:Group");
     for (const L of O) {
@@ -10822,7 +10824,7 @@ function RA(e, t) {
       ...R.map((_) => _.group.id),
       ...Gt(e, "group.update").map((_) => _.id)
     ]);
-    for (const _ of r.filter((M) => M.type === "bpmn:Group")) {
+    for (const _ of r.filter((C) => C.type === "bpmn:Group")) {
       if (x.has(_.id)) continue;
       const O = (((gm = _.businessObject.extensionElements) == null ? void 0 : gm.values) ?? []).find((I) => I.$type === "bwl:Members"), L = ((O == null ? void 0 : O.refs) ?? "").split(" ").filter(Boolean).map(p).filter((I) => !!I);
       !L.length || !L.some((I) => {
@@ -10832,10 +10834,10 @@ function RA(e, t) {
     }
   }
   {
-    const _ = new Map(jr(He(r)).map((I) => [I.owner, I.rect])), M = r.filter((I) => !!I.waypoints), O = /* @__PURE__ */ new Map(), L = (I, N) => {
+    const _ = new Map(jr(He(r)).map((I) => [I.owner, I.rect])), C = r.filter((I) => !!I.waypoints), O = /* @__PURE__ */ new Map(), L = (I, N) => {
       !I || !N || (O.has(I) || O.set(I, /* @__PURE__ */ new Set()), O.get(I).add(N));
     };
-    for (const I of M) {
+    for (const I of C) {
       const N = (mm = I.source) == null ? void 0 : mm.id, H = (ym = I.target) == null ? void 0 : ym.id;
       L(N, H), ((vm = I.type) != null && vm.includes("DataOutputAssociation") || (xm = I.type) != null && xm.includes("DataInputAssociation") || I.type === "bpmn:Association") && L(H, N);
     }
@@ -10894,17 +10896,17 @@ function RA(e, t) {
       const O = _[Math.floor((_.length - 1) / 2)];
       return { x: O.x, y: O.y, width: 0, height: 0 };
     }
-    const M = x;
-    return { x: M.x, y: M.y, width: M.width, height: M.height };
+    const C = x;
+    return { x: C.x, y: C.y, width: C.width, height: C.height };
   };
   let is = 0;
   const Zg = 12, Jg = 14, rS = 15, aS = 300, sS = (x) => {
     const _ = x.split(`
-`), M = Math.max(..._.map((k) => Is(k, Zg))), O = Math.max(100, Math.min(aS, Math.ceil(M) + Jg)), L = _.reduce((k, F) => k + Math.max(1, Math.ceil((Is(F, Zg) + Jg) / O)), 0);
+`), C = Math.max(..._.map((k) => Is(k, Zg))), O = Math.max(100, Math.min(aS, Math.ceil(C) + Jg)), L = _.reduce((k, F) => k + Math.max(1, Math.ceil((Is(F, Zg) + Jg) / O)), 0);
     return { width: O, height: Math.max(30, L * rS + 10) };
   };
   for (const x of E) {
-    const _ = x.association, M = ((wm = x.placement) == null ? void 0 : wm.anchor) ?? (_ ? _.source === x.annotation.id ? _.target : _.source : void 0), O = M ? p(M) : void 0, L = O ? Xg(O) : void 0, k = sS(x.annotation.text ?? "");
+    const _ = x.association, C = ((wm = x.placement) == null ? void 0 : wm.anchor) ?? (_ ? _.source === x.annotation.id ? _.target : _.source : void 0), O = C ? p(C) : void 0, L = O ? Xg(O) : void 0, k = sS(x.annotation.text ?? "");
     let F;
     if (L && x.placement) {
       const [W, ee] = Zl[x.placement.side], re = x.placement.offset ?? 50;
@@ -10955,25 +10957,25 @@ function RA(e, t) {
       } : { type: "bpmn:Association" }
     );
   }
-  const cS = (x, _, M, O) => {
+  const cS = (x, _, C, O) => {
     const L = x.parent;
     if (!L) return O;
     const k = x.x + x.width / 2, F = /* @__PURE__ */ new Set([x.id]);
     if (!Pe(L, x, k, O, F)) return O;
-    const I = _ ? _.y + Math.min(_.height / 2, we) : M ? M.y + ve : void 0;
+    const I = _ ? _.y + Math.min(_.height / 2, we) : C ? C.y + ve : void 0;
     if (I === void 0) return O;
     const N = Math.floor((O - I) / ie + 1e-6);
     for (let H = 1; H <= 3; H++) {
       const W = N + H, ee = I + W * ie, re = nn(_ == null ? void 0 : _.id, W);
       if (!Pe(L, x, k, ee, re ? /* @__PURE__ */ new Set([...F, ...re]) : F))
-        return Mn(_ == null ? void 0 : _.id, W, M), ee;
+        return Mn(_ == null ? void 0 : _.id, W, C), ee;
     }
     return O;
   }, Qg = () => new Set(r.getAll().filter((x) => x.type !== "label").map((x) => x.id));
   for (const x of Gt(e, "node.update")) {
     let _ = f(x.id);
     if (x.type && Vc(x.type) !== _.type) {
-      const M = _.x + _.width / 2, O = _.y + _.height / 2, L = Qg();
+      const C = _.x + _.width / 2, O = _.y + _.height / 2, L = Qg();
       _ = c.replaceElement(
         _,
         {
@@ -10990,7 +10992,7 @@ function RA(e, t) {
           type: x.type,
           dropped: F
         });
-      const I = Math.round(M - (_.x + _.width / 2)), N = Math.round(O - (_.y + _.height / 2));
+      const I = Math.round(C - (_.x + _.width / 2)), N = Math.round(O - (_.y + _.height / 2));
       if (I !== 0 || N !== 0) {
         n.moveShape(_, { x: I, y: N });
         for (const H of [..._.incoming ?? [], ..._.outgoing ?? []]) Mc(H);
@@ -10998,21 +11000,21 @@ function RA(e, t) {
     }
     if (x.name !== void 0 && n.updateProperties(_, { name: x.name ?? void 0 }), x.lane || x.band !== void 0) {
       x.band !== void 0 && n.updateProperties(_, { "bwl:band": x.band });
-      const M = _.y + _.height / 2, O = d(_), L = x.lane ? f(x.lane) : ((O == null ? void 0 : O.children) ?? []).find(
-        (F) => F.type === "bpmn:Lane" && M >= F.y && M <= F.y + F.height
+      const C = _.y + _.height / 2, O = d(_), L = x.lane ? f(x.lane) : ((O == null ? void 0 : O.children) ?? []).find(
+        (F) => F.type === "bpmn:Lane" && C >= F.y && C <= F.y + F.height
       );
       x.band !== void 0 && Mn(L == null ? void 0 : L.id, x.band, O);
       const k = L ? L.y + (x.band === void 0 ? L.height / 2 : Math.min(L.height / 2, we) + Ot(L.id, x.band) * ie) : x.band !== void 0 && O ? O.y + ve + Ot(`pool:${O.id}`, x.band) * ie : void 0;
       if (k !== void 0) {
-        const F = cS(_, L, O, k), I = F === k ? k - M : F - (_.y + _.height / 2);
+        const F = cS(_, L, O, k), I = F === k ? k - C : F - (_.y + _.height / 2);
         I !== 0 && n.moveElements([_], { x: 0, y: I });
       }
     }
   }
   for (const x of Gt(e, "sequenceFlow.update")) {
-    const _ = f(x.id), M = P.get(x.id);
-    if (M) {
-      const O = (H) => ({ x: H.x + H.width / 2, y: H.y + H.height / 2 }), L = f(M.flow.source), k = f(M.flow.target), F = n.connect(L, k, { type: "bpmn:SequenceFlow", businessObject: Cc(M.flow) }), I = Ep.get(x.id), N = k.y + k.height / 2;
+    const _ = f(x.id), C = P.get(x.id);
+    if (C) {
+      const O = (H) => ({ x: H.x + H.width / 2, y: H.y + H.height / 2 }), L = f(C.flow.source), k = f(C.flow.target), F = n.connect(L, k, { type: "bpmn:SequenceFlow", businessObject: Cc(C.flow) }), I = Ep.get(x.id), N = k.y + k.height / 2;
       I && k.x > I.exit.x && Math.abs(N - I.exit.y) > 1 ? n.updateWaypoints(F, [I.exit, { x: I.exit.x, y: N }, { x: k.x, y: N }]) : (n.reconnect(F, L, k, [O(L), O(k)]), Math.abs(N - (L.y + L.height / 2)) > 1 && Mc(F));
     } else if (x.source !== void 0 || x.target !== void 0) {
       const O = _, L = x.source !== void 0 ? f(x.source) : O.source, k = x.target !== void 0 ? f(x.target) : O.target, F = (H) => ({ x: H.x + H.width / 2, y: H.y + H.height / 2 });
@@ -11038,7 +11040,7 @@ function RA(e, t) {
     if (x.text !== void 0 && n.updateProperties(_, { text: x.text }), x.placement === null)
       X(_, "bwl:Placement", null);
     else if (x.placement) {
-      const M = f(x.placement.anchor), O = Xg(M), L = d(M) ?? u(), k = typeof L.x == "number" && typeof L.width == "number" && L.type === "bpmn:Participant", [F, I] = Zl[x.placement.side], N = x.placement.offset ?? 50, H = {
+      const C = f(x.placement.anchor), O = Xg(C), L = d(C) ?? u(), k = typeof L.x == "number" && typeof L.width == "number" && L.type === "bpmn:Participant", [F, I] = Zl[x.placement.side], N = x.placement.offset ?? 50, H = {
         x: O.x + O.width / 2 + F * (O.width / 2 + _.width / 2 + N),
         y: O.y + O.height / 2 + I * (O.height / 2 + _.height / 2 + N)
       }, W = k ? Ql(r, O, { width: _.width, height: _.height }, L, { placement: x.placement, selfId: x.id }) : H;
@@ -11048,8 +11050,8 @@ function RA(e, t) {
   for (const x of Gt(e, "group.update")) {
     const _ = f(x.id);
     if (x.name !== void 0 && n.updateLabel(_, x.name ?? ""), x.members) {
-      const M = x.members.map(p).filter((O) => !!O);
-      M.length && n.resizeShape(_, Pp(M, x.id)), X(_, "bwl:Members", { refs: x.members.join(" ") });
+      const C = x.members.map(p).filter((O) => !!O);
+      C.length && n.resizeShape(_, Pp(C, x.id)), X(_, "bwl:Members", { refs: x.members.join(" ") });
     }
   }
 }
@@ -11336,7 +11338,7 @@ function LA(e, t, n, i) {
     for (const Pe of g) {
       const B = s.edges.find((S) => S.id === Pe.edge);
       if (!B) continue;
-      const C = B.endpoints.some((S) => {
+      const M = B.endpoints.some((S) => {
         const V = s.shapes.find((_e) => _e.id === S);
         if (!V || V.container) return !1;
         const K = V.x + V.width / 2, oe = V.y + V.height / 2;
@@ -11344,7 +11346,7 @@ function LA(e, t, n, i) {
       });
       for (const S of vn(B)) {
         const V = S.axis === "v" ? [P, $] : [D, T];
-        Math.min(S.hi, V[1]) - Math.max(S.lo, V[0]) < sw || (S.axis === "v" ? D < S.at && S.at < T : P < S.at && S.at < $) && C || (S.axis === "v" ? (Math.abs(S.at - D) <= Es && (j = Math.max(j, S.at + Wc)), Math.abs(S.at - T) <= Es && (X = Math.min(X, S.at - Wc))) : (Math.abs(S.at - P) <= Es && (G = Math.max(G, S.at + Wc)), Math.abs(S.at - $) <= Es && (te = Math.min(te, S.at - Wc))));
+        Math.min(S.hi, V[1]) - Math.max(S.lo, V[0]) < sw || (S.axis === "v" ? D < S.at && S.at < T : P < S.at && S.at < $) && M || (S.axis === "v" ? (Math.abs(S.at - D) <= Es && (j = Math.max(j, S.at + Wc)), Math.abs(S.at - T) <= Es && (X = Math.min(X, S.at - Wc))) : (Math.abs(S.at - P) <= Es && (G = Math.max(G, S.at + Wc)), Math.abs(S.at - $) <= Es && (te = Math.min(te, S.at - Wc))));
       }
     }
     if (j > v - Uc && (j = D), G > b - Uc && (G = P), X < E + Uc && (X = T), te < R + Uc && (te = $), j === D && G === P && X === T && te === $) continue;
@@ -11357,9 +11359,9 @@ function LA(e, t, n, i) {
     )) {
       for (const Pe of ne) {
         if (Pe.kind !== "label-over-line") continue;
-        const B = U.edges.find((oe) => oe.id === Pe.edge), C = B && yw(B, U), S = (f = o.get(Pe.edge)) == null ? void 0 : f.label;
-        if (!C || !S) continue;
-        const V = C.x - S.x, K = C.y - S.y;
+        const B = U.edges.find((oe) => oe.id === Pe.edge), M = B && yw(B, U), S = (f = o.get(Pe.edge)) == null ? void 0 : f.label;
+        if (!M || !S) continue;
+        const V = M.x - S.x, K = M.y - S.y;
         r.moveElements([S], { x: V, y: K }), q.push({ label: S, dx: V, dy: K });
       }
       U = He(o), ne = pt(U).filter((Pe) => !ve.has(ft(Pe)));
@@ -11577,14 +11579,14 @@ function FA(e, t = {}) {
         continue;
       }
       D(xe.id);
-      const C = Pe === "boundaryEvent" ? Hi(xe.attachedToRef) : void 0;
+      const M = Pe === "boundaryEvent" ? Hi(xe.attachedToRef) : void 0;
       a.push({
         id: xe.id,
         type: Pe,
         ...xe.name ? { name: xe.name } : {},
         ...ne ? { participant: ne } : {},
         ...ue.has(xe.id) ? { lane: ue.get(xe.id) } : {},
-        ...C ? { attachedTo: C } : {},
+        ...M ? { attachedTo: M } : {},
         ...B ? { eventDefinition: B } : {}
       }), Pe === "subProcess" && j(xe);
       const S = ty(xe, "bwl:band");
@@ -11615,8 +11617,8 @@ function FA(e, t = {}) {
       D(ne.id), v.set(ne.id, ne);
       const q = Hi(ne.processRef);
       q && U.add(q);
-      const Z = q ? o.get(q) : void 0, ue = ((Z == null ? void 0 : Z.laneSets) ?? []).flatMap((C) => C.lanes ?? []), xe = ue.map((C) => ({ id: C.id, ...C.name ? { name: C.name } : {} }));
-      for (const C of xe) D(C.id);
+      const Z = q ? o.get(q) : void 0, ue = ((Z == null ? void 0 : Z.laneSets) ?? []).flatMap((M) => M.lanes ?? []), xe = ue.map((M) => ({ id: M.id, ...M.name ? { name: M.name } : {} }));
+      for (const M of xe) D(M.id);
       const Pe = !Z || (Z.flowElements ?? []).length === 0 && ue.length === 0 && (Z.artifacts ?? []).length === 0;
       r.push({
         id: ne.id,
@@ -13450,8 +13452,8 @@ function Sy(e, t, n, i, o, r) {
   ];
 }
 function jw(e, t, n, i, o, r, a, s, c, l) {
-  var u = jo * 120 / 180, p = jo / 180 * (+o || 0), f = [], d, g = tT(function(B, C, S) {
-    var V = B * rn.cos(S) - C * rn.sin(S), K = B * rn.sin(S) + C * rn.cos(S);
+  var u = jo * 120 / 180, p = jo / 180 * (+o || 0), f = [], d, g = tT(function(B, M, S) {
+    var V = B * rn.cos(S) - M * rn.sin(S), K = B * rn.sin(S) + M * rn.cos(S);
     return { x: V, y: K };
   });
   if (l)
@@ -14621,11 +14623,11 @@ function $T(e) {
         ), Pe.bpmnElement = B, p(Pe);
       else
         throw new Error("no process or collaboration to display");
-    var C = c(B, Pe);
+    var M = c(B, Pe);
     if (Zn(B, "bpmn:Process") || Zn(B, "bpmn:SubProcess"))
-      m(B, C);
+      m(B, M);
     else if (Zn(B, "bpmn:Collaboration"))
-      U(B, C), w(Z.rootElements, C);
+      U(B, M), w(Z.rootElements, M);
     else
       throw new Error(
         `unsupported bpmnElement for ${Hn(Pe)}: ${Hn(B)}`
@@ -15284,13 +15286,13 @@ function Xr(e, t, n, i, o, r, a) {
       strokeWidth: 2
     });
   }
-  function f(B, C) {
+  function f(B, M) {
     var {
       ref: S = { x: 0, y: 0 },
       scale: V = 1,
       element: K,
       parentGfx: oe = o._svg
-    } = C, _e = Ne("marker", {
+    } = M, _e = Ne("marker", {
       id: B,
       viewBox: "0 0 20 20",
       refX: S.x,
@@ -15303,11 +15305,11 @@ function Xr(e, t, n, i, o, r, a) {
     var Qe = Ct(":scope > defs", oe);
     Qe || (Qe = Ne("defs"), Ye(oe, Qe)), Ye(Qe, _e);
   }
-  function d(B, C, S, V) {
+  function d(B, M, S, V) {
     var K = h2.nextPrefixed("marker-");
-    return g(B, K, C, S, V), "url(#" + K + ")";
+    return g(B, K, M, S, V), "url(#" + K + ")";
   }
-  function g(B, C, S, V, K) {
+  function g(B, M, S, V, K) {
     if (S === "sequenceflow-end") {
       var oe = Ne("path", {
         d: "M 1 5 L 11 10 L 1 15 Z",
@@ -15317,7 +15319,7 @@ function Xr(e, t, n, i, o, r, a) {
           strokeWidth: 1
         })
       });
-      f(C, {
+      f(M, {
         element: oe,
         ref: { x: 11, y: 10 },
         scale: 0.5,
@@ -15338,7 +15340,7 @@ function Xr(e, t, n, i, o, r, a) {
           strokeDasharray: [1e4, 1]
         })
       });
-      f(C, {
+      f(M, {
         element: _e,
         ref: { x: 6, y: 6 },
         parentGfx: B
@@ -15356,7 +15358,7 @@ function Xr(e, t, n, i, o, r, a) {
           strokeDasharray: [1e4, 1]
         })
       });
-      f(C, {
+      f(M, {
         element: Qe,
         ref: { x: 8.5, y: 5 },
         parentGfx: B
@@ -15374,7 +15376,7 @@ function Xr(e, t, n, i, o, r, a) {
           strokeDasharray: [1e4, 1]
         })
       });
-      f(C, {
+      f(M, {
         element: yt,
         ref: { x: 1, y: 10 },
         scale: 0.5,
@@ -15393,7 +15395,7 @@ function Xr(e, t, n, i, o, r, a) {
           strokeDasharray: [1e4, 1]
         })
       });
-      f(C, {
+      f(M, {
         element: Ot,
         ref: { x: 11, y: 10 },
         scale: 0.5,
@@ -15408,7 +15410,7 @@ function Xr(e, t, n, i, o, r, a) {
           stroke: K
         })
       });
-      f(C, {
+      f(M, {
         element: xt,
         ref: { x: -1, y: 10 },
         scale: 0.5,
@@ -15423,7 +15425,7 @@ function Xr(e, t, n, i, o, r, a) {
           fill: "none"
         })
       });
-      f(C, {
+      f(M, {
         element: en,
         ref: { x: 0, y: 10 },
         scale: 0.5,
@@ -15431,22 +15433,22 @@ function Xr(e, t, n, i, o, r, a) {
       });
     }
   }
-  function h(B, C, S, V, K = {}) {
+  function h(B, M, S, V, K = {}) {
     yn(V) && (K = V, V = 0), V = V || 0, K = u(K);
-    var oe = C / 2, _e = S / 2, Qe = Ne("circle", {
+    var oe = M / 2, _e = S / 2, Qe = Ne("circle", {
       cx: oe,
       cy: _e,
-      r: Math.round((C + S) / 4 - V),
+      r: Math.round((M + S) / 4 - V),
       ...K
     });
     return Ye(B, Qe), Qe;
   }
-  function m(B, C, S, V, K, oe) {
+  function m(B, M, S, V, K, oe) {
     yn(K) && (oe = K, K = 0), K = K || 0, oe = u(oe);
     var _e = Ne("rect", {
       x: K,
       y: K,
-      width: C - K * 2,
+      width: M - K * 2,
       height: S - K * 2,
       rx: V,
       ry: V,
@@ -15454,10 +15456,10 @@ function Xr(e, t, n, i, o, r, a) {
     });
     return Ye(B, _e), _e;
   }
-  function w(B, C, S, V) {
-    var K = C / 2, oe = S / 2, _e = [
+  function w(B, M, S, V) {
+    var K = M / 2, oe = S / 2, _e = [
       { x: K, y: 0 },
-      { x: C, y: oe },
+      { x: M, y: oe },
       { x: K, y: S },
       { x: 0, y: oe }
     ], Qe = _e.map(function(Ot) {
@@ -15470,55 +15472,55 @@ function Xr(e, t, n, i, o, r, a) {
     });
     return Ye(B, yt), yt;
   }
-  function y(B, C, S, V) {
+  function y(B, M, S, V) {
     S = p(S);
-    var K = Js(C, S, V);
+    var K = Js(M, S, V);
     return Ye(B, K), K;
   }
-  function v(B, C, S) {
-    return y(B, C, S, 5);
+  function v(B, M, S) {
+    return y(B, M, S, 5);
   }
-  function b(B, C, S) {
+  function b(B, M, S) {
     S = p(S);
     var V = Ne("path", {
       ...S,
-      d: C
+      d: M
     });
     return Ye(B, V), V;
   }
-  function E(B, C, S, V) {
-    return b(C, S, Y({ "data-marker": B }, V));
+  function E(B, M, S, V) {
+    return b(M, S, Y({ "data-marker": B }, V));
   }
   function R(B) {
     return Pe[B];
   }
   function D(B) {
-    return function(C, S, V) {
-      return R(B)(C, S, V);
+    return function(M, S, V) {
+      return R(B)(M, S, V);
     };
   }
   var P = {
-    "bpmn:MessageEventDefinition": function(B, C, S = {}, V) {
+    "bpmn:MessageEventDefinition": function(B, M, S = {}, V) {
       var K = i.getScaledPath("EVENT_MESSAGE", {
         xScaleFactor: 0.9,
         yScaleFactor: 0.9,
-        containerWidth: S.width || C.width,
-        containerHeight: S.height || C.height,
+        containerWidth: S.width || M.width,
+        containerHeight: S.height || M.height,
         position: {
           mx: 0.235,
           my: 0.315
         }
-      }), oe = V ? Ce(C, c, S.stroke) : ct(C, s, S.fill), _e = V ? ct(C, s, S.fill) : Ce(C, c, S.stroke), Qe = b(B, K, {
+      }), oe = V ? Ce(M, c, S.stroke) : ct(M, s, S.fill), _e = V ? ct(M, s, S.fill) : Ce(M, c, S.stroke), Qe = b(B, K, {
         fill: oe,
         stroke: _e,
         strokeWidth: 1
       });
       return Qe;
     },
-    "bpmn:TimerEventDefinition": function(B, C, S = {}) {
-      var V = S.width || C.width, K = S.height || C.height, oe = S.width ? 1 : 2, _e = h(B, V, K, 0.2 * K, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+    "bpmn:TimerEventDefinition": function(B, M, S = {}) {
+      var V = S.width || M.width, K = S.height || M.height, oe = S.width ? 1 : 2, _e = h(B, V, K, 0.2 * K, {
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: oe
       }), Qe = i.getScaledPath("EVENT_TIMER_WH", {
         xScaleFactor: 0.75,
@@ -15531,7 +15533,7 @@ function Xr(e, t, n, i, o, r, a) {
         }
       });
       b(B, Qe, {
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: oe
       });
       for (var yt = 0; yt < 12; yt++) {
@@ -15547,181 +15549,181 @@ function Xr(e, t, n, i, o, r, a) {
         }), xt = V / 2, en = K / 2;
         b(B, Ot, {
           strokeWidth: 1,
-          stroke: Ce(C, c, S.stroke),
+          stroke: Ce(M, c, S.stroke),
           transform: "rotate(" + yt * 30 + "," + en + "," + xt + ")"
         });
       }
       return _e;
     },
-    "bpmn:EscalationEventDefinition": function(B, C, S = {}, V) {
+    "bpmn:EscalationEventDefinition": function(B, M, S = {}, V) {
       var K = i.getScaledPath("EVENT_ESCALATION", {
         xScaleFactor: 1,
         yScaleFactor: 1,
-        containerWidth: S.width || C.width,
-        containerHeight: S.height || C.height,
+        containerWidth: S.width || M.width,
+        containerHeight: S.height || M.height,
         position: {
           mx: 0.5,
           my: 0.2
         }
-      }), oe = V ? Ce(C, c, S.stroke) : ct(C, s, S.fill);
+      }), oe = V ? Ce(M, c, S.stroke) : ct(M, s, S.fill);
       return b(B, K, {
         fill: oe,
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
     },
-    "bpmn:ConditionalEventDefinition": function(B, C, S = {}) {
+    "bpmn:ConditionalEventDefinition": function(B, M, S = {}) {
       var V = i.getScaledPath("EVENT_CONDITIONAL", {
         xScaleFactor: 1,
         yScaleFactor: 1,
-        containerWidth: S.width || C.width,
-        containerHeight: S.height || C.height,
+        containerWidth: S.width || M.width,
+        containerHeight: S.height || M.height,
         position: {
           mx: 0.5,
           my: 0.222
         }
       });
       return b(B, V, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
     },
-    "bpmn:LinkEventDefinition": function(B, C, S = {}, V) {
+    "bpmn:LinkEventDefinition": function(B, M, S = {}, V) {
       var K = i.getScaledPath("EVENT_LINK", {
         xScaleFactor: 1,
         yScaleFactor: 1,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
           mx: 0.57,
           my: 0.263
         }
-      }), oe = V ? Ce(C, c, S.stroke) : ct(C, s, S.fill);
+      }), oe = V ? Ce(M, c, S.stroke) : ct(M, s, S.fill);
       return b(B, K, {
         fill: oe,
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
     },
-    "bpmn:ErrorEventDefinition": function(B, C, S = {}, V) {
+    "bpmn:ErrorEventDefinition": function(B, M, S = {}, V) {
       var K = i.getScaledPath("EVENT_ERROR", {
         xScaleFactor: 1.1,
         yScaleFactor: 1.1,
-        containerWidth: S.width || C.width,
-        containerHeight: S.height || C.height,
+        containerWidth: S.width || M.width,
+        containerHeight: S.height || M.height,
         position: {
           mx: 0.2,
           my: 0.722
         }
-      }), oe = V ? Ce(C, c, S.stroke) : ct(C, s, S.fill);
+      }), oe = V ? Ce(M, c, S.stroke) : ct(M, s, S.fill);
       return b(B, K, {
         fill: oe,
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
     },
-    "bpmn:CancelEventDefinition": function(B, C, S = {}, V) {
+    "bpmn:CancelEventDefinition": function(B, M, S = {}, V) {
       var K = i.getScaledPath("EVENT_CANCEL_45", {
         xScaleFactor: 1,
         yScaleFactor: 1,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
           mx: 0.638,
           my: -0.055
         }
-      }), oe = V ? Ce(C, c, S.stroke) : "none", _e = b(B, K, {
+      }), oe = V ? Ce(M, c, S.stroke) : "none", _e = b(B, K, {
         fill: oe,
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
       return Qw(_e, 45), _e;
     },
-    "bpmn:CompensateEventDefinition": function(B, C, S = {}, V) {
+    "bpmn:CompensateEventDefinition": function(B, M, S = {}, V) {
       var K = i.getScaledPath("EVENT_COMPENSATION", {
         xScaleFactor: 1,
         yScaleFactor: 1,
-        containerWidth: S.width || C.width,
-        containerHeight: S.height || C.height,
+        containerWidth: S.width || M.width,
+        containerHeight: S.height || M.height,
         position: {
           mx: 0.22,
           my: 0.5
         }
-      }), oe = V ? Ce(C, c, S.stroke) : ct(C, s, S.fill);
+      }), oe = V ? Ce(M, c, S.stroke) : ct(M, s, S.fill);
       return b(B, K, {
         fill: oe,
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
     },
-    "bpmn:SignalEventDefinition": function(B, C, S = {}, V) {
+    "bpmn:SignalEventDefinition": function(B, M, S = {}, V) {
       var K = i.getScaledPath("EVENT_SIGNAL", {
         xScaleFactor: 0.9,
         yScaleFactor: 0.9,
-        containerWidth: S.width || C.width,
-        containerHeight: S.height || C.height,
+        containerWidth: S.width || M.width,
+        containerHeight: S.height || M.height,
         position: {
           mx: 0.5,
           my: 0.2
         }
-      }), oe = V ? Ce(C, c, S.stroke) : ct(C, s, S.fill);
+      }), oe = V ? Ce(M, c, S.stroke) : ct(M, s, S.fill);
       return b(B, K, {
         strokeWidth: 1,
         fill: oe,
-        stroke: Ce(C, c, S.stroke)
+        stroke: Ce(M, c, S.stroke)
       });
     },
-    "bpmn:MultipleEventDefinition": function(B, C, S = {}, V) {
+    "bpmn:MultipleEventDefinition": function(B, M, S = {}, V) {
       var K = i.getScaledPath("EVENT_MULTIPLE", {
         xScaleFactor: 1.1,
         yScaleFactor: 1.1,
-        containerWidth: S.width || C.width,
-        containerHeight: S.height || C.height,
+        containerWidth: S.width || M.width,
+        containerHeight: S.height || M.height,
         position: {
           mx: 0.211,
           my: 0.36
         }
-      }), oe = V ? Ce(C, c, S.stroke) : ct(C, s, S.fill);
+      }), oe = V ? Ce(M, c, S.stroke) : ct(M, s, S.fill);
       return b(B, K, {
         fill: oe,
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
     },
-    "bpmn:ParallelMultipleEventDefinition": function(B, C, S = {}) {
+    "bpmn:ParallelMultipleEventDefinition": function(B, M, S = {}) {
       var V = i.getScaledPath("EVENT_PARALLEL_MULTIPLE", {
         xScaleFactor: 1.2,
         yScaleFactor: 1.2,
-        containerWidth: S.width || C.width,
-        containerHeight: S.height || C.height,
+        containerWidth: S.width || M.width,
+        containerHeight: S.height || M.height,
         position: {
           mx: 0.458,
           my: 0.194
         }
       });
       return b(B, V, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
     },
-    "bpmn:TerminateEventDefinition": function(B, C, S = {}) {
-      var V = h(B, C.width, C.height, 8, {
-        fill: Ce(C, c, S.stroke),
-        stroke: Ce(C, c, S.stroke),
+    "bpmn:TerminateEventDefinition": function(B, M, S = {}) {
+      var V = h(B, M.width, M.height, 8, {
+        fill: Ce(M, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 4
       });
       return V;
     }
   };
-  function T(B, C, S = {}, V) {
+  function T(B, M, S = {}, V) {
     var K = me(B), oe = u2(K), _e = V || B;
-    return K.get("eventDefinitions") && K.get("eventDefinitions").length > 1 ? K.get("parallelMultiple") ? P["bpmn:ParallelMultipleEventDefinition"](C, _e, S, oe) : P["bpmn:MultipleEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:MessageEventDefinition") ? P["bpmn:MessageEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:TimerEventDefinition") ? P["bpmn:TimerEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:ConditionalEventDefinition") ? P["bpmn:ConditionalEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:SignalEventDefinition") ? P["bpmn:SignalEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:EscalationEventDefinition") ? P["bpmn:EscalationEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:LinkEventDefinition") ? P["bpmn:LinkEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:ErrorEventDefinition") ? P["bpmn:ErrorEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:CancelEventDefinition") ? P["bpmn:CancelEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:CompensateEventDefinition") ? P["bpmn:CompensateEventDefinition"](C, _e, S, oe) : Zi(K, "bpmn:TerminateEventDefinition") ? P["bpmn:TerminateEventDefinition"](C, _e, S, oe) : null;
+    return K.get("eventDefinitions") && K.get("eventDefinitions").length > 1 ? K.get("parallelMultiple") ? P["bpmn:ParallelMultipleEventDefinition"](M, _e, S, oe) : P["bpmn:MultipleEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:MessageEventDefinition") ? P["bpmn:MessageEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:TimerEventDefinition") ? P["bpmn:TimerEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:ConditionalEventDefinition") ? P["bpmn:ConditionalEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:SignalEventDefinition") ? P["bpmn:SignalEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:EscalationEventDefinition") ? P["bpmn:EscalationEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:LinkEventDefinition") ? P["bpmn:LinkEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:ErrorEventDefinition") ? P["bpmn:ErrorEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:CancelEventDefinition") ? P["bpmn:CancelEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:CompensateEventDefinition") ? P["bpmn:CompensateEventDefinition"](M, _e, S, oe) : Zi(K, "bpmn:TerminateEventDefinition") ? P["bpmn:TerminateEventDefinition"](M, _e, S, oe) : null;
   }
   var $ = {
-    ParticipantMultiplicityMarker: function(B, C, S = {}) {
-      var V = Ei(C, S), K = ii(C, S), oe = i.getScaledPath("MARKER_PARALLEL", {
+    ParticipantMultiplicityMarker: function(B, M, S = {}) {
+      var V = Ei(M, S), K = ii(M, S), oe = i.getScaledPath("MARKER_PARALLEL", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: V,
@@ -15733,34 +15735,34 @@ function Xr(e, t, n, i, o, r, a) {
       });
       E("participant-multiplicity", B, oe, {
         strokeWidth: 2,
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke)
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke)
       });
     },
-    SubProcessMarker: function(B, C, S = {}) {
+    SubProcessMarker: function(B, M, S = {}) {
       var V = m(B, 14, 14, 0, {
         strokeWidth: 1,
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke)
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke)
       });
-      In(V, C.width / 2 - 7.5, C.height - 20);
+      In(V, M.width / 2 - 7.5, M.height - 20);
       var K = i.getScaledPath("MARKER_SUB_PROCESS", {
         xScaleFactor: 1.5,
         yScaleFactor: 1.5,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
-          mx: (C.width / 2 - 7.5) / C.width,
-          my: (C.height - 20) / C.height
+          mx: (M.width / 2 - 7.5) / M.width,
+          my: (M.height - 20) / M.height
         }
       });
       E("sub-process", B, K, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke)
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke)
       });
     },
-    ParallelMarker: function(B, C, S) {
-      var V = Ei(C, S), K = ii(C, S), oe = i.getScaledPath("MARKER_PARALLEL", {
+    ParallelMarker: function(B, M, S) {
+      var V = Ei(M, S), K = ii(M, S), oe = i.getScaledPath("MARKER_PARALLEL", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: V,
@@ -15771,45 +15773,45 @@ function Xr(e, t, n, i, o, r, a) {
         }
       });
       E("parallel", B, oe, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke)
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke)
       });
     },
-    SequentialMarker: function(B, C, S) {
+    SequentialMarker: function(B, M, S) {
       var V = i.getScaledPath("MARKER_SEQUENTIAL", {
         xScaleFactor: 1,
         yScaleFactor: 1,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
-          mx: (C.width / 2 + S.seq) / C.width,
-          my: (C.height - 19) / C.height
+          mx: (M.width / 2 + S.seq) / M.width,
+          my: (M.height - 19) / M.height
         }
       });
       E("sequential", B, V, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke)
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke)
       });
     },
-    CompensationMarker: function(B, C, S) {
+    CompensationMarker: function(B, M, S) {
       var V = i.getScaledPath("MARKER_COMPENSATION", {
         xScaleFactor: 1,
         yScaleFactor: 1,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
-          mx: (C.width / 2 + S.compensation) / C.width,
-          my: (C.height - 13) / C.height
+          mx: (M.width / 2 + S.compensation) / M.width,
+          my: (M.height - 13) / M.height
         }
       });
       E("compensation", B, V, {
         strokeWidth: 1,
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke)
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke)
       });
     },
-    LoopMarker: function(B, C, S) {
-      var V = Ei(C, S), K = ii(C, S), oe = i.getScaledPath("MARKER_LOOP", {
+    LoopMarker: function(B, M, S) {
+      var V = Ei(M, S), K = ii(M, S), oe = i.getScaledPath("MARKER_LOOP", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: V,
@@ -15822,12 +15824,12 @@ function Xr(e, t, n, i, o, r, a) {
       E("loop", B, oe, {
         strokeWidth: 1.5,
         fill: "none",
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeMiterlimit: 0.5
       });
     },
-    AdhocMarker: function(B, C, S) {
-      var V = Ei(C, S), K = ii(C, S), oe = i.getScaledPath("MARKER_ADHOC", {
+    AdhocMarker: function(B, M, S) {
+      var V = Ei(M, S), K = ii(M, S), oe = i.getScaledPath("MARKER_ADHOC", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: V,
@@ -15839,22 +15841,22 @@ function Xr(e, t, n, i, o, r, a) {
       });
       E("adhoc", B, oe, {
         strokeWidth: 1,
-        fill: Ce(C, c, S.stroke),
-        stroke: Ce(C, c, S.stroke)
+        fill: Ce(M, c, S.stroke),
+        stroke: Ce(M, c, S.stroke)
       });
     }
   };
-  function j(B, C, S, V) {
-    $[B](C, S, V);
+  function j(B, M, S, V) {
+    $[B](M, S, V);
   }
-  function G(B, C, S = [], V = {}) {
+  function G(B, M, S = [], V = {}) {
     V = {
       fill: V.fill,
       stroke: V.stroke,
-      width: Ei(C, V),
-      height: ii(C, V)
+      width: Ei(M, V),
+      height: ii(M, V)
     };
-    var K = me(C), oe = S.includes("SubProcessMarker");
+    var K = me(M), oe = S.includes("SubProcessMarker");
     oe ? V = {
       ...V,
       seq: -21,
@@ -15880,54 +15882,54 @@ function Xr(e, t, n, i, o, r, a) {
     }), Qe === void 0 && S.push("LoopMarker"), Qe === !1 && S.push("ParallelMarker"), Qe === !0 && S.push("SequentialMarker")), S.includes("CompensationMarker") && S.length === 1 && Y(V, {
       compensation: -8
     }), z(S, function(yt) {
-      j(yt, B, C, V);
+      j(yt, B, M, V);
     });
   }
-  function X(B, C, S = {}) {
+  function X(B, M, S = {}) {
     S = Y({
       size: {
         width: 100
       }
     }, S);
-    var V = r.createText(C || "", S);
+    var V = r.createText(M || "", S);
     return ut(V).add("djs-label"), Ye(B, V), V;
   }
-  function te(B, C, S, V = {}) {
-    var K = me(C), oe = ps({
-      x: C.x,
-      y: C.y,
-      width: C.width,
-      height: C.height
+  function te(B, M, S, V = {}) {
+    var K = me(M), oe = ps({
+      x: M.x,
+      y: M.y,
+      width: M.width,
+      height: M.height
     }, V);
     return X(B, K.name, {
       align: S,
       box: oe,
       padding: 7,
       style: {
-        fill: us(C, l, c, V.stroke)
+        fill: us(M, l, c, V.stroke)
       }
     });
   }
-  function J(B, C, S = {}) {
+  function J(B, M, S = {}) {
     var V = {
-      width: C.width,
-      height: C.height,
-      x: C.width / 2 + C.x,
-      y: C.height / 2 + C.y
+      width: M.width,
+      height: M.height,
+      x: M.width / 2 + M.x,
+      y: M.height / 2 + M.y
     };
-    return X(B, hi(C), {
+    return X(B, hi(M), {
       box: V,
       style: Y(
         {},
         r.getExternalStyle(),
         {
-          fill: us(C, l, c, S.stroke)
+          fill: us(M, l, c, S.stroke)
         }
       )
     });
   }
-  function ie(B, C, S, V = {}) {
-    var K = wn(S), oe = X(B, C, {
+  function ie(B, M, S, V = {}) {
+    var K = wn(S), oe = X(B, M, {
       box: {
         height: 30,
         width: K ? ii(S, V) : Ei(S, V)
@@ -15942,35 +15944,35 @@ function Xr(e, t, n, i, o, r, a) {
       Pl(oe, 0, -_e, 270);
     }
   }
-  function se(B, C, S = {}) {
+  function se(B, M, S = {}) {
     var {
       width: V,
       height: K
-    } = ps(C, S);
+    } = ps(M, S);
     return m(B, V, K, kl, {
       ...S,
-      fill: ct(C, s, S.fill),
+      fill: ct(M, s, S.fill),
       fillOpacity: pa,
-      stroke: Ce(C, c, S.stroke)
+      stroke: Ce(M, c, S.stroke)
     });
   }
-  function ve(B, C, S = {}) {
-    var V = me(C), K = ct(C, s, S.fill), oe = Ce(C, c, S.stroke);
+  function ve(B, M, S = {}) {
+    var V = me(M), K = ct(M, s, S.fill), oe = Ce(M, c, S.stroke);
     return (V.get("associationDirection") === "One" || V.get("associationDirection") === "Both") && (S.markerEnd = d(B, "association-end", K, oe)), V.get("associationDirection") === "Both" && (S.markerStart = d(B, "association-start", K, oe)), S = gt(S, [
       "markerStart",
       "markerEnd"
-    ]), v(B, C.waypoints, {
+    ]), v(B, M.waypoints, {
       ...S,
       stroke: oe,
       strokeDasharray: "0, 5"
     });
   }
-  function we(B, C, S = {}) {
-    var V = ct(C, s, S.fill), K = Ce(C, c, S.stroke), oe = i.getScaledPath("DATA_OBJECT_PATH", {
+  function we(B, M, S = {}) {
+    var V = ct(M, s, S.fill), K = Ce(M, c, S.stroke), oe = i.getScaledPath("DATA_OBJECT_PATH", {
       xScaleFactor: 1,
       yScaleFactor: 1,
-      containerWidth: C.width,
-      containerHeight: C.height,
+      containerWidth: M.width,
+      containerHeight: M.height,
       position: {
         mx: 0.474,
         my: 0.296
@@ -15979,16 +15981,16 @@ function Xr(e, t, n, i, o, r, a) {
       fill: V,
       fillOpacity: pa,
       stroke: K
-    }), Qe = me(C);
+    }), Qe = me(M);
     if (p2(Qe)) {
       var yt = i.getScaledPath("DATA_OBJECT_COLLECTION_PATH", {
         xScaleFactor: 1,
         yScaleFactor: 1,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
           mx: 0.33,
-          my: (C.height - 18) / C.height
+          my: (M.height - 18) / M.height
         }
       });
       b(B, yt, {
@@ -15999,67 +16001,67 @@ function Xr(e, t, n, i, o, r, a) {
     }
     return _e;
   }
-  function U(B, C, S = {}) {
-    return h(B, C.width, C.height, {
+  function U(B, M, S = {}) {
+    return h(B, M.width, M.height, {
       fillOpacity: pa,
       ...S,
-      fill: ct(C, s, S.fill),
-      stroke: Ce(C, c, S.stroke)
+      fill: ct(M, s, S.fill),
+      stroke: Ce(M, c, S.stroke)
     });
   }
-  function ne(B, C, S = {}) {
-    return w(B, C.width, C.height, {
-      fill: ct(C, s, S.fill),
+  function ne(B, M, S = {}) {
+    return w(B, M.width, M.height, {
+      fill: ct(M, s, S.fill),
       fillOpacity: pa,
-      stroke: Ce(C, c, S.stroke)
+      stroke: Ce(M, c, S.stroke)
     });
   }
-  function q(B, C, S = {}) {
-    var V = m(B, Ei(C, S), ii(C, S), 0, {
-      fill: ct(C, s, S.fill),
+  function q(B, M, S = {}) {
+    var V = m(B, Ei(M, S), ii(M, S), 0, {
+      fill: ct(M, s, S.fill),
       fillOpacity: S.fillOpacity || pa,
-      stroke: Ce(C, c, S.stroke),
+      stroke: Ce(M, c, S.stroke),
       strokeWidth: 1.5
-    }), K = me(C);
+    }), K = me(M);
     if (A(K, "bpmn:Lane")) {
       var oe = K.get("name");
-      ie(B, oe, C, S);
+      ie(B, oe, M, S);
     }
     return V;
   }
-  function Z(B, C, S = {}) {
-    var V = se(B, C, S), K = lt(C);
-    if (Gn(C) && (Re(V, {
+  function Z(B, M, S = {}) {
+    var V = se(B, M, S), K = lt(M);
+    if (Gn(M) && (Re(V, {
       strokeDasharray: "0, 5.5",
       strokeWidth: 2.5
     }), !K)) {
-      var oe = me(C).flowElements || [], _e = oe.filter((Qe) => A(Qe, "bpmn:StartEvent"));
-      _e.length === 1 && ue(_e[0], B, S, C);
+      var oe = me(M).flowElements || [], _e = oe.filter((Qe) => A(Qe, "bpmn:StartEvent"));
+      _e.length === 1 && ue(_e[0], B, S, M);
     }
-    return te(B, C, K ? "center-top" : "center-middle", S), K ? G(B, C, void 0, S) : G(B, C, ["SubProcessMarker"], S), V;
+    return te(B, M, K ? "center-top" : "center-middle", S), K ? G(B, M, void 0, S) : G(B, M, ["SubProcessMarker"], S), V;
   }
-  function ue(B, C, S, V) {
+  function ue(B, M, S, V) {
     var K = 22, oe = {
       fill: ct(V, s, S.fill),
       stroke: Ce(V, c, S.stroke),
       width: K,
       height: K
     }, _e = me(B).isInterrupting, Qe = _e ? 0 : 3, yt = _e ? 1 : 1.2, Ot = 20, xt = (K - Ot) / 2, en = "translate(" + xt + "," + xt + ")";
-    h(C, Ot, Ot, {
+    h(M, Ot, Ot, {
       fill: oe.fill,
       stroke: oe.stroke,
       strokeWidth: yt,
       strokeDasharray: Qe,
       transform: en
-    }), T(B, C, oe, V);
+    }), T(B, M, oe, V);
   }
-  function xe(B, C, S = {}) {
-    var V = se(B, C, S);
-    return te(B, C, "center-middle", S), G(B, C, void 0, S), V;
+  function xe(B, M, S = {}) {
+    var V = se(B, M, S);
+    return te(B, M, "center-middle", S), G(B, M, void 0, S), V;
   }
   var Pe = this.handlers = {
-    "bpmn:AdHocSubProcess": function(B, C, S = {}) {
-      return lt(C) ? S = gt(S, [
+    "bpmn:AdHocSubProcess": function(B, M, S = {}) {
+      return lt(M) ? S = gt(S, [
         "fill",
         "stroke",
         "width",
@@ -16067,47 +16069,47 @@ function Xr(e, t, n, i, o, r, a) {
       ]) : S = gt(S, [
         "fill",
         "stroke"
-      ]), Z(B, C, S);
+      ]), Z(B, M, S);
     },
-    "bpmn:Association": function(B, C, S = {}) {
+    "bpmn:Association": function(B, M, S = {}) {
       return S = gt(S, [
         "fill",
         "stroke"
-      ]), ve(B, C, S);
+      ]), ve(B, M, S);
     },
-    "bpmn:BoundaryEvent": function(B, C, S = {}) {
+    "bpmn:BoundaryEvent": function(B, M, S = {}) {
       var { renderIcon: V = !0 } = S;
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var K = me(C), oe = K.get("cancelActivity");
+      var K = me(M), oe = K.get("cancelActivity");
       S = {
         strokeWidth: 1.5,
-        fill: ct(C, s, S.fill),
+        fill: ct(M, s, S.fill),
         fillOpacity: v2,
-        stroke: Ce(C, c, S.stroke)
+        stroke: Ce(M, c, S.stroke)
       }, oe || (S.strokeDasharray = "6");
-      var _e = U(B, C, S);
-      return h(B, C.width, C.height, Zc, {
+      var _e = U(B, M, S);
+      return h(B, M.width, M.height, Zc, {
         ...S,
         fill: "none"
-      }), V && T(C, B, S), _e;
+      }), V && T(M, B, S), _e;
     },
-    "bpmn:BusinessRuleTask": function(B, C, S = {}) {
+    "bpmn:BusinessRuleTask": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = xe(B, C, S), K = i.getScaledPath("TASK_TYPE_BUSINESS_RULE_MAIN", {
+      var V = xe(B, M, S), K = i.getScaledPath("TASK_TYPE_BUSINESS_RULE_MAIN", {
         abspos: {
           x: 8,
           y: 8
         }
       }), oe = b(B, K);
       Re(oe, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
       var _e = i.getScaledPath("TASK_TYPE_BUSINESS_RULE_HEADER", {
@@ -16117,91 +16119,91 @@ function Xr(e, t, n, i, o, r, a) {
         }
       }), Qe = b(B, _e);
       return Re(Qe, {
-        fill: Ce(C, c, S.stroke),
-        stroke: Ce(C, c, S.stroke),
+        fill: Ce(M, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), V;
     },
-    "bpmn:CallActivity": function(B, C, S = {}) {
+    "bpmn:CallActivity": function(B, M, S = {}) {
       return S = gt(S, [
         "fill",
         "stroke"
-      ]), Z(B, C, {
+      ]), Z(B, M, {
         strokeWidth: 5,
         ...S
       });
     },
-    "bpmn:ComplexGateway": function(B, C, S = {}) {
+    "bpmn:ComplexGateway": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = ne(B, C, S), K = i.getScaledPath("GATEWAY_COMPLEX", {
+      var V = ne(B, M, S), K = i.getScaledPath("GATEWAY_COMPLEX", {
         xScaleFactor: 0.5,
         yScaleFactor: 0.5,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
           mx: 0.46,
           my: 0.26
         }
       });
       return b(B, K, {
-        fill: Ce(C, c, S.stroke),
-        stroke: Ce(C, c, S.stroke),
+        fill: Ce(M, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), V;
     },
-    "bpmn:DataInput": function(B, C, S = {}) {
+    "bpmn:DataInput": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = i.getRawPath("DATA_ARROW"), K = we(B, C, S);
+      var V = i.getRawPath("DATA_ARROW"), K = we(B, M, S);
       return b(B, V, {
         fill: "none",
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), K;
     },
-    "bpmn:DataInputAssociation": function(B, C, S = {}) {
+    "bpmn:DataInputAssociation": function(B, M, S = {}) {
       return S = gt(S, [
         "fill",
         "stroke"
-      ]), ve(B, C, {
+      ]), ve(B, M, {
         ...S,
-        markerEnd: d(B, "association-end", ct(C, s, S.fill), Ce(C, c, S.stroke))
+        markerEnd: d(B, "association-end", ct(M, s, S.fill), Ce(M, c, S.stroke))
       });
     },
-    "bpmn:DataObject": function(B, C, S = {}) {
+    "bpmn:DataObject": function(B, M, S = {}) {
       return S = gt(S, [
         "fill",
         "stroke"
-      ]), we(B, C, S);
+      ]), we(B, M, S);
     },
     "bpmn:DataObjectReference": D("bpmn:DataObject"),
-    "bpmn:DataOutput": function(B, C, S = {}) {
+    "bpmn:DataOutput": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = i.getRawPath("DATA_ARROW"), K = we(B, C, S);
+      var V = i.getRawPath("DATA_ARROW"), K = we(B, M, S);
       return b(B, V, {
         strokeWidth: 1,
-        fill: Ce(C, c, S.stroke),
-        stroke: Ce(C, c, S.stroke)
+        fill: Ce(M, c, S.stroke),
+        stroke: Ce(M, c, S.stroke)
       }), K;
     },
-    "bpmn:DataOutputAssociation": function(B, C, S = {}) {
+    "bpmn:DataOutputAssociation": function(B, M, S = {}) {
       return S = gt(S, [
         "fill",
         "stroke"
-      ]), ve(B, C, {
+      ]), ve(B, M, {
         ...S,
-        markerEnd: d(B, "association-end", ct(C, s, S.fill), Ce(C, c, S.stroke))
+        markerEnd: d(B, "association-end", ct(M, s, S.fill), Ce(M, c, S.stroke))
       });
     },
-    "bpmn:DataStoreReference": function(B, C, S = {}) {
+    "bpmn:DataStoreReference": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
@@ -16209,41 +16211,41 @@ function Xr(e, t, n, i, o, r, a) {
       var V = i.getScaledPath("DATA_STORE", {
         xScaleFactor: 1,
         yScaleFactor: 1,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
           mx: 0,
           my: 0.133
         }
       });
       return b(B, V, {
-        fill: ct(C, s, S.fill),
+        fill: ct(M, s, S.fill),
         fillOpacity: pa,
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 2
       });
     },
-    "bpmn:EndEvent": function(B, C, S = {}) {
+    "bpmn:EndEvent": function(B, M, S = {}) {
       var { renderIcon: V = !0 } = S;
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var K = U(B, C, {
+      var K = U(B, M, {
         ...S,
         strokeWidth: 4
       });
-      return V && T(C, B, S), K;
+      return V && T(M, B, S), K;
     },
-    "bpmn:EventBasedGateway": function(B, C, S = {}) {
+    "bpmn:EventBasedGateway": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = me(C), K = ne(B, C, S);
-      h(B, C.width, C.height, C.height * 0.2, {
-        fill: ct(C, "none", S.fill),
-        stroke: Ce(C, c, S.stroke),
+      var V = me(M), K = ne(B, M, S);
+      h(B, M.width, M.height, M.height * 0.2, {
+        fill: ct(M, "none", S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       });
       var oe = V.get("eventGatewayType"), _e = !!V.get("instantiate");
@@ -16251,8 +16253,8 @@ function Xr(e, t, n, i, o, r, a) {
         var Ot = i.getScaledPath("GATEWAY_EVENT_BASED", {
           xScaleFactor: 0.18,
           yScaleFactor: 0.18,
-          containerWidth: C.width,
-          containerHeight: C.height,
+          containerWidth: M.width,
+          containerHeight: M.height,
           position: {
             mx: 0.36,
             my: 0.44
@@ -16260,7 +16262,7 @@ function Xr(e, t, n, i, o, r, a) {
         });
         b(B, Ot, {
           fill: "none",
-          stroke: Ce(C, c, S.stroke),
+          stroke: Ce(M, c, S.stroke),
           strokeWidth: 2
         });
       }
@@ -16268,8 +16270,8 @@ function Xr(e, t, n, i, o, r, a) {
         var yt = i.getScaledPath("GATEWAY_PARALLEL", {
           xScaleFactor: 0.4,
           yScaleFactor: 0.4,
-          containerWidth: C.width,
-          containerHeight: C.height,
+          containerWidth: M.width,
+          containerHeight: M.height,
           position: {
             mx: 0.474,
             my: 0.296
@@ -16277,123 +16279,123 @@ function Xr(e, t, n, i, o, r, a) {
         });
         b(B, yt, {
           fill: "none",
-          stroke: Ce(C, c, S.stroke),
+          stroke: Ce(M, c, S.stroke),
           strokeWidth: 1
         });
-      } else oe === "Exclusive" && (_e || h(B, C.width, C.height, C.height * 0.26, {
+      } else oe === "Exclusive" && (_e || h(B, M.width, M.height, M.height * 0.26, {
         fill: "none",
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), Qe());
       return K;
     },
-    "bpmn:ExclusiveGateway": function(B, C, S = {}) {
+    "bpmn:ExclusiveGateway": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = ne(B, C, S), K = i.getScaledPath("GATEWAY_EXCLUSIVE", {
+      var V = ne(B, M, S), K = i.getScaledPath("GATEWAY_EXCLUSIVE", {
         xScaleFactor: 0.4,
         yScaleFactor: 0.4,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
           mx: 0.32,
           my: 0.3
         }
-      }), oe = mt(C);
+      }), oe = mt(M);
       return oe.get("isMarkerVisible") && b(B, K, {
-        fill: Ce(C, c, S.stroke),
-        stroke: Ce(C, c, S.stroke),
+        fill: Ce(M, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), V;
     },
-    "bpmn:Gateway": function(B, C, S = {}) {
+    "bpmn:Gateway": function(B, M, S = {}) {
       return S = gt(S, [
         "fill",
         "stroke"
-      ]), ne(B, C, S);
+      ]), ne(B, M, S);
     },
-    "bpmn:Group": function(B, C, S = {}) {
+    "bpmn:Group": function(B, M, S = {}) {
       return S = gt(S, [
         "fill",
         "stroke",
         "width",
         "height"
-      ]), m(B, C.width, C.height, kl, {
-        stroke: Ce(C, c, S.stroke),
+      ]), m(B, M.width, M.height, kl, {
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1.5,
         strokeDasharray: "10, 6, 0, 6",
         fill: "none",
         pointerEvents: "none",
-        width: Ei(C, S),
-        height: ii(C, S)
+        width: Ei(M, S),
+        height: ii(M, S)
       });
     },
-    "bpmn:InclusiveGateway": function(B, C, S = {}) {
+    "bpmn:InclusiveGateway": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = ne(B, C, S);
-      return h(B, C.width, C.height, C.height * 0.24, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+      var V = ne(B, M, S);
+      return h(B, M.width, M.height, M.height * 0.24, {
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 2.5
       }), V;
     },
-    "bpmn:IntermediateEvent": function(B, C, S = {}) {
+    "bpmn:IntermediateEvent": function(B, M, S = {}) {
       var { renderIcon: V = !0 } = S;
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var K = U(B, C, {
+      var K = U(B, M, {
         ...S,
         strokeWidth: 1.5
       });
-      return h(B, C.width, C.height, Zc, {
+      return h(B, M.width, M.height, Zc, {
         fill: "none",
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1.5
-      }), V && T(C, B, S), K;
+      }), V && T(M, B, S), K;
     },
     "bpmn:IntermediateCatchEvent": D("bpmn:IntermediateEvent"),
     "bpmn:IntermediateThrowEvent": D("bpmn:IntermediateEvent"),
-    "bpmn:Lane": function(B, C, S = {}) {
+    "bpmn:Lane": function(B, M, S = {}) {
       return S = gt(S, [
         "fill",
         "stroke",
         "width",
         "height"
-      ]), q(B, C, {
+      ]), q(B, M, {
         ...S,
         fillOpacity: x2
       });
     },
-    "bpmn:ManualTask": function(B, C, S = {}) {
+    "bpmn:ManualTask": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = xe(B, C, S), K = i.getScaledPath("TASK_TYPE_MANUAL", {
+      var V = xe(B, M, S), K = i.getScaledPath("TASK_TYPE_MANUAL", {
         abspos: {
           x: 17,
           y: 15
         }
       });
       return b(B, K, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 0.5
       }), V;
     },
-    "bpmn:MessageFlow": function(B, C, S = {}) {
+    "bpmn:MessageFlow": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = me(C), K = mt(C), oe = ct(C, s, S.fill), _e = Ce(C, c, S.stroke), Qe = v(B, C.waypoints, {
+      var V = me(M), K = mt(M), oe = ct(M, s, S.fill), _e = Ce(M, c, S.stroke), Qe = v(B, M.waypoints, {
         markerEnd: d(B, "messageflow-end", oe, _e),
         markerStart: d(B, "messageflow-start", oe, _e),
         stroke: _e,
@@ -16421,35 +16423,35 @@ function Xr(e, t, n, i, o, r, a) {
       }
       return Qe;
     },
-    "bpmn:ParallelGateway": function(B, C, S = {}) {
+    "bpmn:ParallelGateway": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = ne(B, C, S), K = i.getScaledPath("GATEWAY_PARALLEL", {
+      var V = ne(B, M, S), K = i.getScaledPath("GATEWAY_PARALLEL", {
         xScaleFactor: 0.6,
         yScaleFactor: 0.6,
-        containerWidth: C.width,
-        containerHeight: C.height,
+        containerWidth: M.width,
+        containerHeight: M.height,
         position: {
           mx: 0.46,
           my: 0.2
         }
       });
       return b(B, K, {
-        fill: Ce(C, c, S.stroke),
-        stroke: Ce(C, c, S.stroke),
+        fill: Ce(M, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), V;
     },
-    "bpmn:Participant": function(B, C, S = {}) {
+    "bpmn:Participant": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke",
         "width",
         "height"
       ]);
-      var V = q(B, C, S), K = lt(C), oe = wn(C), _e = me(C), Qe = _e.get("name");
+      var V = q(B, M, S), K = lt(M), oe = wn(M), _e = me(M), Qe = _e.get("name");
       if (K) {
         var yt = oe ? [
           {
@@ -16458,7 +16460,7 @@ function Xr(e, t, n, i, o, r, a) {
           },
           {
             x: 30,
-            y: ii(C, S)
+            y: ii(M, S)
           }
         ] : [
           {
@@ -16466,40 +16468,40 @@ function Xr(e, t, n, i, o, r, a) {
             y: 30
           },
           {
-            x: Ei(C, S),
+            x: Ei(M, S),
             y: 30
           }
         ];
         y(B, yt, {
-          stroke: Ce(C, c, S.stroke),
+          stroke: Ce(M, c, S.stroke),
           strokeWidth: m2
-        }), ie(B, Qe, C, S);
+        }), ie(B, Qe, M, S);
       } else {
-        var Ot = ps(C, S);
-        oe || (Ot.height = Ei(C, S), Ot.width = ii(C, S));
+        var Ot = ps(M, S);
+        oe || (Ot.height = Ei(M, S), Ot.width = ii(M, S));
         var xt = X(B, Qe, {
           box: Ot,
           align: "center-middle",
           style: {
-            fill: us(C, l, c, S.stroke)
+            fill: us(M, l, c, S.stroke)
           }
         });
         if (!oe) {
-          var en = -1 * ii(C, S);
+          var en = -1 * ii(M, S);
           Pl(xt, 0, -en, 270);
         }
       }
-      return _e.get("participantMultiplicity") && j("ParticipantMultiplicityMarker", B, C, S), V;
+      return _e.get("participantMultiplicity") && j("ParticipantMultiplicityMarker", B, M, S), V;
     },
-    "bpmn:ReceiveTask": function(B, C, S = {}) {
+    "bpmn:ReceiveTask": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = me(C), K = xe(B, C, S), oe;
+      var V = me(M), K = xe(B, M, S), oe;
       return V.get("instantiate") ? (h(B, 28, 28, 20 * 0.22, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), oe = i.getScaledPath("TASK_TYPE_INSTANTIATING_SEND", {
         abspos: {
@@ -16516,34 +16518,34 @@ function Xr(e, t, n, i, o, r, a) {
           my: 0.4
         }
       }), b(B, oe, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), K;
     },
-    "bpmn:ScriptTask": function(B, C, S = {}) {
+    "bpmn:ScriptTask": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = xe(B, C, S), K = i.getScaledPath("TASK_TYPE_SCRIPT", {
+      var V = xe(B, M, S), K = i.getScaledPath("TASK_TYPE_SCRIPT", {
         abspos: {
           x: 15,
           y: 20
         }
       });
       return b(B, K, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), V;
     },
-    "bpmn:SendTask": function(B, C, S = {}) {
+    "bpmn:SendTask": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = xe(B, C, S), K = i.getScaledPath("TASK_TYPE_SEND", {
+      var V = xe(B, M, S), K = i.getScaledPath("TASK_TYPE_SEND", {
         xScaleFactor: 1,
         yScaleFactor: 1,
         containerWidth: 21,
@@ -16554,20 +16556,20 @@ function Xr(e, t, n, i, o, r, a) {
         }
       });
       return b(B, K, {
-        fill: Ce(C, c, S.stroke),
-        stroke: ct(C, s, S.fill),
+        fill: Ce(M, c, S.stroke),
+        stroke: ct(M, s, S.fill),
         strokeWidth: 1
       }), V;
     },
-    "bpmn:SequenceFlow": function(B, C, S = {}) {
+    "bpmn:SequenceFlow": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = ct(C, s, S.fill), K = Ce(C, c, S.stroke), oe = v(B, C.waypoints, {
+      var V = ct(M, s, S.fill), K = Ce(M, c, S.stroke), oe = v(B, M.waypoints, {
         markerEnd: d(B, "sequenceflow-end", V, K),
         stroke: K
-      }), _e = me(C), { source: Qe } = C;
+      }), _e = me(M), { source: Qe } = M;
       if (Qe) {
         var yt = me(Qe);
         _e.get("conditionExpression") && A(yt, "bpmn:Activity") && Re(oe, {
@@ -16578,14 +16580,14 @@ function Xr(e, t, n, i, o, r, a) {
       }
       return oe;
     },
-    "bpmn:ServiceTask": function(B, C, S = {}) {
+    "bpmn:ServiceTask": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = xe(B, C, S);
+      var V = xe(B, M, S);
       h(B, 10, 10, {
-        fill: ct(C, s, S.fill),
+        fill: ct(M, s, S.fill),
         stroke: "none",
         transform: "translate(6, 6)"
       });
@@ -16596,11 +16598,11 @@ function Xr(e, t, n, i, o, r, a) {
         }
       });
       b(B, K, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), h(B, 10, 10, {
-        fill: ct(C, s, S.fill),
+        fill: ct(M, s, S.fill),
         stroke: "none",
         transform: "translate(11, 10)"
       });
@@ -16611,27 +16613,27 @@ function Xr(e, t, n, i, o, r, a) {
         }
       });
       return b(B, oe, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1
       }), V;
     },
-    "bpmn:StartEvent": function(B, C, S = {}) {
+    "bpmn:StartEvent": function(B, M, S = {}) {
       var { renderIcon: V = !0 } = S;
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var K = me(C);
+      var K = me(M);
       K.get("isInterrupting") || (S = {
         ...S,
         strokeDasharray: "6"
       });
-      var oe = U(B, C, S);
-      return V && T(C, B, S), oe;
+      var oe = U(B, M, S);
+      return V && T(M, B, S), oe;
     },
-    "bpmn:SubProcess": function(B, C, S = {}) {
-      return lt(C) ? S = gt(S, [
+    "bpmn:SubProcess": function(B, M, S = {}) {
+      return lt(M) ? S = gt(S, [
         "fill",
         "stroke",
         "width",
@@ -16639,15 +16641,15 @@ function Xr(e, t, n, i, o, r, a) {
       ]) : S = gt(S, [
         "fill",
         "stroke"
-      ]), Z(B, C, S);
+      ]), Z(B, M, S);
     },
-    "bpmn:Task": function(B, C, S = {}) {
+    "bpmn:Task": function(B, M, S = {}) {
       return S = gt(S, [
         "fill",
         "stroke"
-      ]), xe(B, C, S);
+      ]), xe(B, M, S);
     },
-    "bpmn:TextAnnotation": function(B, C, S = {}) {
+    "bpmn:TextAnnotation": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
@@ -16655,7 +16657,7 @@ function Xr(e, t, n, i, o, r, a) {
       var {
         width: V,
         height: K
-      } = ps(C, S), oe = m(B, V, K, 0, 0, {
+      } = ps(M, S), oe = m(B, V, K, 0, 0, {
         fill: "none",
         stroke: "none"
       }), _e = i.getScaledPath("TEXT_ANNOTATION", {
@@ -16669,20 +16671,20 @@ function Xr(e, t, n, i, o, r, a) {
         }
       });
       b(B, _e, {
-        stroke: Ce(C, c, S.stroke)
+        stroke: Ce(M, c, S.stroke)
       });
-      var Qe = me(C), yt = Qe.get("text") || "";
+      var Qe = me(M), yt = Qe.get("text") || "";
       return X(B, yt, {
         align: "left-top",
-        box: ps(C, S),
+        box: ps(M, S),
         padding: wa,
         style: {
-          fill: us(C, l, c, S.stroke)
+          fill: us(M, l, c, S.stroke)
         }
       }), oe;
     },
-    "bpmn:Transaction": function(B, C, S = {}) {
-      lt(C) ? S = gt(S, [
+    "bpmn:Transaction": function(B, M, S = {}) {
+      lt(M) ? S = gt(S, [
         "fill",
         "stroke",
         "width",
@@ -16691,36 +16693,36 @@ function Xr(e, t, n, i, o, r, a) {
         "fill",
         "stroke"
       ]);
-      var V = Z(B, C, {
+      var V = Z(B, M, {
         strokeWidth: 1.5,
         ...S
       }), K = n.style(["no-fill", "no-events"], {
-        stroke: Ce(C, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 1.5
-      }), oe = lt(C);
+      }), oe = lt(M);
       return oe || (S = {}), m(
         B,
-        Ei(C, S),
-        ii(C, S),
+        Ei(M, S),
+        ii(M, S),
         kl - Zc,
         Zc,
         K
       ), V;
     },
-    "bpmn:UserTask": function(B, C, S = {}) {
+    "bpmn:UserTask": function(B, M, S = {}) {
       S = gt(S, [
         "fill",
         "stroke"
       ]);
-      var V = xe(B, C, S), K = 15, oe = 12, _e = i.getScaledPath("TASK_TYPE_USER_1", {
+      var V = xe(B, M, S), K = 15, oe = 12, _e = i.getScaledPath("TASK_TYPE_USER_1", {
         abspos: {
           x: K,
           y: oe
         }
       });
       b(B, _e, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 0.5
       });
       var Qe = i.getScaledPath("TASK_TYPE_USER_2", {
@@ -16730,8 +16732,8 @@ function Xr(e, t, n, i, o, r, a) {
         }
       });
       b(B, Qe, {
-        fill: ct(C, s, S.fill),
-        stroke: Ce(C, c, S.stroke),
+        fill: ct(M, s, S.fill),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 0.5
       });
       var yt = i.getScaledPath("TASK_TYPE_USER_3", {
@@ -16741,13 +16743,13 @@ function Xr(e, t, n, i, o, r, a) {
         }
       });
       return b(B, yt, {
-        fill: Ce(C, c, S.stroke),
-        stroke: Ce(C, c, S.stroke),
+        fill: Ce(M, c, S.stroke),
+        stroke: Ce(M, c, S.stroke),
         strokeWidth: 0.5
       }), V;
     },
-    label: function(B, C, S = {}) {
-      return J(B, C, S);
+    label: function(B, M, S = {}) {
+      return J(B, M, S);
     }
   };
   this._drawPath = b, this._renderer = R;