@marimo-team/islands 0.14.18-dev4 → 0.14.18-dev40

package/dist/{treemap-75Q7IDZK-DG5pexEL.js → treemap-75Q7IDZK-CaHoPejr.js}

@@ -2,18 +2,18 @@ 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 { e6 as Kl, bY as Vl, av as Ma, b1 as Wl, F as _t, aY as Hl, ay as Q, bu as jl, bv as zl, y as ql, A as Ni, z as Da, aw as Qs, e7 as Fa, aU as Yl, ba as Ga, e8 as Ua, aW as Xl, bc as wi, ax as Jl, e9 as Zl, bq as Ql, ea as eu, aZ as Ie, D as vt, aB as _i, bd as tu, eb as W, ec as Re } from "./main-oBXj9Aa7.js";
-import { g as ei, d as bt, k as nu, v as H, 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-B0fx6-mD.js";
-import { m as k, f as Lt, h as I, e as ti, l as Ot, d as iu } from "./min-CtguZ_r5.js";
-import { ad as P } from "./mermaid-DaNqdymj.js";
-import { c as te } from "./clone-ByH0K_W2.js";
+import { e6 as Kl, bZ as Vl, aw as Ma, b2 as Hl, F as _t, aZ as Wl, az as Q, bv as jl, bw as zl, y as ql, A as Ni, z as Da, ax as Qs, e7 as Fa, aV as Yl, bb as Ga, e8 as Ua, aX as Xl, bd as wi, ay as Jl, e9 as Zl, br as Ql, ea as eu, a_ as Ie, D as vt, aC as _i, be as tu, eb as H, ec as Re } from "./main-D1gyEFIz.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-C789h55S.js";
+import { m as k, f as Lt, h as I, e as ti, l as Ot, d as iu } from "./min-DB4yN-iG.js";
+import { ad as P } from "./mermaid-B67irHCy.js";
+import { c as te } from "./clone-BZjp8DHO.js";
 var au = Object.prototype, ou = au.hasOwnProperty, Ee = Kl(function(n, e) {
   if (Vl(e) || Ma(e)) {
-    Wl(e, _t(e), n);
+    Hl(e, _t(e), n);
     return;
   }
   for (var t in e)
-    ou.call(e, t) && Hl(n, t, e[t]);
+    ou.call(e, t) && Wl(n, t, e[t]);
 });
 function wn(n) {
   for (var e = -1, t = n == null ? 0 : n.length, r = 0, s = []; ++e < t; ) {
@@ -99,7 +99,7 @@ function de(n) {
 }
 var Ru = Math.max;
 function ue(n, e, t, r) {
-  n = Ma(n) ? n : H(n), t = t ? Qs(t) : 0;
+  n = Ma(n) ? n : W(n), t = t ? Qs(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;
 }
@@ -175,7 +175,7 @@ function Cu(n) {
 function ar(n) {
   return typeof n == "object" && n !== null && se(n.container) && Ge(n.reference) && typeof n.message == "string";
 }
-class Wa {
+class Ha {
   constructor() {
     this.subtypes = {}, this.allSubtypes = {};
   }
@@ -210,7 +210,7 @@ class Wa {
 function In(n) {
   return typeof n == "object" && n !== null && Array.isArray(n.content);
 }
-function Ha(n) {
+function Wa(n) {
   return typeof n == "object" && n !== null && typeof n.tokenType == "object";
 }
 function ja(n) {
@@ -594,20 +594,20 @@ function Er(n) {
     length: t - e
   };
 }
-var He;
+var We;
 (function(n) {
   n[n.Before = 0] = "Before", n[n.After = 1] = "After", n[n.OverlapFront = 2] = "OverlapFront", n[n.OverlapBack = 3] = "OverlapBack", n[n.Inside = 4] = "Inside", n[n.Outside = 5] = "Outside";
-})(He || (He = {}));
+})(We || (We = {}));
 function wu(n, e) {
   if (n.end.line < e.start.line || n.end.line === e.start.line && n.end.character <= e.start.character)
-    return He.Before;
+    return We.Before;
   if (n.start.line > e.end.line || n.start.line === e.end.line && n.start.character >= e.end.character)
-    return He.After;
+    return We.After;
   const t = n.start.line > e.start.line || n.start.line === e.start.line && n.start.character >= e.start.character, r = n.end.line < e.end.line || n.end.line === e.end.line && n.end.character <= e.end.character;
-  return t && r ? He.Inside : t ? He.OverlapBack : r ? He.OverlapFront : He.Outside;
+  return t && r ? We.Inside : t ? We.OverlapBack : r ? We.OverlapFront : We.Outside;
 }
 function _u(n, e) {
-  return wu(n, e) > He.After;
+  return wu(n, e) > We.After;
 }
 const Lu = /^[\w\p{L}]$/u;
 function Ou(n, e) {
@@ -626,7 +626,7 @@ function Ou(n, e) {
   }
 }
 function Pi(n, e) {
-  return Ha(n) && e.includes(n.tokenType.name);
+  return Wa(n) && e.includes(n.tokenType.name);
 }
 function Pu(n, e = true) {
   for (; n.container; ) {
@@ -653,13 +653,13 @@ const Fn = "AbstractRule", Gn = "AbstractType", ns = "Condition", bi = "TypeDefi
 function bu(n) {
   return O.isInstance(n, Vt);
 }
-const Un = "ArrayLiteral", Bn = "ArrayType", Wt = "BooleanLiteral";
+const Un = "ArrayLiteral", Bn = "ArrayType", Ht = "BooleanLiteral";
 function Mu(n) {
-  return O.isInstance(n, Wt);
+  return O.isInstance(n, Ht);
 }
-const Ht = "Conjunction";
+const Wt = "Conjunction";
 function Du(n) {
-  return O.isInstance(n, Ht);
+  return O.isInstance(n, Wt);
 }
 const jt = "Disjunction";
 function Fu(n) {
@@ -677,7 +677,7 @@ const is = "NamedArgument", Yt = "Negation";
 function Gu(n) {
   return O.isInstance(n, Yt);
 }
-const Vn = "NumberLiteral", Wn = "Parameter", Xt = "ParameterReference";
+const Vn = "NumberLiteral", Hn = "Parameter", Xt = "ParameterReference";
 function Uu(n) {
   return O.isInstance(n, Xt);
 }
@@ -685,7 +685,7 @@ const Jt = "ParserRule";
 function Ne(n) {
   return O.isInstance(n, Jt);
 }
-const Hn = "ReferenceType", or = "ReturnType";
+const Wn = "ReferenceType", or = "ReturnType";
 function Bu(n) {
   return O.isInstance(n, or);
 }
@@ -722,7 +722,7 @@ function si(n) {
   return O.isInstance(n, sn);
 }
 const an = "EndOfFile";
-function Wu(n) {
+function Hu(n) {
   return O.isInstance(n, an);
 }
 const on = "Group";
@@ -734,7 +734,7 @@ function mt(n) {
   return O.isInstance(n, ln);
 }
 const un = "NegatedToken";
-function Hu(n) {
+function Wu(n) {
   return O.isInstance(n, un);
 }
 const cn = "RegexToken";
@@ -769,9 +769,9 @@ const yn = "Wildcard";
 function Ju(n) {
   return O.isInstance(n, yn);
 }
-class Qa extends Wa {
+class Qa extends Ha {
   getAllTypes() {
-    return [Vt, Fn, Gn, en, tn, Un, Bn, nn, Wt, rn, ns, Ht, sn, jt, an, Kn, ss, on, zt, qt, ln, is, un, Yt, Vn, Wn, Xt, Jt, Hn, 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, Zt, jn, fn, hn, xt, pn, Qt, as, bi, zn, mn, gn, rs, yn];
   }
   computeIsSubtype(e, t) {
     switch (e) {
@@ -798,13 +798,13 @@ class Qa extends Wa {
       case jn:
         return this.isSubtype(rs, t);
       case Bn:
-      case Hn:
+      case Wn:
       case Zt:
       case zn:
         return this.isSubtype(bi, t);
-      case Wt:
-        return this.isSubtype(ns, t) || this.isSubtype(rs, t);
       case Ht:
+        return this.isSubtype(ns, t) || this.isSubtype(rs, t);
+      case Wt:
       case jt:
       case Yt:
       case Xt:
@@ -838,7 +838,7 @@ class Qa extends Wa {
         return Kn;
       case "NamedArgument:parameter":
       case "ParameterReference:parameter":
-        return Wn;
+        return Hn;
       case "TerminalRuleCall:rule":
         return xt;
       default:
@@ -869,16 +869,16 @@ class Qa extends Wa {
             { name: "elementType" }
           ]
         };
-      case Wt:
+      case Ht:
         return {
-          name: Wt,
+          name: Ht,
           properties: [
             { name: "true", defaultValue: false }
           ]
         };
-      case Ht:
+      case Wt:
         return {
-          name: Ht,
+          name: Wt,
           properties: [
             { name: "left" },
             { name: "right" }
@@ -953,9 +953,9 @@ class Qa extends Wa {
             { name: "value" }
           ]
         };
-      case Wn:
+      case Hn:
         return {
-          name: Wn,
+          name: Hn,
           properties: [
             { name: "name" }
           ]
@@ -984,9 +984,9 @@ class Qa extends Wa {
             { name: "wildcard", defaultValue: false }
           ]
         };
-      case Hn:
+      case Wn:
         return {
-          name: Hn,
+          name: Wn,
           properties: [
             { name: "referenceType" }
           ]
@@ -2099,7 +2099,7 @@ class ic extends Vr {
 ` && (this.multiline = true), e.quantifier)
       this.isStarting = false, this.endRegexpStack = [];
     else {
-      const r = Wr(t);
+      const r = Hr(t);
       this.endRegexpStack.push(r), this.isStarting && (this.startRegexp += r);
     }
   }
@@ -2134,11 +2134,11 @@ function Ps(n) {
   const e = typeof n == "string" ? new RegExp(n) : n;
   return oc.some((t) => e.test(t));
 }
-function Wr(n) {
+function Hr(n) {
   return n.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
 }
 function lc(n) {
-  return Array.prototype.map.call(n, (e) => /\w/.test(e) ? `[${e.toLowerCase()}${e.toUpperCase()}]` : Wr(e)).join("");
+  return Array.prototype.map.call(n, (e) => /\w/.test(e) ? `[${e.toLowerCase()}${e.toUpperCase()}]` : Hr(e)).join("");
 }
 function uc(n, e) {
   const t = cc(n), r = e.match(t);
@@ -2426,7 +2426,7 @@ function Mt(n, e) {
       lookahead: n.lookahead
     });
   } else {
-    if (Hu(n))
+    if (Wu(n))
       return $c(n);
     if (Xu(n))
       return kc(n);
@@ -2483,7 +2483,7 @@ function Sc(n) {
   });
 }
 function us(n) {
-  return Wr(n.value);
+  return Hr(n.value);
 }
 function ze(n, e) {
   var t;
@@ -2775,7 +2775,7 @@ function Fe(n) {
     return "CONSUME";
   throw Error("non exhaustive match");
 }
-class Hr {
+class Wr {
   walk(e, t = []) {
     x(e.definition, (r, s) => {
       const i = X(e.definition, s + 1);
@@ -2877,7 +2877,7 @@ function Pc(n) {
   return [n.terminalType];
 }
 const po = "_~IN~_";
-class bc extends Hr {
+class bc extends Wr {
   constructor(e) {
     super(), this.topProd = e, this.follows = {};
   }
@@ -3012,7 +3012,7 @@ function Ms(n, e, t) {
     default:
       throw Error("non exhaustive match!");
   }
-  return H(e);
+  return W(e);
 }
 function Yn(n, e, t) {
   const r = Qe(n);
@@ -3217,14 +3217,14 @@ function Vc(n, e) {
     canBeOptimized: v
   };
 }
-function Wc(n, e) {
+function Hc(n, e) {
   let t = [];
   const r = jc(n);
   t = t.concat(r.errors);
   const s = zc(r.valid), i = s.valid;
-  return t = t.concat(s.errors), t = t.concat(Hc(i)), t = t.concat(td(i)), t = t.concat(nd(i, e)), t = t.concat(rd(i)), t;
+  return t = t.concat(s.errors), t = t.concat(Wc(i)), t = t.concat(td(i)), t = t.concat(nd(i, e)), t = t.concat(rd(i)), t;
 }
-function Hc(n) {
+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;
@@ -3453,7 +3453,7 @@ function ad(n, e, t) {
 function od(n, e, t) {
   const r = [];
   let s = false;
-  const i = wn(Ie(H(n.modes))), a = Ur(i, (l) => l[yt] === ce.NA), o = Ro(t);
+  const i = wn(Ie(W(n.modes))), a = Ur(i, (l) => l[yt] === ce.NA), o = Ro(t);
   return e && x(a, (l) => {
     const u = To(l, o);
     if (u !== false) {
@@ -3591,7 +3591,7 @@ function hd(n) {
 }
 function pd(n) {
   x(n, (e) => {
-    Eo(e) || (vo[Vi] = e, e.tokenTypeIdx = Vi++), Wi(e) && !Q(e.CATEGORIES) && (e.CATEGORIES = [e.CATEGORIES]), Wi(e) || (e.CATEGORIES = []), yd(e) || (e.categoryMatches = []), Td(e) || (e.categoryMatchesMap = {});
+    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 = {});
   });
 }
 function md(n) {
@@ -3617,7 +3617,7 @@ function Ao(n, e) {
 function Eo(n) {
   return I(n, "tokenTypeIdx");
 }
-function Wi(n) {
+function Hi(n) {
   return I(n, "CATEGORIES");
 }
 function yd(n) {
@@ -3696,7 +3696,7 @@ a boolean 2nd argument is no longer supported`);
       if (x(s.modes, (o, l) => {
         this.TRACE_INIT(`Mode: <${l}> processing`, () => {
           if (this.modes.push(l), this.config.skipValidations === false && this.TRACE_INIT("validatePatterns", () => {
-            this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(Wc(o, a));
+            this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(Hc(o, a));
           }), P(this.lexerDefinitionErrors)) {
             bn(o);
             let u;
@@ -3936,7 +3936,7 @@ function wt(n) {
 function ko(n) {
   return de(n.LABEL) && n.LABEL !== "";
 }
-const vd = "parent", Hi = "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", Zi = "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, Hi) && (t.CATEGORIES = n[Hi]), 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, Zi) && (t.START_CHARS_HINT = n[Zi]), t;
 }
 const et = $o({ name: "EOF", pattern: ce.NA });
 bn([et]);
@@ -4085,7 +4085,7 @@ class $d extends Ft {
     super(), this.nameToTopRule = e, this.errMsgProvider = t, this.errors = [];
   }
   resolveRefs() {
-    x(H(this.nameToTopRule), (e) => {
+    x(W(this.nameToTopRule), (e) => {
       this.currTopLevel = e, e.accept(this);
     });
   }
@@ -4104,7 +4104,7 @@ class $d extends Ft {
     }
   }
 }
-class Sd extends Hr {
+class Sd extends Wr {
   constructor(e, t) {
     super(), this.topProd = e, this.path = t, this.possibleTokTypes = [], this.nextProductionName = "", this.nextProductionOccurrence = 0, this.found = false, this.isAtEndOfPath = false;
   }
@@ -4137,7 +4137,7 @@ class Cd extends Sd {
     }
   }
 }
-class zr extends Hr {
+class zr extends Wr {
   constructor(e, t) {
     super(), this.topRule = e, this.occurrence = t, this.result = {
       token: void 0,
@@ -4529,7 +4529,7 @@ function Od(n, e, t) {
       return false;
     };
 }
-class Pd extends Hr {
+class Pd extends Wr {
   constructor(e, t, r) {
     super(), this.topProd = e, this.targetOccurrence = t, this.targetProdType = r;
   }
@@ -4706,7 +4706,7 @@ function Gd(n, e) {
   const t = new Bd();
   n.accept(t);
   const r = t.allProductions, s = yu(r, Ud), i = be(s, (o) => o.length > 1);
-  return k(H(i), (o) => {
+  return k(W(i), (o) => {
     const l = Pe(o), u = e.buildDuplicateFoundError(n, o), c = Fe(l), d = {
       message: u,
       type: le.DUPLICATE_PRODUCTIONS,
@@ -4824,7 +4824,7 @@ class mi extends Ft {
     this.alternations.push(e);
   }
 }
-function Wd(n, e) {
+function Hd(n, e) {
   const t = new mi();
   n.accept(t);
   const r = t.alternations;
@@ -4848,7 +4848,7 @@ function Wd(n, e) {
     });
   });
 }
-function Hd(n, e, t) {
+function Wd(n, e, t) {
   const r = new mi();
   n.accept(r);
   let s = r.alternations;
@@ -5211,10 +5211,10 @@ class gi {
     return Ae(e, (t) => _o(t, t, ht));
   }
   validateEmptyOrAlternatives(e) {
-    return Ae(e, (t) => Wd(t, ht));
+    return Ae(e, (t) => Hd(t, ht));
   }
   validateAmbiguousAlternationAlternatives(e, t) {
-    return Ae(e, (r) => Hd(r, t, ht));
+    return Ae(e, (r) => Wd(r, t, ht));
   }
   validateSomeNonEmptyLookaheadPath(e, t) {
     return qd(e, t, ht);
@@ -5394,17 +5394,17 @@ function gf(n, e, t) {
     s[i] = pf;
   }), r.prototype = s, r.prototype.constructor = r, r;
 }
-var Ws;
+var Hs;
 (function(n) {
   n[n.REDUNDANT_METHOD = 0] = "REDUNDANT_METHOD", n[n.MISSING_METHOD = 1] = "MISSING_METHOD";
-})(Ws || (Ws = {}));
+})(Hs || (Hs = {}));
 function yf(n, e) {
   return Tf(n, e);
 }
 function Tf(n, e) {
   const t = ke(e, (s) => vt(n[s]) === false), r = k(t, (s) => ({
     msg: `Missing visitor method: <${s}> on ${n.constructor.name} CST Visitor.`,
-    type: Ws.MISSING_METHOD,
+    type: Hs.MISSING_METHOD,
     methodName: s
   }));
   return wn(r);
@@ -5862,7 +5862,7 @@ class Af {
     return this.gastProductionsCache;
   }
   getSerializedGastProductions() {
-    return Nc(H(this.gastProductionsCache));
+    return Nc(W(this.gastProductionsCache));
   }
 }
 class Ef {
@@ -5883,16 +5883,16 @@ class Ef {
     }
     if (Q(e))
       this.tokensMap = ae(e, (i, a) => (i[a.name] = a, i), {});
-    else if (I(e, "modes") && Oe(Ie(H(e.modes)), Rd)) {
-      const i = Ie(H(e.modes)), a = ni(i);
+    else if (I(e, "modes") && Oe(Ie(W(e.modes)), Rd)) {
+      const i = Ie(W(e.modes)), a = ni(i);
       this.tokensMap = ae(a, (o, l) => (o[l.name] = l, o), {});
     } else if (tu(e))
       this.tokensMap = te(e);
     else
       throw new Error("<tokensDictionary> argument must be An Array of Token constructors, A dictionary of Token constructors or an IMultiModeLexerDefinition");
     this.tokensMap.EOF = et;
-    const r = I(e, "modes") ? Ie(H(e.modes)) : H(e), s = Oe(r, (i) => P(i.categoryMatches));
-    this.tokenMatcher = s ? xr : Pn, bn(H(this.tokensMap));
+    const r = I(e, "modes") ? Ie(W(e.modes)) : W(e), s = Oe(r, (i) => P(i.categoryMatches));
+    this.tokenMatcher = s ? xr : Pn, bn(W(this.tokensMap));
   }
   defineRule(e, t, r) {
     if (this.selfAnalysisDone)
@@ -6505,31 +6505,31 @@ class Mn {
       let r = [];
       if (this.TRACE_INIT("Grammar Resolving", () => {
         r = Zd({
-          rules: H(this.gastProductionsCache)
+          rules: W(this.gastProductionsCache)
         }), this.definitionErrors = this.definitionErrors.concat(r);
       }), this.TRACE_INIT("Grammar Validations", () => {
         if (P(r) && this.skipValidations === false) {
           const s = Qd({
-            rules: H(this.gastProductionsCache),
-            tokenTypes: H(this.tokensMap),
+            rules: W(this.gastProductionsCache),
+            tokenTypes: W(this.tokensMap),
             errMsgProvider: ht,
             grammarName: t
           }), i = Dd({
             lookaheadStrategy: this.lookaheadStrategy,
-            rules: H(this.gastProductionsCache),
-            tokenTypes: H(this.tokensMap),
+            rules: W(this.gastProductionsCache),
+            tokenTypes: W(this.tokensMap),
             grammarName: t
           });
           this.definitionErrors = this.definitionErrors.concat(s, i);
         }
       }), P(this.definitionErrors) && (this.recoveryEnabled && this.TRACE_INIT("computeAllProdsFollows", () => {
-        const s = Mc(H(this.gastProductionsCache));
+        const s = Mc(W(this.gastProductionsCache));
         this.resyncFollows = s;
       }), this.TRACE_INIT("ComputeLookaheadFunctions", () => {
         var s, i;
         (i = (s = this.lookaheadStrategy).initialize) === null || i === void 0 || i.call(s, {
-          rules: H(this.gastProductionsCache)
-        }), this.preComputeLookaheadFunctions(H(this.gastProductionsCache));
+          rules: W(this.gastProductionsCache)
+        }), this.preComputeLookaheadFunctions(W(this.gastProductionsCache));
       })), !Mn.DEFER_DEFINITION_ERRORS_HANDLING && !P(this.definitionErrors))
         throw e = k(this.definitionErrors, (s) => s.message), new Error(`Parser Definition Errors detected:
  ${e.join(`
@@ -6570,7 +6570,7 @@ class wf extends Mn {
 function Pt(n, e, t) {
   return `${n.name}_${e}_${t}`;
 }
-const tt = 1, _f = 2, Wo = 4, Ho = 5, Dn = 7, Lf = 8, Of = 9, Pf = 10, bf = 11, jo = 12;
+const tt = 1, _f = 2, Ho = 4, Wo = 5, Dn = 7, Lf = 8, Of = 9, Pf = 10, bf = 11, jo = 12;
 class yi {
   constructor(e) {
     this.target = e;
@@ -6632,7 +6632,7 @@ function qo(n, e, t) {
 }
 function Ff(n, e, t) {
   const r = q(n, e, t, {
-    type: Ho
+    type: Wo
   });
   st(n, r);
   const s = Gt(n, e, r, t, Et(n, e, t));
@@ -6640,7 +6640,7 @@ function Ff(n, e, t) {
 }
 function Gf(n, e, t) {
   const r = q(n, e, t, {
-    type: Ho
+    type: Wo
   });
   st(n, r);
   const s = Gt(n, e, r, t, Et(n, e, t)), i = vi(n, e, t.separator, t);
@@ -6648,7 +6648,7 @@ function Gf(n, e, t) {
 }
 function Uf(n, e, t) {
   const r = q(n, e, t, {
-    type: Wo
+    type: Ho
   });
   st(n, r);
   const s = Gt(n, e, r, t, Et(n, e, t));
@@ -6656,7 +6656,7 @@ function Uf(n, e, t) {
 }
 function Bf(n, e, t) {
   const r = q(n, e, t, {
-    type: Wo
+    type: Ho
   });
   st(n, r);
   const s = Gt(n, e, r, t, Et(n, e, t)), i = vi(n, e, t.separator, t);
@@ -6676,7 +6676,7 @@ function Vf(n, e, t) {
   });
   st(n, r);
   const s = Gt(n, e, r, t, Et(n, e, t));
-  return Wf(n, e, t, s);
+  return Hf(n, e, t, s);
 }
 function Et(n, e, t) {
   const r = ke(k(t.definition, (s) => qo(n, e, s)), (s) => s !== void 0);
@@ -6710,7 +6710,7 @@ function Xo(n, e, t, r, s) {
     right: l
   };
 }
-function Wf(n, e, t, r) {
+function Hf(n, e, t, r) {
   const s = r.left, i = r.right;
   return V(s, i), n.decisionMap[Pt(e, "Option", t.idx)] = s, r;
 }
@@ -6729,9 +6729,9 @@ function Gt(n, e, t, r, ...s) {
     left: t,
     right: i
   };
-  return n.decisionMap[Pt(e, Hf(r), r.idx)] = t, a;
+  return n.decisionMap[Pt(e, Wf(r), r.idx)] = t, a;
 }
-function Hf(n) {
+function Wf(n) {
   if (n instanceof pe)
     return "Alternation";
   if (n instanceof ee)
@@ -6815,7 +6815,7 @@ function Yf(n, e) {
   n.states.splice(n.states.indexOf(e), 1);
 }
 const Lr = {};
-class Hs {
+class Ws {
   constructor() {
     this.map = {}, this.configs = [];
   }
@@ -7073,7 +7073,7 @@ function ih(n, e) {
   return n.edges[e.tokenTypeIdx];
 }
 function ah(n, e, t) {
-  const r = new Hs(), s = [];
+  const r = new Ws(), s = [];
   for (const a of n.elements) {
     if (t.is(a.alt) === false)
       continue;
@@ -7093,7 +7093,7 @@ function ah(n, e, t) {
   }
   let i;
   if (s.length === 0 && r.size === 1 && (i = r), i === void 0) {
-    i = new Hs();
+    i = new Ws();
     for (const a of r.elements)
       Or(a, i);
   }
@@ -7135,7 +7135,7 @@ function el(n, e) {
   return r !== void 0 ? r : (e.configs.finalize(), n.states[t] = e, e);
 }
 function uh(n) {
-  const e = new Hs(), t = n.transitions.length;
+  const e = new Ws(), t = n.transitions.length;
   for (let r = 0; r < t; r++) {
     const i = {
       state: n.transitions[r].target,
@@ -7357,7 +7357,7 @@ class Ei extends tl {
       }
       return this._rangeCache;
     } else
-      return { start: W.create(0, 0), end: W.create(0, 0) };
+      return { start: H.create(0, 0), end: H.create(0, 0) };
   }
   get firstNonHiddenNode() {
     for (const e of this.content)
@@ -7765,7 +7765,7 @@ function Tt(n, e, t = false) {
     r = Ih(n, e);
   else if (ii(e))
     r = Nh(n, e);
-  else if (Wu(e)) {
+  else if (Hu(e)) {
     const s = n.consume++;
     r = () => n.parser.consume(s, et, e);
   } else
@@ -9123,12 +9123,12 @@ class Vh {
     return Object.assign(Object.assign({}, e), { message: `Could not resolve reference to ${s} named '${e.reference.$refText}'.`, targetDescription: t });
   }
 }
-function Wh(n) {
+function Hh(n) {
   return typeof n.name == "string";
 }
-class Hh {
+class Wh {
   getName(e) {
-    if (Wh(e))
+    if (Hh(e))
       return e.name;
   }
   getNameNode(e) {
@@ -10586,7 +10586,7 @@ function Aa(n) {
 }
 function Tp(n, e, t) {
   let r, s;
-  typeof n == "string" ? (s = e, r = t) : (s = n.range.start, r = e), s || (s = W.create(0, 0));
+  typeof n == "string" ? (s = e, r = t) : (s = n.range.start, r = e), s || (s = H.create(0, 0));
   const i = Rl(n), a = Si(r), o = Ap({
     lines: i,
     position: s,
@@ -10630,7 +10630,7 @@ function Ap(n) {
     }
     if (c = c.substring(0, Sp(c)), Js(c, d) >= c.length) {
       if (s.length > 0) {
-        const h = W.create(i, a);
+        const h = H.create(i, a);
         s.push({
           type: "break",
           content: "",
@@ -10641,7 +10641,7 @@ function Ap(n) {
       Ea.lastIndex = d;
       const h = Ea.exec(c);
       if (h) {
-        const p = h[0], m = h[1], v = W.create(i, a + d), y = W.create(i, a + d + p.length);
+        const p = h[0], m = h[1], v = H.create(i, a + d), y = H.create(i, a + d + p.length);
         s.push({
           type: "tag",
           content: m,
@@ -10660,7 +10660,7 @@ function Ap(n) {
 function Ep(n, e, t, r) {
   const s = [];
   if (n.length === 0) {
-    const i = W.create(t, r), a = W.create(t, r + e.length);
+    const i = H.create(t, r), a = H.create(t, r + e.length);
     s.push({
       type: "text",
       content: e,
@@ -10673,27 +10673,27 @@ function Ep(n, e, t, r) {
       u.length > 0 && s.push({
         type: "text",
         content: e.substring(i, l),
-        range: Re.create(W.create(t, i + r), W.create(t, l + r))
+        range: Re.create(H.create(t, i + r), H.create(t, l + r))
       });
       let c = u.length + 1;
       const d = o[1];
       if (s.push({
         type: "inline-tag",
         content: d,
-        range: Re.create(W.create(t, i + c + r), W.create(t, i + c + d.length + r))
+        range: Re.create(H.create(t, i + c + r), H.create(t, i + c + d.length + r))
       }), c += d.length, o.length === 4) {
         c += o[2].length;
         const f = o[3];
         s.push({
           type: "text",
           content: f,
-          range: Re.create(W.create(t, i + c + r), W.create(t, i + c + f.length + r))
+          range: Re.create(H.create(t, i + c + r), H.create(t, i + c + f.length + r))
         });
       } else
         s.push({
           type: "text",
           content: "",
-          range: Re.create(W.create(t, i + c + r), W.create(t, i + c + r))
+          range: Re.create(H.create(t, i + c + r), H.create(t, i + c + r))
         });
       i = l + o[0].length;
     }
@@ -10701,7 +10701,7 @@ function Ep(n, e, t, r) {
     a.length > 0 && s.push({
       type: "text",
       content: a,
-      range: Re.create(W.create(t, i + r), W.create(t, i + r + a.length))
+      range: Re.create(H.create(t, i + r), H.create(t, i + r + a.length))
     });
   }
   return s;
@@ -10718,7 +10718,7 @@ function Sp(n) {
 }
 function Cp(n) {
   var e, t, r, s;
-  const i = W.create(n.position.line, n.position.character);
+  const i = H.create(n.position.line, n.position.character);
   if (n.tokens.length === 0)
     return new ka([], Re.create(i, i));
   const a = [];
@@ -10790,7 +10790,7 @@ function Si(n) {
 }
 function Ts(n, e) {
   if (typeof n == "string" || typeof n == "object") {
-    const t = typeof n == "string" ? Wr(n) : n.source;
+    const t = typeof n == "string" ? Hr(n) : n.source;
     return e ? new RegExp(`^\\s*${t}`) : new RegExp(`\\s*${t}\\s*$`);
   } else
     return n;
@@ -11066,7 +11066,7 @@ class Mp {
   }
   dehydrateCstNode(e, t) {
     const r = t.cstNodes.get(e);
-    return ja(e) ? r.fullText = e.fullText : r.grammarSource = this.getGrammarElementId(e.grammarSource), r.hidden = e.hidden, r.astNode = t.astNodes.get(e.astNode), In(e) ? r.content = e.content.map((s) => this.dehydrateCstNode(s, t)) : Ha(e) && (r.tokenType = e.tokenType.name, r.offset = e.offset, r.length = e.length, r.startLine = e.range.start.line, r.startColumn = e.range.start.character, r.endLine = e.range.end.line, r.endColumn = e.range.end.character), r;
+    return ja(e) ? r.fullText = e.fullText : r.grammarSource = this.getGrammarElementId(e.grammarSource), r.hidden = e.hidden, r.astNode = t.astNodes.get(e.astNode), In(e) ? r.content = e.content.map((s) => this.dehydrateCstNode(s, t)) : Wa(e) && (r.tokenType = e.tokenType.name, r.offset = e.offset, r.length = e.length, r.startLine = e.range.start.line, r.startColumn = e.range.start.character, r.endLine = e.range.end.line, r.endColumn = e.range.end.character), r;
   }
   hydrate(e) {
     const t = e.value, r = this.createHydrationContext(t);
@@ -11173,7 +11173,7 @@ function it(n) {
     },
     references: {
       Linker: (e) => new Vh(e),
-      NameProvider: () => new Hh(),
+      NameProvider: () => new Wh(),
       ScopeProvider: (e) => new Zh(e),
       ScopeComputation: (e) => new zh(e),
       References: (e) => new jh(e)
@@ -11295,15 +11295,15 @@ function Vp(n) {
 }
 R(Vp, "isArchitecture");
 var Qn = "Axis", En = "Branch";
-function Wp(n) {
+function Hp(n) {
   return Me.isInstance(n, En);
 }
-R(Wp, "isBranch");
+R(Hp, "isBranch");
 var er = "Checkout", tr = "CherryPicking", vs = "ClassDefStatement", kn = "Commit";
-function Hp(n) {
+function Wp(n) {
   return Me.isInstance(n, kn);
 }
-R(Hp, "isCommit");
+R(Wp, "isCommit");
 var As = "Curve", Es = "Edge", ks = "Entry", $n = "GitGraph";
 function jp(n) {
   return Me.isInstance(n, $n);
@@ -11344,7 +11344,7 @@ function Qp(n) {
   return Me.isInstance(n, vr);
 }
 R(Qp, "isTreemap");
-var Ns = "TreemapRow", rr = "Direction", sr = "Leaf", ir = "Section", Sl = (_a2 = class extends Wa {
+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];
   }
@@ -11974,42 +11974,42 @@ function Ul(n = ot) {
   return e.ServiceRegistry.register(t), Fl(t), { shared: e, Treemap: t };
 }
 R(Ul, "createTreemapServices");
-var We = {}, Dm = {
+var He = {}, Dm = {
   info: /* @__PURE__ */ R(async () => {
     const { createInfoServices: n } = await Promise.resolve().then(() => Um), e = n().Info.parser.LangiumParser;
-    We.info = e;
+    He.info = e;
   }, "info"),
   packet: /* @__PURE__ */ R(async () => {
     const { createPacketServices: n } = await Promise.resolve().then(() => Bm), e = n().Packet.parser.LangiumParser;
-    We.packet = e;
+    He.packet = e;
   }, "packet"),
   pie: /* @__PURE__ */ R(async () => {
     const { createPieServices: n } = await Promise.resolve().then(() => Km), e = n().Pie.parser.LangiumParser;
-    We.pie = e;
+    He.pie = e;
   }, "pie"),
   architecture: /* @__PURE__ */ R(async () => {
     const { createArchitectureServices: n } = await Promise.resolve().then(() => Vm), e = n().Architecture.parser.LangiumParser;
-    We.architecture = e;
+    He.architecture = e;
   }, "architecture"),
   gitGraph: /* @__PURE__ */ R(async () => {
-    const { createGitGraphServices: n } = await Promise.resolve().then(() => Wm), e = n().GitGraph.parser.LangiumParser;
-    We.gitGraph = e;
+    const { createGitGraphServices: n } = await Promise.resolve().then(() => Hm), e = n().GitGraph.parser.LangiumParser;
+    He.gitGraph = e;
   }, "gitGraph"),
   radar: /* @__PURE__ */ R(async () => {
-    const { createRadarServices: n } = await Promise.resolve().then(() => Hm), e = n().Radar.parser.LangiumParser;
-    We.radar = e;
+    const { createRadarServices: n } = await Promise.resolve().then(() => Wm), e = n().Radar.parser.LangiumParser;
+    He.radar = e;
   }, "radar"),
   treemap: /* @__PURE__ */ R(async () => {
     const { createTreemapServices: n } = await Promise.resolve().then(() => jm), e = n().Treemap.parser.LangiumParser;
-    We.treemap = e;
+    He.treemap = e;
   }, "treemap")
 };
 async function Fm(n, e) {
   const t = Dm[n];
   if (!t)
     throw new Error(`Unknown diagram type: ${n}`);
-  We[n] || await t();
-  const s = We[n].parse(e);
+  He[n] || await t();
+  const s = He[n].parse(e);
   if (s.lexerErrors.length > 0 || s.parserErrors.length > 0)
     throw new Gm(s);
   return s.value;
@@ -12039,11 +12039,11 @@ const Um = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   ArchitectureModule: Pl,
   createArchitectureServices: bl
-}, Symbol.toStringTag, { value: "Module" })), Wm = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Symbol.toStringTag, { value: "Module" })), Hm = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   GitGraphModule: Cl,
   createGitGraphServices: xl
-}, Symbol.toStringTag, { value: "Module" })), Hm = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Symbol.toStringTag, { value: "Module" })), Wm = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   RadarModule: Ml,
   createRadarServices: Dl