@ucap-llm/ai-ui 1.1.13 → 1.1.15

package/{architectureDiagram-IEHRJDOE-e4684ef3.mjs → architectureDiagram-IEHRJDOE-1ccc2c64.mjs}

@@ -1,12 +1,12 @@
-import { aH as Ne, aI as qe, C as Je, _ as nt, aJ as Qe, aK as Ke, n as je, o as _e, s as tr, g as er, c as rr, b as ir, d as fe, l as be, j as ar, t as nr, H as or, V as sr, aj as Le, aL as Ee } from "./index-f83d4b07.mjs";
-import { p as hr } from "./chunk-4BMEZGHF-8d9a2e4f.mjs";
-import { I as lr } from "./chunk-XZIHB7SX-56c08d07.mjs";
-import { p as fr } from "./mermaid-parser.core-55f134dc.mjs";
+import { d4 as Ne, d5 as qe, c1 as Qe, bz as nt, d6 as Je, d7 as Ke, bP as je, bQ as _e, bB as tr, bC as er, bE as rr, bD as ir, bF as fe, bM as be, bL as ar, bW as nr, c6 as or, cB as sr, cK as Le, d8 as Ee } from "./index-433e2395.mjs";
+import { p as hr } from "./chunk-4BMEZGHF-705995af.mjs";
+import { I as lr } from "./chunk-XZIHB7SX-fafd3ca2.mjs";
+import { p as fr } from "./mermaid-parser.core-6eb44241.mjs";
 import { c as Pe } from "./cytoscape.esm-bb479f88.mjs";
 import "vue";
