@marimo-team/islands 0.16.0 → 0.16.2

package/dist/{treemap-75Q7IDZK-Dy3GswCD.js → treemap-75Q7IDZK-LMXGKln_.js}

@@ -2,11 +2,11 @@ var __defProp = Object.defineProperty;
 var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
 var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
 var _a2, _b, _c2, _d2, _e, _f2, _g, _h2, _i2, _j, _k, _l2, _m2, _n2, _o2, _p2, _q;
-import { dY as Kl, bO as Vl, al as Ma, aT as Hl, u as _t, aO as Wl, ao as Q, bk as jl, bl as zl, k as ql, n as Ni, m as Da, am as Qs, dZ as Fa, aK as Yl, b0 as Ga, d_ as Ua, aM as Xl, b2 as wi, an as Jl, d$ as Zl, bg as Ql, e0 as eu, aP as Ie, q as vt, ar as _i, b3 as tu, e1 as H, e2 as Re } from "./main-mtVsqZY6.js";
-import { g as ei, d as bt, k as nu, v as W, l as Ba, m as ru, n as su, a as Ka, c as x, i as qe, r as ae, f as ke, o as z } from "./_baseUniq-DQHjMSO_.js";
-import { m as k, f as Lt, h as I, e as ti, l as Ot, d as iu } from "./min-BLUnrJi8.js";
-import { ad as P } from "./mermaid-DUnuxwY7.js";
-import { c as te } from "./clone-B3q5i6e_.js";
+import { d_ as Kl, bQ as Vl, al as Ma, aT as Hl, u as _t, aO as Wl, ao as Z, bk as jl, bl as zl, k as ql, n as Ni, m as Da, am as Zs, d$ as Fa, aK as Yl, b0 as Ga, e0 as Ua, aM as Xl, b2 as wi, an as Jl, e1 as Ql, bg as Zl, e2 as eu, aP as Ie, q as vt, ar as _i, b3 as tu, e3 as H, e4 as Re } from "./main-pE28kbH0.js";
+import { g as ei, d as bt, k as nu, v as W, l as Ba, m as ru, n as su, a as Ka, c as x, i as qe, r as ae, f as ke, o as z } from "./_baseUniq-BykZEXIq.js";
+import { m as k, f as Lt, h as I, e as ti, l as Ot, d as iu } from "./min-DmsBJf5S.js";
+import { ad as P } from "./mermaid-BGd7kEsf.js";
+import { c as te } from "./clone-CDDiMerE.js";
 var au = Object.prototype, ou = au.hasOwnProperty, Ee = Kl(function(n, e) {
   if (Vl(e) || Ma(e)) {
     Hl(e, _t(e), n);
@@ -36,7 +36,7 @@ function uu(n, e, t, r) {
 }
 function cu(n, e) {
   return function(t, r) {
-    var s = Q(t) ? lu : uu, i = e ? e() : {};
+    var s = Z(t) ? lu : uu, i = e ? e() : {};
     return s(t, n, bt(r), i);
   };
 }
@@ -63,11 +63,11 @@ var Gr = ql(function(n, e) {
 });
 function X(n, e, t) {
   var r = n == null ? 0 : n.length;
-  return r ? (e = e === void 0 ? 1 : Qs(e), Fa(n, e < 0 ? 0 : e, r)) : [];
+  return r ? (e = e === void 0 ? 1 : Zs(e), Fa(n, e < 0 ? 0 : e, r)) : [];
 }
 function xn(n, e, t) {
   var r = n == null ? 0 : n.length;
-  return r ? (e = e === void 0 ? 1 : Qs(e), e = r - e, Fa(n, 0, e < 0 ? 0 : e)) : [];
+  return r ? (e = e === void 0 ? 1 : Zs(e), e = r - e, Fa(n, 0, e < 0 ? 0 : e)) : [];
 }
 function hu(n, e) {
   for (var t = -1, r = n == null ? 0 : n.length; ++t < r; )
@@ -82,7 +82,7 @@ function pu(n, e) {
   }), t;
 }
 function Oe(n, e, t) {
-  var r = Q(n) ? hu : pu;
+  var r = Z(n) ? hu : pu;
   return r(n, bt(e));
 }
 function Pe(n) {
@@ -95,11 +95,11 @@ var mu = Object.prototype, gu = mu.hasOwnProperty, yu = cu(function(n, e, t) {
   gu.call(n, t) ? n[t].push(e) : Yl(n, t, [e]);
 }), Tu = "[object String]";
 function de(n) {
-  return typeof n == "string" || !Q(n) && Ga(n) && Ua(n) == Tu;
+  return typeof n == "string" || !Z(n) && Ga(n) && Ua(n) == Tu;
 }
 var Ru = Math.max;
 function ue(n, e, t, r) {
-  n = Ma(n) ? n : W(n), t = t ? Qs(t) : 0;
+  n = Ma(n) ? n : W(n), t = t ? Zs(t) : 0;
   var s = n.length;
   return t < 0 && (t = Ru(s + t, 0)), de(n) ? t <= s && n.indexOf(e, t) > -1 : !!s && Ba(n, e, t) > -1;
 }
@@ -139,12 +139,12 @@ function be(n, e) {
   var t = Jl(ru(n), function(r) {
     return [r];
   });
-  return e = bt(e), Zl(n, t, function(r, s) {
+  return e = bt(e), Ql(n, t, function(r, s) {
     return e(r, s[0]);
   });
 }
 function Ur(n, e) {
-  var t = Q(n) ? Ql : su;
+  var t = Z(n) ? Zl : su;
   return t(n, ku(bt(e)));
 }
 function $u(n, e) {
@@ -154,7 +154,7 @@ function $u(n, e) {
   }), !!t;
 }
 function Va(n, e, t) {
-  var r = Q(n) ? eu : $u;
+  var r = Z(n) ? eu : $u;
   return r(n, bt(e));
 }
 function ni(n) {
@@ -483,7 +483,7 @@ function Ar(n) {
 }
 const Iu = new J(() => {
 }, () => Te), Te = Object.freeze({ done: true, value: void 0 });
-function Z(...n) {
+function Q(...n) {
   if (n.length === 1) {
     const e = n[0];
     if (e instanceof J)
@@ -689,17 +689,17 @@ const Wn = "ReferenceType", or = "ReturnType";
 function Bu(n) {
   return O.isInstance(n, or);
 }
-const Zt = "SimpleType";
+const Qt = "SimpleType";
 function Ku(n) {
-  return O.isInstance(n, Zt);
+  return O.isInstance(n, Qt);
 }
 const jn = "StringLiteral", xt = "TerminalRule";
 function At(n) {
   return O.isInstance(n, xt);
 }
-const Qt = "Type";
+const Zt = "Type";
 function Xa(n) {
-  return O.isInstance(n, Qt);
+  return O.isInstance(n, Zt);
 }
 const as = "TypeAttribute", zn = "UnionType", en = "Action";
 function Br(n) {
@@ -758,7 +758,7 @@ function Yu(n) {
   return O.isInstance(n, pn);
 }
 const mn = "UnorderedGroup";
-function Za(n) {
+function Qa(n) {
   return O.isInstance(n, mn);
 }
 const gn = "UntilToken";
@@ -769,9 +769,9 @@ const yn = "Wildcard";
 function Ju(n) {
   return O.isInstance(n, yn);
 }
-class Qa extends Ha {
+class Za extends Ha {
   getAllTypes() {
-    return [Vt, Fn, Gn, en, tn, Un, Bn, nn, Ht, rn, ns, Wt, sn, jt, an, Kn, ss, on, zt, qt, ln, is, un, Yt, Vn, Hn, Xt, Jt, Wn, cn, or, dn, Zt, jn, fn, hn, xt, pn, Qt, as, bi, zn, mn, gn, rs, yn];
+    return [Vt, Fn, Gn, en, tn, Un, Bn, nn, Ht, rn, ns, Wt, sn, jt, an, Kn, ss, on, zt, qt, ln, is, un, Yt, Vn, Hn, Xt, Jt, Wn, cn, or, dn, Qt, jn, fn, hn, xt, pn, Zt, as, bi, zn, mn, gn, rs, yn];
   }
   computeIsSubtype(e, t) {
     switch (e) {
@@ -799,7 +799,7 @@ class Qa extends Ha {
         return this.isSubtype(rs, t);
       case Bn:
       case Wn:
-      case Zt:
+      case Qt:
       case zn:
         return this.isSubtype(bi, t);
       case Ht:
@@ -811,7 +811,7 @@ class Qa extends Ha {
         return this.isSubtype(ns, t);
       case zt:
       case qt:
-      case Qt:
+      case Zt:
         return this.isSubtype(Gn, t);
       case Jt:
         return this.isSubtype(Fn, t) || this.isSubtype(Gn, t);
@@ -998,9 +998,9 @@ class Qa extends Ha {
             { name: "name" }
           ]
         };
-      case Zt:
+      case Qt:
         return {
-          name: Zt,
+          name: Qt,
           properties: [
             { name: "primitiveType" },
             { name: "stringType" },
@@ -1025,9 +1025,9 @@ class Qa extends Ha {
             { name: "type" }
           ]
         };
-      case Qt:
+      case Zt:
         return {
-          name: Qt,
+          name: Zt,
           properties: [
             { name: "name" },
             { name: "type" }
@@ -1219,8 +1219,8 @@ class Qa extends Ha {
     }
   }
 }
-const O = new Qa();
-function Zu(n) {
+const O = new Za();
+function Qu(n) {
   for (const [e, t] of Object.entries(n))
     e.startsWith("$") || (Array.isArray(t) ? t.forEach((r, s) => {
       se(r) && (r.$container = n, r.$containerProperty = e, r.$containerIndex = s);
@@ -1234,7 +1234,7 @@ function Kr(n, e) {
     t = t.$container;
   }
 }
-function Ze(n) {
+function Qe(n) {
   const t = Os(n).$document;
   if (!t)
     throw new Error("AST node has no document.");
@@ -1318,7 +1318,7 @@ function eo(n) {
     return Te;
   });
 }
-function Qu(n, e) {
+function Zu(n, e) {
   const t = n.getTypeMetaData(e.$type), r = e;
   for (const s of t.properties)
     s.defaultValue !== void 0 && r[s.name] === void 0 && (r[s.name] = to(s.defaultValue));
@@ -2983,7 +2983,7 @@ function Ms(n, e, t) {
                   for (let c = u.from; c <= u.to && c < Rn; c++)
                     Yn(c, e, t);
                   if (u.to >= Rn) {
-                    const c = u.from >= Rn ? u.from : Rn, d = u.to, f = Qe(c), h = Qe(d);
+                    const c = u.from >= Rn ? u.from : Rn, d = u.to, f = Ze(c), h = Ze(d);
                     for (let p = f; p <= h; p++)
                       e[p] = p;
                   }
@@ -3015,18 +3015,18 @@ function Ms(n, e, t) {
   return W(e);
 }
 function Yn(n, e, t) {
-  const r = Qe(n);
+  const r = Ze(n);
   e[r] = r, t === true && Bc(n, e);
 }
 function Bc(n, e) {
   const t = String.fromCharCode(n), r = t.toUpperCase();
   if (r !== t) {
-    const s = Qe(r.charCodeAt(0));
+    const s = Ze(r.charCodeAt(0));
     e[s] = s;
   } else {
     const s = t.toLowerCase();
     if (s !== t) {
-      const i = Qe(s.charCodeAt(0));
+      const i = Ze(s.charCodeAt(0));
       e[i] = i;
     }
   }
@@ -3043,7 +3043,7 @@ function Ui(n, e) {
 }
 function Ds(n) {
   const e = n.quantifier;
-  return e && e.atLeast === 0 ? true : n.value ? Q(n.value) ? Oe(n.value, Ds) : Ds(n.value) : false;
+  return e && e.atLeast === 0 ? true : n.value ? Z(n.value) ? Oe(n.value, Ds) : Ds(n.value) : false;
 }
 class Kc extends Vr {
   constructor(e) {
@@ -3153,7 +3153,7 @@ function Vc(n, e) {
     }), l = k(r, (A) => {
       const T = A.LONGER_ALT;
       if (T)
-        return Q(T) ? k(T, (b) => Li(r, b)) : [Li(r, T)];
+        return Z(T) ? k(T, (b) => Li(r, b)) : [Li(r, T)];
     }), u = k(r, (A) => A.PUSH_MODE), c = k(r, (A) => I(A, "POP_MODE"));
   });
   let d;
@@ -3183,12 +3183,12 @@ function Vc(n, e) {
   return e.safeMode || t("First Char Optimization", () => {
     y = ae(r, (A, T, C) => {
       if (typeof T.PATTERN == "string") {
-        const b = T.PATTERN.charCodeAt(0), ne = Qe(b);
+        const b = T.PATTERN.charCodeAt(0), ne = Ze(b);
         cs(A, ne, m[C]);
-      } else if (Q(T.START_CHARS_HINT)) {
+      } else if (Z(T.START_CHARS_HINT)) {
         let b;
         x(T.START_CHARS_HINT, (ne) => {
-          const we = typeof ne == "string" ? ne.charCodeAt(0) : ne, me = Qe(we);
+          const we = typeof ne == "string" ? ne.charCodeAt(0) : ne, me = Ze(we);
           b !== me && (b = me, cs(A, me, m[C]));
         });
       } else if (Ye(T.PATTERN))
@@ -3227,7 +3227,7 @@ function Hc(n, e) {
 function Wc(n) {
   let e = [];
   const t = ke(n, (r) => Ye(r[yt]));
-  return e = e.concat(Yc(t)), e = e.concat(Zc(t)), e = e.concat(Qc(t)), e = e.concat(ed(t)), e = e.concat(Xc(t)), e;
+  return e = e.concat(Yc(t)), e = e.concat(Qc(t)), e = e.concat(Zc(t)), e = e.concat(ed(t)), e = e.concat(Xc(t)), e;
 }
 function jc(n) {
   const e = ke(n, (s) => !I(s, yt)), t = k(e, (s) => ({
@@ -3284,7 +3284,7 @@ function Xc(n) {
   }));
 }
 const Jc = /[^\\[][\^]|^\^/;
-function Zc(n) {
+function Qc(n) {
   class e extends Vr {
     constructor() {
       super(...arguments), this.found = false;
@@ -3310,7 +3310,7 @@ function Zc(n) {
     tokenTypes: [s]
   }));
 }
-function Qc(n) {
+function Zc(n) {
   const e = ke(n, (r) => {
     const s = r[yt];
     return s instanceof RegExp && (s.multiline || s.global);
@@ -3438,7 +3438,7 @@ function ad(n, e, t) {
           type: K.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
         });
       else if (I(a, "LONGER_ALT")) {
-        const l = Q(a.LONGER_ALT) ? a.LONGER_ALT : [a.LONGER_ALT];
+        const l = Z(a.LONGER_ALT) ? a.LONGER_ALT : [a.LONGER_ALT];
         x(l, (u) => {
           !qe(u) && !ue(s, u) && r.push({
             message: `A MultiMode Lexer cannot be initialized with a longer_alt <${u.name}> on token <${a.name}> outside of mode <${i}>
@@ -3478,7 +3478,7 @@ function ld(n) {
   const e = {}, t = _t(n);
   return x(t, (r) => {
     const s = n[r];
-    if (Q(s))
+    if (Z(s))
       e[r] = [];
     else
       throw Error("non exhaustive match");
@@ -3555,7 +3555,7 @@ function cs(n, e, t) {
 }
 const Rn = 256;
 let cr = [];
-function Qe(n) {
+function Ze(n) {
   return n < Rn ? n : cr[n];
 }
 function fd() {
@@ -3591,7 +3591,7 @@ function hd(n) {
 }
 function pd(n) {
   x(n, (e) => {
-    Eo(e) || (vo[Vi] = e, e.tokenTypeIdx = Vi++), Hi(e) && !Q(e.CATEGORIES) && (e.CATEGORIES = [e.CATEGORIES]), Hi(e) || (e.CATEGORIES = []), yd(e) || (e.categoryMatches = []), Td(e) || (e.categoryMatchesMap = {});
+    Eo(e) || (vo[Vi] = e, e.tokenTypeIdx = Vi++), Hi(e) && !Z(e.CATEGORIES) && (e.CATEGORIES = [e.CATEGORIES]), Hi(e) || (e.CATEGORIES = []), yd(e) || (e.categoryMatches = []), Td(e) || (e.categoryMatchesMap = {});
   });
 }
 function md(n) {
@@ -3681,7 +3681,7 @@ a boolean 2nd argument is no longer supported`);
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS`);
         if (t.safeMode && t.ensureOptimizations)
           throw Error('"safeMode" and "ensureOptimizations" flags are mutually exclusive.');
-        this.trackStartLines = /full|onlyStart/i.test(this.config.positionTracking), this.trackEndLines = /full/i.test(this.config.positionTracking), Q(e) ? s = {
+        this.trackStartLines = /full|onlyStart/i.test(this.config.positionTracking), this.trackEndLines = /full/i.test(this.config.positionTracking), Z(e) ? s = {
           modes: { defaultMode: te(e) },
           defaultMode: Tn
         } : (i = false, s = te(e));
@@ -3770,7 +3770,7 @@ a boolean 2nd argument is no longer supported`);
       return L;
     }
     function ut(re) {
-      const xe = Qe(re), St = _[xe];
+      const xe = Ze(re), St = _[xe];
       return St === void 0 ? ge : St;
     }
     const Bl = (re) => {
@@ -3936,7 +3936,7 @@ function wt(n) {
 function ko(n) {
   return de(n.LABEL) && n.LABEL !== "";
 }
-const vd = "parent", Wi = "categories", ji = "label", zi = "group", qi = "push_mode", Yi = "pop_mode", Xi = "longer_alt", Ji = "line_breaks", Zi = "start_chars_hint";
+const vd = "parent", Wi = "categories", ji = "label", zi = "group", qi = "push_mode", Yi = "pop_mode", Xi = "longer_alt", Ji = "line_breaks", Qi = "start_chars_hint";
 function $o(n) {
   return Ad(n);
 }
@@ -3945,7 +3945,7 @@ function Ad(n) {
   if (t.name = n.name, qe(e) || (t.PATTERN = e), I(n, vd))
     throw `The parent property is no longer supported.
 See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346 for details.`;
-  return I(n, Wi) && (t.CATEGORIES = n[Wi]), bn([t]), I(n, ji) && (t.LABEL = n[ji]), I(n, zi) && (t.GROUP = n[zi]), I(n, Yi) && (t.POP_MODE = n[Yi]), I(n, qi) && (t.PUSH_MODE = n[qi]), I(n, Xi) && (t.LONGER_ALT = n[Xi]), I(n, Ji) && (t.LINE_BREAKS = n[Ji]), I(n, Zi) && (t.START_CHARS_HINT = n[Zi]), t;
+  return I(n, Wi) && (t.CATEGORIES = n[Wi]), bn([t]), I(n, ji) && (t.LABEL = n[ji]), I(n, zi) && (t.GROUP = n[zi]), I(n, Yi) && (t.POP_MODE = n[Yi]), I(n, qi) && (t.PUSH_MODE = n[qi]), I(n, Xi) && (t.LONGER_ALT = n[Xi]), I(n, Ji) && (t.LINE_BREAKS = n[Ji]), I(n, Qi) && (t.START_CHARS_HINT = n[Qi]), t;
 }
 const et = $o({ name: "EOF", pattern: ce.NA });
 bn([et]);
@@ -4158,7 +4158,7 @@ class xd extends zr {
       super.walkMany(e, t, r);
   }
 }
-class Qi extends zr {
+class Zi extends zr {
   walkManySep(e, t, r) {
     if (e.idx === this.occurrence) {
       const s = Pe(t.concat(r));
@@ -4984,7 +4984,7 @@ function Jd(n, e, t) {
     }
   }), r;
 }
-function Zd(n) {
+function Qd(n) {
   const e = ti(n, {
     errMsgProvider: Ed
   }), t = {};
@@ -4992,7 +4992,7 @@ function Zd(n) {
     t[r.name] = r;
   }), kd(t, e.errMsgProvider);
 }
-function Qd(n) {
+function Zd(n) {
   return n = ti(n, {
     errMsgProvider: ht
   }), Fd(n.rules, n.tokenTypes, n.errMsgProvider, n.grammarName);
@@ -5368,7 +5368,7 @@ function mf(n, e) {
   Bo(t, n + "BaseSemantics");
   const r = {
     visit: function(s, i) {
-      if (Q(s) && (s = s[0]), !qe(s))
+      if (Z(s) && (s = s[0]), !qe(s))
         return this[s.name](s.children, i);
     },
     validateVisitor: function() {
@@ -5871,7 +5871,7 @@ class Ef {
       throw Error(`The Parser's configuration can no longer contain a <serializedGrammar> property.
 	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0
 	For Further details.`);
-    if (Q(e)) {
+    if (Z(e)) {
       if (P(e))
         throw Error(`A Token Vocabulary cannot be empty.
 	Note that the first argument for the parser constructor
@@ -5881,7 +5881,7 @@ class Ef {
 	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_4-0-0
 	For Further details.`);
     }
-    if (Q(e))
+    if (Z(e))
       this.tokensMap = ae(e, (i, a) => (i[a.name] = a, i), {});
     else if (I(e, "modes") && Oe(Ie(W(e.modes)), Rd)) {
       const i = Ie(W(e.modes)), a = ni(i);
@@ -6060,8 +6060,8 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
         i,
         o,
         s,
-        Qi
-      ], o, Vs, e, Qi);
+        Zi
+      ], o, Vs, e, Zi);
     }
   }
   repetitionSepSecondInternal(e, t, r, s, i) {
@@ -6080,7 +6080,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     return e.call(this), this.getLexerPosition() > t;
   }
   orInternal(e, t) {
-    const r = this.getKeyForAutomaticLookahead(Go, t), s = Q(e) ? e : e.DEF, a = this.getLaFuncFromCache(r).call(this, s);
+    const r = this.getKeyForAutomaticLookahead(Go, t), s = Z(e) ? e : e.DEF, a = this.getLaFuncFromCache(r).call(this, s);
     if (a !== void 0)
       return s[a].ALT.call(this);
     this.raiseNoAltException(t, e.ERR_MSG);
@@ -6394,7 +6394,7 @@ function Bt(n, e, t, r = false) {
 }
 function xf(n, e) {
   Nr(e);
-  const t = Ot(this.recordingProdStack), r = Q(n) === false, s = r === false ? n : n.DEF, i = new pe({
+  const t = Ot(this.recordingProdStack), r = Z(n) === false, s = r === false ? n : n.DEF, i = new pe({
     definition: [],
     idx: e,
     ignoreAmbiguities: r && n.IGNORE_AMBIGUITIES === true
@@ -6504,12 +6504,12 @@ class Mn {
       });
       let r = [];
       if (this.TRACE_INIT("Grammar Resolving", () => {
-        r = Zd({
+        r = Qd({
           rules: W(this.gastProductionsCache)
         }), this.definitionErrors = this.definitionErrors.concat(r);
       }), this.TRACE_INIT("Grammar Validations", () => {
         if (P(r) && this.skipValidations === false) {
-          const s = Qd({
+          const s = Zd({
             rules: W(this.gastProductionsCache),
             tokenTypes: W(this.tokensMap),
             errMsgProvider: ht,
@@ -6857,7 +6857,7 @@ function Xf(n, e) {
     }, t[s] = i), i;
   };
 }
-class Zo {
+class Qo {
   constructor() {
     this.predicates = [];
   }
@@ -6875,14 +6875,14 @@ class Zo {
     return e;
   }
 }
-const ua = new Zo();
+const ua = new Qo();
 class Jf extends gi {
   constructor(e) {
     var t;
     super(), this.logging = (t = e == null ? void 0 : e.logging) !== null && t !== void 0 ? t : ((r) => console.log(r));
   }
   initialize(e) {
-    this.atn = Mf(e.rules), this.dfas = Zf(this.atn);
+    this.atn = Mf(e.rules), this.dfas = Qf(this.atn);
   }
   validateAmbiguousAlternationAlternatives() {
     return [];
@@ -6917,7 +6917,7 @@ class Jf extends gi {
         return f[h.tokenTypeIdx];
       };
     } else return s ? function(f) {
-      const h = new Zo(), p = f === void 0 ? 0 : f.length;
+      const h = new Qo(), p = f === void 0 ? 0 : f.length;
       for (let v = 0; v < p; v++) {
         const y = f == null ? void 0 : f[v].GATE;
         h.set(v, y === void 0 || y.call(this));
@@ -6980,7 +6980,7 @@ function ca(n, e = true) {
   }
   return true;
 }
-function Zf(n) {
+function Qf(n) {
   const e = n.decisionStates.length, t = Array(e);
   for (let r = 0; r < e; r++)
     t[r] = Xf(n.decisionStates[r], r);
@@ -6991,11 +6991,11 @@ function ps(n, e, t, r) {
   let i = s.start;
   if (i === void 0) {
     const o = uh(s.atnStartState);
-    i = el(s, Qo(o)), s.start = i;
+    i = el(s, Zo(o)), s.start = i;
   }
-  return Qf.apply(this, [s, i, t, r]);
+  return Zf.apply(this, [s, i, t, r]);
 }
-function Qf(n, e, t, r) {
+function Zf(n, e, t, r) {
   let s = e, i = 1;
   const a = [];
   let o = this.LA(i++);
@@ -7012,7 +7012,7 @@ function eh(n, e, t, r, s, i) {
   const a = ah(e.configs, t, s);
   if (a.size === 0)
     return da(n, e, t, Lr), Lr;
-  let o = Qo(a);
+  let o = Zo(a);
   const l = lh(a, s);
   if (l !== void 0)
     o.isAcceptState = true, o.prediction = l, o.configs.uniqueAlt = l;
@@ -7117,7 +7117,7 @@ function lh(n, e) {
     }
   return t;
 }
-function Qo(n) {
+function Zo(n) {
   return {
     configs: n,
     edges: {},
@@ -7563,7 +7563,7 @@ class Th extends sl {
     if (this.isRecording())
       return;
     const e = this.current;
-    return Zu(e), this.nodeBuilder.construct(e), this.stack.pop(), ms(e) ? this.converter.convert(e.value, e.$cstNode) : (Qu(this.astReflection, e), e);
+    return Qu(e), this.nodeBuilder.construct(e), this.stack.pop(), ms(e) ? this.converter.convert(e.value, e.$cstNode) : (Zu(this.astReflection, e), e);
   }
   getAssignment(e) {
     if (!this.assignmentMap.has(e)) {
@@ -7741,7 +7741,7 @@ function al(n, e, t) {
   }, n), e;
 }
 function kh(n, e) {
-  const t = ro(e, false), r = Z(e.rules).filter(Ne).filter((s) => t.has(s));
+  const t = ro(e, false), r = Q(e.rules).filter(Ne).filter((s) => t.has(s));
   for (const s of r) {
     const i = Object.assign(Object.assign({}, n), { consume: 1, optional: 1, subrule: 1, many: 1, or: 1 });
     n.parser.rule(s, Tt(i, s.definition));
@@ -7761,7 +7761,7 @@ function Tt(n, e, t = false) {
     r = Sh(n, e);
   else if (Ja(e))
     r = xh(n, e);
-  else if (Za(e))
+  else if (Qa(e))
     r = Ih(n, e);
   else if (ii(e))
     r = Nh(n, e);
@@ -7978,7 +7978,7 @@ function _h(n, e) {
   {
     let t = e, r = t.$container, s = e.$type;
     for (; !Ne(r); )
-      (ii(r) || Ja(r) || Za(r)) && (s = r.elements.indexOf(t).toString() + ":" + s), t = r, r = r.$container;
+      (ii(r) || Ja(r) || Qa(r)) && (s = r.elements.indexOf(t).toString() + ":" + s), t = r, r = r.$container;
     return s = r.name + ":" + s, n.ruleNames.set(e, s), s;
   }
 }
@@ -8005,7 +8005,7 @@ class cl {
     this.diagnostics = [];
   }
   buildTokens(e, t) {
-    const r = Z(ro(e, false)), s = this.buildTerminalTokens(r), i = this.buildKeywordTokens(r, s, t);
+    const r = Q(ro(e, false)), s = this.buildTerminalTokens(r), i = this.buildKeywordTokens(r, s, t);
     return s.forEach((a) => {
       const o = a.PATTERN;
       typeof o == "object" && o && "test" in o && Ps(o) ? i.unshift(a) : i.push(a);
@@ -8154,10 +8154,10 @@ var Ve;
   }
   n.convertBoolean = l;
 })(Ve || (Ve = {}));
-var dt = {}, Zn = {}, ha;
+var dt = {}, Qn = {}, ha;
 function fl() {
-  if (ha) return Zn;
-  ha = 1, Object.defineProperty(Zn, "__esModule", { value: true });
+  if (ha) return Qn;
+  ha = 1, Object.defineProperty(Qn, "__esModule", { value: true });
   let n;
   function e() {
     if (n === void 0)
@@ -8171,7 +8171,7 @@ function fl() {
       n = s;
     }
     t.install = r;
-  })(e || (e = {})), Zn.default = e, Zn;
+  })(e || (e = {})), Qn.default = e, Qn;
 }
 var Y = {}, pa;
 function bh() {
@@ -8356,7 +8356,7 @@ function Gh() {
   return hr = performance.now(), new G.CancellationTokenSource();
 }
 const br = Symbol("OperationCancelled");
-function Zr(n) {
+function Qr(n) {
   return n === br;
 }
 async function ve(n) {
@@ -8984,7 +8984,7 @@ class Kh {
     this.documentMap = /* @__PURE__ */ new Map(), this.langiumDocumentFactory = e.workspace.LangiumDocumentFactory, this.serviceRegistry = e.ServiceRegistry;
   }
   get all() {
-    return Z(this.documentMap.values());
+    return Q(this.documentMap.values());
   }
   addDocument(e) {
     const t = e.uri.toString();
@@ -9173,12 +9173,12 @@ class jh {
       i && r.push(i);
     }
     let s = this.index.findAllReferences(e, this.nodeLocator.getAstNodePath(e));
-    return t.documentUri && (s = s.filter((i) => nt.equals(i.sourceUri, t.documentUri))), r.push(...s), Z(r);
+    return t.documentUri && (s = s.filter((i) => nt.equals(i.sourceUri, t.documentUri))), r.push(...s), Q(r);
   }
   getReferenceToSelf(e) {
     const t = this.nameProvider.getNameNode(e);
     if (t) {
-      const r = Ze(e), s = this.nodeLocator.getAstNodePath(e);
+      const r = Qe(e), s = this.nodeLocator.getAstNodePath(e);
       return {
         sourceUri: r.uri,
         sourcePath: s,
@@ -9200,7 +9200,7 @@ class Mr {
    * The total number of values in the multimap.
    */
   get size() {
-    return ws.sum(Z(this.map.values()).map((e) => e.length));
+    return ws.sum(Q(this.map.values()).map((e) => e.length));
   }
   /**
    * Clear all entries in the multimap.
@@ -9281,25 +9281,25 @@ class Mr {
    * Returns a stream of key, value pairs for every entry in the map.
    */
   entries() {
-    return Z(this.map.entries()).flatMap(([e, t]) => t.map((r) => [e, r]));
+    return Q(this.map.entries()).flatMap(([e, t]) => t.map((r) => [e, r]));
   }
   /**
    * Returns a stream of keys in the map.
    */
   keys() {
-    return Z(this.map.keys());
+    return Q(this.map.keys());
   }
   /**
    * Returns a stream of values in the map.
    */
   values() {
-    return Z(this.map.values()).flat();
+    return Q(this.map.values()).flat();
   }
   /**
    * Returns a stream of key, value set pairs for every key in the map.
    */
   entriesGroupedByKey() {
-    return Z(this.map.entries());
+    return Q(this.map.entries());
   }
 }
 class Ta {
@@ -9415,7 +9415,7 @@ class qh {
       return this.outerScope.getElement(e);
   }
   getAllElements() {
-    let e = Z(this.elements.values());
+    let e = Q(this.elements.values());
     return this.outerScope && (e = e.concat(this.outerScope.getAllElements())), e;
   }
 }
@@ -9516,17 +9516,17 @@ class Jh extends Yh {
     }));
   }
 }
-class Zh {
+class Qh {
   constructor(e) {
     this.reflection = e.shared.AstReflection, this.nameProvider = e.references.NameProvider, this.descriptions = e.workspace.AstNodeDescriptionProvider, this.indexManager = e.shared.workspace.IndexManager, this.globalScopeCache = new Jh(e.shared);
   }
   getScope(e) {
-    const t = [], r = this.reflection.getReferenceType(e), s = Ze(e.container).precomputedScopes;
+    const t = [], r = this.reflection.getReferenceType(e), s = Qe(e.container).precomputedScopes;
     if (s) {
       let a = e.container;
       do {
         const o = s.get(a);
-        o.length > 0 && t.push(Z(o).filter((l) => this.reflection.isSubtype(l.type, r))), a = a.$container;
+        o.length > 0 && t.push(Q(o).filter((l) => this.reflection.isSubtype(l.type, r))), a = a.$container;
       } while (a);
     }
     let i = this.getGlobalScope(r, e);
@@ -9538,14 +9538,14 @@ class Zh {
    * Create a scope for the given collection of AST node descriptions.
    */
   createScope(e, t, r) {
-    return new Ra(Z(e), t, r);
+    return new Ra(Q(e), t, r);
   }
   /**
    * Create a scope for the given collection of AST nodes, which need to be transformed into respective
    * descriptions first. This is done using the `NameProvider` and `AstNodeDescriptionProvider` services.
    */
   createScopeForNodes(e, t, r) {
-    const s = Z(e).map((i) => {
+    const s = Q(e).map((i) => {
       const a = this.nameProvider.getName(i);
       if (a)
         return this.descriptions.createDescription(i, a);
@@ -9559,7 +9559,7 @@ class Zh {
     return this.globalScopeCache.get(e, () => new qh(this.indexManager.allElements(e)));
   }
 }
-function Qh(n) {
+function Zh(n) {
   return typeof n.$comment == "string";
 }
 function va(n) {
@@ -9572,7 +9572,7 @@ class ep {
   serialize(e, t) {
     const r = t ?? {}, s = t == null ? void 0 : t.replacer, i = (o, l) => this.replacer(o, l, r), a = s ? (o, l) => s(o, l, i) : i;
     try {
-      return this.currentDocument = Ze(e), JSON.stringify(e, a, t == null ? void 0 : t.space);
+      return this.currentDocument = Qe(e), JSON.stringify(e, a, t == null ? void 0 : t.space);
     } finally {
       this.currentDocument = void 0;
     }
@@ -9587,7 +9587,7 @@ class ep {
       if (Ge(t)) {
         const f = t.ref, h = r ? t.$refText : void 0;
         if (f) {
-          const p = Ze(f);
+          const p = Qe(f);
           let m = "";
           this.currentDocument && this.currentDocument !== p && (o ? m = o(p.uri, t) : m = p.uri.toString());
           const v = this.astNodeLocator.getAstNodePath(f);
@@ -9779,7 +9779,7 @@ class np {
     try {
       await e();
     } catch (i) {
-      if (Zr(i))
+      if (Qr(i))
         throw i;
       console.error(`${t}:`, i), i instanceof Error && i.stack && console.error(i.stack);
       const a = i instanceof Error ? i.message : String(i);
@@ -9795,7 +9795,7 @@ class np {
       this.entries.add(r, t);
   }
   getChecks(e, t) {
-    let r = Z(this.entries.get(e)).concat(this.entries.get("AstNode"));
+    let r = Q(this.entries.get(e)).concat(this.entries.get("AstNode"));
     return t && (r = r.filter((s) => t.includes(s.category))), r.map((s) => s.check);
   }
   /**
@@ -9868,7 +9868,7 @@ class rp {
     try {
       i.push(...await this.validateAst(s.value, t, r));
     } catch (a) {
-      if (Zr(a))
+      if (Qr(a))
         throw a;
       console.error("An error occurred during validation:", a);
     }
@@ -10033,7 +10033,7 @@ class ap {
     this.astNodeLocator = e.workspace.AstNodeLocator, this.nameProvider = e.references.NameProvider;
   }
   createDescription(e, t, r) {
-    const s = r ?? Ze(e);
+    const s = r ?? Qe(e);
     t ?? (t = this.nameProvider.getName(e));
     const i = this.astNodeLocator.getAstNodePath(e);
     if (!t)
@@ -10073,7 +10073,7 @@ class op {
     const t = e.reference.$nodeDescription, r = e.reference.$refNode;
     if (!t || !r)
       return;
-    const s = Ze(e.container).uri;
+    const s = Qe(e.container).uri;
     return {
       sourceUri: s,
       sourcePath: this.nodeLocator.getAstNodePath(e.container),
@@ -10234,7 +10234,7 @@ class dp {
       }
       this.buildState.delete(a.toString());
     }
-    const s = Z(e).concat(t).map((a) => a.toString()).toSet();
+    const s = Q(e).concat(t).map((a) => a.toString()).toSet();
     this.langiumDocuments.all.filter((a) => !s.has(a.uri.toString()) && this.shouldRelink(a, s)).forEach((a) => {
       this.serviceRegistry.getServices(a.uri).references.Linker.unlink(a), a.state = Math.min(a.state, D.ComputedScopes), a.diagnostics = void 0;
     }), await this.emitUpdate(e, t), await ve(r);
@@ -10370,7 +10370,7 @@ class dp {
       try {
         await a(e, r);
       } catch (o) {
-        if (!Zr(o))
+        if (!Qr(o))
           throw o;
       }
   }
@@ -10414,15 +10414,15 @@ class fp {
     this.symbolIndex = /* @__PURE__ */ new Map(), this.symbolByTypeIndex = new Xh(), this.referenceIndex = /* @__PURE__ */ new Map(), this.documents = e.workspace.LangiumDocuments, this.serviceRegistry = e.ServiceRegistry, this.astReflection = e.AstReflection;
   }
   findAllReferences(e, t) {
-    const r = Ze(e).uri, s = [];
+    const r = Qe(e).uri, s = [];
     return this.referenceIndex.forEach((i) => {
       i.forEach((a) => {
         nt.equals(a.targetUri, r) && a.targetPath === t && s.push(a);
       });
-    }), Z(s);
+    }), Q(s);
   }
   allElements(e, t) {
-    let r = Z(this.symbolIndex.keys());
+    let r = Q(this.symbolIndex.keys());
     return t && (r = r.filter((s) => !t || t.has(s))), r.map((s) => this.getFileDescriptions(s, e)).flat();
   }
   getFileDescriptions(e, t) {
@@ -10750,7 +10750,7 @@ function vl(n) {
   const s = [];
   for (; e && e.type !== "break" && e.type !== "tag"; )
     s.push(Np(n)), r = e, e = n.tokens[n.index];
-  return new Zs(s, Re.create(t.range.start, r.range.end));
+  return new Qs(s, Re.create(t.range.start, r.range.end));
 }
 function Np(n) {
   return n.tokens[n.index].type === "inline-tag" ? Al(n, true) : El(n);
@@ -10760,14 +10760,14 @@ function Al(n, e) {
   if ((s == null ? void 0 : s.type) === "text")
     if (e) {
       const i = El(n);
-      return new Rs(r, new Zs([i], i.range), e, Re.create(t.range.start, i.range.end));
+      return new Rs(r, new Qs([i], i.range), e, Re.create(t.range.start, i.range.end));
     } else {
       const i = vl(n);
       return new Rs(r, i, e, Re.create(t.range.start, i.range.end));
     }
   else {
     const i = t.range;
-    return new Rs(r, new Zs([], i), e, i);
+    return new Rs(r, new Qs([], i), e, i);
   }
 }
 function El(n) {
@@ -10878,7 +10878,7 @@ function _p(n, e) {
     return n;
   }
 }
-class Zs {
+class Qs {
   constructor(e, t) {
     this.inlines = e, this.range = t;
   }
@@ -10943,7 +10943,7 @@ class Lp {
   documentationTagRenderer(e, t) {
   }
   findNameInPrecomputedScopes(e, t) {
-    const s = Ze(e).precomputedScopes;
+    const s = Qe(e).precomputedScopes;
     if (!s)
       return;
     let i = e;
@@ -10964,7 +10964,7 @@ class Op {
   }
   getComment(e) {
     var t;
-    return Qh(e) ? e.$comment : (t = Ou(e.$cstNode, this.grammarConfig().multilineCommentRules)) === null || t === void 0 ? void 0 : t.text;
+    return Zh(e) ? e.$comment : (t = Ou(e.$cstNode, this.grammarConfig().multilineCommentRules)) === null || t === void 0 ? void 0 : t.text;
   }
 }
 class Pp {
@@ -11010,7 +11010,7 @@ class bp {
         const i = await Promise.resolve().then(() => t(s));
         r.resolve(i);
       } catch (i) {
-        Zr(i) ? r.resolve(void 0) : r.reject(i);
+        Qr(i) ? r.resolve(void 0) : r.reject(i);
       }
     })), this.done = true, this.performNextOperation();
   }
@@ -11174,7 +11174,7 @@ function it(n) {
     references: {
       Linker: (e) => new Vh(e),
       NameProvider: () => new Wh(),
-      ScopeProvider: (e) => new Zh(e),
+      ScopeProvider: (e) => new Qh(e),
       ScopeComputation: (e) => new zh(e),
       References: (e) => new jh(e)
     },
@@ -11278,7 +11278,7 @@ const ot = {
     languageId: "langium"
   })
 }, Up = {
-  AstReflection: () => new Qa()
+  AstReflection: () => new Za()
 };
 function Bp() {
   const n = ie(at(ot), Up), e = ie(it({ shared: n }), Gp);
@@ -11294,7 +11294,7 @@ function Vp(n) {
   return Me.isInstance(n, pr);
 }
 R(Vp, "isArchitecture");
-var Qn = "Axis", En = "Branch";
+var Zn = "Axis", En = "Branch";
 function Hp(n) {
   return Me.isInstance(n, En);
 }
@@ -11335,18 +11335,18 @@ function Jp(n) {
 }
 R(Jp, "isPie");
 var Rr = "PieSection";
-function Zp(n) {
+function Qp(n) {
   return Me.isInstance(n, Rr);
 }
-R(Zp, "isPieSection");
+R(Qp, "isPieSection");
 var xs = "Radar", Is = "Service", vr = "Treemap";
-function Qp(n) {
+function Zp(n) {
   return Me.isInstance(n, vr);
 }
-R(Qp, "isTreemap");
+R(Zp, "isTreemap");
 var Ns = "TreemapRow", rr = "Direction", sr = "Leaf", ir = "Section", Sl = (_a2 = class extends Ha {
   getAllTypes() {
-    return [pr, Qn, En, er, tr, vs, kn, As, rr, Es, ks, $n, $s, mr, nr, Ss, sr, Sn, Cs, gr, yr, Tr, Rr, xs, ir, Is, Ia, vr, Ns];
+    return [pr, Zn, En, er, tr, vs, kn, As, rr, Es, ks, $n, $s, mr, nr, Ss, sr, Sn, Cs, gr, yr, Tr, Rr, xs, ir, Is, Ia, vr, Ns];
   }
   computeIsSubtype(n, e) {
     switch (n) {
@@ -11369,7 +11369,7 @@ var Ns = "TreemapRow", rr = "Direction", sr = "Leaf", ir = "Section", Sl = (_a2
     const e = `${n.container.$type}:${n.property}`;
     switch (e) {
       case "Entry:axis":
-        return Qn;
+        return Zn;
       default:
         throw new Error(`${e} is not a valid reference id.`);
     }
@@ -11389,9 +11389,9 @@ var Ns = "TreemapRow", rr = "Direction", sr = "Leaf", ir = "Section", Sl = (_a2
             { name: "title" }
           ]
         };
-      case Qn:
+      case Zn:
         return {
-          name: Qn,
+          name: Zn,
           properties: [
             { name: "label" },
             { name: "name" }
@@ -11718,7 +11718,7 @@ var Ns = "TreemapRow", rr = "Direction", sr = "Leaf", ir = "Section", Sl = (_a2
   ACC_DESCR: Am,
   ACC_TITLE: Em,
   TITLE: km
-}, Qr = (_b = class extends dl {
+}, Zr = (_b = class extends dl {
   runConverter(n, e, t) {
     let r = this.runCommonConverter(n, e, t);
     return r === void 0 && (r = this.runCustomConverter(n, e, t)), r === void 0 ? super.runConverter(n, e, t) : r;
@@ -11736,7 +11736,7 @@ var Ns = "TreemapRow", rr = "Direction", sr = "Leaf", ir = "Section", Sl = (_a2
 `);
     }
   }
-}, R(_b, "AbstractMermaidValueConverter"), _b), es = (_c2 = class extends Qr {
+}, R(_b, "AbstractMermaidValueConverter"), _b), es = (_c2 = class extends Zr {
   runCustomConverter(n, e, t) {
   }
 }, R(_c2, "CommonValueConverter"), _c2), lt = (_d2 = class extends cl {
@@ -11822,7 +11822,7 @@ var Im = (_i2 = class extends lt {
   constructor() {
     super(["pie", "showData"]);
   }
-}, R(_i2, "PieTokenBuilder"), _i2), Nm = (_j = class extends Qr {
+}, R(_i2, "PieTokenBuilder"), _i2), Nm = (_j = class extends Zr {
   runCustomConverter(n, e, t) {
     if (n.name === "PIE_SECTION_LABEL")
       return e.replace(/"/g, "").trim();
@@ -11849,7 +11849,7 @@ var wm = (_k = class extends lt {
   constructor() {
     super(["architecture"]);
   }
-}, R(_k, "ArchitectureTokenBuilder"), _k), _m = (_l2 = class extends Qr {
+}, R(_k, "ArchitectureTokenBuilder"), _k), _m = (_l2 = class extends Zr {
   runCustomConverter(n, e, t) {
     if (n.name === "ARCH_ICON")
       return e.replace(/[()]/g, "").trim();
@@ -11902,7 +11902,7 @@ var Om = (_n2 = class extends lt {
   constructor() {
     super(["treemap"]);
   }
-}, R(_n2, "TreemapTokenBuilder"), _n2), Pm = /classDef\s+([A-Z_a-z]\w+)(?:\s+([^\n\r;]*))?;?/, bm = (_o2 = class extends Qr {
+}, R(_n2, "TreemapTokenBuilder"), _n2), Pm = /classDef\s+([A-Z_a-z]\w+)(?:\s+([^\n\r;]*))?;?/, bm = (_o2 = class extends Zr {
   runCustomConverter(n, e, t) {
     if (n.name === "NUMBER2")
       return parseFloat(e.replace(/,/g, ""));