@altimateai/ui-components 0.0.78 → 0.0.79-beta.2

package/dist/mermaid-parser.core.js

@@ -1,8 +1,8 @@
 var Ac = Object.defineProperty;
 var Ec = (n, e, t) => e in n ? Ac(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
 var Ze = (n, e, t) => Ec(n, typeof e != "symbol" ? e + "" : e, t);
-import { cw as $c, cx as kc, bF as Nl, b_ as xc, bJ as Sc, bG as ee, bq as Ic, br as Ea, bQ as Cc, bT as wl, bU as Ll, c3 as $a, bR as Nc, bt as vt, bu as D, bH as ka, bB as wc } from "./CoachForm.js";
-import { k as qt, j as Hs, g as nn, S as Lc, w as _c, x as bc, c as _l, v as z, y as bl, l as Oc, z as Pc, A as Mc, B as Dc, C as Fc, a as Ol, d as C, i as Ye, r as le, f as ke, D as Y } from "./_baseUniq.js";
+import { dK as $c, dL as kc, cV as Nl, db as xc, cZ as Sc, cW as ee, aA as Ic, aB as Ea, d1 as Cc, d4 as wl, d5 as Ll, dg as $a, d2 as Nc, ah as vt, ai as D, cX as ka, cR as wc } from "./CoachForm.js";
+import { k as qt, j as Hs, g as nn, S as Lc, w as _c, x as Oc, d as _l, v as z, y as Ol, l as bc, z as Pc, A as Mc, B as Dc, C as Fc, c as bl, a as C, i as Ye, r as le, f as ke, D as Y } from "./_baseUniq.js";
 import { j as js, m as x, d as Gc, f as Ne, g as Yt, i as zs, h as N, l as Xt, e as Uc } from "./_basePickBy.js";
 import { c as ne } from "./clone.js";
 var Bc = Object.prototype, Vc = Bc.hasOwnProperty, $e = $c(function(n, e) {
@@ -50,7 +50,7 @@ function zc(n, e, t, r) {
   var i = -1, s = _c, a = !0, o = n.length, l = [], u = e.length;
   if (!o)
     return l;
-  e.length >= jc && (s = bc, a = !1, e = new Lc(e));
+  e.length >= jc && (s = Oc, a = !1, e = new Lc(e));
   e:
     for (; ++i < o; ) {
       var c = n[i], d = c;
@@ -86,7 +86,7 @@ function Yc(n, e) {
     return t = !!e(r, i, s), t;
   }), t;
 }
-function Oe(n, e, t) {
+function be(n, e, t) {
   var r = ee(n) ? qc : Yc;
   return r(n, nn(e));
 }
@@ -106,14 +106,14 @@ var ed = Math.max;
 function de(n, e, t, r) {
   n = Nl(n) ? n : z(n), t = t && !r ? js(t) : 0;
   var i = n.length;
-  return t < 0 && (t = ed(i + t, 0)), he(n) ? t <= i && n.indexOf(e, t) > -1 : !!i && bl(n, e, t) > -1;
+  return t < 0 && (t = ed(i + t, 0)), he(n) ? t <= i && n.indexOf(e, t) > -1 : !!i && Ol(n, e, t) > -1;
 }
 function xa(n, e, t) {
   var r = n == null ? 0 : n.length;
   if (!r)
     return -1;
   var i = 0;
-  return bl(n, e, i);
+  return Ol(n, e, i);
 }
 var td = "[object RegExp]";
 function nd(n) {
@@ -141,7 +141,7 @@ function id(n) {
 function Me(n, e) {
   if (n == null)
     return {};
-  var t = Oc(Pc(n), function(r) {
+  var t = bc(Pc(n), function(r) {
     return [r];
   });
   return e = nn(e), Gc(n, t, function(r, i) {
@@ -163,10 +163,10 @@ function Ml(n, e, t) {
   return r(n, nn(e));
 }
 function qs(n) {
-  return n && n.length ? Ol(n) : [];
+  return n && n.length ? bl(n) : [];
 }
 function ad(n, e) {
-  return n && n.length ? Ol(n, nn(e)) : [];
+  return n && n.length ? bl(n, nn(e)) : [];
 }
 function ae(n) {
   return typeof n == "object" && n !== null && typeof n.$type == "string";
@@ -654,7 +654,7 @@ class Ul extends Error {
 function er(n) {
   throw new Error("Error! The input value was not handled.");
 }
-const or = "AbstractRule", lr = "AbstractType", _i = "Condition", Ca = "TypeDefinition", bi = "ValueLiteral", dn = "AbstractElement";
+const or = "AbstractRule", lr = "AbstractType", _i = "Condition", Ca = "TypeDefinition", Oi = "ValueLiteral", dn = "AbstractElement";
 function gd(n) {
   return M.isInstance(n, dn);
 }
@@ -670,7 +670,7 @@ const pn = "Disjunction";
 function Rd(n) {
   return M.isInstance(n, pn);
 }
-const dr = "Grammar", Oi = "GrammarImport", mn = "InferredType";
+const dr = "Grammar", bi = "GrammarImport", mn = "InferredType";
 function Bl(n) {
   return M.isInstance(n, mn);
 }
@@ -750,13 +750,13 @@ const _n = "RuleCall";
 function gt(n) {
   return M.isInstance(n, _n);
 }
-const bn = "TerminalAlternatives";
+const On = "TerminalAlternatives";
 function Cd(n) {
-  return M.isInstance(n, bn);
+  return M.isInstance(n, On);
 }
-const On = "TerminalGroup";
+const bn = "TerminalGroup";
 function Nd(n) {
-  return M.isInstance(n, On);
+  return M.isInstance(n, bn);
 }
 const Pn = "TerminalRuleCall";
 function wd(n) {
@@ -776,7 +776,7 @@ function _d(n) {
 }
 class jl extends Dl {
   getAllTypes() {
-    return [dn, or, lr, En, $n, ur, cr, kn, fn, xn, _i, hn, Sn, pn, In, dr, Oi, Cn, mn, gn, Nn, Pi, wn, yn, fr, hr, Tn, Rn, pr, Ln, Nr, _n, vn, mr, bn, On, It, Pn, An, Mi, Ca, gr, Mn, Dn, bi, Fn];
+    return [dn, or, lr, En, $n, ur, cr, kn, fn, xn, _i, hn, Sn, pn, In, dr, bi, Cn, mn, gn, Nn, Pi, wn, yn, fr, hr, Tn, Rn, pr, Ln, Nr, _n, vn, mr, On, bn, It, Pn, An, Mi, Ca, gr, Mn, Dn, Oi, Fn];
   }
   computeIsSubtype(e, t) {
     switch (e) {
@@ -791,8 +791,8 @@ class jl extends Dl {
       case wn:
       case Ln:
       case _n:
-      case bn:
       case On:
+      case bn:
       case Pn:
       case Mn:
       case Dn:
@@ -801,14 +801,14 @@ class jl extends Dl {
       case ur:
       case fr:
       case mr:
-        return this.isSubtype(bi, t);
+        return this.isSubtype(Oi, t);
       case cr:
       case pr:
       case vn:
       case gr:
         return this.isSubtype(Ca, t);
       case fn:
-        return this.isSubtype(_i, t) || this.isSubtype(bi, t);
+        return this.isSubtype(_i, t) || this.isSubtype(Oi, t);
       case hn:
       case pn:
       case yn:
@@ -912,9 +912,9 @@ class jl extends Dl {
             { name: "usedGrammars", defaultValue: [] }
           ]
         };
-      case Oi:
+      case bi:
         return {
-          name: Oi,
+          name: bi,
           properties: [
             { name: "path" }
           ]
@@ -1163,18 +1163,18 @@ class jl extends Dl {
             { name: "rule" }
           ]
         };
-      case bn:
+      case On:
         return {
-          name: bn,
+          name: On,
           properties: [
             { name: "cardinality" },
             { name: "elements", defaultValue: [] },
             { name: "lookahead" }
           ]
         };
-      case On:
+      case bn:
         return {
-          name: On,
+          name: bn,
           properties: [
             { name: "cardinality" },
             { name: "elements", defaultValue: [] },
@@ -1225,7 +1225,7 @@ class jl extends Dl {
   }
 }
 const M = new jl();
-function bd(n) {
+function Od(n) {
   for (const [e, t] of Object.entries(n))
     e.startsWith("$") || (Array.isArray(t) ? t.forEach((r, i) => {
       ae(r) && (r.$container = n, r.$containerProperty = e, r.$containerIndex = i);
@@ -1323,7 +1323,7 @@ function zl(n) {
     return ve;
   });
 }
-function Od(n, e) {
+function bd(n, e) {
   const t = n.getTypeMetaData(e.$type), r = e;
   for (const i of t.properties)
     i.defaultValue !== void 0 && r[i.name] === void 0 && (r[i.name] = ql(i.defaultValue));
@@ -2720,7 +2720,7 @@ function ff(n) {
   return n instanceof pe || n instanceof te || n instanceof W || n instanceof xe || n instanceof Se || n instanceof me || n instanceof G || n instanceof sn;
 }
 function zr(n, e = []) {
-  return n instanceof te || n instanceof W || n instanceof me ? !0 : n instanceof ge ? Ml(n.definition, (r) => zr(r, e)) : n instanceof ue && de(e, n) ? !1 : n instanceof Be ? (n instanceof ue && e.push(n), Oe(n.definition, (r) => zr(r, e))) : !1;
+  return n instanceof te || n instanceof W || n instanceof me ? !0 : n instanceof ge ? Ml(n.definition, (r) => zr(r, e)) : n instanceof ue && de(e, n) ? !1 : n instanceof Be ? (n instanceof ue && e.push(n), be(n.definition, (r) => zr(r, e))) : !1;
 }
 function hf(n) {
   return n instanceof ge;
@@ -2994,7 +2994,7 @@ function $f(n, e) {
     }
   }
 }
-function ba(n, e) {
+function Oa(n, e) {
   return Yt(n.value, (t) => {
     if (typeof t == "number")
       return de(e, t);
@@ -3006,7 +3006,7 @@ function ba(n, e) {
 }
 function hs(n) {
   const e = n.quantifier;
-  return e && e.atLeast === 0 ? !0 : n.value ? ee(n.value) ? Oe(n.value, hs) : hs(n.value) : !1;
+  return e && e.atLeast === 0 ? !0 : n.value ? ee(n.value) ? be(n.value, hs) : hs(n.value) : !1;
 }
 class kf extends yi {
   constructor(e) {
@@ -3029,7 +3029,7 @@ class kf extends yi {
     de(this.targetCharCodes, e.value) && (this.found = !0);
   }
   visitSet(e) {
-    e.complement ? ba(e, this.targetCharCodes) === void 0 && (this.found = !0) : ba(e, this.targetCharCodes) !== void 0 && (this.found = !0);
+    e.complement ? Oa(e, this.targetCharCodes) === void 0 && (this.found = !0) : Oa(e, this.targetCharCodes) !== void 0 && (this.found = !0);
   }
 }
 function ia(n, e) {
@@ -3084,7 +3084,7 @@ function xf(n, e) {
           "v",
           "w",
           "W"
-        ], I[1]) ? I[1] : e.useSticky ? Pa(R) : Oa(R);
+        ], I[1]) ? I[1] : e.useSticky ? Pa(R) : ba(R);
       } else {
         if (vt(R))
           return i = !0, { exec: R };
@@ -3095,7 +3095,7 @@ function xf(n, e) {
             return R;
           {
             const I = R.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&"), F = new RegExp(I);
-            return e.useSticky ? Pa(F) : Oa(F);
+            return e.useSticky ? Pa(F) : ba(F);
           }
         } else
           throw Error("non exhaustive match");
@@ -3190,7 +3190,7 @@ function Sf(n, e) {
 function If(n) {
   let e = [];
   const t = ke(n, (r) => Xe(r[yt]));
-  return e = e.concat(Lf(t)), e = e.concat(Of(t)), e = e.concat(Pf(t)), e = e.concat(Mf(t)), e = e.concat(_f(t)), e;
+  return e = e.concat(Lf(t)), e = e.concat(bf(t)), e = e.concat(Pf(t)), e = e.concat(Mf(t)), e = e.concat(_f(t)), e;
 }
 function Cf(n) {
   const e = ke(n, (i) => !N(i, yt)), t = x(e, (i) => ({
@@ -3246,8 +3246,8 @@ function _f(n) {
     tokenTypes: [r]
   }));
 }
-const bf = /[^\\[][\^]|^\^/;
-function Of(n) {
+const Of = /[^\\[][\^]|^\^/;
+function bf(n) {
   class e extends yi {
     constructor() {
       super(...arguments), this.found = !1;
@@ -3262,7 +3262,7 @@ function Of(n) {
       const a = vi(s), o = new e();
       return o.visit(a), o.found;
     } catch {
-      return bf.test(s.source);
+      return Of.test(s.source);
     }
   });
   return x(t, (i) => ({
@@ -3370,7 +3370,7 @@ function Bf(n) {
     "{"
   ], (t) => n.source.indexOf(t) !== -1) === void 0;
 }
-function Oa(n) {
+function ba(n) {
   const e = n.ignoreCase ? "i" : "";
   return new RegExp(`^(?:${n.source})`, e);
 }
@@ -3725,12 +3725,12 @@ a boolean 2nd argument is no longer supported`);
     const re = this.hasCustom ? 0 : Math.floor(e.length / 10), Le = new Array(re), ye = [];
     let Fe = this.trackStartLines ? 1 : void 0, Ie = this.trackStartLines ? 1 : void 0;
     const k = Wf(this.emptyGroups), T = this.trackStartLines, $ = this.config.lineTerminatorsPattern;
-    let S = 0, b = [], _ = [];
+    let S = 0, O = [], _ = [];
     const L = [], Te = [];
     Object.freeze(Te);
     let q;
     function K() {
-      return b;
+      return O;
     }
     function dt(ie) {
       const Ce = tt(ie), xt = _[Ce];
@@ -3751,13 +3751,13 @@ a boolean 2nd argument is no longer supported`);
       } else {
         L.pop();
         const Ce = Xt(L);
-        b = this.patternIdxToConfig[Ce], _ = this.charCodeToPatternIdxToConfig[Ce], S = b.length;
+        O = this.patternIdxToConfig[Ce], _ = this.charCodeToPatternIdxToConfig[Ce], S = O.length;
         const xt = this.canModeBeOptimized[Ce] && this.config.safeMode === !1;
         _ && xt ? q = dt : q = K;
       }
     };
     function Ra(ie) {
-      L.push(ie), _ = this.charCodeToPatternIdxToConfig[ie], b = this.patternIdxToConfig[ie], S = b.length, S = b.length;
+      L.push(ie), _ = this.charCodeToPatternIdxToConfig[ie], O = this.patternIdxToConfig[ie], S = O.length, S = O.length;
       const Ce = this.canModeBeOptimized[ie] && this.config.safeMode === !1;
       _ && Ce ? q = dt : q = K;
     }
@@ -3776,7 +3776,7 @@ a boolean 2nd argument is no longer supported`);
           if (o = _e.longerAlt, o !== void 0) {
             const Qe = o.length;
             for (s = 0; s < Qe; s++) {
-              const Ke = b[o[s]], ft = Ke.pattern;
+              const Ke = O[o[s]], ft = Ke.pattern;
               if (c = null, Ke.isCustom === !0 ? (y = ft.exec(E, I, Le, k), y !== null ? (a = y[0], y.payload !== void 0 && (c = y.payload)) : a = null) : (this.updateLastIndex(ft, I), a = this.match(ft, e, I)), a && a.length > l.length) {
                 l = a, u = c, _e = Ke;
                 break;
@@ -3801,7 +3801,7 @@ a boolean 2nd argument is no longer supported`);
         let Ke = va === !1;
         for (; Ke === !1 && I < R; )
           for (e = this.chopInput(e, 1), I++, i = 0; i < S; i++) {
-            const ft = b[i], Li = ft.pattern, Aa = ft.short;
+            const ft = O[i], Li = ft.pattern, Aa = ft.short;
             if (Aa !== !1 ? E.charCodeAt(I) === Aa && (Ke = !0) : ft.isCustom === !0 ? Ke = Li.exec(E, I, Le, k) !== null : (this.updateLastIndex(Li, I), Ke = Li.exec(e) !== null), Ke === !0)
               break;
           }
@@ -4416,7 +4416,7 @@ function hh(n, e, t, r, i, s) {
   return s(a[0], o, r);
 }
 function ph(n, e, t, r) {
-  const i = n.length, s = Oe(n, (a) => Oe(a, (o) => o.length === 1));
+  const i = n.length, s = be(n, (a) => be(a, (o) => o.length === 1));
   if (e)
     return function(a) {
       const o = x(a, (l) => l.GATE);
@@ -4461,7 +4461,7 @@ function ph(n, e, t, r) {
     };
 }
 function mh(n, e, t) {
-  const r = Oe(n, (s) => s.length === 1), i = n.length;
+  const r = be(n, (s) => s.length === 1), i = n.length;
   if (r && !t) {
     const s = Ne(n);
     if (s.length === 1 && D(s[0].categoryMatches)) {
@@ -4645,13 +4645,13 @@ function gs(n, e) {
   return !1;
 }
 function Th(n, e) {
-  return n.length < e.length && Oe(n, (t, r) => {
+  return n.length < e.length && be(n, (t, r) => {
     const i = e[r];
     return t === i || i.categoryMatchesMap[t.tokenTypeIdx];
   });
 }
 function Au(n) {
-  return Oe(n, (e) => Oe(e, (t) => Oe(t, (r) => D(r.categoryMatches))));
+  return be(n, (e) => be(e, (t) => be(t, (r) => D(r.categoryMatches))));
 }
 function Rh(n) {
   const e = n.lookaheadStrategy.validate({
@@ -4662,7 +4662,7 @@ function Rh(n) {
   return x(e, (t) => Object.assign({ type: ce.CUSTOM_LOOKAHEAD_VALIDATION }, t));
 }
 function vh(n, e, t, r) {
-  const i = Ee(n, (l) => Ah(l, t)), s = bh(n, e, t), a = Ee(n, (l) => Nh(l, t)), o = Ee(n, (l) => kh(l, n, r, t));
+  const i = Ee(n, (l) => Ah(l, t)), s = Oh(n, e, t), a = Ee(n, (l) => Nh(l, t)), o = Ee(n, (l) => kh(l, n, r, t));
   return i.concat(s, a, o);
 }
 function Ah(n, e) {
@@ -4740,7 +4740,7 @@ function xh(n, e, t) {
   })), r;
 }
 function $u(n, e, t, r = []) {
-  const i = [], s = br(e.definition);
+  const i = [], s = Or(e.definition);
   if (D(s))
     return [];
   {
@@ -4760,7 +4760,7 @@ function $u(n, e, t, r = []) {
     return i.concat(u);
   }
 }
-function br(n) {
+function Or(n) {
   let e = [];
   if (D(n))
     return e;
@@ -4768,14 +4768,14 @@ function br(n) {
   if (t instanceof ue)
     e.push(t.referencedRule);
   else if (t instanceof pe || t instanceof te || t instanceof xe || t instanceof Se || t instanceof me || t instanceof W)
-    e = e.concat(br(t.definition));
+    e = e.concat(Or(t.definition));
   else if (t instanceof ge)
-    e = Ne(x(t.definition, (s) => br(s.definition)));
+    e = Ne(x(t.definition, (s) => Or(s.definition)));
   else if (!(t instanceof G)) throw Error("non exhaustive match");
   const r = zr(t), i = n.length > 1;
   if (r && i) {
     const s = J(n);
-    return e.concat(br(s));
+    return e.concat(Or(s));
   } else
     return e;
 }
@@ -4933,7 +4933,7 @@ function _h(n, e, t, r) {
     });
   }));
 }
-function bh(n, e, t) {
+function Oh(n, e, t) {
   const r = [], i = x(e, (s) => s.name);
   return C(n, (s) => {
     const a = s.name;
@@ -4947,7 +4947,7 @@ function bh(n, e, t) {
     }
   }), r;
 }
-function Oh(n) {
+function bh(n) {
   const e = zs(n, {
     errMsgProvider: ih
   }), t = {};
@@ -5148,7 +5148,7 @@ function Bh(n, e, t, r, i, s, a) {
   const d = l.isEndOfRule;
   this.RULE_STACK.length === 1 && d && u === void 0 && (u = nt, c = 1), !(u === void 0 || c === void 0) && this.shouldInRepetitionRecoveryBeTried(u, c, a) && this.tryInRepetitionRecovery(n, e, t, u);
 }
-const Vh = 4, st = 8, Lu = 1 << st, _u = 2 << st, ys = 3 << st, Ts = 4 << st, Rs = 5 << st, Or = 6 << st;
+const Vh = 4, st = 8, Lu = 1 << st, _u = 2 << st, ys = 3 << st, Ts = 4 << st, Rs = 5 << st, br = 6 << st;
 function Ki(n, e, t) {
   return t | e | n;
 }
@@ -5216,7 +5216,7 @@ class Kh {
         }), C(a, (u) => {
           this.computeLookaheadFunc(t, u.idx, Ts, "RepetitionMandatory", u.maxLookahead, Ge(u));
         }), C(o, (u) => {
-          this.computeLookaheadFunc(t, u.idx, Or, "RepetitionMandatoryWithSeparator", u.maxLookahead, Ge(u));
+          this.computeLookaheadFunc(t, u.idx, br, "RepetitionMandatoryWithSeparator", u.maxLookahead, Ge(u));
         }), C(l, (u) => {
           this.computeLookaheadFunc(t, u.idx, Rs, "RepetitionWithSeparator", u.maxLookahead, Ge(u));
         });
@@ -5307,7 +5307,7 @@ function zh(n, e, t) {
   n.children[e] === void 0 ? n.children[e] = [t] : n.children[e].push(t);
 }
 const qh = "name";
-function bu(n, e) {
+function Ou(n, e) {
   Object.defineProperty(n, qh, {
     enumerable: !1,
     configurable: !0,
@@ -5328,7 +5328,7 @@ function Yh(n, e) {
 function Xh(n, e) {
   const t = function() {
   };
-  bu(t, n + "BaseSemantics");
+  Ou(t, n + "BaseSemantics");
   const r = {
     visit: function(i, s) {
       if (ee(i) && (i = i[0]), !Ye(i))
@@ -5351,7 +5351,7 @@ function Xh(n, e) {
 function Jh(n, e, t) {
   const r = function() {
   };
-  bu(r, n + "BaseSemanticsWithDefaults");
+  Ou(r, n + "BaseSemanticsWithDefaults");
   const i = Object.create(t.prototype);
   return C(e, (s) => {
     i[s] = Yh;
@@ -5846,7 +5846,7 @@ class rp {
     }
     if (ee(e))
       this.tokensMap = le(e, (s, a) => (s[a.name] = a, s), {});
-    else if (N(e, "modes") && Oe(Ne(z(e.modes)), th)) {
+    else if (N(e, "modes") && be(Ne(z(e.modes)), th)) {
       const s = Ne(z(e.modes)), a = qs(s);
       this.tokensMap = le(a, (o, l) => (o[l.name] = l, o), {});
     } else if (wc(e))
@@ -5854,7 +5854,7 @@ class rp {
     else
       throw new Error("<tokensDictionary> argument must be An Array of Token constructors, A dictionary of Token constructors or an IMultiModeLexerDefinition");
     this.tokensMap.EOF = nt;
-    const r = N(e, "modes") ? Ne(z(e.modes)) : z(e), i = Oe(r, (s) => D(s.categoryMatches));
+    const r = N(e, "modes") ? Ne(z(e.modes)) : z(e), i = be(r, (s) => D(s.categoryMatches));
     this.tokenMatcher = i ? Yr : rr, ir(z(this.tokensMap));
   }
   defineRule(e, t, r) {
@@ -5954,7 +5954,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     this.attemptInRepetitionRecovery(this.atLeastOneInternal, [e, t], i, Ts, e, ch);
   }
   atLeastOneSepFirstInternal(e, t) {
-    const r = this.getKeyForAutomaticLookahead(Or, e);
+    const r = this.getKeyForAutomaticLookahead(br, e);
     this.atLeastOneSepFirstInternalLogic(e, t, r);
   }
   atLeastOneSepFirstInternalLogic(e, t, r) {
@@ -5970,7 +5970,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
         o,
         i,
         za
-      ], o, Or, e, za);
+      ], o, br, e, za);
     } else
       throw this.raiseEarlyExitException(e, B.REPETITION_MANDATORY_WITH_SEPARATOR, t.ERR_MSG);
   }
@@ -6036,7 +6036,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
       r,
       i,
       s
-    ], r, Or, e, s);
+    ], r, br, e, s);
   }
   doSingleRepetition(e) {
     const t = this.getLexerPosition();
@@ -6200,10 +6200,10 @@ const xi = {
   description: "This Object indicates the Parser is during Recording Phase"
 };
 Object.freeze(xi);
-const Qa = !0, Za = Math.pow(2, st) - 1, Ou = gu({ name: "RECORDING_PHASE_TOKEN", pattern: fe.NA });
-ir([Ou]);
+const Qa = !0, Za = Math.pow(2, st) - 1, bu = gu({ name: "RECORDING_PHASE_TOKEN", pattern: fe.NA });
+ir([bu]);
 const Pu = sa(
-  Ou,
+  bu,
   `This IToken indicates the Parser is in Recording Phase
 	See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details`,
   // Using "-1" instead of NaN (as in EOF) because an actual number is less likely to
@@ -6467,7 +6467,7 @@ class sr {
       });
       let r = [];
       if (this.TRACE_INIT("Grammar Resolving", () => {
-        r = Oh({
+        r = bh({
           rules: z(this.gastProductionsCache)
         }), this.definitionErrors = this.definitionErrors.concat(r);
       }), this.TRACE_INIT("Grammar Validations", () => {
@@ -6845,7 +6845,7 @@ class _p extends la {
     super(), this.logging = (t = e == null ? void 0 : e.logging) !== null && t !== void 0 ? t : (r) => console.log(r);
   }
   initialize(e) {
-    this.atn = yp(e.rules), this.dfas = bp(this.atn);
+    this.atn = yp(e.rules), this.dfas = Op(this.atn);
   }
   validateAmbiguousAlternationAlternatives() {
     return [];
@@ -6943,7 +6943,7 @@ function ro(n, e = !0) {
   }
   return !0;
 }
-function bp(n) {
+function Op(n) {
   const e = n.decisionStates.length, t = Array(e);
   for (let r = 0; r < e; r++)
     t[r] = Lp(n.decisionStates[r], r);
@@ -6956,9 +6956,9 @@ function Wi(n, e, t, r) {
     const o = Wp(i.atnStartState);
     s = ju(i, Hu(o)), i.start = s;
   }
-  return Op.apply(this, [i, s, t, r]);
+  return bp.apply(this, [i, s, t, r]);
 }
-function Op(n, e, t, r) {
+function bp(n, e, t, r) {
   let i = e, s = 1;
   const a = [];
   let o = this.LA(s++);
@@ -7227,7 +7227,7 @@ var P;
   }
   n.is = t;
 })(P || (P = {}));
-var O;
+var b;
 (function(n) {
   function e(r, i, s, a) {
     if (p.uinteger(r) && p.uinteger(i) && p.uinteger(s) && p.uinteger(a))
@@ -7242,7 +7242,7 @@ var O;
     return p.objectLiteral(i) && P.is(i.start) && P.is(i.end);
   }
   n.is = t;
-})(O || (O = {}));
+})(b || (b = {}));
 var ri;
 (function(n) {
   function e(r, i) {
@@ -7251,7 +7251,7 @@ var ri;
   n.create = e;
   function t(r) {
     let i = r;
-    return p.objectLiteral(i) && O.is(i.range) && (p.string(i.uri) || p.undefined(i.uri));
+    return p.objectLiteral(i) && b.is(i.range) && (p.string(i.uri) || p.undefined(i.uri));
   }
   n.is = t;
 })(ri || (ri = {}));
@@ -7263,7 +7263,7 @@ var oo;
   n.create = e;
   function t(r) {
     let i = r;
-    return p.objectLiteral(i) && O.is(i.targetRange) && p.string(i.targetUri) && O.is(i.targetSelectionRange) && (O.is(i.originSelectionRange) || p.undefined(i.originSelectionRange));
+    return p.objectLiteral(i) && b.is(i.targetRange) && p.string(i.targetUri) && b.is(i.targetSelectionRange) && (b.is(i.originSelectionRange) || p.undefined(i.originSelectionRange));
   }
   n.is = t;
 })(oo || (oo = {}));
@@ -7295,7 +7295,7 @@ var lo;
   n.create = e;
   function t(r) {
     const i = r;
-    return p.objectLiteral(i) && O.is(i.range) && $s.is(i.color);
+    return p.objectLiteral(i) && b.is(i.range) && $s.is(i.color);
   }
   n.is = t;
 })(lo || (lo = {}));
@@ -7376,7 +7376,7 @@ var ii;
   function t(r) {
     var i;
     let s = r;
-    return p.defined(s) && O.is(s.range) && p.string(s.message) && (p.number(s.severity) || p.undefined(s.severity)) && (p.integer(s.code) || p.string(s.code) || p.undefined(s.code)) && (p.undefined(s.codeDescription) || p.string((i = s.codeDescription) === null || i === void 0 ? void 0 : i.href)) && (p.string(s.source) || p.undefined(s.source)) && (p.undefined(s.relatedInformation) || p.typedArray(s.relatedInformation, ks.is));
+    return p.defined(s) && b.is(s.range) && p.string(s.message) && (p.number(s.severity) || p.undefined(s.severity)) && (p.integer(s.code) || p.string(s.code) || p.undefined(s.code)) && (p.undefined(s.codeDescription) || p.string((i = s.codeDescription) === null || i === void 0 ? void 0 : i.href)) && (p.string(s.source) || p.undefined(s.source)) && (p.undefined(s.relatedInformation) || p.typedArray(s.relatedInformation, ks.is));
   }
   n.is = t;
 })(ii || (ii = {}));
@@ -7409,7 +7409,7 @@ var Zt;
   n.del = r;
   function i(s) {
     const a = s;
-    return p.objectLiteral(a) && p.string(a.newText) && O.is(a.range);
+    return p.objectLiteral(a) && p.string(a.newText) && b.is(a.range);
   }
   n.is = i;
 })(Zt || (Zt = {}));
@@ -7608,7 +7608,7 @@ var $o;
   n.create = e;
   function t(r) {
     const i = r;
-    return i && p.string(i.newText) && O.is(i.insert) && O.is(i.replace);
+    return i && p.string(i.newText) && b.is(i.insert) && b.is(i.replace);
   }
   n.is = t;
 })($o || ($o = {}));
@@ -7654,7 +7654,7 @@ var Co;
 (function(n) {
   function e(t) {
     let r = t;
-    return !!r && p.objectLiteral(r) && (Xn.is(r.contents) || si.is(r.contents) || p.typedArray(r.contents, si.is)) && (t.range === void 0 || O.is(t.range));
+    return !!r && p.objectLiteral(r) && (Xn.is(r.contents) || si.is(r.contents) || p.typedArray(r.contents, si.is)) && (t.range === void 0 || b.is(t.range));
   }
   n.is = e;
 })(Co || (Co = {}));
@@ -7685,14 +7685,14 @@ var _o;
   }
   n.create = e;
 })(_o || (_o = {}));
-var bo;
+var Oo;
 (function(n) {
   n.File = 1, n.Module = 2, n.Namespace = 3, n.Package = 4, n.Class = 5, n.Method = 6, n.Property = 7, n.Field = 8, n.Constructor = 9, n.Enum = 10, n.Interface = 11, n.Function = 12, n.Variable = 13, n.Constant = 14, n.String = 15, n.Number = 16, n.Boolean = 17, n.Array = 18, n.Object = 19, n.Key = 20, n.Null = 21, n.EnumMember = 22, n.Struct = 23, n.Event = 24, n.Operator = 25, n.TypeParameter = 26;
-})(bo || (bo = {}));
-var Oo;
+})(Oo || (Oo = {}));
+var bo;
 (function(n) {
   n.Deprecated = 1;
-})(Oo || (Oo = {}));
+})(bo || (bo = {}));
 var Po;
 (function(n) {
   function e(t, r, i, s, a) {
@@ -7727,7 +7727,7 @@ var Do;
   n.create = e;
   function t(r) {
     let i = r;
-    return i && p.string(i.name) && p.number(i.kind) && O.is(i.range) && O.is(i.selectionRange) && (i.detail === void 0 || p.string(i.detail)) && (i.deprecated === void 0 || p.boolean(i.deprecated)) && (i.children === void 0 || Array.isArray(i.children)) && (i.tags === void 0 || Array.isArray(i.tags));
+    return i && p.string(i.name) && p.number(i.kind) && b.is(i.range) && b.is(i.selectionRange) && (i.detail === void 0 || p.string(i.detail)) && (i.deprecated === void 0 || p.boolean(i.deprecated)) && (i.children === void 0 || Array.isArray(i.children)) && (i.tags === void 0 || Array.isArray(i.tags));
   }
   n.is = t;
 })(Do || (Do = {}));
@@ -7774,7 +7774,7 @@ var Bo;
   n.create = e;
   function t(r) {
     let i = r;
-    return p.defined(i) && O.is(i.range) && (p.undefined(i.command) || Qt.is(i.command));
+    return p.defined(i) && b.is(i.range) && (p.undefined(i.command) || Qt.is(i.command));
   }
   n.is = t;
 })(Bo || (Bo = {}));
@@ -7798,7 +7798,7 @@ var Ko;
   n.create = e;
   function t(r) {
     let i = r;
-    return p.defined(i) && O.is(i.range) && (p.undefined(i.target) || p.string(i.target));
+    return p.defined(i) && b.is(i.range) && (p.undefined(i.target) || p.string(i.target));
   }
   n.is = t;
 })(Ko || (Ko = {}));
@@ -7810,7 +7810,7 @@ var Wo;
   n.create = e;
   function t(r) {
     let i = r;
-    return p.objectLiteral(i) && O.is(i.range) && (i.parent === void 0 || n.is(i.parent));
+    return p.objectLiteral(i) && b.is(i.range) && (i.parent === void 0 || n.is(i.parent));
   }
   n.is = t;
 })(Wo || (Wo = {}));
@@ -7838,7 +7838,7 @@ var qo;
   n.create = e;
   function t(r) {
     const i = r;
-    return i != null && O.is(i.range) && p.string(i.text);
+    return i != null && b.is(i.range) && p.string(i.text);
   }
   n.is = t;
 })(qo || (qo = {}));
@@ -7850,7 +7850,7 @@ var Yo;
   n.create = e;
   function t(r) {
     const i = r;
-    return i != null && O.is(i.range) && p.boolean(i.caseSensitiveLookup) && (p.string(i.variableName) || i.variableName === void 0);
+    return i != null && b.is(i.range) && p.boolean(i.caseSensitiveLookup) && (p.string(i.variableName) || i.variableName === void 0);
   }
   n.is = t;
 })(Yo || (Yo = {}));
@@ -7862,7 +7862,7 @@ var Xo;
   n.create = e;
   function t(r) {
     const i = r;
-    return i != null && O.is(i.range) && (p.string(i.expression) || i.expression === void 0);
+    return i != null && b.is(i.range) && (p.string(i.expression) || i.expression === void 0);
   }
   n.is = t;
 })(Xo || (Xo = {}));
@@ -7874,19 +7874,19 @@ var Jo;
   n.create = e;
   function t(r) {
     const i = r;
-    return p.defined(i) && O.is(r.stoppedLocation);
+    return p.defined(i) && b.is(r.stoppedLocation);
   }
   n.is = t;
 })(Jo || (Jo = {}));
-var bs;
+var Os;
 (function(n) {
   n.Type = 1, n.Parameter = 2;
   function e(t) {
     return t === 1 || t === 2;
   }
   n.is = e;
-})(bs || (bs = {}));
-var Os;
+})(Os || (Os = {}));
+var bs;
 (function(n) {
   function e(r) {
     return { value: r };
@@ -7897,7 +7897,7 @@ var Os;
     return p.objectLiteral(i) && (i.tooltip === void 0 || p.string(i.tooltip) || Xn.is(i.tooltip)) && (i.location === void 0 || ri.is(i.location)) && (i.command === void 0 || Qt.is(i.command));
   }
   n.is = t;
-})(Os || (Os = {}));
+})(bs || (bs = {}));
 var Qo;
 (function(n) {
   function e(r, i, s) {
@@ -7907,7 +7907,7 @@ var Qo;
   n.create = e;
   function t(r) {
     const i = r;
-    return p.objectLiteral(i) && P.is(i.position) && (p.string(i.label) || p.typedArray(i.label, Os.is)) && (i.kind === void 0 || bs.is(i.kind)) && i.textEdits === void 0 || p.typedArray(i.textEdits, Zt.is) && (i.tooltip === void 0 || p.string(i.tooltip) || Xn.is(i.tooltip)) && (i.paddingLeft === void 0 || p.boolean(i.paddingLeft)) && (i.paddingRight === void 0 || p.boolean(i.paddingRight));
+    return p.objectLiteral(i) && P.is(i.position) && (p.string(i.label) || p.typedArray(i.label, bs.is)) && (i.kind === void 0 || Os.is(i.kind)) && i.textEdits === void 0 || p.typedArray(i.textEdits, Zt.is) && (i.tooltip === void 0 || p.string(i.tooltip) || Xn.is(i.tooltip)) && (i.paddingLeft === void 0 || p.boolean(i.paddingLeft)) && (i.paddingRight === void 0 || p.boolean(i.paddingRight));
   }
   n.is = t;
 })(Qo || (Qo = {}));
@@ -8451,7 +8451,7 @@ class em extends Xu {
     if (this.isRecording())
       return;
     const e = this.current;
-    return bd(e), this.nodeBuilder.construct(e), this.stack.pop(), Hi(e) ? this.converter.convert(e.value, e.$cstNode) : (Od(this.astReflection, e), e);
+    return Od(e), this.nodeBuilder.construct(e), this.stack.pop(), Hi(e) ? this.converter.convert(e.value, e.$cstNode) : (bd(this.astReflection, e), e);
   }
   getAssignment(e) {
     if (!this.assignmentMap.has(e)) {
@@ -9570,7 +9570,7 @@ var uc;
     }
     const u = "", c = "/", d = /^(([^:/?#]+?):)?(\/\/([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))?/;
     class h {
-      constructor(T, $, S, b, _, L = !1) {
+      constructor(T, $, S, O, _, L = !1) {
         Ze(this, "scheme");
         Ze(this, "authority");
         Ze(this, "path");
@@ -9586,7 +9586,7 @@ var uc;
               q ? q[0] !== c && (q = c + q) : q = c;
           }
           return q;
-        }(this.scheme, S || u), this.query = b || u, this.fragment = _ || u, l(this, L));
+        }(this.scheme, S || u), this.query = O || u, this.fragment = _ || u, l(this, L));
       }
       static isUri(T) {
         return T instanceof h || !!T && typeof T.authority == "string" && typeof T.fragment == "string" && typeof T.path == "string" && typeof T.query == "string" && typeof T.scheme == "string" && typeof T.fsPath == "string" && typeof T.with == "function" && typeof T.toString == "function";
@@ -9596,8 +9596,8 @@ var uc;
       }
       with(T) {
         if (!T) return this;
-        let { scheme: $, authority: S, path: b, query: _, fragment: L } = T;
-        return $ === void 0 ? $ = this.scheme : $ === null && ($ = u), S === void 0 ? S = this.authority : S === null && (S = u), b === void 0 ? b = this.path : b === null && (b = u), _ === void 0 ? _ = this.query : _ === null && (_ = u), L === void 0 ? L = this.fragment : L === null && (L = u), $ === this.scheme && S === this.authority && b === this.path && _ === this.query && L === this.fragment ? this : new m($, S, b, _, L);
+        let { scheme: $, authority: S, path: O, query: _, fragment: L } = T;
+        return $ === void 0 ? $ = this.scheme : $ === null && ($ = u), S === void 0 ? S = this.authority : S === null && (S = u), O === void 0 ? O = this.path : O === null && (O = u), _ === void 0 ? _ = this.query : _ === null && (_ = u), L === void 0 ? L = this.fragment : L === null && (L = u), $ === this.scheme && S === this.authority && O === this.path && _ === this.query && L === this.fragment ? this : new m($, S, O, _, L);
       }
       static parse(T, $ = !1) {
         const S = d.exec(T);
@@ -9652,17 +9652,17 @@ var uc;
     }
     const g = { 58: "%3A", 47: "%2F", 63: "%3F", 35: "%23", 91: "%5B", 93: "%5D", 64: "%40", 33: "%21", 36: "%24", 38: "%26", 39: "%27", 40: "%28", 41: "%29", 42: "%2A", 43: "%2B", 44: "%2C", 59: "%3B", 61: "%3D", 32: "%20" };
     function A(k, T, $) {
-      let S, b = -1;
+      let S, O = -1;
       for (let _ = 0; _ < k.length; _++) {
         const L = k.charCodeAt(_);
-        if (L >= 97 && L <= 122 || L >= 65 && L <= 90 || L >= 48 && L <= 57 || L === 45 || L === 46 || L === 95 || L === 126 || T && L === 47 || $ && L === 91 || $ && L === 93 || $ && L === 58) b !== -1 && (S += encodeURIComponent(k.substring(b, _)), b = -1), S !== void 0 && (S += k.charAt(_));
+        if (L >= 97 && L <= 122 || L >= 65 && L <= 90 || L >= 48 && L <= 57 || L === 45 || L === 46 || L === 95 || L === 126 || T && L === 47 || $ && L === 91 || $ && L === 93 || $ && L === 58) O !== -1 && (S += encodeURIComponent(k.substring(O, _)), O = -1), S !== void 0 && (S += k.charAt(_));
         else {
           S === void 0 && (S = k.substr(0, _));
           const Te = g[L];
-          Te !== void 0 ? (b !== -1 && (S += encodeURIComponent(k.substring(b, _)), b = -1), S += Te) : b === -1 && (b = _);
+          Te !== void 0 ? (O !== -1 && (S += encodeURIComponent(k.substring(O, _)), O = -1), S += Te) : O === -1 && (O = _);
         }
       }
-      return b !== -1 && (S += encodeURIComponent(k.substring(b))), S !== void 0 ? S : k;
+      return O !== -1 && (S += encodeURIComponent(k.substring(O))), S !== void 0 ? S : k;
     }
     function y(k) {
       let T;
@@ -9678,8 +9678,8 @@ var uc;
     }
     function R(k, T) {
       const $ = T ? y : A;
-      let S = "", { scheme: b, authority: _, path: L, query: Te, fragment: q } = k;
-      if (b && (S += b, S += ":"), (_ || b === "file") && (S += c, S += c), _) {
+      let S = "", { scheme: O, authority: _, path: L, query: Te, fragment: q } = k;
+      if (O && (S += O, S += ":"), (_ || O === "file") && (S += c, S += c), _) {
         let K = _.indexOf("@");
         if (K !== -1) {
           const dt = _.substr(0, K);
@@ -9717,10 +9717,10 @@ var uc;
       k.joinPath = function(T, ...$) {
         return T.with({ path: ye.join(T.path, ...$) });
       }, k.resolvePath = function(T, ...$) {
-        let S = T.path, b = !1;
-        S[0] !== Fe && (S = Fe + S, b = !0);
+        let S = T.path, O = !1;
+        S[0] !== Fe && (S = Fe + S, O = !0);
         let _ = ye.resolve(S, ...$);
-        return b && _[0] === Fe && !T.authority && (_ = _.substring(1)), T.with({ path: _ });
+        return O && _[0] === Fe && !T.authority && (_ = _.substring(1)), T.with({ path: _ });
       }, k.dirname = function(T) {
         if (T.path.length === 0 || T.path === Fe) return T;
         let $ = ye.dirname(T.path);
@@ -9859,7 +9859,7 @@ class _m {
     return () => i ?? (i = Bs.create(e.toString(), r.getServices(e).LanguageMetaData.languageId, 0, t ?? ""));
   }
 }
-class bm {
+class Om {
   constructor(e) {
     this.documentMap = /* @__PURE__ */ new Map(), this.langiumDocumentFactory = e.workspace.LangiumDocumentFactory, this.serviceRegistry = e.ServiceRegistry;
   }
@@ -9901,7 +9901,7 @@ class bm {
   }
 }
 const ji = Symbol("ref_resolving");
-class Om {
+class bm {
   constructor(e) {
     this.reflection = e.shared.AstReflection, this.langiumDocuments = () => e.shared.workspace.LangiumDocuments, this.scopeProvider = e.references.ScopeProvider, this.astNodeLocator = e.workspace.AstNodeLocator;
   }
@@ -10736,13 +10736,13 @@ class qm {
     const i = e.parseResult, s = [];
     if (await Ae(r), (!t.categories || t.categories.includes("built-in")) && (this.processLexingErrors(i, s, t), t.stopAfterLexingErrors && s.some((a) => {
       var o;
-      return ((o = a.data) === null || o === void 0 ? void 0 : o.code) === be.LexingError;
+      return ((o = a.data) === null || o === void 0 ? void 0 : o.code) === Oe.LexingError;
     }) || (this.processParsingErrors(i, s, t), t.stopAfterParsingErrors && s.some((a) => {
       var o;
-      return ((o = a.data) === null || o === void 0 ? void 0 : o.code) === be.ParsingError;
+      return ((o = a.data) === null || o === void 0 ? void 0 : o.code) === Oe.ParsingError;
     })) || (this.processLinkingErrors(e, s, t), t.stopAfterLinkingErrors && s.some((a) => {
       var o;
-      return ((o = a.data) === null || o === void 0 ? void 0 : o.code) === be.LinkingError;
+      return ((o = a.data) === null || o === void 0 ? void 0 : o.code) === Oe.LinkingError;
     }))))
       return s;
     try {
@@ -10798,7 +10798,7 @@ class qm {
           severity: zi("error"),
           range: s,
           message: i.message,
-          data: Vn(be.ParsingError),
+          data: Vn(Oe.ParsingError),
           source: this.getSource()
         };
         t.push(a);
@@ -10814,7 +10814,7 @@ class qm {
           property: s.property,
           index: s.index,
           data: {
-            code: be.LinkingError,
+            code: Oe.LinkingError,
             containerType: s.container.$type,
             property: s.property,
             refText: s.reference.$refText
@@ -10893,21 +10893,21 @@ function zi(n) {
 function Xm(n) {
   switch (n) {
     case "error":
-      return Vn(be.LexingError);
+      return Vn(Oe.LexingError);
     case "warning":
-      return Vn(be.LexingWarning);
+      return Vn(Oe.LexingWarning);
     case "info":
-      return Vn(be.LexingInfo);
+      return Vn(Oe.LexingInfo);
     case "hint":
-      return Vn(be.LexingHint);
+      return Vn(Oe.LexingHint);
     default:
       throw new Error("Invalid diagnostic severity: " + n);
   }
 }
-var be;
+var Oe;
 (function(n) {
   n.LexingError = "lexing-error", n.LexingWarning = "lexing-warning", n.LexingInfo = "lexing-info", n.LexingHint = "lexing-hint", n.ParsingError = "parsing-error", n.LinkingError = "linking-error";
-})(be || (be = {}));
+})(Oe || (Oe = {}));
 class Jm {
   constructor(e) {
     this.astNodeLocator = e.workspace.AstNodeLocator, this.nameProvider = e.references.NameProvider;
@@ -11513,7 +11513,7 @@ function dg(n) {
         i.push({
           type: "break",
           content: "",
-          range: O.create(f, f)
+          range: b.create(f, f)
         });
       }
     } else {
@@ -11524,7 +11524,7 @@ function dg(n) {
         i.push({
           type: "tag",
           content: g,
-          range: O.create(A, y)
+          range: b.create(A, y)
         }), d += m.length, d = Ks(c, d);
       }
       if (d < c.length) {
@@ -11543,7 +11543,7 @@ function fg(n, e, t, r) {
     i.push({
       type: "text",
       content: e,
-      range: O.create(s, a)
+      range: b.create(s, a)
     });
   } else {
     let s = 0;
@@ -11552,27 +11552,27 @@ function fg(n, e, t, r) {
       u.length > 0 && i.push({
         type: "text",
         content: e.substring(s, l),
-        range: O.create(P.create(t, s + r), P.create(t, l + r))
+        range: b.create(P.create(t, s + r), P.create(t, l + r))
       });
       let c = u.length + 1;
       const d = o[1];
       if (i.push({
         type: "inline-tag",
         content: d,
-        range: O.create(P.create(t, s + c + r), P.create(t, s + c + d.length + r))
+        range: b.create(P.create(t, s + c + r), P.create(t, s + c + d.length + r))
       }), c += d.length, o.length === 4) {
         c += o[2].length;
         const h = o[3];
         i.push({
           type: "text",
           content: h,
-          range: O.create(P.create(t, s + c + r), P.create(t, s + c + h.length + r))
+          range: b.create(P.create(t, s + c + r), P.create(t, s + c + h.length + r))
         });
       } else
         i.push({
           type: "text",
           content: "",
-          range: O.create(P.create(t, s + c + r), P.create(t, s + c + r))
+          range: b.create(P.create(t, s + c + r), P.create(t, s + c + r))
         });
       s = l + o[0].length;
     }
@@ -11580,7 +11580,7 @@ function fg(n, e, t, r) {
     a.length > 0 && i.push({
       type: "text",
       content: a,
-      range: O.create(P.create(t, s + r), P.create(t, s + r + a.length))
+      range: b.create(P.create(t, s + r), P.create(t, s + r + a.length))
     });
   }
   return i;
@@ -11599,14 +11599,14 @@ function gg(n) {
   var e, t, r, i;
   const s = P.create(n.position.line, n.position.character);
   if (n.tokens.length === 0)
-    return new gl([], O.create(s, s));
+    return new gl([], b.create(s, s));
   const a = [];
   for (; n.index < n.tokens.length; ) {
     const u = yg(n, a[a.length - 1]);
     u && a.push(u);
   }
   const o = (t = (e = a[0]) === null || e === void 0 ? void 0 : e.range.start) !== null && t !== void 0 ? t : s, l = (i = (r = a[a.length - 1]) === null || r === void 0 ? void 0 : r.range.end) !== null && i !== void 0 ? i : s;
-  return new gl(a, O.create(o, l));
+  return new gl(a, b.create(o, l));
 }
 function yg(n, e) {
   const t = n.tokens[n.index];
@@ -11629,7 +11629,7 @@ function hc(n) {
   const i = [];
   for (; e && e.type !== "break" && e.type !== "tag"; )
     i.push(Rg(n)), r = e, e = n.tokens[n.index];
-  return new Ws(i, O.create(t.range.start, r.range.end));
+  return new Ws(i, b.create(t.range.start, r.range.end));
 }
 function Rg(n) {
   return n.tokens[n.index].type === "inline-tag" ? pc(n, !0) : mc(n);
@@ -11639,10 +11639,10 @@ function pc(n, e) {
   if ((i == null ? void 0 : i.type) === "text")
     if (e) {
       const s = mc(n);
-      return new Yi(r, new Ws([s], s.range), e, O.create(t.range.start, s.range.end));
+      return new Yi(r, new Ws([s], s.range), e, b.create(t.range.start, s.range.end));
     } else {
       const s = hc(n);
-      return new Yi(r, s, e, O.create(t.range.start, s.range.end));
+      return new Yi(r, s, e, b.create(t.range.start, s.range.end));
     }
   else {
     const s = t.range;
@@ -12051,7 +12051,7 @@ function ot(n) {
       ReferenceDescriptionProvider: (e) => new Qm(e)
     },
     references: {
-      Linker: (e) => new Om(e),
+      Linker: (e) => new bm(e),
       NameProvider: () => new Mm(),
       ScopeProvider: (e) => new Km(e),
       ScopeComputation: (e) => new Fm(e),
@@ -12072,7 +12072,7 @@ function lt(n) {
   return {
     ServiceRegistry: (e) => new jm(e),
     workspace: {
-      LangiumDocuments: (e) => new bm(e),
+      LangiumDocuments: (e) => new Om(e),
       LangiumDocumentFactory: (e) => new _m(e),
       DocumentBuilder: (e) => new tg(e),
       IndexManager: (e) => new ng(e),
@@ -12169,15 +12169,15 @@ function $t(n) {
   return t.shared.workspace.LangiumDocumentFactory.fromModel(r, Rt.parse(`memory://${(e = r.name) !== null && e !== void 0 ? e : "grammar"}.langium`)), r;
 }
 var _g = Object.defineProperty, v = (n, e) => _g(n, "name", { value: e, configurable: !0 }), Al = "Statement", Mr = "Architecture";
-function bg(n) {
+function Og(n) {
   return De.isInstance(n, Mr);
 }
-v(bg, "isArchitecture");
+v(Og, "isArchitecture");
 var Ar = "Axis", Kn = "Branch";
-function Og(n) {
+function bg(n) {
   return De.isInstance(n, Kn);
 }
-v(Og, "isBranch");
+v(bg, "isBranch");
 var Er = "Checkout", $r = "CherryPicking", Xi = "ClassDefStatement", Wn = "Commit";
 function Pg(n) {
   return De.isInstance(n, Wn);
@@ -12615,10 +12615,10 @@ var ss = "TreemapRow", xr = "Direction", Sr = "Leaf", Ir = "Section", Lt, Tc = (
 `);
     }
   }
-}, v(_t, "AbstractMermaidValueConverter"), _t), bt, wi = (bt = class extends Ni {
+}, v(_t, "AbstractMermaidValueConverter"), _t), Ot, wi = (Ot = class extends Ni {
   runCustomConverter(e, t, r) {
   }
-}, v(bt, "CommonValueConverter"), bt), Ot, ct = (Ot = class extends nc {
+}, v(Ot, "CommonValueConverter"), Ot), bt, ct = (bt = class extends nc {
   constructor(e) {
     super(), this.keywords = new Set(e);
   }
@@ -12628,7 +12628,7 @@ var ss = "TreemapRow", xr = "Direction", Sr = "Leaf", Ir = "Section", Lt, Tc = (
       this.keywords.has(s.name) && s.PATTERN !== void 0 && (s.PATTERN = new RegExp(s.PATTERN.toString() + "(?:(?=%%)|(?!\\S))"));
     }), i;
   }
-}, v(Ot, "AbstractMermaidTokenBuilder"), Ot), Pt;
+}, v(bt, "AbstractMermaidTokenBuilder"), bt), Pt;
 Pt = class extends ct {
 }, v(Pt, "CommonTokenBuilder");
 var Mt, my = (Mt = class extends ct {
@@ -12759,24 +12759,24 @@ var Kt, _y = (Kt = class extends ct {
   constructor() {
     super(["radar-beta"]);
   }
-}, v(Kt, "RadarTokenBuilder"), Kt), by = {
+}, v(Kt, "RadarTokenBuilder"), Kt), Oy = {
   parser: {
     TokenBuilder: /* @__PURE__ */ v(() => new _y(), "TokenBuilder"),
     ValueConverter: /* @__PURE__ */ v(() => new wi(), "ValueConverter")
   }
 };
-function Oy(n = ut) {
+function by(n = ut) {
   const e = oe(
     lt(n),
     kt
   ), t = oe(
     ot({ shared: e }),
     uy,
-    by
+    Oy
   );
   return e.ServiceRegistry.register(t), { shared: e, Radar: t };
 }
-v(Oy, "createRadarServices");
+v(by, "createRadarServices");
 var Wt, Py = (Wt = class extends ct {
   constructor() {
     super(["treemap"]);
@@ -12907,7 +12907,7 @@ export {
   gy as G,
   Ry as I,
   Ey as P,
-  by as R,
+  Oy as R,
   Gy as T,
   $y as a,
   Sy as b,
@@ -12915,7 +12915,7 @@ export {
   Iy as d,
   Ly as e,
   yy as f,
-  Oy as g,
+  by as g,
   Uy as h,
   Vy as p
 };