-import "./_baseUniq-2bcae05e.mjs";
-import "./_basePickBy-12958109.mjs";
-import "./clone-1f18a17f.mjs";
+import "./_baseUniq-8cd7fbc4.mjs";
+import "./_basePickBy-e7598e72.mjs";
+import "./clone-327a1426.mjs";
 var Ge = { exports: {} }, pe = { exports: {} }, ye = { exports: {} }, xe;
 function cr() {
   return xe || (xe = 1, function(C, U) {
@@ -1681,33 +1681,33 @@ function cr() {
                 this.V[V][V] = 1;
               }
               for (var B = n - 1, _ = Math.pow(2, -52), lt = Math.pow(2, -966); n > 0; ) {
-                var J = void 0, Rt = void 0;
-                for (J = n - 2; J >= -1 && J !== -1; J--)
-                  if (Math.abs(r[J]) <= lt + _ * (Math.abs(this.s[J]) + Math.abs(this.s[J + 1]))) {
-                    r[J] = 0;
+                var Q = void 0, Rt = void 0;
+                for (Q = n - 2; Q >= -1 && Q !== -1; Q--)
+                  if (Math.abs(r[Q]) <= lt + _ * (Math.abs(this.s[Q]) + Math.abs(this.s[Q + 1]))) {
+                    r[Q] = 0;
                     break;
                   }
-                if (J === n - 2)
+                if (Q === n - 2)
                   Rt = 4;
                 else {
                   var Lt = void 0;
-                  for (Lt = n - 1; Lt >= J && Lt !== J; Lt--) {
-                    var vt = (Lt !== n ? Math.abs(r[Lt]) : 0) + (Lt !== J + 1 ? Math.abs(r[Lt - 1]) : 0);
+                  for (Lt = n - 1; Lt >= Q && Lt !== Q; Lt--) {
+                    var vt = (Lt !== n ? Math.abs(r[Lt]) : 0) + (Lt !== Q + 1 ? Math.abs(r[Lt - 1]) : 0);
                     if (Math.abs(this.s[Lt]) <= lt + _ * vt) {
                       this.s[Lt] = 0;
                       break;
                     }
                   }
-                  Lt === J ? Rt = 3 : Lt === n - 1 ? Rt = 1 : (Rt = 2, J = Lt);
+                  Lt === Q ? Rt = 3 : Lt === n - 1 ? Rt = 1 : (Rt = 2, Q = Lt);
                 }
-                switch (J++, Rt) {
+                switch (Q++, Rt) {
                   case 1:
                     {
                       var it = r[n - 2];
                       r[n - 2] = 0;
-                      for (var gt = n - 2; gt >= J; gt--) {
+                      for (var gt = n - 2; gt >= Q; gt--) {
                         var Tt = u.hypot(this.s[gt], it), At = this.s[gt] / Tt, Dt = it / Tt;
-                        this.s[gt] = Tt, gt !== J && (it = -Dt * r[gt - 1], r[gt - 1] = At * r[gt - 1]);
+                        this.s[gt] = Tt, gt !== Q && (it = -Dt * r[gt - 1], r[gt - 1] = At * r[gt - 1]);
                         for (var mt = 0; mt < this.n; mt++)
                           Tt = At * this.V[mt][gt] + Dt * this.V[mt][n - 1], this.V[mt][n - 1] = -Dt * this.V[mt][gt] + At * this.V[mt][n - 1], this.V[mt][gt] = Tt;
                       }
@@ -1715,25 +1715,25 @@ function cr() {
                     break;
                   case 2:
                     {
-                      var xt = r[J - 1];
-                      r[J - 1] = 0;
-                      for (var St = J; St < n; St++) {
+                      var xt = r[Q - 1];
+                      r[Q - 1] = 0;
+                      for (var St = Q; St < n; St++) {
                         var Vt = u.hypot(this.s[St], xt), Xt = this.s[St] / Vt, Ut = xt / Vt;
                         this.s[St] = Vt, xt = -Ut * r[St], r[St] = Xt * r[St];
                         for (var bt = 0; bt < this.m; bt++)
-                          Vt = Xt * this.U[bt][St] + Ut * this.U[bt][J - 1], this.U[bt][J - 1] = -Ut * this.U[bt][St] + Xt * this.U[bt][J - 1], this.U[bt][St] = Vt;
+                          Vt = Xt * this.U[bt][St] + Ut * this.U[bt][Q - 1], this.U[bt][Q - 1] = -Ut * this.U[bt][St] + Xt * this.U[bt][Q - 1], this.U[bt][St] = Vt;
                       }
                     }
                     break;
                   case 3:
                     {
-                      var Ht = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(r[n - 2])), Math.abs(this.s[J])), Math.abs(r[J])), Bt = this.s[n - 1] / Ht, F = this.s[n - 2] / Ht, b = r[n - 2] / Ht, $ = this.s[J] / Ht, Q = r[J] / Ht, Z = ((F + Bt) * (F - Bt) + b * b) / 2, at = Bt * b * (Bt * b), ut = 0;
+                      var Ht = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(r[n - 2])), Math.abs(this.s[Q])), Math.abs(r[Q])), Bt = this.s[n - 1] / Ht, F = this.s[n - 2] / Ht, b = r[n - 2] / Ht, $ = this.s[Q] / Ht, J = r[Q] / Ht, Z = ((F + Bt) * (F - Bt) + b * b) / 2, at = Bt * b * (Bt * b), ut = 0;
                       (function(Nt, Mt) {
                         return Nt || Mt;
                       })(Z !== 0, at !== 0) && (ut = Math.sqrt(Z * Z + at), Z < 0 && (ut = -ut), ut = at / (Z + ut));
-                      for (var ot = ($ + Bt) * ($ - Bt) + ut, tt = $ * Q, j = J; j < n - 1; j++) {
+                      for (var ot = ($ + Bt) * ($ - Bt) + ut, tt = $ * J, j = Q; j < n - 1; j++) {
                         var dt = u.hypot(ot, tt), wt = ot / dt, yt = tt / dt;
-                        j !== J && (r[j - 1] = dt), ot = wt * this.s[j] + yt * r[j], r[j] = wt * r[j] - yt * this.s[j], tt = yt * this.s[j + 1], this.s[j + 1] = wt * this.s[j + 1];
+                        j !== Q && (r[j - 1] = dt), ot = wt * this.s[j] + yt * r[j], r[j] = wt * r[j] - yt * this.s[j], tt = yt * this.s[j + 1], this.s[j + 1] = wt * this.s[j + 1];
                         for (var It = 0; It < this.n; It++)
                           dt = wt * this.V[It][j] + yt * this.V[It][j + 1], this.V[It][j + 1] = -yt * this.V[It][j] + wt * this.V[It][j + 1], this.V[It][j] = dt;
                         if (dt = u.hypot(ot, tt), wt = ot / dt, yt = tt / dt, this.s[j] = dt, ot = wt * r[j] + yt * this.s[j + 1], this.s[j + 1] = -yt * r[j] + wt * this.s[j + 1], tt = yt * r[j + 1], r[j + 1] = wt * r[j + 1], j < this.m - 1)
@@ -1745,20 +1745,20 @@ function cr() {
                     break;
                   case 4:
                     {
-                      if (this.s[J] <= 0) {
-                        this.s[J] = this.s[J] < 0 ? -this.s[J] : 0;
+                      if (this.s[Q] <= 0) {
+                        this.s[Q] = this.s[Q] < 0 ? -this.s[Q] : 0;
                         for (var st = 0; st <= B; st++)
-                          this.V[st][J] = -this.V[st][J];
+                          this.V[st][Q] = -this.V[st][Q];
                       }
-                      for (; J < B && !(this.s[J] >= this.s[J + 1]); ) {
-                        var Ct = this.s[J];
-                        if (this.s[J] = this.s[J + 1], this.s[J + 1] = Ct, J < this.n - 1)
+                      for (; Q < B && !(this.s[Q] >= this.s[Q + 1]); ) {
+                        var Ct = this.s[Q];
+                        if (this.s[Q] = this.s[Q + 1], this.s[Q + 1] = Ct, Q < this.n - 1)
                           for (var ct = 0; ct < this.n; ct++)
-                            Ct = this.V[ct][J + 1], this.V[ct][J + 1] = this.V[ct][J], this.V[ct][J] = Ct;
-                        if (J < this.m - 1)
+                            Ct = this.V[ct][Q + 1], this.V[ct][Q + 1] = this.V[ct][Q], this.V[ct][Q] = Ct;
+                        if (Q < this.m - 1)
                           for (var ht = 0; ht < this.m; ht++)
-                            Ct = this.U[ht][J + 1], this.U[ht][J + 1] = this.U[ht][J], this.U[ht][J] = Ct;
-                        J++;
+                            Ct = this.U[ht][Q + 1], this.U[ht][Q + 1] = this.U[ht][Q], this.U[ht][Q] = Ct;
+                        Q++;
                       }
                       n--;
                     }
@@ -2108,8 +2108,8 @@ function ur() {
                     this.idToNodeMap.set(E.id, E);
                   }
                   var y = function O(H) {
-                    for (var B = H.getChild().getNodes(), _, lt = 0, J = 0; J < B.length; J++)
-                      _ = B[J], _.getChild() == null ? n.fixedNodeSet.has(_.id) && (lt += 100) : lt += O(_);
+                    for (var B = H.getChild().getNodes(), _, lt = 0, Q = 0; Q < B.length; Q++)
+                      _ = B[Q], _.getChild() == null ? n.fixedNodeSet.has(_.id) && (lt += 100) : lt += O(_);
                     return lt;
                   };
                   if (this.constraints.fixedNodeConstraint) {
@@ -2165,16 +2165,16 @@ function ur() {
                         }
                       });
                       var Y = function(H, B) {
-                        var _ = [], lt = [], J = new k(), Rt = /* @__PURE__ */ new Set(), Lt = 0;
+                        var _ = [], lt = [], Q = new k(), Rt = /* @__PURE__ */ new Set(), Lt = 0;
                         return H.forEach(function(vt, it) {
                           if (!Rt.has(it)) {
                             _[Lt] = [], lt[Lt] = !1;
                             var gt = it;
-                            for (J.push(gt), Rt.add(gt), _[Lt].push(gt); J.length != 0; ) {
-                              gt = J.shift(), B.has(gt) && (lt[Lt] = !0);
+                            for (Q.push(gt), Rt.add(gt), _[Lt].push(gt); Q.length != 0; ) {
+                              gt = Q.shift(), B.has(gt) && (lt[Lt] = !0);
                               var Tt = H.get(gt);
                               Tt.forEach(function(At) {
-                                Rt.has(At) || (J.push(At), Rt.add(At), _[Lt].push(At));
+                                Rt.has(At) || (Q.push(At), Rt.add(At), _[Lt].push(At));
                               });
                             }
                             Lt++;
@@ -2286,8 +2286,8 @@ function ur() {
                             } else
                               q += this.idToNodeMap.get(x[y]).displacementY, V++;
                           for (var et = q / V, y = 0; y < x.length; y++)
-                            this.dummyToNodeForHorizontalAlignment.has(x[y]) ? this.dummyToNodeForHorizontalAlignment.get(x[y]).forEach(function(J) {
-                              n.idToNodeMap.get(J).displacementY = et;
+                            this.dummyToNodeForHorizontalAlignment.has(x[y]) ? this.dummyToNodeForHorizontalAlignment.get(x[y]).forEach(function(Q) {
+                              n.idToNodeMap.get(Q).displacementY = et;
                             }) : this.idToNodeMap.get(x[y]).displacementY = et;
                         }
                       }
@@ -2360,8 +2360,8 @@ function ur() {
                     _ >= 0 && V.splice(_, 1), z--, Y--;
                   }
                   m != null ? O = (V.indexOf(H[0]) + 1) % z : O = 0;
-                  for (var lt = Math.abs(E - p) / Y, J = O; et != Y; J = ++J % z) {
-                    var Rt = V[J].getOtherEnd(n);
+                  for (var lt = Math.abs(E - p) / Y, Q = O; et != Y; Q = ++Q % z) {
+                    var Rt = V[Q].getOtherEnd(n);
                     if (Rt != m) {
                       var Lt = (p + et * lt) % 360, vt = (Lt + lt) % 360;
                       D.branchRadialLayout(Rt, n, Lt, vt, y + I, I), et++;
@@ -2720,11 +2720,11 @@ function ur() {
                   var X = function(b, $) {
                     return { x: b.x - $.x, y: b.y - $.y };
                   }, k = function(b) {
-                    var $ = 0, Q = 0;
+                    var $ = 0, J = 0;
                     return b.forEach(function(Z) {
-                      $ += d[v.get(Z)], Q += N[v.get(Z)];
-                    }), { x: $ / b.size, y: Q / b.size };
-                  }, D = function(b, $, Q, Z, at) {
+                      $ += d[v.get(Z)], J += N[v.get(Z)];
+                    }), { x: $ / b.size, y: J / b.size };
+                  }, D = function(b, $, J, Z, at) {
                     function ut(ft, st) {
                       var Ct = new Set(ft), ct = !0, ht = !1, Wt = void 0;
                       try {
@@ -2754,17 +2754,17 @@ function ur() {
                     });
                     var tt = /* @__PURE__ */ new Map(), j = /* @__PURE__ */ new Map(), dt = new g();
                     ot.forEach(function(ft, st) {
-                      ft == 0 ? (dt.push(st), Q || ($ == "horizontal" ? tt.set(st, v.has(st) ? d[v.get(st)] : Z.get(st)) : tt.set(st, v.has(st) ? N[v.get(st)] : Z.get(st)))) : tt.set(st, Number.NEGATIVE_INFINITY), Q && j.set(st, /* @__PURE__ */ new Set([st]));
-                    }), Q && at.forEach(function(ft) {
+                      ft == 0 ? (dt.push(st), J || ($ == "horizontal" ? tt.set(st, v.has(st) ? d[v.get(st)] : Z.get(st)) : tt.set(st, v.has(st) ? N[v.get(st)] : Z.get(st)))) : tt.set(st, Number.NEGATIVE_INFINITY), J && j.set(st, /* @__PURE__ */ new Set([st]));
+                    }), J && at.forEach(function(ft) {
                       var st = [];
                       if (ft.forEach(function(ht) {
-                        Q.has(ht) && st.push(ht);
+                        J.has(ht) && st.push(ht);
                       }), st.length > 0) {
                         var Ct = 0;
                         st.forEach(function(ht) {
                           $ == "horizontal" ? (tt.set(ht, v.has(ht) ? d[v.get(ht)] : Z.get(ht)), Ct += tt.get(ht)) : (tt.set(ht, v.has(ht) ? N[v.get(ht)] : Z.get(ht)), Ct += tt.get(ht));
                         }), Ct = Ct / st.length, ft.forEach(function(ht) {
-                          Q.has(ht) || tt.set(ht, Ct);
+                          J.has(ht) || tt.set(ht, Ct);
                         });
                       } else {
                         var ct = 0;
@@ -2779,7 +2779,7 @@ function ur() {
                       var st = dt.shift(), Ct = b.get(st);
                       Ct.forEach(function(ct) {
                         if (tt.get(ct.id) < tt.get(st) + ct.gap)
-                          if (Q && Q.has(ct.id)) {
+                          if (J && J.has(ct.id)) {
                             var ht = void 0;
                             if ($ == "horizontal" ? ht = v.has(ct.id) ? d[v.get(ct.id)] : Z.get(ct.id) : ht = v.has(ct.id) ? N[v.get(ct.id)] : Z.get(ct.id), tt.set(ct.id, ht), ht < tt.get(st) + ct.gap) {
                               var Wt = tt.get(st) + ct.gap - ht;
@@ -2789,11 +2789,11 @@ function ur() {
                             }
                           } else
                             tt.set(ct.id, tt.get(st) + ct.gap);
-                        ot.set(ct.id, ot.get(ct.id) - 1), ot.get(ct.id) == 0 && dt.push(ct.id), Q && j.set(ct.id, ut(j.get(st), j.get(ct.id)));
+                        ot.set(ct.id, ot.get(ct.id) - 1), ot.get(ct.id) == 0 && dt.push(ct.id), J && j.set(ct.id, ut(j.get(st), j.get(ct.id)));
                       });
                     }; dt.length != 0; )
                       wt();
-                    if (Q) {
+                    if (J) {
                       var yt = /* @__PURE__ */ new Set();
                       b.forEach(function(ft, st) {
                         ft.length == 0 && yt.add(st);
@@ -2805,7 +2805,7 @@ function ur() {
                           try {
                             for (var Nt = ft[Symbol.iterator](), Mt; !(ct = (Mt = Nt.next()).done); ct = !0) {
                               var Zt = Mt.value;
-                              Q.has(Zt) && (Ct = !0);
+                              J.has(Zt) && (Ct = !0);
                             }
                           } catch (Ft) {
                             ht = !0, Wt = Ft;
@@ -2865,29 +2865,29 @@ function ur() {
                     }
                     return tt;
                   }, rt = function(b) {
-                    var $ = 0, Q = 0, Z = 0, at = 0;
+                    var $ = 0, J = 0, Z = 0, at = 0;
                     if (b.forEach(function(j) {
-                      j.left ? d[v.get(j.left)] - d[v.get(j.right)] >= 0 ? $++ : Q++ : N[v.get(j.top)] - N[v.get(j.bottom)] >= 0 ? Z++ : at++;
-                    }), $ > Q && Z > at)
+                      j.left ? d[v.get(j.left)] - d[v.get(j.right)] >= 0 ? $++ : J++ : N[v.get(j.top)] - N[v.get(j.bottom)] >= 0 ? Z++ : at++;
+                    }), $ > J && Z > at)
                       for (var ut = 0; ut < v.size; ut++)
                         d[ut] = -1 * d[ut], N[ut] = -1 * N[ut];
-                    else if ($ > Q)
+                    else if ($ > J)
                       for (var ot = 0; ot < v.size; ot++)
                         d[ot] = -1 * d[ot];
                     else if (Z > at)
                       for (var tt = 0; tt < v.size; tt++)
                         N[tt] = -1 * N[tt];
                   }, n = function(b) {
-                    var $ = [], Q = new g(), Z = /* @__PURE__ */ new Set(), at = 0;
+                    var $ = [], J = new g(), Z = /* @__PURE__ */ new Set(), at = 0;
                     return b.forEach(function(ut, ot) {
                       if (!Z.has(ot)) {
                         $[at] = [];
                         var tt = ot;
-                        for (Q.push(tt), Z.add(tt), $[at].push(tt); Q.length != 0; ) {
-                          tt = Q.shift();
+                        for (J.push(tt), Z.add(tt), $[at].push(tt); J.length != 0; ) {
+                          tt = J.shift();
                           var j = b.get(tt);
                           j.forEach(function(dt) {
-                            Z.has(dt.id) || (Q.push(dt.id), Z.add(dt.id), $[at].push(dt.id));
+                            Z.has(dt.id) || (J.push(dt.id), Z.add(dt.id), $[at].push(dt.id));
                           });
                         }
                         at++;
@@ -2895,19 +2895,19 @@ function ur() {
                     }), $;
                   }, m = function(b) {
                     var $ = /* @__PURE__ */ new Map();
-                    return b.forEach(function(Q, Z) {
+                    return b.forEach(function(J, Z) {
                       $.set(Z, []);
-                    }), b.forEach(function(Q, Z) {
-                      Q.forEach(function(at) {
+                    }), b.forEach(function(J, Z) {
+                      J.forEach(function(at) {
                         $.get(Z).push(at), $.get(at.id).push({ id: Z, gap: at.gap, direction: at.direction });
                       });
                     }), $;
                   }, p = function(b) {
                     var $ = /* @__PURE__ */ new Map();
-                    return b.forEach(function(Q, Z) {
+                    return b.forEach(function(J, Z) {
                       $.set(Z, []);
-                    }), b.forEach(function(Q, Z) {
-                      Q.forEach(function(at) {
+                    }), b.forEach(function(J, Z) {
+                      J.forEach(function(at) {
                         $.get(at.id).push({ id: Z, gap: at.gap, direction: at.direction });
                       });
                     }), $;
@@ -2936,8 +2936,8 @@ function ur() {
                             dt.size > 0 ? wt = d[v.get(dt.values().next().value)] : wt = k(j).x, b[tt].forEach(function(yt) {
                               E[F] = [wt, N[v.get(yt)]], y[F] = [d[v.get(yt)], N[v.get(yt)]], F++;
                             });
-                          }, Q = 0; Q < b.length; Q++)
-                            $(Q);
+                          }, J = 0; J < b.length; J++)
+                            $(J);
                           I = !0;
                         }
                         if (h.alignmentConstraint.horizontal) {
@@ -2977,9 +2977,9 @@ function ur() {
                       }
                     }
                     if (I) {
-                      for (var lt = void 0, J = t.transpose(E), Rt = t.transpose(y), Lt = 0; Lt < J.length; Lt++)
-                        J[Lt] = t.multGamma(J[Lt]), Rt[Lt] = t.multGamma(Rt[Lt]);
-                      var vt = t.multMat(J, t.transpose(Rt)), it = s.svd(vt);
+                      for (var lt = void 0, Q = t.transpose(E), Rt = t.transpose(y), Lt = 0; Lt < Q.length; Lt++)
+                        Q[Lt] = t.multGamma(Q[Lt]), Rt[Lt] = t.multGamma(Rt[Lt]);
+                      var vt = t.multMat(Q, t.transpose(Rt)), it = s.svd(vt);
                       lt = t.multMat(it.V, t.transpose(it.U));
                       for (var gt = 0; gt < v.size; gt++) {
                         var Tt = [d[gt], N[gt]], At = [lt[0][0], lt[1][0]], Dt = [lt[0][1], lt[1][1]];
@@ -2992,7 +2992,7 @@ function ur() {
                     if (h.fixedNodeConstraint && h.fixedNodeConstraint.length > 0) {
                       var mt = { x: 0, y: 0 };
                       h.fixedNodeConstraint.forEach(function(F, b) {
-                        var $ = { x: d[v.get(F.nodeId)], y: N[v.get(F.nodeId)] }, Q = F.position, Z = X(Q, $);
+                        var $ = { x: d[v.get(F.nodeId)], y: N[v.get(F.nodeId)] }, J = F.position, Z = X(J, $);
                         mt.x += Z.x, mt.y += Z.y;
                       }), mt.x /= h.fixedNodeConstraint.length, mt.y /= h.fixedNodeConstraint.length, d.forEach(function(F, b) {
                         d[b] += mt.x;
@@ -3009,10 +3009,10 @@ function ur() {
                           xt[b].forEach(function(at) {
                             $.add(at);
                           });
-                          var Q = new Set([].concat(f($)).filter(function(at) {
+                          var J = new Set([].concat(f($)).filter(function(at) {
                             return R.has(at);
                           })), Z = void 0;
-                          Q.size > 0 ? Z = d[v.get(Q.values().next().value)] : Z = k($).x, $.forEach(function(at) {
+                          J.size > 0 ? Z = d[v.get(J.values().next().value)] : Z = k($).x, $.forEach(function(at) {
                             R.has(at) || (d[v.get(at)] = Z);
                           });
                         }, Vt = 0; Vt < xt.length; Vt++)
@@ -3023,17 +3023,17 @@ function ur() {
                           Xt[b].forEach(function(at) {
                             $.add(at);
                           });
-                          var Q = new Set([].concat(f($)).filter(function(at) {
+                          var J = new Set([].concat(f($)).filter(function(at) {
                             return R.has(at);
                           })), Z = void 0;
-                          Q.size > 0 ? Z = N[v.get(Q.values().next().value)] : Z = k($).y, $.forEach(function(at) {
+                          J.size > 0 ? Z = N[v.get(J.values().next().value)] : Z = k($).y, $.forEach(function(at) {
                             R.has(at) || (N[v.get(at)] = Z);
                           });
                         }, bt = 0; bt < Xt.length; bt++)
                           Ut(bt);
                     }
                     h.relativePlacementConstraint && function() {
-                      var F = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), $ = /* @__PURE__ */ new Map(), Q = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), at = /* @__PURE__ */ new Map(), ut = /* @__PURE__ */ new Set(), ot = /* @__PURE__ */ new Set();
+                      var F = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), $ = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), at = /* @__PURE__ */ new Map(), ut = /* @__PURE__ */ new Set(), ot = /* @__PURE__ */ new Set();
                       if (R.forEach(function(Yt) {
                         ut.add(Yt), ot.add(Yt);
                       }), h.alignmentConstraint) {
@@ -3046,16 +3046,16 @@ function ur() {
                             j(dt);
                         if (h.alignmentConstraint.horizontal)
                           for (var wt = h.alignmentConstraint.horizontal, yt = function(Et) {
-                            Q.set("dummy" + Et, []), wt[Et].forEach(function(Ot) {
-                              b.set(Ot, "dummy" + Et), Q.get("dummy" + Et).push(Ot), R.has(Ot) && ot.add("dummy" + Et);
+                            J.set("dummy" + Et, []), wt[Et].forEach(function(Ot) {
+                              b.set(Ot, "dummy" + Et), J.get("dummy" + Et).push(Ot), R.has(Ot) && ot.add("dummy" + Et);
                             }), at.set("dummy" + Et, N[v.get(wt[Et][0])]);
                           }, It = 0; It < wt.length; It++)
                             yt(It);
                       }
                       var ft = /* @__PURE__ */ new Map(), st = /* @__PURE__ */ new Map(), Ct = function(Et) {
                         W.get(Et).forEach(function(Ot) {
-                          var Jt = void 0, kt = void 0;
-                          Ot.direction == "horizontal" ? (Jt = F.get(Et) ? F.get(Et) : Et, F.get(Ot.id) ? kt = { id: F.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : kt = Ot, ft.has(Jt) ? ft.get(Jt).push(kt) : ft.set(Jt, [kt]), ft.has(kt.id) || ft.set(kt.id, [])) : (Jt = b.get(Et) ? b.get(Et) : Et, b.get(Ot.id) ? kt = { id: b.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : kt = Ot, st.has(Jt) ? st.get(Jt).push(kt) : st.set(Jt, [kt]), st.has(kt.id) || st.set(kt.id, []));
+                          var Qt = void 0, kt = void 0;
+                          Ot.direction == "horizontal" ? (Qt = F.get(Et) ? F.get(Et) : Et, F.get(Ot.id) ? kt = { id: F.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : kt = Ot, ft.has(Qt) ? ft.get(Qt).push(kt) : ft.set(Qt, [kt]), ft.has(kt.id) || ft.set(kt.id, [])) : (Qt = b.get(Et) ? b.get(Et) : Et, b.get(Ot.id) ? kt = { id: b.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : kt = Ot, st.has(Qt) ? st.get(Qt).push(kt) : st.set(Qt, [kt]), st.has(kt.id) || st.set(kt.id, []));
                         });
                       }, ct = !0, ht = !1, Wt = void 0;
                       try {
@@ -3104,7 +3104,7 @@ function ur() {
                         }
                       }
                       var ke = function(Et) {
-                        Q.get(Et) ? Q.get(Et).forEach(function(Ot) {
+                        J.get(Et) ? J.get(Et).forEach(function(Ot) {
                           N[v.get(Ot)] = jt.get(Et);
                         }) : N[v.get(Et)] = jt.get(Et);
                       }, de = !0, we = !1, Oe = void 0;
@@ -3362,8 +3362,8 @@ function ur() {
                     else
                       B = x.add(new g(this.graphManager));
                     if (B.id = O.data("id"), B.nodeRepulsion = m(Y.nodeRepulsion, O), B.paddingLeft = parseInt(O.css("padding")), B.paddingTop = parseInt(O.css("padding")), B.paddingRight = parseInt(O.css("padding")), B.paddingBottom = parseInt(O.css("padding")), Y.nodeDimensionsIncludeLabels && (B.labelWidth = O.boundingBox({ includeLabels: !0, includeNodes: !1, includeOverlays: !1 }).w, B.labelHeight = O.boundingBox({ includeLabels: !0, includeNodes: !1, includeOverlays: !1 }).h, B.labelPosVertical = O.css("text-valign"), B.labelPosHorizontal = O.css("text-halign")), rt[O.data("id")] = B, isNaN(B.rect.x) && (B.rect.x = 0), isNaN(B.rect.y) && (B.rect.y = 0), H != null && H.length > 0) {
-                      var J = void 0;
-                      J = V.getGraphManager().add(V.newGraph(), B), W(J, H, V, Y);
+                      var Q = void 0;
+                      Q = V.getGraphManager().add(V.newGraph(), B), W(Q, H, V, Y);
                     }
                   }
                 }, y = function(x, q, V) {
@@ -3605,7 +3605,7 @@ function ur() {
                         }
                         M.quality == "default" || M.quality == "proof" ? (k.push(h(M, X[0])), t.relocateComponent(rt[0], k[0], M)) : t.relocateComponent(rt[0], X[0], M);
                       }
-                    var J = function(it, gt) {
+                    var Q = function(it, gt) {
                       if (M.quality == "default" || M.quality == "proof") {
                         typeof it == "number" && (it = gt);
                         var Tt = void 0, At = void 0, Dt = it.data("id");
@@ -3630,8 +3630,8 @@ function ur() {
                       var Rt = t.calcParentsWithoutChildren(P, K), Lt = K.filter(function(vt) {
                         return vt.css("display") == "none";
                       });
-                      M.eles = K.not(Lt), K.nodes().not(":parent").not(Lt).layoutPositions(S, M, J), Rt.length > 0 && Rt.forEach(function(vt) {
-                        vt.position(J(vt));
+                      M.eles = K.not(Lt), K.nodes().not(":parent").not(Lt).layoutPositions(S, M, Q), Rt.length > 0 && Rt.forEach(function(vt) {
+                        vt.position(Q(vt));
                       });
                     } else
                       console.log("If randomize option is set to false, then quality option must be 'default' or 'proof'.");
@@ -3647,19 +3647,19 @@ function ur() {
             (a, r, e) => {
               var f = e(548), i = e(140).layoutBase.Matrix, g = e(140).layoutBase.SVD, t = function(o) {
                 var c = o.cy, h = o.eles, T = h.nodes(), v = h.nodes(":parent"), d = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map(), M = [], P = [], K = [], X = [], k = [], D = [], rt = [], n = [], m = void 0, p = 1e8, E = 1e-9, y = o.piTol, I = o.samplingType, w = o.nodeSeparation, R = void 0, W = function() {
-                  for (var b = 0, $ = 0, Q = !1; $ < R; ) {
-                    b = Math.floor(Math.random() * m), Q = !1;
+                  for (var b = 0, $ = 0, J = !1; $ < R; ) {
+                    b = Math.floor(Math.random() * m), J = !1;
                     for (var Z = 0; Z < $; Z++)
                       if (X[Z] == b) {
-                        Q = !0;
+                        J = !0;
                         break;
                       }
-                    if (!Q)
+                    if (!J)
                       X[$] = b, $++;
                     else
                       continue;
                   }
-                }, x = function(b, $, Q) {
+                }, x = function(b, $, J) {
                   for (var Z = [], at = 0, ut = 0, ot = 0, tt = void 0, j = [], dt = 0, wt = 1, yt = 0; yt < m; yt++)
                     j[yt] = p;
                   for (Z[ut] = b, j[b] = 0; ut >= at; ) {
@@ -3668,7 +3668,7 @@ function ur() {
                       tt = N.get(It[ft]), j[tt] == p && (j[tt] = j[ot] + 1, Z[++ut] = tt);
                     D[ot][$] = j[ot] * w;
                   }
-                  if (Q) {
+                  if (J) {
                     for (var st = 0; st < m; st++)
                       D[st][$] < k[st] && (k[st] = D[st][$]);
                     for (var Ct = 0; Ct < m; Ct++)
@@ -3685,8 +3685,8 @@ function ur() {
                       X[at] = $, $ = x($, at, b);
                   } else {
                     W();
-                    for (var Q = 0; Q < R; Q++)
-                      x(X[Q], Q, b);
+                    for (var J = 0; J < R; J++)
+                      x(X[J], J, b);
                   }
                   for (var ut = 0; ut < m; ut++)
                     for (var ot = 0; ot < R; ot++)
@@ -3697,25 +3697,25 @@ function ur() {
                     for (var dt = 0; dt < R; dt++)
                       rt[j][dt] = D[X[dt]][j];
                 }, V = function() {
-                  for (var b = g.svd(rt), $ = b.S, Q = b.U, Z = b.V, at = $[0] * $[0] * $[0], ut = [], ot = 0; ot < R; ot++) {
+                  for (var b = g.svd(rt), $ = b.S, J = b.U, Z = b.V, at = $[0] * $[0] * $[0], ut = [], ot = 0; ot < R; ot++) {
                     ut[ot] = [];
                     for (var tt = 0; tt < R; tt++)
                       ut[ot][tt] = 0, ot == tt && (ut[ot][tt] = $[ot] / ($[ot] * $[ot] + at / ($[ot] * $[ot])));
                   }
-                  n = i.multMat(i.multMat(Z, ut), i.transpose(Q));
+                  n = i.multMat(i.multMat(Z, ut), i.transpose(J));
                 }, Y = function() {
-                  for (var b = void 0, $ = void 0, Q = [], Z = [], at = [], ut = [], ot = 0; ot < m; ot++)
-                    Q[ot] = Math.random(), Z[ot] = Math.random();
-                  Q = i.normalize(Q), Z = i.normalize(Z);
+                  for (var b = void 0, $ = void 0, J = [], Z = [], at = [], ut = [], ot = 0; ot < m; ot++)
+                    J[ot] = Math.random(), Z[ot] = Math.random();
+                  J = i.normalize(J), Z = i.normalize(Z);
                   for (var tt = E, j = E, dt = void 0; ; ) {
                     for (var wt = 0; wt < m; wt++)
-                      at[wt] = Q[wt];
-                    if (Q = i.multGamma(i.multL(i.multGamma(at), D, n)), b = i.dotProduct(at, Q), Q = i.normalize(Q), tt = i.dotProduct(at, Q), dt = Math.abs(tt / j), dt <= 1 + y && dt >= 1)
+                      at[wt] = J[wt];
+                    if (J = i.multGamma(i.multL(i.multGamma(at), D, n)), b = i.dotProduct(at, J), J = i.normalize(J), tt = i.dotProduct(at, J), dt = Math.abs(tt / j), dt <= 1 + y && dt >= 1)
                       break;
                     j = tt;
                   }
                   for (var yt = 0; yt < m; yt++)
-                    at[yt] = Q[yt];
+                    at[yt] = J[yt];
                   for (j = E; ; ) {
                     for (var It = 0; It < m; It++)
                       ut[It] = Z[It];
@@ -3735,8 +3735,8 @@ function ur() {
                 var O = !0, H = !1, B = void 0;
                 try {
                   for (var _ = d.keys()[Symbol.iterator](), lt; !(O = (lt = _.next()).done); O = !0) {
-                    var J = lt.value;
-                    N.set(J, et++);
+                    var Q = lt.value;
+                    N.set(Q, et++);
                   }
                 } catch (F) {
                   H = !0, B = F;
@@ -3753,9 +3753,9 @@ function ur() {
                 v.forEach(function(F) {
                   for (var b = F.children().intersection(h); b.nodes(":childless").length == 0; )
                     b = b.nodes()[0].children().intersection(h);
-                  var $ = 0, Q = b.nodes(":childless")[0].connectedEdges().length;
+                  var $ = 0, J = b.nodes(":childless")[0].connectedEdges().length;
                   b.nodes(":childless").forEach(function(Z, at) {
-                    Z.connectedEdges().length < Q && (Q = Z.connectedEdges().length, $ = at);
+                    Z.connectedEdges().length < J && (J = Z.connectedEdges().length, $ = at);
                   }), S.set(F.id(), b.nodes(":childless")[$].id());
                 }), T.forEach(function(F) {
                   var b = void 0;
@@ -3764,9 +3764,9 @@ function ur() {
                   });
                 });
                 var Lt = function(b) {
-                  var $ = N.get(b), Q = void 0;
+                  var $ = N.get(b), J = void 0;
                   d.get(b).forEach(function(Z) {
-                    c.getElementById(Z).isParent() ? Q = S.get(Z) : Q = Z, M[$].push(Q), M[N.get(Q)].push(b);
+                    c.getElementById(Z).isParent() ? J = S.get(Z) : J = Z, M[$].push(J), M[N.get(J)].push(b);
                   });
                 }, vt = !0, it = !1, gt = void 0;
                 try {
@@ -3872,14 +3872,14 @@ var Re = {
 }, "isArchitectureDirection"), zt = /* @__PURE__ */ nt(function(C) {
   const U = C;
   return U === "L" || U === "R";
-}, "isArchitectureDirectionX"), Qt = /* @__PURE__ */ nt(function(C) {
+}, "isArchitectureDirectionX"), Jt = /* @__PURE__ */ nt(function(C) {
   const U = C;
   return U === "T" || U === "B";
 }, "isArchitectureDirectionY"), Ce = /* @__PURE__ */ nt(function(C, U) {
-  const A = zt(C) && Qt(U), G = Qt(C) && zt(U);
+  const A = zt(C) && Jt(U), G = Jt(C) && zt(U);
   return A || G;
 }, "isArchitectureDirectionXY"), pr = /* @__PURE__ */ nt(function(C) {
-  const U = C[0], A = C[1], G = zt(U) && Qt(A), L = Qt(U) && zt(A);
+  const U = C[0], A = C[1], G = zt(U) && Jt(A), L = Jt(U) && zt(A);
   return G || L;
 }, "isArchitecturePairXY"), yr = /* @__PURE__ */ nt(function(C) {
   return C !== "LL" && C !== "RR" && C !== "TT" && C !== "BB";
@@ -3888,7 +3888,7 @@ var Re = {
   return yr(A) ? A : void 0;
 }, "getArchitectureDirectionPair"), Er = /* @__PURE__ */ nt(function([C, U], A) {
   const G = A[0], L = A[1];
-  return zt(G) ? Qt(L) ? [C + (G === "L" ? -1 : 1), U + (L === "T" ? 1 : -1)] : [C + (G === "L" ? -1 : 1), U] : zt(L) ? [C + (L === "L" ? 1 : -1), U + (G === "T" ? 1 : -1)] : [C, U + (G === "T" ? 1 : -1)];
+  return zt(G) ? Jt(L) ? [C + (G === "L" ? -1 : 1), U + (L === "T" ? 1 : -1)] : [C + (G === "L" ? -1 : 1), U] : zt(L) ? [C + (L === "L" ? 1 : -1), U + (G === "T" ? 1 : -1)] : [C, U + (G === "T" ? 1 : -1)];
 }, "shiftPositionByArchitectureDirectionPair"), mr = /* @__PURE__ */ nt(function(C) {
   return C === "LT" || C === "TL" ? [1, 1] : C === "BL" || C === "LB" ? [1, -1] : C === "BR" || C === "RB" ? [-1, -1] : [-1, 1];
 }, "getArchitectureDirectionXYFactors"), Tr = /* @__PURE__ */ nt(function(C, U) {
@@ -3897,7 +3897,7 @@ var Re = {
   return C.type === "service";
 }, "isArchitectureService"), Lr = /* @__PURE__ */ nt(function(C) {
   return C.type === "junction";
-}, "isArchitectureJunction"), Ue = /* @__PURE__ */ nt((C) => C.data(), "edgeData"), ne = /* @__PURE__ */ nt((C) => C.data(), "nodeData"), Ye = Je.architecture, pt = new lr(() => ({
+}, "isArchitectureJunction"), Ue = /* @__PURE__ */ nt((C) => C.data(), "edgeData"), ne = /* @__PURE__ */ nt((C) => C.data(), "nodeData"), Ye = Qe.architecture, pt = new lr(() => ({
   nodes: {},
   groups: {},
   edges: [],
@@ -4156,7 +4156,7 @@ var Gr = /* @__PURE__ */ nt((C, U) => {
         '<path d="m65,47.5c0,2.76-2.24,5-5,5H20c-2.76,0-5-2.24-5-5,0-1.87,1.03-3.51,2.56-4.36-.04-.21-.06-.42-.06-.64,0-2.6,2.48-4.74,5.65-4.97,1.65-4.51,6.34-7.76,11.85-7.76.86,0,1.69.08,2.5.23,2.09-1.57,4.69-2.5,7.5-2.5,6.1,0,11.19,4.38,12.28,10.17,2.14.56,3.72,2.51,3.72,4.83,0,.03,0,.07-.01.1,2.29.46,4.01,2.48,4.01,4.9Z" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/>'
       )
     },
-    unknown: Qe,
+    unknown: Je,
     blank: {
       body: ae("")
     }
@@ -4184,11 +4184,11 @@ var Gr = /* @__PURE__ */ nt((C, U) => {
       if (i && (zt(e) ? h += e === "L" ? -M : M : T += e === "T" ? -M : M + 18), o && (zt(t) ? N += t === "L" ? -M : M : S += t === "T" ? -M : M + 18), !i && ((P = le.getNode(r)) == null ? void 0 : P.type) === "junction" && (zt(e) ? h += e === "L" ? L : -L : T += e === "T" ? L : -L), !o && ((K = le.getNode(g)) == null ? void 0 : K.type) === "junction" && (zt(t) ? N += t === "L" ? L : -L : S += t === "T" ? L : -L), a[0]._private.rscratch) {
         const X = C.insert("g");
         if (X.insert("path").attr("d", `M ${h},${T} L ${v},${d} L${N},${S} `).attr("class", "edge"), f) {
-          const k = zt(e) ? he[e](h, u) : h - l, D = Qt(e) ? he[e](T, u) : T - l;
+          const k = zt(e) ? he[e](h, u) : h - l, D = Jt(e) ? he[e](T, u) : T - l;
           X.insert("polygon").attr("points", Se[e](u)).attr("transform", `translate(${k},${D})`).attr("class", "arrow");
         }
         if (s) {
-          const k = zt(t) ? he[t](N, u) : N - l, D = Qt(t) ? he[t](S, u) : S - l;
+          const k = zt(t) ? he[t](N, u) : N - l, D = Jt(t) ? he[t](S, u) : S - l;
           X.insert("polygon").attr("points", Se[t](u)).attr("transform", `translate(${k},${D})`).attr("class", "arrow");
         }
         if (c) {
@@ -4609,7 +4609,7 @@ function Ze(C, U, A, G, L, { spatialMaps: u, groupAlignments: l }) {
         if ((s = o.data) != null && s.call(o)) {
           const { x: c, y: h } = o.source().position(), { x: T, y: v } = o.target().position();
           if (c !== T && h !== v) {
-            const d = o.sourceEndpoint(), N = o.targetEndpoint(), { sourceDir: S } = Ue(o), [M, P] = Qt(S) ? [d.x, N.y] : [N.x, d.y], { weights: K, distances: X } = t(d, N, M, P);
+            const d = o.sourceEndpoint(), N = o.targetEndpoint(), { sourceDir: S } = Ue(o), [M, P] = Jt(S) ? [d.x, N.y] : [N.x, d.y], { weights: K, distances: X } = t(d, N, M, P);
             o.style("segment-distances", X), o.style("segment-weights", K);
           }
         }